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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1210.6275
|
Jo\~ao Eugenio Marynowski
|
Jo\~ao Eugenio Marynowski
|
Ambiente de Planejamento Ip\^e
|
MSc dissertation involving Artificial Intelligence, Planning, Petri
Net, Plangraph, Intelig\^encia Artificial, Planejamento, Redes de Petri e
Grafo de Planos
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work we investigate the systems that implements algorithms for the
planning problem in Artificial Intelligence, called planners, with especial
attention to the planners based on the plan graph. We analyze the problem of
comparing the performance of the different algorithms and we propose an
environment for the development and analysis of planners.
|
[
{
"version": "v1",
"created": "Tue, 23 Oct 2012 15:54:00 GMT"
},
{
"version": "v2",
"created": "Wed, 24 Oct 2012 20:03:00 GMT"
}
] | 2012-10-26T00:00:00 |
[
[
"Marynowski",
"João Eugenio",
""
]
] |
new_dataset
| 0.996099 |
1210.6918
|
Vadim E. Levit
|
Vadim Levit and David Tankus
|
Well-Covered Graphs Without Cycles of Lengths 4, 5 and 6
|
11 pages, 2 figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A graph G is well-covered if all its maximal independent sets are of the same
cardinality. Assume that a weight function w is defined on its vertices. Then G
is w-well-covered if all maximal independent sets are of the same weight. For
every graph G, the set of weight functions w such that G is w-well-covered is a
vector space. Given an input graph G without cycles of length 4, 5, and 6, we
characterize polynomially the vector space of weight functions w for which G is
w-well-covered. Let B be an induced complete bipartite subgraph of G on vertex
sets of bipartition B_{X} and B_{Y}. Assume that there exists an independent
set S such that both the union of S and B_{X} and the union of S and B_{Y} are
maximal independent sets of G. Then B is a generating subgraph of G, and it
produces the restriction w(B_{X})=w(B_{Y}). It is known that for every weight
function w, if G is w-well-covered, then the above restriction is satisfied. In
the special case, where B_{X}={x} and B_{Y}={y}, we say that xy is a relating
edge. Recognizing relating edges and generating subgraphs is an NP-complete
problem. However, we provide a polynomial algorithm for recognizing generating
subgraphs of an input graph without cycles of length 5, 6 and 7. We also
present a polynomial algorithm for recognizing relating edges in an input graph
without cycles of length 5 and 6.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2012 17:26:13 GMT"
}
] | 2012-10-26T00:00:00 |
[
[
"Levit",
"Vadim",
""
],
[
"Tankus",
"David",
""
]
] |
new_dataset
| 0.982089 |
cs/0403042
|
Aikaterini Argyraki
|
Katerina J. Argyraki, David R. Cheriton
|
Protecting Public-Access Sites Against Distributed Denial-of-Service
Attacks
|
Description and evaluation of a filter management protocol that
reactively protects public-access sites against DDoS attacks. 12 pages long
|
Updated versions in Proc. USENIX Annual Technical Conference,
April 2005, and IEEE/ACM Transactions on Networking, 17(4):1284-1297, August
2009
|
10.1109/TNET.2008.2007431
| null |
cs.NI
| null |
A distributed denial-of-service (DDoS) attack can flood a victim site with
malicious traffic, causing service disruption or even complete failure.
Public-access sites like amazon or ebay are particularly vulnerable to such
attacks, because they have no way of a priori blocking unauthorized traffic.
We present Active Internet Traffic Filtering (AITF), a mechanism that
protects public-access sites from highly distributed attacks by causing
undesired traffic to be blocked as close as possible to its sources. We
identify filters as a scarce resource and show that AITF protects a significant
amount of the victim's bandwidth, while requiring from each participating
router a number of filters that can be accommodated by today's routers. AITF is
incrementally deployable, because it offers a substantial benefit even to the
first sites that deploy it.
|
[
{
"version": "v1",
"created": "Mon, 29 Mar 2004 19:24:14 GMT"
},
{
"version": "v2",
"created": "Mon, 24 May 2004 07:20:17 GMT"
}
] | 2012-10-26T00:00:00 |
[
[
"Argyraki",
"Katerina J.",
""
],
[
"Cheriton",
"David R.",
""
]
] |
new_dataset
| 0.978754 |
1210.6370
|
Ma\"el Le Treust
|
Ma\"el Le Treust, Yezekael Hayel, Samson Lasaulce, M\'erouane Debbah
|
"To sense" or "not to sense" in energy-efficient power control games
|
Proc. of the 2nd International Conference on Game Theory for Network
(GAMENETS), 2011
| null | null | null |
cs.GT cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A network of cognitive transmitters is considered. Each transmitter has to
decide his power control policy in order to maximize energy-efficiency of his
transmission. For this, a transmitter has two actions to take. He has to decide
whether to sense the power levels of the others or not (which corresponds to a
finite sensing game), and to choose his transmit power level for each block
(which corresponds to a compact power control game). The sensing game is shown
to be a weighted potential game and its set of correlated equilibria is
studied. Interestingly, it is shown that the general hybrid game where each
transmitter can jointly choose the hybrid pair of actions (to sense or not to
sense, transmit power level) leads to an outcome which is worse than the one
obtained by playing the sensing game first, and then playing the power control
game. This is an interesting Braess-type paradox to be aware of for
energy-efficient power control in cognitive networks.
|
[
{
"version": "v1",
"created": "Tue, 23 Oct 2012 20:27:12 GMT"
}
] | 2012-10-25T00:00:00 |
[
[
"Treust",
"Maël Le",
""
],
[
"Hayel",
"Yezekael",
""
],
[
"Lasaulce",
"Samson",
""
],
[
"Debbah",
"Mérouane",
""
]
] |
new_dataset
| 0.999234 |
1210.6385
|
Bino John
|
Guodong Liu, Zhihua Li, Yuefeng Lin, and Bino John
|
Automated family-based naming of small RNAs for next generation
sequencing data using a modified MD5-digest algorithm
|
12 pages, 1 main table, 3 supplementary information tables
| null | null | null |
cs.CR q-bio.GN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We developed NameMyGene, a web tool and a stand alone program to easily
generate putative family-based names for small RNA sequences so that
laboratories can easily organize, analyze, and observe patterns from, the
massive amount of data generated by next-generation sequencers. NameMyGene,
also applicable to other emerging methods such as RNA-Seq, and Chip-Seq, solely
uses the input small RNA sequence and does not require any additional data such
as other sequence data sets. The web server and software is freely available
(http://www.johnlab.org/NameMyGene) and is based on Java to ensure platform
independency.
|
[
{
"version": "v1",
"created": "Tue, 23 Oct 2012 21:22:16 GMT"
}
] | 2012-10-25T00:00:00 |
[
[
"Liu",
"Guodong",
""
],
[
"Li",
"Zhihua",
""
],
[
"Lin",
"Yuefeng",
""
],
[
"John",
"Bino",
""
]
] |
new_dataset
| 0.950621 |
1007.3804
|
Bruno Grenet
|
Bruno Grenet (LIP), Erich Kaltofen, Pascal Koiran (LIP), Natacha
Portier (LIP)
|
Symmetric Determinantal Representation of Formulas and Weakly Skew
Circuits
|
To appear in the AMS Contemporary Mathematics volume on
Randomization, Relaxation, and Complexity in Polynomial Equation Solving,
edited by Gurvits, Pebay, Rojas and Thompson
|
Randomization, Relaxation, and Complexity in Polynomial Equation
Solving, Amer. Math. Soc. (Ed.) (2011) 61-96
|
10.1090/conm/556
|
RRLIP2010-24
|
cs.CC cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We deploy algebraic complexity theoretic techniques for constructing
symmetric determinantal representations of for00504925mulas and weakly skew
circuits. Our representations produce matrices of much smaller dimensions than
those given in the convex geometry literature when applied to polynomials
having a concise representation (as a sum of monomials, or more generally as an
arithmetic formula or a weakly skew circuit). These representations are valid
in any field of characteristic different from 2. In characteristic 2 we are led
to an almost complete solution to a question of B\"urgisser on the
VNP-completeness of the partial permanent. In particular, we show that the
partial permanent cannot be VNP-complete in a finite field of characteristic 2
unless the polynomial hierarchy collapses.
|
[
{
"version": "v1",
"created": "Thu, 22 Jul 2010 06:07:33 GMT"
},
{
"version": "v2",
"created": "Mon, 26 Jul 2010 19:14:57 GMT"
},
{
"version": "v3",
"created": "Fri, 14 Jan 2011 09:56:07 GMT"
},
{
"version": "v4",
"created": "Tue, 25 Oct 2011 06:13:10 GMT"
}
] | 2012-10-24T00:00:00 |
[
[
"Grenet",
"Bruno",
"",
"LIP"
],
[
"Kaltofen",
"Erich",
"",
"LIP"
],
[
"Koiran",
"Pascal",
"",
"LIP"
],
[
"Portier",
"Natacha",
"",
"LIP"
]
] |
new_dataset
| 0.99363 |
1210.6286
|
James Aspnes
|
James Aspnes
|
A one-bit swap object using test-and-sets and a max register
| null | null | null |
YALEU/DCS/TR-1464
|
cs.DC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a linearizable, wait-free implementation of a one-bit swap object
from a single max register and an unbounded array of test-and-set bits. Each
swap operation takes at most three steps. Using standard randomized
constructions, the max register and test-and-set bits can be replaced by
read-write registers, at the price of raising the cost of a swap operation to
an expected O(max(log n, min(log t, n))) steps, where t is the number of times
the swap object has previously changed its value and n is the number of
processes.
|
[
{
"version": "v1",
"created": "Tue, 23 Oct 2012 16:49:56 GMT"
}
] | 2012-10-24T00:00:00 |
[
[
"Aspnes",
"James",
""
]
] |
new_dataset
| 0.997415 |
1210.6338
|
Guido Stolfi
|
Guido Stolfi (University of Sao Paulo)
|
A Ternary Digital to Analog Converter with High Power Output and 170-dB
Dynamic Range
|
4 pages, 10 figures
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A prototype of a very high dynamic range 32-bits Digital to Analog Converter
(DAC) was designed and built for the purpose of direct auditory stimulus
generation. It provides signals from less than 100 nV up to 50 Watts peak power
output, driving a 32-Ohms earphone or speaker. The use of ternary cells makes
possible a 170 dB dynamic range that is basically limited by thermal noise
only.
|
[
{
"version": "v1",
"created": "Mon, 22 Oct 2012 15:11:08 GMT"
}
] | 2012-10-24T00:00:00 |
[
[
"Stolfi",
"Guido",
"",
"University of Sao Paulo"
]
] |
new_dataset
| 0.998581 |
1111.0084
|
Natasha Devroye
|
Yiwei Song and Natasha Devroye
|
Lattice codes for the Gaussian relay channel: Decode-and-Forward and
Compress-and-Forward
|
submitted to IEEE Transactions on Information Theory, October 30,
2011. Revised October 15, 2012
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Lattice codes are known to achieve capacity in the Gaussian point-to-point
channel, achieving the same rates as independent, identically distributed
(i.i.d.) random Gaussian codebooks. Lattice codes are also known to outperform
random codes for certain channel models that are able to exploit their
linearity. In this work, we show that lattice codes may be used to achieve the
same performance as known i.i.d. Gaussian random coding techniques for the
Gaussian relay channel, and show several examples of how this may be combined
with the linearity of lattices codes in multi-source relay networks. In
particular, we present a nested lattice list decoding technique, by which,
lattice codes are shown to achieve the Decode-and-Forward (DF) rate of single
source, single destination Gaussian relay channels with one or more relays. We
next present two examples of how this DF scheme may be combined with the
linearity of lattice codes to achieve new rate regions which for some channel
conditions outperform analogous known Gaussian random coding techniques in
multi-source relay channels. That is, we derive a new achievable rate region
for the two-way relay channel with direct links and compare it to existing
schemes, and derive another achievable rate region for the multiple access
relay channel. We furthermore present a lattice Compress-and-Forward (CF)
scheme for the Gaussian relay channel which exploits a lattice Wyner-Ziv
binning scheme and achieves the same rate as the Cover-El Gamal CF rate
evaluated for Gaussian random codes. These results suggest that
structured/lattice codes may be used to mimic, and sometimes outperform, random
Gaussian codes in general Gaussian networks.
|
[
{
"version": "v1",
"created": "Tue, 1 Nov 2011 00:12:38 GMT"
},
{
"version": "v2",
"created": "Sun, 21 Oct 2012 16:34:07 GMT"
}
] | 2012-10-23T00:00:00 |
[
[
"Song",
"Yiwei",
""
],
[
"Devroye",
"Natasha",
""
]
] |
new_dataset
| 0.962571 |
1203.1527
|
Jon-Lark Kim
|
Finley Freibert, Jon-Lark Kim
|
Optimum Subcodes of Self-Dual Codes and Their Optimum Distance Profiles
|
This paper is a revised version with the title "Optimal Subcodes of
Self-Dual Codes and Their Optimum Distance Profiles"
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Binary optimal codes often contain optimal or near-optimal subcodes. In this
paper we show that this is true for the family of self-dual codes. One approach
is to compute the optimum distance profiles (ODPs) of linear codes, which was
introduced by Luo, et. al. (2010). One of our main results is the development
of general algorithms, called the Chain Algorithms, for finding ODPs of linear
codes. Then we determine the ODPs for the Type II codes of lengths up to 24 and
the extremal Type II codes of length 32, give a partial result of the ODP of
the extended quadratic residue code $q_{48}$ of length 48. We also show that
there does not exist a $[48,k,16]$ subcode of $q_{48}$ for $k \ge 17$, and we
find a first example of a doubly-even self-complementary $[48, 16, 16]$ code.
|
[
{
"version": "v1",
"created": "Wed, 7 Mar 2012 16:34:21 GMT"
},
{
"version": "v2",
"created": "Sun, 25 Mar 2012 18:53:04 GMT"
},
{
"version": "v3",
"created": "Fri, 19 Oct 2012 02:40:07 GMT"
},
{
"version": "v4",
"created": "Mon, 22 Oct 2012 14:49:58 GMT"
}
] | 2012-10-23T00:00:00 |
[
[
"Freibert",
"Finley",
""
],
[
"Kim",
"Jon-Lark",
""
]
] |
new_dataset
| 0.954572 |
1210.5541
|
Matthijs Ruijgrok
|
Matthijs Ruijgrok
|
A single-item continuous double auction game
|
37 pages, 15 figures
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A double auction game with an infinite number of buyers and sellers is
introduced. All sellers posses one unit of a good, all buyers desire to buy one
unit. Each seller and each buyer has a private valuation of the good. The
distribution of the valuations define supply and demand functions. One unit of
the good is auctioned. At successive, discrete time instances, a player is
randomly selected to make a bid (buyer) or an ask (seller). When the maximum of
the bids becomes larger than the minimum of the asks, a transaction occurs and
the auction is closed. The players have to choose the value of their bid or ask
before the auction starts and use this value when they are selected. Assuming
that the supply and demand functions are known, expected profits as functions
of the strategies are derived, as well as expected transaction prices. It is
shown that for linear supply and demand functions, there exists at most one
Bayesian Nash equilibrium. Competitive behaviour is not an equilibrium of the
game. For linear supply and demand functions, the sum of the expected profit of
the sellers and the buyers is the same for the Bayesian Nash equilibrium and
the market where players behave competitively. Connections are made with the
ZI-C traders model and the $k$-double auction.
|
[
{
"version": "v1",
"created": "Fri, 19 Oct 2012 21:25:39 GMT"
}
] | 2012-10-23T00:00:00 |
[
[
"Ruijgrok",
"Matthijs",
""
]
] |
new_dataset
| 0.99425 |
1210.5701
|
Juraj Stacho
|
Mathew Francis, Pavol Hell, Juraj Stacho
|
Obstructions to chordal circular-arc graphs of small independence number
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A blocking quadruple (BQ) is a quadruple of vertices of a graph such that any
two vertices of the quadruple either miss (have no neighbours on) some path
connecting the remaining two vertices of the quadruple, or are connected by
some path missed by the remaining two vertices. This is akin to the notion of
asteroidal triple used in the classical characterization of interval graphs by
Lekkerkerker and Boland. We show that a circular-arc graph cannot have a
blocking quadruple. We also observe that the absence of blocking quadruples is
not in general sufficient to guarantee that a graph is a circular-arc graph.
Nonetheless, it can be shown to be sufficient for some special classes of
graphs, such as those investigated by Bonomo et al. In this note, we focus on
chordal graphs, and study the relationship between the structure of chordal
graphs and the presence/absence of blocking quadruples. Our contribution is
two-fold. Firstly, we provide a forbidden induced subgraph characterization of
chordal graphs without blocking quadruples. In particular, we observe that all
the forbidden subgraphs are variants of the subgraphs forbidden for interval
graphs. Secondly, we show that the absence of blocking quadruples is sufficient
to guarantee that a chordal graph with no independent set of size five is a
circular-arc graph. In our proof we use a novel geometric approach,
constructing a circular-arc representation by traversing around a carefully
chosen clique tree.
|
[
{
"version": "v1",
"created": "Sun, 21 Oct 2012 07:58:40 GMT"
}
] | 2012-10-23T00:00:00 |
[
[
"Francis",
"Mathew",
""
],
[
"Hell",
"Pavol",
""
],
[
"Stacho",
"Juraj",
""
]
] |
new_dataset
| 0.999104 |
1210.5888
|
Wojciech Mazurczyk
|
Artur Janicki, Wojciech Mazurczyk, Krzysztof Szczypiorski
|
Steganalysis of Transcoding Steganography
|
13 pages, 7 figures, 2 tables
| null | null | null |
cs.CR cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
TranSteg (Trancoding Steganography) is a fairly new IP telephony
steganographic method that functions by compressing overt (voice) data to make
space for the steganogram by means of transcoding. It offers high
steganographic bandwidth, retains good voice quality and is generally harder to
detect than other existing VoIP steganographic methods. In TranSteg, after the
steganogram reaches the receiver, the hidden information is extracted and the
speech data is practically restored to what was originally sent. This is a huge
advantage compared with other existing VoIP steganographic methods, where the
hidden data can be extracted and removed but the original data cannot be
restored because it was previously erased due to a hidden data insertion
process. In this paper we address the issue of steganalysis of TranSteg.
Various TranSteg scenarios and possibilities of warden(s) localization are
analyzed with regards to the TranSteg detection. A steganalysis method based on
MFCC (Mel-Frequency Cepstral Coefficients) parameters and GMMs (Gaussian
Mixture Models) was developed and tested for various overt/covert codec pairs
in a single warden scenario with double transcoding. The proposed method
allowed for efficient detection of some codec pairs (e.g., G.711/G.729), whilst
some others remained more resistant to detection (e.g., iLBC/AMR).
|
[
{
"version": "v1",
"created": "Mon, 22 Oct 2012 13:18:19 GMT"
}
] | 2012-10-23T00:00:00 |
[
[
"Janicki",
"Artur",
""
],
[
"Mazurczyk",
"Wojciech",
""
],
[
"Szczypiorski",
"Krzysztof",
""
]
] |
new_dataset
| 0.99874 |
1210.5913
|
Ikuesan R. Adeyemi Mr.
|
Ikuesan R. Adeyemi, Norafida Bt Ithnin
|
Bio-Thentic Card: Authentication concept for RFID Card
|
(IJCSIS) International Journal of Computer Science and Information
Security 2012
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Radio frequency identification (RFID) is a technology that employs basic
identifier of an object embedded in a chip, transmitted via radio wave, for
identification. An RFID Card responds to query or interrogation irrespective of
"Who" holds the Card; like a key to a door. Since an attacker can possess the
card, access to such object can therefore be easily compromised. This security
breach is classified as an unauthorized use of Card, and it forms the bedrock
for RFID Card compromise especially in access control. As an on-card
authentication mechanism, this research proposed a concept termed Bio-Thentic
Card, which can be adopted to prevent this single point of failure of RFID
Card. The Bio-Thentic Card was fabricated, tested and assessed in line with the
known threats, and attacks; and it was observed to proffer substantive solution
to unauthorized use of RFID Card vulnerability
|
[
{
"version": "v1",
"created": "Fri, 5 Oct 2012 05:09:45 GMT"
}
] | 2012-10-23T00:00:00 |
[
[
"Adeyemi",
"Ikuesan R.",
""
],
[
"Ithnin",
"Norafida Bt",
""
]
] |
new_dataset
| 0.983641 |
1210.5935
|
Scherer Gabriel
|
Gabriel Scherer (INRIA Rocquencourt), Didier R\'emy (INRIA
Rocquencourt)
|
GADT meet Subtyping
|
No. RR-8114 (2012)
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While generalized abstract datatypes (GADT) are now considered
well-understood, adding them to a language with a notion of subtyping comes
with a few surprises. What does it mean for a GADT parameter to be covariant?
The answer turns out to be quite subtle. It involves fine-grained properties of
the subtyping relation that raise interesting design questions. We allow
variance annotations in GADT definitions, study their soundness, and present a
sound and complete algorithm to check them. Our work may be applied to
real-world ML-like languages with explicit subtyping such as OCaml, or to
languages with general subtyping constraints.
|
[
{
"version": "v1",
"created": "Mon, 22 Oct 2012 15:36:56 GMT"
}
] | 2012-10-23T00:00:00 |
[
[
"Scherer",
"Gabriel",
"",
"INRIA Rocquencourt"
],
[
"Rémy",
"Didier",
"",
"INRIA\n Rocquencourt"
]
] |
new_dataset
| 0.983616 |
1210.5946
|
Roberto Maieli
|
Roberto Maieli
|
Bipolar Proof Nets for MALL
|
Proceedings of the "Proof, Computation, Complexity" International
Workshop, 17-18 August 2012, University of Copenhagen, Denmark
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work we present a computation paradigm based on a concurrent and
incremental construction of proof nets (de-sequentialized or graphical proofs)
of the pure multiplicative and additive fragment of Linear Logic, a resources
conscious refinement of Classical Logic. Moreover, we set a correspon- dence
between this paradigm and those more pragmatic ones inspired to transactional
or distributed systems. In particular we show that the construction of additive
proof nets can be interpreted as a model for super-ACID (or co-operative)
transactions over distributed transactional systems (typi- cally,
multi-databases).
|
[
{
"version": "v1",
"created": "Mon, 22 Oct 2012 16:11:55 GMT"
}
] | 2012-10-23T00:00:00 |
[
[
"Maieli",
"Roberto",
""
]
] |
new_dataset
| 0.978335 |
1210.5973
|
Zungeru Adamu Murtala
|
A. M. Zungeru, J. G. Kolo, I. Olumide
|
A Simple and Reliable Touch Sensitive Security System
|
17 Pages, 7 Figures, Journal Publication
|
International Journal of Network Security & Its Applications
(IJNSA), vol. 4, issue 5, pp. 149-169, 2012
|
10.5121/ijnsa.2012.4512
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This research focuses on detection of unauthorized access to residential and
commercial buildings when the residents are far away from the access gate of
the house. The system is a simple and reliable touch activated security system
and uses sensor technology to revolutionize the standards of living. The system
provides a best solution to most of the problems faced by house owners in their
daily life. Due to its simple electronic components nature, it is more
adaptable and cost-effective. The system is divided into three units; the power
supply unit which employs the use of both DC battery and mains supply to ensure
constant power supply to the circuit, the trigger unit which is responsible for
activating the alarm unit and designed to have much time and period and
moderate sensitivity in order to reduce the rate of false alarm, and the alarm
amplitude unit which main function is to produce amplitude alarm sound when
triggered by the trigger unit with the aim of producing a large audible sound
that can alert the entire neighborhood or scare an intruder away. The design of
the system was achieved by considering some factors such as economy,
availability of components and research materials, efficiency, compatibility
and portability and also durability in the design process. The performance of
the system after test met design specifications. This system works on the
principle of touch sensor. The general operation of the system and performance
is dependent on the presence of an intruder entering through the door and
touching any part of the door. The overall system was constructed and tested
and it work perfectly.
|
[
{
"version": "v1",
"created": "Wed, 10 Oct 2012 12:53:25 GMT"
}
] | 2012-10-23T00:00:00 |
[
[
"Zungeru",
"A. M.",
""
],
[
"Kolo",
"J. G.",
""
],
[
"Olumide",
"I.",
""
]
] |
new_dataset
| 0.963093 |
1210.5975
|
Tasha Frankie
|
Tasha Frankie, Gordon Hughes, Ken Kreutz-Delgado
|
Solid State Disk Object-Based Storage with Trim Commands
| null | null | null | null |
cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a model of NAND flash SSD utilization and write
amplification when the ATA/ATAPI SSD Trim command is incorporated into
object-based storage under a variety of user workloads, including a uniform
random workload with objects of fixed size and a uniform random workload with
objects of varying sizes. We first summarize the existing models for write
amplification in SSDs for workloads with and without the Trim command, then
propose an alteration of the models that utilizes a framework of object-based
storage. The utilization of objects and pages in the SSD is derived, with the
analytic results compared to simulation. Finally, the effect of objects on
write amplification and its computation is discussed along with a potential
application to optimization of SSD usage through object storage metadata
servers that allocate object classes of distinct object size.
|
[
{
"version": "v1",
"created": "Wed, 10 Oct 2012 18:02:33 GMT"
}
] | 2012-10-23T00:00:00 |
[
[
"Frankie",
"Tasha",
""
],
[
"Hughes",
"Gordon",
""
],
[
"Kreutz-Delgado",
"Ken",
""
]
] |
new_dataset
| 0.99655 |
1209.2086
|
Donglin Hu
|
Donglin Hu and Shiwen Mao
|
On Cooperative Relay Networks with Video Applications
| null | null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we investigate the problem of cooperative relay in CR networks
for further enhanced network performance. In particular, we focus on the two
representative cooperative relay strategies, and develop optimal spectrum
sensing and $p$-Persistent CSMA for spectrum access. Then, we study the problem
of cooperative relay in CR networks for video streaming. We incorporate
interference alignment to allow transmitters collaboratively send encoded
signals to all CR users. In the cases of a single licensed channel and multiple
licensed channels with channel bonding, we develop an optimal distributed
algorithm with proven convergence and convergence speed. In the case of
multiple channels without channel bonding, we develop a greedy algorithm with
bounded performance.
|
[
{
"version": "v1",
"created": "Mon, 10 Sep 2012 18:38:07 GMT"
},
{
"version": "v2",
"created": "Fri, 19 Oct 2012 19:43:03 GMT"
}
] | 2012-10-22T00:00:00 |
[
[
"Hu",
"Donglin",
""
],
[
"Mao",
"Shiwen",
""
]
] |
new_dataset
| 0.987248 |
1210.5287
|
Amit Sahai
|
Amit Sahai and Brent Waters
|
Attribute-Based Encryption for Circuits from Multilinear Maps
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we provide the first construction of Attribute-Based Encryption
(ABE) for general circuits. Our construction is based on the existence of
multilinear maps. We prove selective security of our scheme in the standard
model under the natural multilinear generalization of the BDDH assumption. Our
scheme achieves both Key-Policy and Ciphertext-Policy variants of ABE.
|
[
{
"version": "v1",
"created": "Fri, 19 Oct 2012 00:14:59 GMT"
}
] | 2012-10-22T00:00:00 |
[
[
"Sahai",
"Amit",
""
],
[
"Waters",
"Brent",
""
]
] |
new_dataset
| 0.966624 |
1210.5321
|
Koji Ohnishi
|
Koji Ohnishi
|
The origin of Mayan languages from Formosan language group of
Austronesian
|
6 pages, 1 Table. Proceedings of the 145th Annual Meeting of the
Linguistic Society of Japan
| null | null | null |
cs.CL q-bio.PE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Basic body-part names (BBPNs) were defined as body-part names in Swadesh
basic 200 words. Non-Mayan cognates of Mayan (MY) BBPNs were extensively
searched for, by comparing with non-MY vocabulary, including ca.1300 basic
words of 82 AN languages listed by Tryon (1985), etc. Thus found cognates (CGs)
in non-MY are listed in Table 1, as classified by language groups to which most
similar cognates (MSCs) of MY BBPNs belong. CGs of MY are classified to 23
mutually unrelated CG-items, of which 17.5 CG-items have their MSCs in
Austronesian (AN), giving its closest similarity score (CSS), CSS(AN) = 17.5,
which consists of 10.33 MSCs in Formosan, 1.83 MSCs in Western
Malayo-Polynesian (W.MP), 0.33 in Central MP, 0.0 in SHWNG, and 5.0 in Oceanic
[i.e., CSS(FORM)= 10.33, CSS(W.MP) = 1.88, ..., CSS(OC)= 5.0]. These CSSs for
language (sub)groups are also listed in the underline portion of every section
of (Section1 - Section 6) in Table 1. Chi-squar test (degree of freedom = 1)
using [Eq 1] and [Eqs.2] revealed that MSCs of MY BBPNs are distributed in
Formosan in significantly higher frequency (P < 0.001) than in other subgroups
of AN, as well as than in non-AN languages. MY is thus concluded to have been
derived from Formosan of AN. Eskimo shows some BBPN similarities to FORM and
MY.
|
[
{
"version": "v1",
"created": "Fri, 19 Oct 2012 05:50:58 GMT"
}
] | 2012-10-22T00:00:00 |
[
[
"Ohnishi",
"Koji",
""
]
] |
new_dataset
| 0.999777 |
1210.5363
|
Micha{\l} Pilipczuk
|
Micha{\l} Pilipczuk
|
Computing cutwidth and pathwidth of semi-complete digraphs via degree
orderings
| null | null | null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The notions of cutwidth and pathwidth of digraphs play a central role in the
containment theory for tournaments, or more generally semi-complete digraphs,
developed in a recent series of papers by Chudnovsky, Fradkin, Kim, Scott, and
Seymour [2, 3, 4, 8, 9, 11]. In this work we introduce a new approach to
computing these width measures on semi-complete digraphs, via degree orderings.
Using the new technique we are able to reprove the main results of [2, 9] in a
unified and significantly simplified way, as well as obtain new results. First,
we present polynomial-time approximation algorithms for both cutwidth and
pathwidth, faster and simpler than the previously known ones; the most
significant improvement is in case of pathwidth, where instead of previously
known O(OPT)-approximation in fixed-parameter tractable time [6] we obtain a
constant-factor approximation in polynomial time. Secondly, by exploiting the
new set of obstacles for cutwidth and pathwidth, we show that topological
containment and immersion in semi-complete digraphs can be tested in
single-exponential fixed-parameter tractable time. Finally, we present how the
new approach can be used to obtain exact fixed-parameter tractable algorithms
for cutwidth and pathwidth, with single- exponential running time dependency on
the optimal width.
|
[
{
"version": "v1",
"created": "Fri, 19 Oct 2012 09:44:21 GMT"
}
] | 2012-10-22T00:00:00 |
[
[
"Pilipczuk",
"Michał",
""
]
] |
new_dataset
| 0.996279 |
1210.5454
|
Mina Guirguis
|
Mina Guirguis and George Atia
|
Stuck in Traffic (SiT) Attacks: A Framework for Identifying Stealthy
Attacks that Cause Traffic Congestion
| null | null | null | null |
cs.NI cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent advances in wireless technologies have enabled many new applications
in Intelligent Transportation Systems (ITS) such as collision avoidance,
cooperative driving, congestion avoidance, and traffic optimization. Due to the
vulnerable nature of wireless communication against interference and
intentional jamming, ITS face new challenges to ensure the reliability and the
safety of the overall system. In this paper, we expose a class of stealthy
attacks -- Stuck in Traffic (SiT) attacks -- that aim to cause congestion by
exploiting how drivers make decisions based on smart traffic signs. An attacker
mounting a SiT attack solves a Markov Decision Process problem to find
optimal/suboptimal attack policies in which he/she interferes with a
well-chosen subset of signals that are based on the state of the system. We
apply Approximate Policy Iteration (API) algorithms to derive potent attack
policies. We evaluate their performance on a number of systems and compare them
to other attack policies including random, myopic and DoS attack policies. The
generated policies, albeit suboptimal, are shown to significantly outperform
other attack policies as they maximize the expected cumulative reward from the
standpoint of the attacker.
|
[
{
"version": "v1",
"created": "Fri, 19 Oct 2012 15:48:54 GMT"
}
] | 2012-10-22T00:00:00 |
[
[
"Guirguis",
"Mina",
""
],
[
"Atia",
"George",
""
]
] |
new_dataset
| 0.997479 |
1208.2724
|
Monik Khare
|
Monik Khare, Neal E. Young
|
Caching with rental cost and zapping
|
Caching with rental cost, caching with zapping
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The \emph{file caching} problem is defined as follows. Given a cache of size
$k$ (a positive integer), the goal is to minimize the total retrieval cost for
the given sequence of requests to files. A file $f$ has size $size(f)$ (a
positive integer) and retrieval cost $cost(f)$ (a non-negative number) for
bringing the file into the cache. A \emph{miss} or \emph{fault} occurs when the
requested file is not in the cache and the file has to be retrieved into the
cache by paying the retrieval cost, and some other file may have to be removed
(\emph{evicted}) from the cache so that the total size of the files in the
cache does not exceed $k$.
We study the following variants of the online file caching problem.
\textbf{\emph{Caching with Rental Cost} (or \emph{Rental Caching})}: There is a
rental cost $\lambda$ (a positive number) for each file in the cache at each
time unit. The goal is to minimize the sum of the retrieval costs and the
rental costs. \textbf{\emph{Caching with Zapping}}: A file can be \emph{zapped}
by paying a zapping cost $N \ge 1$. Once a file is zapped, all future requests
of the file don't incur any cost. The goal is to minimize the sum of the
retrieval costs and the zapping costs.
We study these two variants and also the variant which combines these two
(rental caching with zapping). We present deterministic lower and upper bounds
in the competitive-analysis framework. We study and extend the online covering
algorithm from \citep{young02online} to give deterministic online algorithms.
We also present randomized lower and upper bounds for some of these problems.
|
[
{
"version": "v1",
"created": "Mon, 13 Aug 2012 22:49:00 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Aug 2012 05:07:27 GMT"
},
{
"version": "v3",
"created": "Thu, 23 Aug 2012 18:26:43 GMT"
},
{
"version": "v4",
"created": "Tue, 4 Sep 2012 19:27:13 GMT"
},
{
"version": "v5",
"created": "Thu, 18 Oct 2012 19:05:01 GMT"
}
] | 2012-10-19T00:00:00 |
[
[
"Khare",
"Monik",
""
],
[
"Young",
"Neal E.",
""
]
] |
new_dataset
| 0.997097 |
1210.4850
|
Raja Hafiz Affandi
|
Raja Hafiz Affandi, Alex Kulesza, Emily B. Fox
|
Markov Determinantal Point Processes
|
Appears in Proceedings of the Twenty-Eighth Conference on Uncertainty
in Artificial Intelligence (UAI2012)
| null | null |
UAI-P-2012-PG-26-35
|
cs.LG cs.IR stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A determinantal point process (DPP) is a random process useful for modeling
the combinatorial problem of subset selection. In particular, DPPs encourage a
random subset Y to contain a diverse set of items selected from a base set Y.
For example, we might use a DPP to display a set of news headlines that are
relevant to a user's interests while covering a variety of topics. Suppose,
however, that we are asked to sequentially select multiple diverse sets of
items, for example, displaying new headlines day-by-day. We might want these
sets to be diverse not just individually but also through time, offering
headlines today that are unlike the ones shown yesterday. In this paper, we
construct a Markov DPP (M-DPP) that models a sequence of random sets {Yt}. The
proposed M-DPP defines a stationary process that maintains DPP margins.
Crucially, the induced union process Zt = Yt u Yt-1 is also marginally
DPP-distributed. Jointly, these properties imply that the sequence of random
sets are encouraged to be diverse both at a given time step as well as across
time steps. We describe an exact, efficient sampling procedure, and a method
for incrementally learning a quality measure over items in the base set Y based
on external preferences. We apply the M-DPP to the task of sequentially
displaying diverse and relevant news articles to a user with topic preferences.
|
[
{
"version": "v1",
"created": "Tue, 16 Oct 2012 17:35:39 GMT"
}
] | 2012-10-19T00:00:00 |
[
[
"Affandi",
"Raja Hafiz",
""
],
[
"Kulesza",
"Alex",
""
],
[
"Fox",
"Emily B.",
""
]
] |
new_dataset
| 0.999484 |
1210.4874
|
Hoong Chuin Lau
|
Hoong Chuin Lau, William Yeoh, Pradeep Varakantham, Duc Thien Nguyen,
Huaxing Chen
|
Dynamic Stochastic Orienteering Problems for Risk-Aware Applications
|
Appears in Proceedings of the Twenty-Eighth Conference on Uncertainty
in Artificial Intelligence (UAI2012)
| null | null |
UAI-P-2012-PG-448-458
|
cs.AI cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Orienteering problems (OPs) are a variant of the well-known prize-collecting
traveling salesman problem, where the salesman needs to choose a subset of
cities to visit within a given deadline. OPs and their extensions with
stochastic travel times (SOPs) have been used to model vehicle routing problems
and tourist trip design problems. However, they suffer from two limitations
travel times between cities are assumed to be time independent and the route
provided is independent of the risk preference (with respect to violating the
deadline) of the user. To address these issues, we make the following
contributions: We introduce (1) a dynamic SOP (DSOP) model, which is an
extension of SOPs with dynamic (time-dependent) travel times; (2) a
risk-sensitive criterion to allow for different risk preferences; and (3) a
local search algorithm to solve DSOPs with this risk-sensitive criterion. We
evaluated our algorithms on a real-world dataset for a theme park navigation
problem as well as synthetic datasets employed in the literature.
|
[
{
"version": "v1",
"created": "Tue, 16 Oct 2012 17:42:27 GMT"
}
] | 2012-10-19T00:00:00 |
[
[
"Lau",
"Hoong Chuin",
""
],
[
"Yeoh",
"William",
""
],
[
"Varakantham",
"Pradeep",
""
],
[
"Nguyen",
"Duc Thien",
""
],
[
"Chen",
"Huaxing",
""
]
] |
new_dataset
| 0.997369 |
1201.4871
|
Alexander Heu{\ss}ner
|
Gilles Geeraerts and Alexander Heu{\ss}ner and Jean-Fran\c{c}ois
Raskin
|
Queue-Dispatch Asynchronous Systems
|
38 pages, submitted for publication
| null | null | null |
cs.LO cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To make the development of efficient multi-core applications easier,
libraries, such as Grand Central Dispatch, have been proposed. When using such
a library, the programmer writes so-called blocks, which are chunks of codes,
and dispatches them, using synchronous or asynchronous calls, to several types
of waiting queues. A scheduler is then responsible for dispatching those blocks
on the available cores. Blocks can synchronize via a global memory. In this
paper, we propose Queue-Dispatch Asynchronous Systems as a mathematical model
that faithfully formalizes the synchronization mechanisms and the behavior of
the scheduler in those systems. We study in detail their relationships to
classical formalisms such as pushdown systems, Petri nets, fifo systems, and
counter systems. Our main technical contributions are precise worst-case
complexity results for the Parikh coverability problem for several subclasses
of our model.
|
[
{
"version": "v1",
"created": "Mon, 23 Jan 2012 21:19:03 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Apr 2012 15:28:10 GMT"
},
{
"version": "v3",
"created": "Wed, 17 Oct 2012 07:00:58 GMT"
}
] | 2012-10-18T00:00:00 |
[
[
"Geeraerts",
"Gilles",
""
],
[
"Heußner",
"Alexander",
""
],
[
"Raskin",
"Jean-François",
""
]
] |
new_dataset
| 0.999388 |
1210.4644
|
Yashpal Singh Mr
|
Yashpal Singh, Kapil Gulati and S. Niranjan ((1) Mewar University,
Rajasthan, (2) BITS College of Engg, Bhiwani, Haryana, (3) PDM College of
Engg, Bahadurgarh)
|
Dimensions and issues of mobile agent technology
|
11 pages, 6 figure
|
International Journal of Artificial Intelligence & Applications
(IJAIA), Vol.3, No.5, 2012, 51-61
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile Agent is a type of software system which acts "intelligently" on one's
behalf with the feature of autonomy, learning ability and most importantly
mobility. Now mobile agents are gaining interest in the research community. In
this article mobile agents will be addressed as tools for mobile computing.
Mobile agents have been used in applications ranging from network management to
information management. We present mobile agent concept, characteristics,
classification, need, applications and technical constraints in the mobile
technology. We also provide a brief case study about how mobile agent is used
for information retrieval.
|
[
{
"version": "v1",
"created": "Wed, 17 Oct 2012 06:52:04 GMT"
}
] | 2012-10-18T00:00:00 |
[
[
"Singh",
"Yashpal",
""
],
[
"Gulati",
"Kapil",
""
],
[
"Niranjan",
"S.",
""
]
] |
new_dataset
| 0.985494 |
1210.4661
|
Jose Oliveira
|
Jose N. Oliveira
|
Functions as types or the "Hoare logic" of functional dependencies
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Inspired by the trend on unifying theories of programming, this paper shows
how the algebraic treatment of standard data dependency theory equips
relational data with functional types and an associated type system which is
useful for type checking database operations and for query optimization.
Such a typed approach to database programming is then shown to be of the same
family as other programming logics such as eg. Hoare logic or that of strongest
invariant functions which has been used in the analysis of while statements.
The prospect of using automated deduction systems such as Prover9 for
type-checking and query optimization on top of such an algebraic approach is
considered.
|
[
{
"version": "v1",
"created": "Wed, 17 Oct 2012 08:07:46 GMT"
}
] | 2012-10-18T00:00:00 |
[
[
"Oliveira",
"Jose N.",
""
]
] |
new_dataset
| 0.972478 |
1210.4791
|
Callum James Corbett
|
Roger A. Sauer and Thang X. Duong and Callum J. Corbett
|
A computational formulation for constrained solid and liquid membranes
considering isogeometric finite elements
| null | null | null | null |
cs.CE physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A geometrically exact membrane formulation is presented that is based on
curvilinear coordinates and isogeometric finite elements, and is suitable for
both solid and liquid membranes. The curvilinear coordinate system is used to
describe both the theory and the finite element equations of the membrane. In
the latter case this avoids the use of local cartesian coordinates at the
element level. Consequently, no transformation of derivatives is required. The
formulation considers a split of the in-plane and out-of-plane membrane
contributions, which allows the construction of a stable formulation for liquid
membranes with constant surface tension. The proposed membrane formulation is
general, and accounts for dead and live loading, as well as enclosed volume,
area, and contact constraints. The new formulation is illustrated by several
challenging examples, considering linear and quadratic Lagrange elements, as
well as isogeometric elements based on quadratic NURBS and cubic T-splines. It
is seen that the isogeometric elements are much more accurate than standard
Lagrange elements. The gain is especially large for the liquid membrane
formulation since it depends explicitly on the surface curvature.
|
[
{
"version": "v1",
"created": "Wed, 17 Oct 2012 16:45:52 GMT"
}
] | 2012-10-18T00:00:00 |
[
[
"Sauer",
"Roger A.",
""
],
[
"Duong",
"Thang X.",
""
],
[
"Corbett",
"Callum J.",
""
]
] |
new_dataset
| 0.966604 |
1210.4416
|
Giovanni Marro
|
Giovanni Marro
|
A Direct Proof of a Theorem Concerning Singular Hamiltonian Systems
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This technical report presents a direct proof of Theorem~1 in [1] and some
consequences that also account for (20) in [1]. This direct proof exploits a
state space change of basis which replaces the coupled difference equations
(10) in [1] with two equivalent difference equations which, instead, are
decoupled.
|
[
{
"version": "v1",
"created": "Tue, 16 Oct 2012 14:07:24 GMT"
}
] | 2012-10-17T00:00:00 |
[
[
"Marro",
"Giovanni",
""
]
] |
new_dataset
| 0.969019 |
1210.4517
|
Konstantinos Pelechrinis
|
Konstantinos Pelechrinis, Prashant Krishnamurthy, Ke Zhang
|
Gaming the Game: Honeypot Venues Against Cheaters in Location-based
Social Networks
|
Preprint - ACM HotMobile Submission
| null | null | null |
cs.SI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The proliferation of location-based social networks (LBSNs) has provided the
community with an abundant source of information that can be exploited and used
in many different ways. LBSNs offer a number of conveniences to its
participants, such as - but not limited to - a list of places in the vicinity
of a user, recommendations for an area never explored before provided by other
peers, tracking of friends, monetary rewards in the form of special deals from
the venues visited as well as a cheap way of advertisement for the latter.
However, service convenience and security have followed disjoint paths in LBSNs
and users can misuse the offered features. The major threat for the service
providers is that of fake check-ins. Users can easily manipulate the
localization module of the underlying application and declare their presence in
a counterfeit location. The incentives for these behaviors can be both earning
monetary as well as virtual rewards. Therefore, while fake check-ins driven
from the former motive can cause monetary losses, those aiming in virtual
rewards are also harmful. In particular, they can significantly degrade the
services offered from the LBSN providers (such as recommendations) or third
parties using these data (e.g., urban planners). In this paper, we propose and
analyze a honeypot venue-based solution, enhanced with a challenge-response
scheme, that flags users who are generating fake spatial information. We
believe that our work will stimulate further research on this important topic
and will provide new directions with regards to possible solutions.
|
[
{
"version": "v1",
"created": "Tue, 16 Oct 2012 18:29:05 GMT"
}
] | 2012-10-17T00:00:00 |
[
[
"Pelechrinis",
"Konstantinos",
""
],
[
"Krishnamurthy",
"Prashant",
""
],
[
"Zhang",
"Ke",
""
]
] |
new_dataset
| 0.97441 |
1207.3807
|
Hao-Hsiang Hung
|
Hao-Hsiang Hung
|
Light Spanner and Monotone Tree
|
arXiv admin note: text overlap with arXiv:1104.4669
| null |
10.1007/978-3-642-32589-2_42
| null |
cs.DS
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In approximation algorithm design, light spanners has applications in
graph-metric problems such as metric TSP (the traveling salesman problem). We
have developed an efficient algorithm for light spanners in bounded pathwidth
graphs, based on an intermediate data structure called monotone tree. In this
paper, we extended the results to include bounded catwidth graphs.
|
[
{
"version": "v1",
"created": "Mon, 16 Jul 2012 20:01:55 GMT"
}
] | 2012-10-16T00:00:00 |
[
[
"Hung",
"Hao-Hsiang",
""
]
] |
new_dataset
| 0.985976 |
1210.3729
|
Tanmoy Chakraborty
|
Tanmoy Chakraborty and Sivaji Bandyopadhyay
|
Inference of Fine-grained Attributes of Bengali Corpus for Stylometry
Detection
|
5 pages, 2 figures, 4 tables. arXiv admin note: substantial text
overlap with arXiv:1208.6268
|
Polibits (44) 2011, pp. 79-83
| null | null |
cs.CL cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Stylometry, the science of inferring characteristics of the author from the
characteristics of documents written by that author, is a problem with a long
history and belongs to the core task of Text categorization that involves
authorship identification, plagiarism detection, forensic investigation,
computer security, copyright and estate disputes etc. In this work, we present
a strategy for stylometry detection of documents written in Bengali. We adopt a
set of fine-grained attribute features with a set of lexical markers for the
analysis of the text and use three semi-supervised measures for making
decisions. Finally, a majority voting approach has been taken for final
classification. The system is fully automatic and language-independent.
Evaluation results of our attempt for Bengali author's stylometry detection
show reasonably promising accuracy in comparison to the baseline model.
|
[
{
"version": "v1",
"created": "Sat, 13 Oct 2012 18:02:26 GMT"
}
] | 2012-10-16T00:00:00 |
[
[
"Chakraborty",
"Tanmoy",
""
],
[
"Bandyopadhyay",
"Sivaji",
""
]
] |
new_dataset
| 0.991246 |
1210.3943
|
Rodolfo Baggio
|
Rodolfo Baggio and Giacomo Del Chiappa
|
Tourism destinations as digital business ecosystems
|
9 pages, 3 figures, 2 tables; accepted for publication in the
proceedings of: ENTER2013: 20th International Conference on Information
Technology and Travel and Tourism, January 23-25, 2013, Innsbruck (Austria)
| null | null | null |
cs.CY physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tourism has been experiencing very relevant changes since when Information
and Communication Technologies (ICTs), in all their forms, have started to
pervade the industry and the market. In the last decade, a new concept gained
the attention of both researchers and practitioners, that of Digital Business
Ecosystem (DBE). It can be considered as a technological infrastructure aimed
at creating a digital environment to support and enhance networking between
enterprises and stakeholders operating within a sector. Aim of this paper is to
assess the extent to which the technological connection has affected the
structural configuration of the tourism system and, specifically, of tourism
destinations. The present study argues that two components can be considered
when assessing the relationships among stakeholders within a tourism
destination: a real and a virtual one. Further it shows how these two
components are structurally strongly coupled and co-evolve forming a single
system.
|
[
{
"version": "v1",
"created": "Mon, 15 Oct 2012 09:00:57 GMT"
}
] | 2012-10-16T00:00:00 |
[
[
"Baggio",
"Rodolfo",
""
],
[
"Del Chiappa",
"Giacomo",
""
]
] |
new_dataset
| 0.977249 |
1210.4006
|
Maayan Harel Maayan Harel
|
Maayan Harel and Shie Mannor
|
The Perturbed Variation
| null | null | null | null |
cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new discrepancy score between two distributions that gives an
indication on their similarity. While much research has been done to determine
if two samples come from exactly the same distribution, much less research
considered the problem of determining if two finite samples come from similar
distributions. The new score gives an intuitive interpretation of similarity;
it optimally perturbs the distributions so that they best fit each other. The
score is defined between distributions, and can be efficiently estimated from
samples. We provide convergence bounds of the estimated score, and develop
hypothesis testing procedures that test if two data sets come from similar
distributions. The statistical power of this procedures is presented in
simulations. We also compare the score's capacity to detect similarity with
that of other known measures on real data.
|
[
{
"version": "v1",
"created": "Mon, 15 Oct 2012 12:43:03 GMT"
}
] | 2012-10-16T00:00:00 |
[
[
"Harel",
"Maayan",
""
],
[
"Mannor",
"Shie",
""
]
] |
new_dataset
| 0.995151 |
1210.3491
|
Joydeep Basu
|
Joydeep Basu and Tarun K. Bhattacharyya
|
Microelectromechanical system cantilever-based frequency doublers
|
The final, definitive version of this paper has been published in
Journal of Intelligent Material Systems and Structures, 2012 by SAGE
Publications Ltd. (http://online.sagepub.com), All rights reserved. Journal
of Intelligent Material Systems and Structures, 2012
| null |
10.1177/1045389X12461695
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Microelectromechanical system (MEMS) based on-chip resonators offer great
potential for high frequency signal processing circuits like reference
oscillators and filters. This is due to their exceptional features like small
size, large frequency-quality factor product, integrability with CMOS ICs, low
power consumption, low cost batch fabrication etc. A capacitively transduced
cantilever beam resonator is one such popular MEMS resonator topology. In this
letter, the inherent square-law nonlinearity of the voltage-to-force transfer
function of a cantilever resonator's capacitive transducer has been employed
for the realization of frequency doubling effect. Using this concept, frequency
doubling of input signals of 500 kHz to 1 MHz, and 227.5 kHz to 455 kHz has
been experimentally demonstrated for two cantilever beams of length 51.75 and
76.75 micrometer respectively. The MEMS cantilevers have been fabricated with
polysilicon using the PolyMUMPs surface micromachining process, and their
testing has been performed using Laser Doppler Vibrometry. The test results
obtained are in reasonable compliance with the analytical and CoventorWare
finite-element simulation results. The high efficiency demonstrated by the
cantilever frequency doubler makes it a promising choice for signal generation
at high frequencies.
|
[
{
"version": "v1",
"created": "Fri, 12 Oct 2012 12:27:11 GMT"
}
] | 2012-10-15T00:00:00 |
[
[
"Basu",
"Joydeep",
""
],
[
"Bhattacharyya",
"Tarun K.",
""
]
] |
new_dataset
| 0.979611 |
1210.3597
|
Francois Pellegrini
|
Fran\c{c}ois Pellegrini (LaBRI, INRIA Bordeaux - Sud-Ouest),
S\'ebastien Canevet (CERSA)
|
Le droit du num\'erique : une histoire \`a pr\'eserver
|
No. RR-8100 (2012)
| null | null | null |
cs.GL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although the history of informatics is recent, this field poses unusual
problems with respect to its preservation. These problems are amplified by
legal issues, digital law being in itself a subject matter whose history is
also worth presenting in a computer science museum. The purpose of this paper
is to present a quick overview of the evolution of law regarding digital
matters, from an historical perspective as well as with respect to the
preservation and presentation of the works.
|
[
{
"version": "v1",
"created": "Fri, 12 Oct 2012 18:48:58 GMT"
}
] | 2012-10-15T00:00:00 |
[
[
"Pellegrini",
"François",
"",
"LaBRI, INRIA Bordeaux - Sud-Ouest"
],
[
"Canevet",
"Sébastien",
"",
"CERSA"
]
] |
new_dataset
| 0.997966 |
1207.5720
|
Tomasz Rutkowski
|
Tomasz M. Rutkowski, Hiromu Mori, Yoshihiro Matsumoto, Zhenyu Cai,
Moonjeong Chang, Nozomu Nishikawa, Shoji Makino, and Koichi Mori
|
Haptic BCI Paradigm based on Somatosensory Evoked Potential
|
2 pages, 1 figure
| null | null | null |
cs.HC q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new concept and an online prototype of haptic BCI paradigm are presented.
Our main goal is to develop a new, alternative and low cost paradigm, with
open-source hardware and software components. We also report results obtained
with the novel dry EEG electrodes based signal acquisition system by g.tec,
which further improves experimental comfort. We address the following points: a
novel application of the BCI; a new methodological approach used compared to
earlier projects; a new benefit for potential users of a BCI; the approach
working online/in real-time; development of a novel stimuli delivery hardware
and software. The results with five healthy subjects and discussion of future
developments conclude this submission.
|
[
{
"version": "v1",
"created": "Tue, 24 Jul 2012 15:05:50 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Jul 2012 08:49:54 GMT"
},
{
"version": "v3",
"created": "Mon, 30 Jul 2012 10:21:31 GMT"
},
{
"version": "v4",
"created": "Tue, 31 Jul 2012 06:10:36 GMT"
},
{
"version": "v5",
"created": "Thu, 23 Aug 2012 13:24:59 GMT"
},
{
"version": "v6",
"created": "Thu, 11 Oct 2012 02:45:58 GMT"
}
] | 2012-10-12T00:00:00 |
[
[
"Rutkowski",
"Tomasz M.",
""
],
[
"Mori",
"Hiromu",
""
],
[
"Matsumoto",
"Yoshihiro",
""
],
[
"Cai",
"Zhenyu",
""
],
[
"Chang",
"Moonjeong",
""
],
[
"Nishikawa",
"Nozomu",
""
],
[
"Makino",
"Shoji",
""
],
[
"Mori",
"Koichi",
""
]
] |
new_dataset
| 0.998541 |
1210.3115
|
EPTCS
|
Robbert Krebbers (Radboud University Nijmegen)
|
A call-by-value lambda-calculus with lists and control
|
In Proceedings CL&C 2012, arXiv:1210.2890
|
EPTCS 97, 2012, pp. 19-33
|
10.4204/EPTCS.97.2
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Calculi with control operators have been studied to reason about control in
programming languages and to interpret the computational content of classical
proofs. To make these calculi into a real programming language, one should also
include data types.
As a step into that direction, this paper defines a simply typed
call-by-value lambda calculus with the control operators catch and throw, a
data type of lists, and an operator for primitive recursion (a la Goedel's T).
We prove that our system satisfies subject reduction, progress, confluence for
untyped terms, and strong normalization for well-typed terms.
|
[
{
"version": "v1",
"created": "Thu, 11 Oct 2012 03:52:15 GMT"
}
] | 2012-10-12T00:00:00 |
[
[
"Krebbers",
"Robbert",
"",
"Radboud University Nijmegen"
]
] |
new_dataset
| 0.987836 |
1210.3312
|
Juan Manuel Torres Moreno
|
Juan-Manuel Torres-Moreno
|
Artex is AnotheR TEXt summarizer
|
11 pages, 5 figures. arXiv admin note: substantial text overlap with
arXiv:1209.3126
| null | null | null |
cs.IR cs.AI cs.CL
|
http://creativecommons.org/licenses/by/3.0/
|
This paper describes Artex, another algorithm for Automatic Text
Summarization. In order to rank sentences, a simple inner product is calculated
between each sentence, a document vector (text topic) and a lexical vector
(vocabulary used by a sentence). Summaries are then generated by assembling the
highest ranked sentences. No ruled-based linguistic post-processing is
necessary in order to obtain summaries. Tests over several datasets (coming
from Document Understanding Conferences (DUC), Text Analysis Conferences (TAC),
evaluation campaigns, etc.) in French, English and Spanish have shown that
summarizer achieves interesting results.
|
[
{
"version": "v1",
"created": "Thu, 11 Oct 2012 18:21:01 GMT"
}
] | 2012-10-12T00:00:00 |
[
[
"Torres-Moreno",
"Juan-Manuel",
""
]
] |
new_dataset
| 0.999558 |
1210.2951
|
Georg Regensburger
|
Anja Korporal, Georg Regensburger, Markus Rosenkranz
|
Regular and Singular Boundary Problems in Maple
|
14 pages; Berlin/Heidelberg, Springer
|
Computer Algebra in Scientific Computing (CASC 2011), LNCS 6885,
pp. 280-293, 2011
|
10.1007/978-3-642-23568-9_22
| null |
cs.SC cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a new Maple package for treating boundary problems for linear
ordinary differential equations, allowing two-/multipoint as well as Stieltjes
boundary conditions. For expressing differential operators, boundary
conditions, and Green's operators, we employ the algebra of
integro-differential operators. The operations implemented for regular boundary
problems include computing Green's operators as well as composing and factoring
boundary problems. Our symbolic approach to singular boundary problems is new;
it provides algorithms for computing compatibility conditions and generalized
Green's operators.
|
[
{
"version": "v1",
"created": "Wed, 10 Oct 2012 15:13:55 GMT"
}
] | 2012-10-11T00:00:00 |
[
[
"Korporal",
"Anja",
""
],
[
"Regensburger",
"Georg",
""
],
[
"Rosenkranz",
"Markus",
""
]
] |
new_dataset
| 0.999062 |
1210.2453
|
EPTCS
|
Alessandro Solimando (University of Genova, Italy), Giorgio Delzanno
(University of Genova, Italy), Giovanna Guerrini (University of Genova,
Italy)
|
Automata-based Static Analysis of XML Document Adaptation
|
In Proceedings GandALF 2012, arXiv:1210.2028
|
EPTCS 96, 2012, pp. 85-98
|
10.4204/EPTCS.96.7
| null |
cs.DB cs.DS cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The structure of an XML document can be optionally specified by means of XML
Schema, thus enabling the exploitation of structural information for efficient
document handling. Upon schema evolution, or when exchanging documents among
different collections exploiting related but not identical schemas, the need
may arise of adapting a document, known to be valid for a given schema S, to a
target schema S'. The adaptation may require knowledge of the element semantics
and cannot always be automatically derived. In this paper, we present an
automata-based method for the static analysis of user-defined XML document
adaptations, expressed as sequences of XQuery Update update primitives. The key
feature of the method is the use of an automatic inference method for
extracting the type, expressed as a Hedge Automaton, of a sequence of document
updates. The type is computed starting from the original schema S and from
rewriting rules that formally define the operational semantics of a sequence of
document updates. Type inclusion can then be used as conformance test w.r.t.
the type extracted from the target schema S'.
|
[
{
"version": "v1",
"created": "Tue, 9 Oct 2012 00:53:46 GMT"
}
] | 2012-10-10T00:00:00 |
[
[
"Solimando",
"Alessandro",
"",
"University of Genova, Italy"
],
[
"Delzanno",
"Giorgio",
"",
"University of Genova, Italy"
],
[
"Guerrini",
"Giovanna",
"",
"University of Genova,\n Italy"
]
] |
new_dataset
| 0.975136 |
1210.2456
|
EPTCS
|
Ricardo Almeida, Sabine Broda, Nelma Moreira
|
Deciding KAT and Hoare Logic with Derivatives
|
In Proceedings GandALF 2012, arXiv:1210.2028
|
EPTCS 96, 2012, pp. 127-140
|
10.4204/EPTCS.96.10
| null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Kleene algebra with tests (KAT) is an equational system for program
verification, which is the combination of Boolean algebra (BA) and Kleene
algebra (KA), the algebra of regular expressions. In particular, KAT subsumes
the propositional fragment of Hoare logic (PHL) which is a formal system for
the specification and verification of programs, and that is currently the base
of most tools for checking program correctness. Both the equational theory of
KAT and the encoding of PHL in KAT are known to be decidable. In this paper we
present a new decision procedure for the equivalence of two KAT expressions
based on the notion of partial derivatives. We also introduce the notion of
derivative modulo particular sets of equations. With this we extend the
previous procedure for deciding PHL. Some experimental results are also
presented.
|
[
{
"version": "v1",
"created": "Tue, 9 Oct 2012 00:54:12 GMT"
}
] | 2012-10-10T00:00:00 |
[
[
"Almeida",
"Ricardo",
""
],
[
"Broda",
"Sabine",
""
],
[
"Moreira",
"Nelma",
""
]
] |
new_dataset
| 0.998837 |
1210.2457
|
EPTCS
|
Daniel Neider (RWTH Aachen University), Roman Rabinovich (RWTH Aachen
University), Martin Zimmermann (RWTH Aachen University and University of
Warsaw)
|
Down the Borel Hierarchy: Solving Muller Games via Safety Games
|
In Proceedings GandALF 2012, arXiv:1210.2028
|
EPTCS 96, 2012, pp. 169-182
|
10.4204/EPTCS.96.13
| null |
cs.LO cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We transform a Muller game with n vertices into a safety game with (n!)^3
vertices whose solution allows to determine the winning regions of the Muller
game and to compute a finite-state winning strategy for one player. This yields
a novel antichain-based memory structure and a natural notion of permissive
strategies for Muller games. Moreover, we generalize our construction by
presenting a new type of game reduction from infinite games to safety games and
show its applicability to several other winning conditions.
|
[
{
"version": "v1",
"created": "Tue, 9 Oct 2012 00:54:33 GMT"
}
] | 2012-10-10T00:00:00 |
[
[
"Neider",
"Daniel",
"",
"RWTH Aachen University"
],
[
"Rabinovich",
"Roman",
"",
"RWTH Aachen\n University"
],
[
"Zimmermann",
"Martin",
"",
"RWTH Aachen University and University of\n Warsaw"
]
] |
new_dataset
| 0.980806 |
1210.2462
|
EPTCS
|
Alex Kruckman (Berkeley University), Sasha Rubin (TU Vienna and IST
Austria), John Sheridan, Ben Zax
|
A Myhill-Nerode theorem for automata with advice
|
In Proceedings GandALF 2012, arXiv:1210.2028
|
EPTCS 96, 2012, pp. 238-246
|
10.4204/EPTCS.96.18
| null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An automaton with advice is a finite state automaton which has access to an
additional fixed infinite string called an advice tape. We refine the
Myhill-Nerode theorem to characterize the languages of finite strings that are
accepted by automata with advice. We do the same for tree automata with advice.
|
[
{
"version": "v1",
"created": "Tue, 9 Oct 2012 00:55:28 GMT"
}
] | 2012-10-10T00:00:00 |
[
[
"Kruckman",
"Alex",
"",
"Berkeley University"
],
[
"Rubin",
"Sasha",
"",
"TU Vienna and IST\n Austria"
],
[
"Sheridan",
"John",
""
],
[
"Zax",
"Ben",
""
]
] |
new_dataset
| 0.989663 |
1210.2514
|
Jitendra Mohan Dr
|
J. Mohan, S. Maheshwari, and D. S. Chauhan
|
Minimum Grounded Component Based Voltage-Mode Quadrature Oscillator
using DVCC
|
International Journal on Recent Trends in Engineering & Technology,
vol.3, issue 4, 2010
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a new voltage-mode quadrature oscillator using minimum number
of active and passive component is proposed. The proposed circuit employs
single modified DVCC, two grounded capacitor and two grounded resistors, which
is ideal for IC implementation. The active and passive sensitivity are no more
than unity. The proposed circuit is verified through PSPICE simulation results.
|
[
{
"version": "v1",
"created": "Tue, 9 Oct 2012 07:34:55 GMT"
}
] | 2012-10-10T00:00:00 |
[
[
"Mohan",
"J.",
""
],
[
"Maheshwari",
"S.",
""
],
[
"Chauhan",
"D. S.",
""
]
] |
new_dataset
| 0.995734 |
1210.2582
|
Adrian Agustin
|
Adrian Agustin, Josep Vidal
|
Degrees of Freedom Region of the MIMO X channel with an Arbitrary Number
of Antennas
|
submitted to IEEE Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We characterize the total degrees of freedom (DoF) of the full-rank MIMO X
channel with arbitrary number of antennas at each node. We elucidate that the
existing outer bound is tight for any antenna configuration and provide
transmit and receive filter designs that attain this outer bound. The proposed
achievable scheme exploits channel extensions in terms of both, symbol and
asymmetric complex signaling when the communication is carried out over a
constant channel case, and is also applicable to time varying channels. The
proposed scheme represents a general framework for the derivation of the total
DoF of any two-by-two multiuser channels. Furthermore, the rank-deficient MIMO
channels case is naturally addressed, and it is shown that the total DoF of the
interference (IC) and MIMO X channels are in general superior to the full rank
MIMO case
|
[
{
"version": "v1",
"created": "Tue, 9 Oct 2012 12:38:18 GMT"
}
] | 2012-10-10T00:00:00 |
[
[
"Agustin",
"Adrian",
""
],
[
"Vidal",
"Josep",
""
]
] |
new_dataset
| 0.989175 |
1210.2584
|
Mansour Moufid
|
Mansour Moufid
|
Sudoku as a special transportation problem
|
6 pages; 2 figures
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sudoku is a popular combinatorial puzzle. A new method of solving Sudoku is
presented, which involves formulating a puzzle as a special type of
transportation problem. This model allows one to solve puzzles with more than
one solution, keeping the constraints of the problem fixed, and simply changing
a cost matrix between solutions.
|
[
{
"version": "v1",
"created": "Tue, 9 Oct 2012 12:50:27 GMT"
}
] | 2012-10-10T00:00:00 |
[
[
"Moufid",
"Mansour",
""
]
] |
new_dataset
| 0.99878 |
1210.2704
|
Aslan Tchamkerten
|
Hamed Mirghasemi and Aslan Tchamkerten
|
On the Capacity of the One-Bit Deletion and Duplication Channel
|
Allerton 2012
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The one-bit deletion and duplication channel is investigated. An input to
this channel consists of a block of bits which experiences either a deletion,
or a duplication, or remains unchanged. For this channel a capacity expression
is obtained in a certain asymptotic regime where the deletion and duplication
probabilities tend to zero. As a corollary, we obtain an asymptotic expression
for the capacity of the segmented deletion and duplication channel where the
input now consists of several blocks and each block independently experiences
either a deletion, or a duplication, or remains unchanged.
|
[
{
"version": "v1",
"created": "Tue, 9 Oct 2012 19:48:34 GMT"
}
] | 2012-10-10T00:00:00 |
[
[
"Mirghasemi",
"Hamed",
""
],
[
"Tchamkerten",
"Aslan",
""
]
] |
new_dataset
| 0.998549 |
cs/0605029
|
Shiva Kasiviswanathan
|
Martin Furer, Shiva Prasad Kasiviswanathan
|
Spanners for Geometric Intersection Graphs
|
16 pages, 5 figures, Latex
|
Journal of Computational Geometry 3(1) (2012) 31-64
| null | null |
cs.CG
| null |
Efficient algorithms are presented for constructing spanners in geometric
intersection graphs. For a unit ball graph in R^k, a (1+\epsilon)-spanner is
obtained using efficient partitioning of the space into hypercubes and solving
bichromatic closest pair problems. The spanner construction has almost
equivalent complexity to the construction of Euclidean minimum spanning trees.
The results are extended to arbitrary ball graphs with a sub-quadratic running
time.
For unit ball graphs, the spanners have a small separator decomposition which
can be used to obtain efficient algorithms for approximating proximity problems
like diameter and distance queries. The results on compressed quadtrees,
geometric graph separators, and diameter approximation might be of independent
interest.
|
[
{
"version": "v1",
"created": "Sun, 7 May 2006 23:38:00 GMT"
}
] | 2012-10-10T00:00:00 |
[
[
"Furer",
"Martin",
""
],
[
"Kasiviswanathan",
"Shiva Prasad",
""
]
] |
new_dataset
| 0.98186 |
1206.1948
|
Mojtaba Vaezi
|
Mojtaba Vaezi
|
The Capacity of Less Noisy Cognitive Interference Channels
|
6 pages, one figure, one table. Appeared at the 50th Annual Allerton
Conference on Communications, Control, and Computing (Allerton 2012)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fundamental limits of the cognitive interference channel (CIC) with two pairs
of transmitter-receiver has been under exploration for several years. In this
paper, we study the discrete memoryless cognitive interference channel (DM-CIC)
in which the cognitive transmitter non-causally knows the message of the
primary transmitter. The capacity of this channel is not known in general; it
is only known in some special cases. Inspired by the concept of less noisy
broadcast channel (BC), in this work we introduce the notion of less noisy
cognitive interference channel. Unlike BC, due to the inherent asymmetry of the
cognitive channel, two different less noisy channels are distinguishable; these
are named the primary-less-noisy and cognitive-less-noisy channels. We derive
capacity region for the latter case, by introducing inner and outer bounds on
the capacity of the DM-CIC and showing that these bounds coincide for the
cognitive-less-noisy channel. Having established the capacity region, we prove
that superposition coding is the optimal encoding technique.
|
[
{
"version": "v1",
"created": "Sat, 9 Jun 2012 15:40:53 GMT"
},
{
"version": "v2",
"created": "Sun, 7 Oct 2012 21:30:19 GMT"
}
] | 2012-10-09T00:00:00 |
[
[
"Vaezi",
"Mojtaba",
""
]
] |
new_dataset
| 0.959262 |
1206.4753
|
Tianshi Chen
|
Daofu Liu, Yunji Chen, Qi Guo, Tianshi Chen, Ling Li, Qunfeng Dong,
Weiwu Hu
|
DLS: Directoryless Shared Last-level Cache
|
This paper has been withdrawn by the authors due to a major revision
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Directory-based protocols have been the de facto solution for maintaining
cache coherence in shared-memory parallel systems comprising multi/many cores,
where each store instruction is eagerly made globally visible by invalidating
the private cache (PC) backups of other cores. Consequently, the directory not
only consumes large chip area, but also incurs considerable energy consumption
and performance degradation, due to the large number of Invalidation/Ack
messages transferred in the interconnection network and resulting network
congestion. In this paper, we reveal the interesting fact that the directory is
actually an unnecessary luxury for practical parallel systems. Because of
widely deployed software/hardware techniques involving instruction reordering,
most (if not all) parallel systems work under the weak consistency model, where
a remote store instruction is allowed to be invisible to a core before the next
synchronization of the core, instead of being made visible eagerly by
invalidating PC backups of other cores. Based on this key observation, we
propose a lightweight novel scheme called {\em DLS (DirectoryLess Shared
last-level cache)}, which completely removes the directory and Invalidation/Ack
messages, and efficiently maintains cache coherence using a novel {\em
self-suspicion + speculative execution} mechanism. Experimental results over
SPLASH-2 benchmarks show that on a 16-core processor, DLS not only completely
removes the chip area cost of the directory, but also improves processor
performance by 11.08%, reduces overall network traffic by 28.83%, and reduces
energy consumption of the network by 15.65% on average (compared with
traditional MESI protocol with full directory). Moreover, DLS does not involve
any modification to programming languages and compilers, and hence is
seamlessly compatible with legacy codes.
|
[
{
"version": "v1",
"created": "Thu, 21 Jun 2012 00:59:43 GMT"
},
{
"version": "v2",
"created": "Sun, 7 Oct 2012 04:08:02 GMT"
}
] | 2012-10-09T00:00:00 |
[
[
"Liu",
"Daofu",
""
],
[
"Chen",
"Yunji",
""
],
[
"Guo",
"Qi",
""
],
[
"Chen",
"Tianshi",
""
],
[
"Li",
"Ling",
""
],
[
"Dong",
"Qunfeng",
""
],
[
"Hu",
"Weiwu",
""
]
] |
new_dataset
| 0.998405 |
1207.0782
|
David Burshtein
|
David Burshtein and Alona Strugatski
|
Polar write once memory codes
|
submitted for publication
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A coding scheme for write once memory (WOM) using polar codes is presented.
It is shown that the scheme achieves the capacity region of noiseless WOMs when
an arbitrary number of multiple writes is permitted. The encoding and decoding
complexities scale as O(N log N) where N is the blocklength. For N sufficiently
large, the error probability decreases sub-exponentially in N. The results can
be generalized from binary to generalized WOMs, described by an arbitrary
directed acyclic graph, using nonbinary polar codes. In the derivation we also
obtain results on the typical distortion of polar codes for lossy source
coding. Some simulation results with finite length codes are presented.
|
[
{
"version": "v1",
"created": "Tue, 3 Jul 2012 19:11:25 GMT"
},
{
"version": "v2",
"created": "Sun, 7 Oct 2012 10:53:03 GMT"
}
] | 2012-10-09T00:00:00 |
[
[
"Burshtein",
"David",
""
],
[
"Strugatski",
"Alona",
""
]
] |
new_dataset
| 0.999673 |
1210.1940
|
Kondwani Magamba
|
Kondwani Magamba, Solomon Kadaleka and Ansley Kasambara
|
Variable-length Hill Cipher with MDS Key Matrix
| null | null | null | null |
cs.CR cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
The Hill Cipher is a classical symmetric cipher which breaks plaintext into
blocks of size m and then multiplies each block by an m by m key matrix to
yield ciphertext. However, it is well known that the Hill cipher succumbs to
cryptanalysis relatively easily. As a result, there have been efforts to
strengthen the cipher through the use of various techniques e.g. permuting rows
and columns of the key matrix to encrypt each plaintext vector with a new key
matrix. In this paper, we strengthen the security of the Hill cipher against a
known-plaintext attack by encrypting each plaintext matrix by a variable-length
key matrix obtained from a Maximum Distance Separable (MDS) master key matrix.
|
[
{
"version": "v1",
"created": "Sat, 6 Oct 2012 11:20:31 GMT"
}
] | 2012-10-09T00:00:00 |
[
[
"Magamba",
"Kondwani",
""
],
[
"Kadaleka",
"Solomon",
""
],
[
"Kasambara",
"Ansley",
""
]
] |
new_dataset
| 0.997759 |
1210.2025
|
Abdul Razaque
|
Wafa Elmannai, Abdul Razaque, Khaled Elleithy
|
TCP-UB: A New congestion aware transmission control protocolvariant
|
13 Pages, 11 figures
|
International Journal of Computer Networks & Communications
(IJCNC) Vol.4, No.4, July 2012
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Transmission control protocol (TCP) is a connection oriented protocol for
several types of distributed applications. TCP is reliable particularly for
traditional fixed networks. With emergence of faster wireless networks, TCP has
been performing poorly in its original format. The performance of TCP is
affected due to assorted factors including congestion window, maximum packet
size, retry limit, recovery mechanism, backup mechanism and mobility. To
overcome deficiency of original TCP, Several modifications have been introduced
to improve network quality. The mobility is a major hurdle in degrading the
performance of mobile wireless networks. In this paper, we introduce and
implement new TCP variant University of Bridgeport (UB) that combines the
features of TCP Westwood and Vegas. We examine the performance of TCP-UB, Vegas
and Westwood using different realistic scenarios. NS2 simulator demonstrates
the stability of TCP-UB as compared with TCP Vegas and Westwood in highly
congested networks from the mobility point of view.
|
[
{
"version": "v1",
"created": "Sun, 7 Oct 2012 06:13:44 GMT"
}
] | 2012-10-09T00:00:00 |
[
[
"Elmannai",
"Wafa",
""
],
[
"Razaque",
"Abdul",
""
],
[
"Elleithy",
"Khaled",
""
]
] |
new_dataset
| 0.999644 |
1210.2028
|
EPTCS
|
Marco Faella (Universit\`a di Napoli "Federico II"), Aniello Murano
(Universit\`a di Napoli "Federico II")
|
Proceedings Third International Symposium on Games, Automata, Logics and
Formal Verification
| null |
EPTCS 96, 2012
|
10.4204/EPTCS.96
| null |
cs.LO cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This volume contains the proceedings of the Third International Symposium on
Games, Automata, Logic and Formal Verification (GandALF), held in Naples
(Italy) from September 6th to 8th, 2012.
GandALF was founded by a number of Italian computer scientists interested in
mathematical logic, automata theory, game theory, and their applications to the
specification, design, and verification of complex systems. Its aim is to
provide a forum where people from different areas, and possibly with different
backgrounds, can fruitfully interact. Even though the idea of the symposium
emerged within the Italian research community, the event has a truly
international nature, as witnessed by the composition of the conference
committees and the programme.
|
[
{
"version": "v1",
"created": "Sun, 7 Oct 2012 06:44:34 GMT"
}
] | 2012-10-09T00:00:00 |
[
[
"Faella",
"Marco",
"",
"Università di Napoli \"Federico II\""
],
[
"Murano",
"Aniello",
"",
"Università di Napoli \"Federico II\""
]
] |
new_dataset
| 0.989172 |
1210.2030
|
Abdul Razaque
|
Abdul Razaque, Khaled Elleithy
|
Multi-frame Signature-cum Anomaly-based Intrusion Detection Systems
(MSAIDS) to Protect Privacy of Users over Mobile Collaborative Learning (MCL)
|
20 pages, 9 figures International Journal of E -Technology Volume 3
Number 2 May 2012. arXiv admin note: substantial text overlap with
arXiv:1208.2073
|
International Journal of E -Technology Volume 3 Number 2 May 2012
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The rogue DHCP is unauthorized server that releases the incorrect IP address
to users and sniffs the traffic illegally. The contribution specially provides
privacy to users and enhances the security aspects of mobile supported
collaborative framework (MSCF) explained in [24].The paper introduces
multi-frame signature-cum anomaly-based intrusion detection systems (MSAIDS)
supported with novel algorithms and inclusion of new rules in existing IDS. The
major target of contribution is to detect the malicious attacks and blocks the
illegal activities of rogue DHCP server. This innovative security mechanism
reinforces the confidence of users, protects network from illicit intervention
and restore the privacy of users. Finally, the paper validates the idea through
simulation and compares the findings with known existing techniques.
|
[
{
"version": "v1",
"created": "Sun, 7 Oct 2012 06:54:51 GMT"
}
] | 2012-10-09T00:00:00 |
[
[
"Razaque",
"Abdul",
""
],
[
"Elleithy",
"Khaled",
""
]
] |
new_dataset
| 0.980206 |
1210.2035
|
Clemens Wiltsche
|
Clemens Wiltsche, Ufuk Topcu and Richard M. Murray
|
Synthesis of Reactive Protocols for Vehicle-to-Vehicle Communication
|
Technical report for the paper with the same title prepared for
submission to ICCPS'13, April 8--11, 2013, Philadelphia, PA, USA
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a synthesis method for communication protocols for active safety
applications that satisfy certain formal specifications on quality of service
requirements. The protocols are developed to provide reliable communication
services for automobile active safety applications. The synthesis method
transforms a specification into a distributed implementation of senders and
receivers that together satisfy the quality of service requirements by
transmitting messages over an unreliable medium. We develop a specification
language and an execution model for the implementations, and demonstrate the
viability of our method by developing a protocol for a traffic scenario in
which a car runs a red light at a busy intersection.
|
[
{
"version": "v1",
"created": "Sun, 7 Oct 2012 08:00:19 GMT"
}
] | 2012-10-09T00:00:00 |
[
[
"Wiltsche",
"Clemens",
""
],
[
"Topcu",
"Ufuk",
""
],
[
"Murray",
"Richard M.",
""
]
] |
new_dataset
| 0.997818 |
1210.2149
|
Ragib Hasan
|
Shams Zawoad and Ragib Hasan
|
The Enemy Within: The Emerging Threats to Healthcare from Malicious
Mobile Devices
|
To appear at MobiHealth 2012
| null | null | null |
cs.CR cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
With the proliferation of wireless networks, mobile devices and medical
devices are increasingly being equipped with wireless interfaces, such as
Bluetooth and WiFi to allow easy access to and control of the medical devices.
Unfortunately, the very presence and usage of such interfaces also expose the
medical devices to novel attacks from malicious parties. The emerging threat
from malicious mobile devices is significant and severe, since attackers can
steal confidential data from a patient's medical device. Also, attackers can
compromise the medical device and either feed doctors bad data from it or issue
potentially fatal commands to the device, which may even result in the death of
the patient. As the mobile devices are often at close proximity to the patient
(either in the hospital or home settings), attacks from such devices are hard
to prevent. In this paper, we present a systematic analysis of this new threat
from mobile devices on medical devices and healthcare infrastructure. We also
perform a thorough security analysis of a major hospital and uncover potential
vulnerabilities. Finally, we propose a set of potential solutions and defenses
against such attacks.
|
[
{
"version": "v1",
"created": "Mon, 8 Oct 2012 05:34:18 GMT"
}
] | 2012-10-09T00:00:00 |
[
[
"Zawoad",
"Shams",
""
],
[
"Hasan",
"Ragib",
""
]
] |
new_dataset
| 0.994421 |
1210.2159
|
Joerg Kliewer
|
Matthieu R. Bloch, Laura Luzzi, Joerg Kliewer
|
Strong Coordination with Polar Codes
|
7 pages doublespaced, presented at the 50th Annual Allerton
Conference on Communication, Control and Computing 2012
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we design explicit codes for strong coordination in two-node
networks. Specifically, we consider a two-node network in which the action
imposed by nature is binary and uniform, and the action to coordinate is
obtained via a symmetric discrete memoryless channel. By observing that polar
codes are useful for channel resolvability over binary symmetric channels, we
prove that nested polar codes achieve a subset of the strong coordination
capacity region, and therefore provide a constructive and low complexity
solution for strong coordination.
|
[
{
"version": "v1",
"created": "Mon, 8 Oct 2012 07:02:27 GMT"
}
] | 2012-10-09T00:00:00 |
[
[
"Bloch",
"Matthieu R.",
""
],
[
"Luzzi",
"Laura",
""
],
[
"Kliewer",
"Joerg",
""
]
] |
new_dataset
| 0.999325 |
1201.0414
|
Xuechong Guan
|
Xuechong Guan and Yongming Li
|
Continuity in Information Algebras
| null | null |
10.1142/S0218488512500304
| null |
cs.AI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper, the continuity and strong continuity in domain-free
information algebras and labeled information algebras are introduced
respectively. A more general concept of continuous function which is defined
between two domain-free continuous information algebras is presented. It is
shown that, with the operations combination and focusing, the set of all
continuous functions between two domain-free s-continuous information algebras
forms a new s-continuous information algebra. By studying the relationship
between domain-free information algebras and labeled information algebras, it
is demonstrated that they do correspond to each other on s-compactness.
|
[
{
"version": "v1",
"created": "Mon, 2 Jan 2012 02:40:12 GMT"
}
] | 2012-10-08T00:00:00 |
[
[
"Guan",
"Xuechong",
""
],
[
"Li",
"Yongming",
""
]
] |
new_dataset
| 0.988062 |
1210.1771
|
A. Emre Cetin
|
A. Emre Cetin
|
In-place associative permutation sort
|
25 pages. arXiv admin note: substantial text overlap with
arXiv:1209.0572, arXiv:1209.3668, arXiv:1209.1942, arXiv:1209.4714
| null | null | null |
cs.DS
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In-place associative integer sorting technique was developed, improved and
specialized for distinct integers. The technique is suitable for integer
sorting. Hence, given a list S of n integers S[0...n-1], the technique sorts
the integers in ascending or descending order. It replaces bucket sort,
distribution counting sort and address calculation sort family of algorithms
and requires only constant amount of additional memory for storing counters and
indices beside the input list. The technique was inspired from one of the
ordinal theories of "serial order in behavior" and explained by the analogy
with the three main stages in the formation and retrieval of memory in
cognitive neuroscience: (i) practicing, (ii) storing and (iii) retrieval.
In this study in-place associative permutation technique is introduced for
integer key sorting problem. Given a list S of n elements S[0...n-1] each have
an integer key in the range [0,m-1], the technique sorts the elements according
to their integer keys in O(n) time using only O(1) amount of memory if m<=n. On
the other hand, if m>n, it sorts in O(n+m) time for the worst, O(m) time for
the average (uniformly distributed keys) and O(n) time for the best case using
O(1) extra space.
|
[
{
"version": "v1",
"created": "Fri, 5 Oct 2012 14:30:37 GMT"
}
] | 2012-10-08T00:00:00 |
[
[
"Cetin",
"A. Emre",
""
]
] |
new_dataset
| 0.97821 |
1206.1996
|
Srimanta Bhattacharya
|
Niranjan Balachandran and Srimanta Bhattacharya
|
On an Extremal Hypergraph Problem Related to Combinatorial Batch Codes
|
9 pages
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $n, r, k$ be positive integers such that $3\leq k < n$ and $2\leq r \leq
k-1$. Let $m(n, r, k)$ denote the maximum number of edges an $r$-uniform
hypergraph on $n$ vertices can have under the condition that any collection of
$i$ edges, span at least $i$ vertices for all $1 \leq i \leq k$. We are
interested in the asymptotic nature of $m(n, r, k)$ for fixed $r$ and $k$ as $n
\rightarrow \infty$. This problem is related to the forbidden hypergraph
problem introduced by Brown, Erd\H{o}s, and S\'os and very recently discussed
in the context of combinatorial batch codes. In this short paper we obtain the
following results. {enumerate}[(i)] Using a result due to Erd\H{o}s we are able
to show $m(n, k, r) = o(n^r)$ for $7\leq k$, and $3 \leq r \leq k-1-\lceil\log
k \rceil$. This result is best possible with respect to the upper bound on $r$
as we subsequently show through explicit construction that for $6 \leq k$, and
$k-\lceil \log k \rceil \leq r \leq k-1, m(n, r, k) = \Theta(n^r)$.
This explicit construction improves on the non-constructive general lower
bound obtained by Brown, Erd\H{o}s, and S\'os for the considered parameter
values. For 2-uniform CBCs we obtain the following results. {enumerate} We
provide exact value of $m(n, 2, 5)$ for $n \geq 5$. Using a result of
Lazebnik,et al. regarding maximum size of graphs with large girth, we improve
the existing lower bound on $m(n, 2, k)$ ($\Omega(n^{\frac{k+1}{k-1}})$) for
all $k \geq 8$ and infinitely many values of $n$. We show $m(n, 2, k) =
O(n^{1+\frac{1}{\lfloor\frac{k}{4}\rfloor}})$ by using a result due to Bondy
and Simonovits, and also show $m(n, 2, k) = \Theta(n^{3/2})$ for $k = 6, 7, 8$
by using a result of K\"{o}vari, S\'os, and Tur\'{a}n.
|
[
{
"version": "v1",
"created": "Sun, 10 Jun 2012 05:46:49 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Aug 2012 08:46:54 GMT"
},
{
"version": "v3",
"created": "Thu, 30 Aug 2012 15:58:23 GMT"
},
{
"version": "v4",
"created": "Thu, 4 Oct 2012 16:25:04 GMT"
}
] | 2012-10-05T00:00:00 |
[
[
"Balachandran",
"Niranjan",
""
],
[
"Bhattacharya",
"Srimanta",
""
]
] |
new_dataset
| 0.989942 |
1210.1039
|
Frederic Le Mouel
|
Julien Ponge (CITI), Fr\'ed\'eric Le Mou\"el (CITI)
|
JooFlux: Hijacking Java 7 InvokeDynamic To Support Live Code
Modifications
| null | null | null | null |
cs.OS cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Changing functional and non-functional software implementation at runtime is
useful and even sometimes critical both in development and production
environments. JooFlux is a JVM agent that allows both the dynamic replacement
of method implementations and the application of aspect advices. It works by
doing bytecode transformation to take advantage of the new invokedynamic
instruction added in Java SE 7 to help implementing dynamic languages for the
JVM. JooFlux can be managed using a JMX agent so as to operate dynamic
modifications at runtime, without resorting to a dedicated domain-specific
language. We compared JooFlux with existing AOP platforms and dynamic
languages. Results demonstrate that JooFlux performances are close to the Java
ones --- with most of the time a marginal overhead, and sometimes a gain ---
where AOP platforms and dynamic languages present significant overheads. This
paves the way for interesting future evolutions and applications of JooFlux.
|
[
{
"version": "v1",
"created": "Wed, 3 Oct 2012 09:15:19 GMT"
}
] | 2012-10-04T00:00:00 |
[
[
"Ponge",
"Julien",
"",
"CITI"
],
[
"Mouël",
"Frédéric Le",
"",
"CITI"
]
] |
new_dataset
| 0.999377 |
1210.0613
|
EPTCS
|
Ugo Dal Lago (Universit\`a di Bologna & INRIA Sophia Antipolis),
Claudia Faggian (CNRS & Universit\'e Denis-Diderot Paris 7)
|
On Multiplicative Linear Logic, Modality and Quantum Circuits
|
In Proceedings QPL 2011, arXiv:1210.0298
|
EPTCS 95, 2012, pp. 55-66
|
10.4204/EPTCS.95.6
| null |
cs.LO quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A logical system derived from linear logic and called QMLL is introduced and
shown able to capture all unitary quantum circuits. Conversely, any proof is
shown to compute, through a concrete GoI interpretation, some quantum circuits.
The system QMLL, which enjoys cut-elimination, is obtained by endowing
multiplicative linear logic with a quantum modality.
|
[
{
"version": "v1",
"created": "Tue, 2 Oct 2012 00:34:21 GMT"
}
] | 2012-10-03T00:00:00 |
[
[
"Lago",
"Ugo Dal",
"",
"Università di Bologna & INRIA Sophia Antipolis"
],
[
"Faggian",
"Claudia",
"",
"CNRS & Université Denis-Diderot Paris 7"
]
] |
new_dataset
| 0.995268 |
1104.4356
|
Daniel Loebenberger
|
Daniel Loebenberger and Michael N\"usken
|
Notions for RSA integers
| null | null | null | null |
cs.CR math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The key-generation algorithm for the RSA cryptosystem is specified in several
standards, such as PKCS#1, IEEE 1363-2000, FIPS 186-3, ANSI X9.44, or ISO/IEC
18033-2. All of them substantially differ in their requirements. This indicates
that for computing a "secure" RSA modulus it does not matter how exactly one
generates RSA integers. In this work we show that this is indeed the case to a
large extend: First, we give a theoretical framework that will enable us to
easily compute the entropy of the output distribution of the considered
standards and show that it is comparatively high. To do so, we compute for each
standard the number of integers they define (up to an error of very small
order) and discuss different methods of generating integers of a specific form.
Second, we show that factoring such integers is hard, provided factoring a
product of two primes of similar size is hard.
|
[
{
"version": "v1",
"created": "Thu, 21 Apr 2011 20:44:19 GMT"
},
{
"version": "v2",
"created": "Wed, 11 May 2011 14:46:20 GMT"
},
{
"version": "v3",
"created": "Mon, 1 Oct 2012 11:27:49 GMT"
}
] | 2012-10-02T00:00:00 |
[
[
"Loebenberger",
"Daniel",
""
],
[
"Nüsken",
"Michael",
""
]
] |
new_dataset
| 0.996715 |
1202.0168
|
Wei Yang
|
Wei Yang and Giuseppe Durisi and Erwin Riegler
|
On the Capacity of Large-MIMO Block-Fading Channels
|
To appear in IEEE Journal on Selected Areas in Communication
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We characterize the capacity of Rayleigh block-fading multiple-input
multiple-output (MIMO) channels in the noncoherent setting where transmitter
and receiver have no a priori knowledge of the realizations of the fading
channel. We prove that unitary space-time modulation (USTM) is not
capacity-achieving in the high signal-to-noise ratio (SNR) regime when the
total number of antennas exceeds the coherence time of the fading channel
(expressed in multiples of the symbol duration), a situation that is relevant
for MIMO systems with large antenna arrays (large-MIMO systems). This result
settles a conjecture by Zheng & Tse (2002) in the affirmative. The
capacity-achieving input signal, which we refer to as Beta-variate space-time
modulation (BSTM), turns out to be the product of a unitary isotropically
distributed random matrix, and a diagonal matrix whose nonzero entries are
distributed as the square-root of the eigenvalues of a Beta-distributed random
matrix of appropriate size. Numerical results illustrate that using BSTM
instead of USTM in large-MIMO systems yields a rate gain as large as 13% for
SNR values of practical interest.
|
[
{
"version": "v1",
"created": "Wed, 1 Feb 2012 13:26:08 GMT"
},
{
"version": "v2",
"created": "Wed, 13 Jun 2012 11:06:22 GMT"
},
{
"version": "v3",
"created": "Sun, 30 Sep 2012 15:21:27 GMT"
}
] | 2012-10-02T00:00:00 |
[
[
"Yang",
"Wei",
""
],
[
"Durisi",
"Giuseppe",
""
],
[
"Riegler",
"Erwin",
""
]
] |
new_dataset
| 0.996133 |
1210.0511
|
Tayeb Lemlouma
|
Tayeb Lemlouma, Julien Luciana, Bastien Oza, Leandro Sierra and
Mika\"el Sala\"un
|
An Easy Cellular Gateway for Providing Shared Services and Data
|
6 pages; The Fifth International Conference on Systems and Networks
Communications, ICSNC 2010
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a new framework that links the two worlds of wired
and cellular users sharing systems. The approach is to propose an easy gateway
that enables the use of cellular networks based services by wireline users and
applications. The idea is to use a mobile terminal or wireless equipment for
sharing cellular services, available thanks to its cellular network, to other
users that use the wireline Internet. The software application acts as a
gateway between the cellular and the wired network; it is responsible for
supporting the services provided by the wireless network and make them
accessible and usable, in a standard and easy way, by anyone on the wireline
network. The gateway software can be integrated easily on any complex
architecture since it can interact with any cellular modem. The paper describes
an implementation prototype where some examples of services, such as the
ability of using messaging services and calls streaming, are experimented. The
proposed platform combines different standards to guarantee the use of our
gateway in heterogeneous environments.
|
[
{
"version": "v1",
"created": "Mon, 1 Oct 2012 19:16:15 GMT"
}
] | 2012-10-02T00:00:00 |
[
[
"Lemlouma",
"Tayeb",
""
],
[
"Luciana",
"Julien",
""
],
[
"Oza",
"Bastien",
""
],
[
"Sierra",
"Leandro",
""
],
[
"Salaün",
"Mikaël",
""
]
] |
new_dataset
| 0.997511 |
1207.3586
|
Gregory Gutin
|
Robert Crowston, Gregory Gutin, Mark Jones
|
Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik
Bound
| null | null | null | null |
cs.DS cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An oriented graph is a directed graph without directed 2-cycles. Poljak and
Turz\'{i}k (1986) proved that every connected oriented graph $G$ on $n$
vertices and $m$ arcs contains an acyclic subgraph with at least
$\frac{m}{2}+\frac{n-1}{4}$ arcs. Raman and Saurabh (2006) gave another proof
of this result and left it as an open question to establish the parameterized
complexity of the following problem: does $G$ have an acyclic subgraph with
least $\frac{m}{2}+\frac{n-1}{4}+k$ arcs, where $k$ is the parameter? We answer
this question by showing that the problem can be solved by an algorithm of
runtime $(12k)!n^{O(1)}$. Thus, the problem is fixed-parameter tractable. We
also prove that there is a polynomial time algorithm that either establishes
that the input instance of the problem is a Yes-instance or reduces the input
instance to an equivalent one of size $O(k^2)$.
|
[
{
"version": "v1",
"created": "Mon, 16 Jul 2012 06:36:56 GMT"
},
{
"version": "v2",
"created": "Fri, 28 Sep 2012 13:10:18 GMT"
}
] | 2012-10-01T00:00:00 |
[
[
"Crowston",
"Robert",
""
],
[
"Gutin",
"Gregory",
""
],
[
"Jones",
"Mark",
""
]
] |
new_dataset
| 0.952323 |
1209.6578
|
Ender Y\"uksel
|
Bo Friis Nielsen and Flemming Nielson and Henrik Pilegaard and Michael
James Andrew Smith and Ender Y\"uksel and Kebin Zeng and Lijun Zhang
|
Roadmap Document on Stochastic Analysis
|
This work has been supported by MT-LAB, a VKR Centre of Excellence
for the Modelling of Information Technology
| null | null | null |
cs.LO cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This document was prepared as part of the MT-LAB research centre. The
research centre studies the Modelling of Information Technology and is a VKR
Centre of Excellence funded for five years by the VILLUM Foundation. You can
read more about MT-LAB at its webpage www.MT-LAB.dk.
The goal of the document is to serve as an introduction to new PhD students
addressing the research goals of MT-LAB. As such it aims to provide an overview
of a number of selected approaches to the modelling of stochastic systems. It
should be readable not only by computers scientists with a background in formal
methods but also by PhD students in stochastics that are interested in
understanding the computer science approach to stochastic model checking.
We have no intention of being encyclopedic in our treatment of the approaches
or the literature. Rather we have made the selection of material based on the
competences of the groups involved in or closely affiliated to MT-LAB, so as to
ease the task of the PhD students in navigating an otherwise vast amount of
literature.
We have decided to publish the document in case other young researchers may
find it helpful. The list of authors reflect those that have at times played a
significant role in the production of the document.
|
[
{
"version": "v1",
"created": "Thu, 27 Sep 2012 12:38:56 GMT"
}
] | 2012-10-01T00:00:00 |
[
[
"Nielsen",
"Bo Friis",
""
],
[
"Nielson",
"Flemming",
""
],
[
"Pilegaard",
"Henrik",
""
],
[
"Smith",
"Michael James Andrew",
""
],
[
"Yüksel",
"Ender",
""
],
[
"Zeng",
"Kebin",
""
],
[
"Zhang",
"Lijun",
""
]
] |
new_dataset
| 0.97112 |
1209.6140
|
Veronique Cherfaoui
|
Paul George (HEUDIASYC), Indira Thouvenin (HEUDIASYC), Vincent Fremont
(HEUDIASYC), V\'eronique Cherfaoui (HEUDIASYC)
|
DAARIA: Driver Assistance by Augmented Reality for Intelligent
Automobile
| null |
2012 IEEE Intelligent Vehicles Symposium, Spain (2012)
| null | null |
cs.HC cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Taking into account the drivers' state is a major challenge for designing new
advanced driver assistance systems. In this paper we present a driver
assistance system strongly coupled to the user. DAARIA 1 stands for Driver
Assistance by Augmented Reality for Intelligent Automobile. It is an augmented
reality interface powered by several sensors. The detection has two goals: one
is the position of obstacles and the quantification of the danger represented
by them. The other is the driver's behavior. A suitable visualization metaphor
allows the driver to perceive at any time the location of the relevant hazards
while keeping his eyes on the road. First results show that our method could be
applied to a vehicle but also to aerospace, fluvial or maritime navigation.
|
[
{
"version": "v1",
"created": "Thu, 27 Sep 2012 07:15:22 GMT"
}
] | 2012-09-28T00:00:00 |
[
[
"George",
"Paul",
"",
"HEUDIASYC"
],
[
"Thouvenin",
"Indira",
"",
"HEUDIASYC"
],
[
"Fremont",
"Vincent",
"",
"HEUDIASYC"
],
[
"Cherfaoui",
"Véronique",
"",
"HEUDIASYC"
]
] |
new_dataset
| 0.99974 |
1209.6228
|
Maryam Tanha
|
Maryam Tanha, Fazirulhisyam Hashima, S. Shamalab, Khairulmizam
Samsudin
|
Highly Available Smart Grid Control Centers through Intrusion Tolerance
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Societies' norms of operation relies on the proper and secure functioning of
several critical infrastructures, particularly modern power grid which is also
known as smart grid. Smart grid is interwoven with the information and
communication technology infrastructure, and thus it is exposed to cyber
security threats. Intrusion tolerance proves a promising security approach
against malicious attacks and contributes to enhance the resilience and
security of the key components of smart grid, mainly SCADA and control centers.
Hence, an intrusion tolerant system architecture for smart grid control centers
is proposed in this paper. The proposed architecture consists of several
modules namely, replication & diversity, compromised/faulty replica detector,
reconfiuration, auditing and proxy. Some of distinctive features of the
proposed ITS are diversity as well as the combined and fine-grained
rejuvenation approach. The security of the proposed architecture is evaluated
with regard to availability and mean time to security failure as performance
measures. The analysis is conducted using a Discrete Time Semi Markov Model and
the acquired results show improvements compared to two established intrusion
tolerant architectures. The viability of SLA as another performance metric is
also investigated.
|
[
{
"version": "v1",
"created": "Wed, 26 Sep 2012 16:12:39 GMT"
}
] | 2012-09-28T00:00:00 |
[
[
"Tanha",
"Maryam",
""
],
[
"Hashima",
"Fazirulhisyam",
""
],
[
"Shamalab",
"S.",
""
],
[
"Samsudin",
"Khairulmizam",
""
]
] |
new_dataset
| 0.9921 |
1209.6262
|
Tapalina Bhattasali
|
Tapalina Bhattasali
|
SEGNET: Secure Geo-Sensor Network Model
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless Geo-Sensor Networks (GEONET) are suitable for critical applications
in hostile environments due to its flexibility in deployment. But low power
geo-sensor nodes are easily compromised by security threats like battery
exhaustion attack which may give rise to unavoidable circumstances. In this
type of attack, intruder forcefully resists legitimate sensor nodes from going
into low-power sleep state. So that compromised sensor node's battery power is
drained out and it stops working. Due to the limited capability of sensor
nodes, it is very difficult to prevent a sensor node from this type of attack
which apparently appears as innocent interaction. In this paper, a framework of
secure GEONET model (SEGNET) is proposed, based on dynamic load distribution
mechanism for heterogeneous environment. It considers hybrid detection approach
using three modules for anomaly detection, intrusion confirmation and decision
making to reduce the probability of false detection, compared to other existing
approaches.
|
[
{
"version": "v1",
"created": "Thu, 27 Sep 2012 15:53:16 GMT"
}
] | 2012-09-28T00:00:00 |
[
[
"Bhattasali",
"Tapalina",
""
]
] |
new_dataset
| 0.99964 |
1209.5907
|
Long Shi
|
Long Shi, Wei Zhang, Xiang-Gen Xia
|
On Designs of Full Diversity Space-Time Block Codes for Two-User MIMO
Interference Channels
|
Accepted by IEEE Transactions on Wireless Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a design criterion for space-time block codes (STBC) is
proposed for two-user MIMO interference channels when a group zero-forcing (ZF)
algorithm is applied at each receiver to eliminate the inter-user interference.
Based on the design criterion, a design of STBC for two-user interference
channels is proposed that can achieve full diversity for each user with the
group ZF receiver. The code rate approaches one when the time delay in the
encoding (or code block size) gets large. Performance results demonstrate that
the full diversity can be guaranteed by our proposed STBC with the group ZF
receiver.
|
[
{
"version": "v1",
"created": "Wed, 26 Sep 2012 11:51:43 GMT"
}
] | 2012-09-27T00:00:00 |
[
[
"Shi",
"Long",
""
],
[
"Zhang",
"Wei",
""
],
[
"Xia",
"Xiang-Gen",
""
]
] |
new_dataset
| 0.998953 |
1209.5982
|
Robert Templeman
|
Robert Templeman, Zahid Rahman, David Crandall, Apu Kapadia
|
PlaceRaider: Virtual Theft in Physical Spaces with Smartphones
| null | null | null | null |
cs.CR cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As smartphones become more pervasive, they are increasingly targeted by
malware. At the same time, each new generation of smartphone features
increasingly powerful onboard sensor suites. A new strain of sensor malware has
been developing that leverages these sensors to steal information from the
physical environment (e.g., researchers have recently demonstrated how malware
can listen for spoken credit card numbers through the microphone, or feel
keystroke vibrations using the accelerometer). Yet the possibilities of what
malware can see through a camera have been understudied. This paper introduces
a novel visual malware called PlaceRaider, which allows remote attackers to
engage in remote reconnaissance and what we call virtual theft. Through
completely opportunistic use of the camera on the phone and other sensors,
PlaceRaider constructs rich, three dimensional models of indoor environments.
Remote burglars can thus download the physical space, study the environment
carefully, and steal virtual objects from the environment (such as financial
documents, information on computer monitors, and personally identifiable
information). Through two human subject studies we demonstrate the
effectiveness of using mobile devices as powerful surveillance and virtual
theft platforms, and we suggest several possible defenses against visual
malware.
|
[
{
"version": "v1",
"created": "Wed, 26 Sep 2012 15:56:07 GMT"
}
] | 2012-09-27T00:00:00 |
[
[
"Templeman",
"Robert",
""
],
[
"Rahman",
"Zahid",
""
],
[
"Crandall",
"David",
""
],
[
"Kapadia",
"Apu",
""
]
] |
new_dataset
| 0.998732 |
1208.5991
|
Nishant Doshi mr.
|
Nishant Doshi, Devesh Jinwala
|
Constant Ciphertext Length in CP-ABE
|
12 pages; NWC, 2011
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ciphertext policy attribute based encryption (CP-ABE) is a technique in which
user with secret key containing attributes, only able to decrypt the message if
the attributes in the policy match with the attributes in secret key. The
existing methods that use reasonably computable decryption policies produce the
ciphertext of size at least linearly varying with the number of attributes with
additional pairing operations during encryption and decryption. In this paper,
we propose a scheme in which ciphertext remains constant in length,
irrespective of the number of attributes. Our scheme works for a threshold
case: the number of attributes in a policy must be a subset of attributes in a
secret key. The security of propose scheme is based on Decisional Bilinear
Diffie-Hellman (DBDH) problem.
|
[
{
"version": "v1",
"created": "Wed, 29 Aug 2012 19:01:19 GMT"
},
{
"version": "v2",
"created": "Tue, 25 Sep 2012 11:10:55 GMT"
}
] | 2012-09-26T00:00:00 |
[
[
"Doshi",
"Nishant",
""
],
[
"Jinwala",
"Devesh",
""
]
] |
new_dataset
| 0.999628 |
1209.4896
|
Harsh Alkutkar Mr.
|
Harsh Alkutkar, Ajinkya Abhyankar, Rushikesh Gawali, Saurabh Gandhele
|
Using Microsoft PowerPoint Presentations To Create HTML5 Based
E-learning Courses
|
Paper has been withdrawn due to inconsistencies in images
| null | null | null |
cs.CY
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This paper introduces how to use Microsoft PowerPoint presentation files to
generate HTML5 based interactive e-learning courses packaged in SCORM format.
|
[
{
"version": "v1",
"created": "Wed, 19 Sep 2012 05:26:57 GMT"
},
{
"version": "v2",
"created": "Tue, 25 Sep 2012 06:01:45 GMT"
}
] | 2012-09-26T00:00:00 |
[
[
"Alkutkar",
"Harsh",
""
],
[
"Abhyankar",
"Ajinkya",
""
],
[
"Gawali",
"Rushikesh",
""
],
[
"Gandhele",
"Saurabh",
""
]
] |
new_dataset
| 0.986452 |
1209.5388
|
Mohammad Rahman
|
Atsuko Miyaji and Mohammad Shahriar Rahman
|
KIMAP: Key-Insulated Mutual Authentication Protocol for RFID
|
23 pages. arXiv admin note: substantial text overlap with
arXiv:1209.5066, arXiv:1209.5076
|
International Journal of Automated Identification Technology
(IJAIT), Vol 3, No 2, pp. 61-74, 2011
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
RFID tags are heavily constrained in computational and storage capabilities,
and raise numerous privacy concerns in everyday life due to their vulnerability
to different attacks. Both forward security and backward security are required
to maintain the privacy of a tag i.e., exposure of a tag's secret key should
not reveal the past or future secret keys of the tag. We envisage the need for
a formal model for backward security for RFID protocol designs in shared key
settings, since the RFID tags are too resource-constrained to support public
key settings. However, there has not been much research on backward security
for shared key environment since Serge Vaudenay in his Asiacrypt 2007 paper
showed that perfect backward security is impossible to achieve without public
key settings. We propose a Key-Insulated Mutual Authentication Protocol for
shared key environment, KIMAP, which minimizes the damage caused by secret key
exposure using insulated keys. Even if a tag's secret key is exposed during an
authentication session, forward security and `restricted' backward security of
the tag are preserved under our assumptions. The notion of `restricted'
backward security is that the adversary misses the protocol transcripts which
are needed to update the compromised secret key. Although our definition does
not capture perfect backward security, it is still suitable for effective
implementation as the tags are highly mobile in practice. We also provide a
formal security model of KIMAP. Our scheme is more efficient than previous
proposals from the viewpoint of computational requirements.
|
[
{
"version": "v1",
"created": "Sun, 23 Sep 2012 15:07:04 GMT"
}
] | 2012-09-26T00:00:00 |
[
[
"Miyaji",
"Atsuko",
""
],
[
"Rahman",
"Mohammad Shahriar",
""
]
] |
new_dataset
| 0.999054 |
1209.5435
|
Muhanad Hayder Mohammed
|
Muhanad Hayder Mohammed
|
Secure electronic lock using pic 16f628a microcontroller
| null |
International Journal of Research in Computer Science IJORCS,
September 21, 2012
|
10.7815/ijorcs.25.2012.047
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The proposed system implements the electronic embedded lock, its provides a
great benefit over traditional lock, which use the manual key, so if the key
lost or theft then anybody could open the lock, while thieving or losing the
long and complex password is harder compare to traditional key, furthermore
combining both manual key with computerized password make the system more
secure. Long password will reduce the possibilities of breaking the code and
opening the lock. The system comprised keypad, and HD44780 20x2 LCD Along with
PIC16f628a microcontroller. The firmware control these components such that
interaction with keypad is very is ver easy and smoothly, the LCD provide user
with messages and notification to be informed about what is the system state.
User can performing opening and closing the lock, changing the current password
in the microcontroller EEPROM and clearing single digit while entering the
password when wrong digit entered (back space). The proposed system firmware
developed using assembly language with MPLAB development environment. It tested
and implemented in real hardware with proper functioning and bug free.
|
[
{
"version": "v1",
"created": "Mon, 24 Sep 2012 21:37:14 GMT"
}
] | 2012-09-26T00:00:00 |
[
[
"Mohammed",
"Muhanad Hayder",
""
]
] |
new_dataset
| 0.983455 |
1209.5464
|
Javad Ghaderi
|
Javad Ghaderi, Tianxiong Ji, R. Srikant
|
Flow-Level Stability of Wireless Networks: Separation of Congestion
Control and Packet Scheduling
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is by now well-known that wireless networks with file arrivals and
departures are stable if one uses alpha-fair congestion control and
back-pressure based scheduling and routing. In this paper, we examine whether
?alpha-fair congestion control is necessary for flow-level stability. We show
that stability can be ensured even with very simple congestion control
mechanisms, such as a fixed window size scheme which limits the maximum number
of packets that are allowed into the ingress queue of a flow. A key ingredient
of our result is the use of the difference between the logarithms of queue
lengths as the link weights. This result is reminiscent of results in the
context of CSMA algorithms, but for entirely different reasons.
|
[
{
"version": "v1",
"created": "Tue, 25 Sep 2012 00:51:44 GMT"
}
] | 2012-09-26T00:00:00 |
[
[
"Ghaderi",
"Javad",
""
],
[
"Ji",
"Tianxiong",
""
],
[
"Srikant",
"R.",
""
]
] |
new_dataset
| 0.994781 |
1209.5626
|
Robert Smith
|
Robert Smith
|
A Tutorial for Creating and Publishing Open Source Lisp Software
|
Accepted for the International Lisp Conference 2012
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The proliferation and accessability of the Internet have made it simple to
view, download, and publish source code. This paper gives a short tutorial on
how to create a new Common Lisp project and publish it.
|
[
{
"version": "v1",
"created": "Tue, 25 Sep 2012 14:41:47 GMT"
}
] | 2012-09-26T00:00:00 |
[
[
"Smith",
"Robert",
""
]
] |
new_dataset
| 0.981886 |
1209.5715
|
Abhigyan Sharma
|
Abhigyan Sharma, Arun Venkataramani, Ramesh Sitaraman
|
Distributing Content Simplifies ISP Traffic Engineering
|
12 pages, 13 Figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Several major Internet service providers (e.g., Level-3, AT&T, Verizon) today
also offer content distribution services. The emergence of such "Network-CDNs"
(NCDNs) are driven by market forces that place more value on content services
than just carrying the bits. NCDNs are also necessitated by the need to reduce
the cost of carrying ever-increasing volumes of traffic across their backbones.
An NCDN has the flexibility to determine both where content is placed and how
traffic is routed within the network. However NCDNs today continue to treat
traffic engineering independently from content placement and request
redirection decisions. In this paper, we investigate the interplay between
content distribution strategies and traffic engineering and ask how an NCDN
should engineer traffic in a content-aware manner. Our experimental analysis,
based on traces from a large content distribution network and real ISP
topologies, shows that effective content placement can significantly simplify
traffic engineering and in most cases obviate the need to engineer NCDN traffic
all together! Further, we show that simple demand-oblivious schemes for routing
and placement such as InverseCap and LRU suffice as they achieve network costs
that are close to the best possible.
|
[
{
"version": "v1",
"created": "Tue, 25 Sep 2012 18:41:15 GMT"
}
] | 2012-09-26T00:00:00 |
[
[
"Sharma",
"Abhigyan",
""
],
[
"Venkataramani",
"Arun",
""
],
[
"Sitaraman",
"Ramesh",
""
]
] |
new_dataset
| 0.973627 |
1106.0151
|
Mofreh Zaghloul
|
Mofreh R. Zaghloul and Ahmed N. Ali
|
Algorithm 916: computing the Faddeyeva and Voigt functions
|
27 pages, 5 tables, 9 figurs
|
ACM Transactions on Mathematical Software, Vol 38, No. 2, Article
15(2011),22 pages
| null | null |
cs.NA math-ph math.MP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a MATLAB function for the numerical evaluation of the Faddeyeva
function w(z). The function is based on a newly developed accurate algorithm.
In addition to its higher accuracy, the software provides a flexible accuracy
vs efficiency trade-off through a controlling parameter that may be used to
reduce accuracy and computational time and vice versa. Verification of the
flexibility, reliability and superior accuracy of the algorithm is provided
through comparison with standard algorithms available in other libraries and
software packages.
|
[
{
"version": "v1",
"created": "Wed, 1 Jun 2011 12:01:12 GMT"
},
{
"version": "v2",
"created": "Sun, 23 Sep 2012 08:07:56 GMT"
}
] | 2012-09-25T00:00:00 |
[
[
"Zaghloul",
"Mofreh R.",
""
],
[
"Ali",
"Ahmed N.",
""
]
] |
new_dataset
| 0.956391 |
1205.1212
|
Abdoul Aziz Ciss
|
Abdoul Aziz Ciss and Ahmed Youssef Ould Cheikh and Djiby Sow
|
A Factoring and Discrete Logarithm based Cryptosystem
|
Something was not correct in the paper
| null | null | null |
cs.CR math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a new public key cryptosystem based on two hard
problems : the cube root extraction modulo a composite moduli (which is
equivalent to the factorisation of the moduli) and the discrete logarithm
problem. These two hard problems are combined during the key generation,
encryption and decryption phases. By combining the IFP and the DLP we introduce
a secure and efficient public key cryptosystem. To break the scheme, an
adversary may solve the IFP and the DLP separately which is computationally
infeasible. The key generation is a simple operation based on the discrete
logarithm modulo a composite moduli. The encryption phase is based both on the
cube root computation and the DLP. These operations are computationally
efficient.
|
[
{
"version": "v1",
"created": "Sun, 6 May 2012 12:27:15 GMT"
},
{
"version": "v2",
"created": "Sun, 23 Sep 2012 22:47:15 GMT"
}
] | 2012-09-25T00:00:00 |
[
[
"Ciss",
"Abdoul Aziz",
""
],
[
"Cheikh",
"Ahmed Youssef Ould",
""
],
[
"Sow",
"Djiby",
""
]
] |
new_dataset
| 0.998725 |
1209.0286
|
Nilanjan Sen
|
Nilanjan Sen and Indrajit Banerjee
|
CAWS - Security Algorithms for Wireless Sensor Networks: A Cellular
Automata Based Approach
|
Proceedings of "All India Seminar on Role of ICT in Improving Quality
of Life" on March 26-27, 2010 organized by The Institution of Engineers
(India) and Bengal Engineering and Science University, Shibpur
|
Proceedings of "All India Seminar on Role of ICT in Improving
Quality of Life", Dated on March 26-27, 2010; pp: 81-88
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Security in the Wireless Sensor Networks (WSN) is a very challenging task
because of their dissimilarities with the conventional wireless networks. The
related works so far have been done have tried to solve the problem keeping in
the mind the constraints of WSNs. In this paper we have proposed a set of
cellular automata based security algorithms (CAWS) which consists of CAKD, a
Cellular Automata (CA) based key management algorithm and CASC, a CA based
secure data communication algorithm, which require very small amount of memory
as well as simple computation.
|
[
{
"version": "v1",
"created": "Mon, 3 Sep 2012 09:55:29 GMT"
}
] | 2012-09-25T00:00:00 |
[
[
"Sen",
"Nilanjan",
""
],
[
"Banerjee",
"Indrajit",
""
]
] |
new_dataset
| 0.999414 |
1209.4975
|
Yanfang Liu
|
Yanfang Liu and William Zhu
|
Parametric matroid of rough set
|
15 pages
| null | null | null |
cs.AI cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Rough set is mainly concerned with the approximations of objects through an
equivalence relation on a universe. Matroid is a combinatorial generalization
of linear independence in vector spaces. In this paper, we define a parametric
set family, with any subset of a universe as its parameter, to connect rough
sets and matroids. On the one hand, for a universe and an equivalence relation
on the universe, a parametric set family is defined through the lower
approximation operator. This parametric set family is proved to satisfy the
independent set axiom of matroids, therefore it can generate a matroid, called
a parametric matroid of the rough set. Three equivalent representations of the
parametric set family are obtained. Moreover, the parametric matroid of the
rough set is proved to be the direct sum of a partition-circuit matroid and a
free matroid. On the other hand, since partition-circuit matroids were well
studied through the lower approximation number, we use it to investigate the
parametric matroid of the rough set. Several characteristics of the parametric
matroid of the rough set, such as independent sets, bases, circuits, the rank
function and the closure operator, are expressed by the lower approximation
number.
|
[
{
"version": "v1",
"created": "Sat, 22 Sep 2012 09:19:54 GMT"
}
] | 2012-09-25T00:00:00 |
[
[
"Liu",
"Yanfang",
""
],
[
"Zhu",
"William",
""
]
] |
new_dataset
| 0.987209 |
1209.5066
|
Mohammad Rahman
|
Atsuko Miyaji and Mohammad Shahriar Rahman
|
APRAP: Another Privacy Preserving RFID Authentication Protocol
|
6 pages, 1 figure, The 6th workshop on Secure Network Protocols
(NPSec 2010), IEEE
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Privacy preserving RFID (Radio Frequency Identification) authentication has
been an active research area in recent years. Both forward security and
backward security are required to maintain the privacy of a tag, i.e., exposure
of a tag's secret key should not reveal the past or future secret keys of the
tag. We envisage the need for a formal model for backward security for RFID
protocol designs in shared key settings, since the RFID tags are too
resource-constrained to support public key settings. However, there has not
been much research on backward security for shared key environment since Serge
Vaudenay in his Asiacrypt 2007 paper showed that perfect backward security is
impossible to achieve without public key settings. We propose a Privacy
Preserving RFID Authentication Protocol for shared key environment, APRAP,
which minimizes the damage caused by secret key exposure using insulated keys.
Even if a tag's secret key is exposed during an authentication session, forward
security and 'restricted' backward security of the tag are preserved under our
assumptions. The notion of 'restricted' backward security is that the adversary
misses the protocol transcripts which are needed to update the compromised
secret key. Although our definition does not capture perfect backward security,
it is still suitable for effective implementation as the tags are highly mobile
in practice. We also provide a formal security model of APRAP. Our scheme is
more efficient than previous proposals from the viewpoint of computational
requirements.
|
[
{
"version": "v1",
"created": "Sun, 23 Sep 2012 13:52:30 GMT"
}
] | 2012-09-25T00:00:00 |
[
[
"Miyaji",
"Atsuko",
""
],
[
"Rahman",
"Mohammad Shahriar",
""
]
] |
new_dataset
| 0.995915 |
1209.5145
|
Viral Shah
|
Jeff Bezanson, Stefan Karpinski, Viral B. Shah, Alan Edelman
|
Julia: A Fast Dynamic Language for Technical Computing
| null | null | null | null |
cs.PL cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dynamic languages have become popular for scientific computing. They are
generally considered highly productive, but lacking in performance. This paper
presents Julia, a new dynamic language for technical computing, designed for
performance from the beginning by adapting and extending modern programming
language techniques. A design based on generic functions and a rich type system
simultaneously enables an expressive programming model and successful type
inference, leading to good performance for a wide range of programs. This makes
it possible for much of the Julia library to be written in Julia itself, while
also incorporating best-of-breed C and Fortran libraries.
|
[
{
"version": "v1",
"created": "Mon, 24 Sep 2012 03:55:45 GMT"
}
] | 2012-09-25T00:00:00 |
[
[
"Bezanson",
"Jeff",
""
],
[
"Karpinski",
"Stefan",
""
],
[
"Shah",
"Viral B.",
""
],
[
"Edelman",
"Alan",
""
]
] |
new_dataset
| 0.999545 |
1209.5307
|
Sarah Allen
|
Sarah R. Allen and John Iacono
|
Packing identical simple polygons is NP-hard
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a small polygon S, a big simple polygon B and a positive integer k, it
is shown to be NP-hard to determine whether k copies of the small polygon
(allowing translation and rotation) can be placed in the big polygon without
overlap. Previous NP-hardness results were only known in the case where the big
polygon is allowed to be non-simple. A novel reduction from Planar-Circuit-SAT
is presented where a small polygon is constructed to encode the entire circuit.
|
[
{
"version": "v1",
"created": "Mon, 24 Sep 2012 15:43:11 GMT"
}
] | 2012-09-25T00:00:00 |
[
[
"Allen",
"Sarah R.",
""
],
[
"Iacono",
"John",
""
]
] |
new_dataset
| 0.998277 |
1209.4635
|
Sachin Lakra
|
Sachin Lakra, Deepak Kumar Sharma
|
DolNet: A Division Of Labour Based Distributed Object Oriented Software
Process Model
|
9 pages, 3 figures. arXiv admin note: substantial text overlap with
arXiv:1209.4453
|
Published in proceedings of the First International Conference on
Data Management 2008, Ghaziabad, Uttar Pradesh, India, Feb 2008, pp.1284-1290
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed Software Development today is in its childhood and not too
widespread as a method of developing software in the global IT Industry. In
this context, Petrinets are a mathematical model for describing distributed
systems theoretically, whereas AttNets are one of their offshoots. But
development of true distributed software is limited to network operating
systems majorly. Software that runs on many machines with separate programs for
each machine, are very few. This paper introduces and defines Distributed
Object Oriented Software Engineering DOOSE as a new field in software
engineering. The paper further gives a Distributed Object Oriented Software
Process Model DOOSPM, called the DolNet, which describes how work may be done
by a software development organization while working on Distributed Object
Oriented DOO Projects.
|
[
{
"version": "v1",
"created": "Thu, 20 Sep 2012 14:39:45 GMT"
}
] | 2012-09-24T00:00:00 |
[
[
"Lakra",
"Sachin",
""
],
[
"Sharma",
"Deepak Kumar",
""
]
] |
new_dataset
| 0.987652 |
1209.4687
|
Lei Zhang
|
Lei Zhang, Hui Li, and Dongning Guo
|
Capacity of Gaussian Channels with Duty Cycle and Power Constraints
|
36 pages, 6 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In many wireless communication systems, radios are subject to a duty cycle
constraint, that is, a radio only actively transmits signals over a fraction of
the time. For example, it is desirable to have a small duty cycle in some low
power systems; a half-duplex radio cannot keep transmitting if it wishes to
receive useful signals; and a cognitive radio needs to listen and detect
primary users frequently. This work studies the capacity of scalar
discrete-time Gaussian channels subject to duty cycle constraint as well as
average transmit power constraint. An idealized duty cycle constraint is first
studied, which can be regarded as a requirement on the minimum fraction of
nontransmissions or zero symbols in each codeword. A unique discrete input
distribution is shown to achieve the channel capacity. In many situations,
numerically optimized on-off signaling can achieve much higher rate than
Gaussian signaling over a deterministic transmission schedule. This is in part
because the positions of nontransmissions in a codeword can convey information.
Furthermore, a more realistic duty cycle constraint is studied, where the extra
cost of transitions between transmissions and nontransmissions due to pulse
shaping is accounted for. The capacity-achieving input is no longer independent
over time and is hard to compute. A lower bound of the achievable rate as a
function of the input distribution is shown to be maximized by a first-order
Markov input process, the distribution of which is also discrete and can be
computed efficiently. The results in this paper suggest that, under various
duty cycle constraints, departing from the usual paradigm of intermittent
packet transmissions may yield substantial gain.
|
[
{
"version": "v1",
"created": "Fri, 21 Sep 2012 01:51:54 GMT"
}
] | 2012-09-24T00:00:00 |
[
[
"Zhang",
"Lei",
""
],
[
"Li",
"Hui",
""
],
[
"Guo",
"Dongning",
""
]
] |
new_dataset
| 0.994381 |
1209.4383
|
Kumar Viswanatha
|
Kumar Viswanatha and Emrah Akyol and Kenneth Rose
|
Minimum Communication Cost for Joint Distributed Source Coding and
Dispersive Information Routing
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers the problem of minimum cost communication of correlated
sources over a network with multiple sinks, which consists of distributed
source coding followed by routing. We introduce a new routing paradigm called
dispersive information routing, wherein the intermediate nodes are allowed to
`split' a packet and forward subsets of the received bits on each of the
forward paths. This paradigm opens up a rich class of research problems which
focus on the interplay between encoding and routing in a network. Unlike
conventional routing methods such as in [1], dispersive information routing
ensures that each sink receives just the information needed to reconstruct the
sources it is required to reproduce. We demonstrate using simple examples that
our approach offers better asymptotic performance than conventional routing
techniques. This paradigm leads to a new information theoretic setup, which has
not been studied earlier. We propose a new coding scheme, using principles from
multiple descriptions encoding [2] and Han and Kobayashi decoding [3]. We show
that this coding scheme achieves the complete rate region for certain special
cases of the general setup and thereby achieves the minimum communication cost
under this routing paradigm.
|
[
{
"version": "v1",
"created": "Wed, 19 Sep 2012 22:31:29 GMT"
}
] | 2012-09-21T00:00:00 |
[
[
"Viswanatha",
"Kumar",
""
],
[
"Akyol",
"Emrah",
""
],
[
"Rose",
"Kenneth",
""
]
] |
new_dataset
| 0.97017 |
1209.4471
|
Nikola Milo\v{s}evi\'c MSc
|
Nikola Milo\v{s}evi\'c
|
Stemmer for Serbian language
|
16 pages, 8 figures, code included
| null | null | null |
cs.CL cs.IR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In linguistic morphology and information retrieval, stemming is the process
for reducing inflected (or sometimes derived) words to their stem, base or root
form; generally a written word form. In this work is presented suffix stripping
stemmer for Serbian language, one of the highly inflectional languages.
|
[
{
"version": "v1",
"created": "Thu, 20 Sep 2012 09:21:29 GMT"
}
] | 2012-09-21T00:00:00 |
[
[
"Milošević",
"Nikola",
""
]
] |
new_dataset
| 0.999806 |
1209.4554
|
Erez Buchnik
|
Erez M. Buchnik
|
Bouma2 - A Quasi-Stateless, Tunable Multiple String-Match Algorithm
|
33 pages, 3 figures
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Bouma2 algorithm attempts to challenge the prevalent "stateful" exact
string-match paradigms by suggesting a "quasi-stateless" approach. We claim
that using state-machines to solve the multiple exact string-match problem
introduces a hidden artificial constraint, namely the Consume-Order Dependency,
which results in unnecessary overhead. Bouma2 is not restricted in this sense;
we postulate that this allows memory-efficiency and improved performance versus
its state-machine equivalents. The heart of the Bouma2 preprocessing problem is
formulated as a weighted Integer Linear Programming problem, that can be tuned
for memory footprint and performance optimization. Specifically, this allows
Bouma2 to be input-sensitive, as tuning can be based on input characteristics.
Evaluating Bouma2 against the Aho-Corasick variant of the popular Snort
Intrusion Prevention System, we demonstrate double the throughput while using
about 10% of the memory.
|
[
{
"version": "v1",
"created": "Thu, 20 Sep 2012 14:59:48 GMT"
}
] | 2012-09-21T00:00:00 |
[
[
"Buchnik",
"Erez M.",
""
]
] |
new_dataset
| 0.981434 |
1209.4621
|
Krishnama Raju Kanchu
|
Krishnama Raju Kanchu and Subhash Kak
|
Goldbach Circles and Balloons and Their Cross Correlation
|
9 pages, 7 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Goldbach partitions can be used in creation of ellipses and circles on the
number line. We extend this work and determine the count and other properties
of concentric Goldbach circles for different values of n. The autocorrelation
function of this sequence with respect to even and odd values suggests that it
has excellent randomness properties. Cross correlation properties of ellipse
and circle sequences are provided that indicate that these sequences have
minimal dependencies and, therefore, they can be used in spread spectrum and
other cryptographic applications.
|
[
{
"version": "v1",
"created": "Thu, 20 Sep 2012 19:17:00 GMT"
}
] | 2012-09-21T00:00:00 |
[
[
"Kanchu",
"Krishnama Raju",
""
],
[
"Kak",
"Subhash",
""
]
] |
new_dataset
| 0.962139 |
1111.6990
|
Kyle Fox
|
Kyle Fox
|
Shortest Non-trivial Cycles in Directed and Undirected Surface Graphs
|
Accepted to SODA 2013. Updated for reviewer comments, to include new
results for undirected graphs, and to include new title
| null | null | null |
cs.CG cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let G be a graph embedded on a surface of genus g with b boundary cycles. We
describe algorithms to compute multiple types of non-trivial cycles in G, using
different techniques depending on whether or not G is an undirected graph. If G
is undirected, then we give an algorithm to compute a shortest non-separating
cycle in 2^O(g) n log log n time. Similar algorithms are given to compute a
shortest non-contractible or non-null-homologous cycle in 2^O(g+b) n log log n
time. Our algorithms for undirected G combine an algorithm of Kutz with known
techniques for efficiently enumerating homotopy classes of curves that may be
shortest non-trivial cycles.
Our main technical contributions in this work arise from assuming G is a
directed graph with possibly asymmetric edge weights. For this case, we give an
algorithm to compute a shortest non-contractible cycle in G in O((g^3 + g b)n
log n) time. In order to achieve this time bound, we use a restriction of the
infinite cyclic cover that may be useful in other contexts. We also describe an
algorithm to compute a shortest non-null-homologous cycle in G in O((g^2 + g
b)n log n) time, extending a known algorithm of Erickson to compute a shortest
non-separating cycle. In both the undirected and directed cases, our algorithms
improve the best time bounds known for many values of g and b.
|
[
{
"version": "v1",
"created": "Tue, 29 Nov 2011 21:24:21 GMT"
},
{
"version": "v2",
"created": "Tue, 6 Dec 2011 20:42:03 GMT"
},
{
"version": "v3",
"created": "Wed, 19 Sep 2012 15:50:06 GMT"
}
] | 2012-09-20T00:00:00 |
[
[
"Fox",
"Kyle",
""
]
] |
new_dataset
| 0.998804 |
1203.2870
|
Giuseppe Cocco
|
Giuseppe Cocco, Deniz G\"und\"uz and Christian Ibars
|
Streaming Transmitter over Block-Fading Channels with Delay Constraint
|
Submitted to IEEE Transactions on Wireless Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Data streaming transmission over a block fading channel is studied. It is
assumed that the transmitter receives a new message at each channel block at a
constant rate, which is fixed by an underlying application, and tries to
deliver the arriving messages by a common deadline. Various transmission
schemes are proposed and compared with an informed transmitter upper bound in
terms of the average decoded rate. It is shown that in the single receiver case
the adaptive joint encoding (aJE) scheme is asymptotically optimal, in that it
achieves the ergodic capacity as the transmission deadline goes to infinity;
and it closely follows the performance of the informed transmitter upper bound
in the case of finite transmission deadline. On the other hand, in the presence
of multiple receivers with different signal-to-noise ratios (SNR), memoryless
transmission (MT), time sharing (TS) and superposition transmission (ST)
schemes are shown to be more robust than the joint encoding (JE) scheme as they
have gradual performance loss with decreasing SNR.
|
[
{
"version": "v1",
"created": "Tue, 13 Mar 2012 17:24:59 GMT"
},
{
"version": "v2",
"created": "Sat, 17 Mar 2012 10:33:58 GMT"
},
{
"version": "v3",
"created": "Tue, 8 May 2012 11:51:14 GMT"
},
{
"version": "v4",
"created": "Wed, 19 Sep 2012 14:27:04 GMT"
}
] | 2012-09-20T00:00:00 |
[
[
"Cocco",
"Giuseppe",
""
],
[
"Gündüz",
"Deniz",
""
],
[
"Ibars",
"Christian",
""
]
] |
new_dataset
| 0.989894 |
1205.5025
|
Casper Steinmann
|
Casper Steinmann, Mikael W. Ibsen, Anne S. Hansen and Jan H. Jensen
|
FragIt: A Tool to Prepare Input Files for Fragment Based Quantum
Chemical Calculations
|
27 pages, 9 figures
| null |
10.1371/journal.pone.0044480
| null |
cs.CE physics.chem-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Near linear scaling fragment based quantum chemical calculations are becoming
increasingly popular for treating large systems with high accuracy and is an
active field of research. However, it remains difficult to set up these
calculations without expert knowledge. To facilitate the use of such methods,
software tools need to be available to support these methods and help to set up
reasonable input files which will lower the barrier of entry for usage by
non-experts. Previous tools relies on specific annotations in structure files
for automatic and successful fragmentation such as residues in PDB files. We
present a general fragmentation methodology and accompanying tools called
FragIt to help setup these calculations. FragIt uses the SMARTS language to
locate chemically appropriate fragments in large structures and is applicable
to fragmentation of any molecular system given suitable SMARTS patterns. We
present SMARTS patterns of fragmentation for proteins, DNA and polysaccharides,
specifically for D-galactopyranose for use in cyclodextrins. FragIt is used to
prepare input files for the Fragment Molecular Orbital method in the GAMESS
program package, but can be extended to other computational methods easily.
|
[
{
"version": "v1",
"created": "Tue, 22 May 2012 14:39:44 GMT"
},
{
"version": "v2",
"created": "Thu, 2 Aug 2012 12:38:53 GMT"
}
] | 2012-09-20T00:00:00 |
[
[
"Steinmann",
"Casper",
""
],
[
"Ibsen",
"Mikael W.",
""
],
[
"Hansen",
"Anne S.",
""
],
[
"Jensen",
"Jan H.",
""
]
] |
new_dataset
| 0.998024 |
1207.2825
|
Matthew Valenti
|
Don Torrieri and Matthew C. Valenti
|
Guard Zones and the Near-Far Problem in DS-CDMA Ad Hoc Networks
|
to appear at Milcom-2012
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The central issue in direct-sequence code-division multiple-access (DS-CDMA)
ad hoc networks is the prevention of a near-far problem. This paper considers
two types of guard zones that may be used to control the near-far problem: a
fundamental exclusion zone and an additional CSMA guard zone that may be
established by the carrier-sense multiple-access (CSMA) protocol. In the
exclusion zone, no mobiles are physically present, modeling the minimum
physical separation among mobiles that is always present in actual networks.
Potentially interfering mobiles beyond a transmitting mobile's exclusion zone,
but within its CSMA guard zone, are deactivated by the protocol. This paper
provides an analysis of DS-CSMA networks with either or both types of guard
zones. A network of finite extent with a finite number of mobiles is modeled as
a uniform clustering process. The analysis uses a closed-form expression for
the outage probability in the presence of Nakagami fading, conditioned on the
network geometry. By using the analysis developed in this paper, the tradeoffs
between exclusion zones and CSMA guard zones are explored for DS-CDMA and
unspread networks.
|
[
{
"version": "v1",
"created": "Thu, 12 Jul 2012 02:06:57 GMT"
},
{
"version": "v2",
"created": "Mon, 10 Sep 2012 04:49:53 GMT"
},
{
"version": "v3",
"created": "Thu, 13 Sep 2012 04:10:15 GMT"
},
{
"version": "v4",
"created": "Mon, 17 Sep 2012 15:13:49 GMT"
},
{
"version": "v5",
"created": "Wed, 19 Sep 2012 19:26:11 GMT"
}
] | 2012-09-20T00:00:00 |
[
[
"Torrieri",
"Don",
""
],
[
"Valenti",
"Matthew C.",
""
]
] |
new_dataset
| 0.982954 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.