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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1203.1869
|
Min Li
|
Min Li, Osvaldo Simeone, Aylin Yener
|
Degraded Broadcast Diamond Channels with Non-Causal State Information at
the Source
|
Submitted to IEEE Transactions on Information Theory, Feb. 2012
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A state-dependent degraded broadcast diamond channel is studied where the
source-to-relays cut is modeled with two noiseless, finite-capacity digital
links with a degraded broadcasting structure, while the relays-to-destination
cut is a general multiple access channel controlled by a random state. It is
assumed that the source has non-causal channel state information and the relays
have no state information. Under this model, first, the capacity is
characterized for the case where the destination has state information, i.e.,
has access to the state sequence. It is demonstrated that in this case, a joint
message and state transmission scheme via binning is optimal. Next, the case
where the destination does not have state information, i.e., the case with
state information at the source only, is considered. For this scenario, lower
and upper bounds on the capacity are derived for the general discrete
memoryless model. Achievable rates are then computed for the case in which the
relays-to-destination cut is affected by an additive Gaussian state. Numerical
results are provided that illuminate the performance advantages that can be
accrued by leveraging non-causal state information at the source.
|
[
{
"version": "v1",
"created": "Thu, 8 Mar 2012 18:04:19 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Li",
"Min",
""
],
[
"Simeone",
"Osvaldo",
""
],
[
"Yener",
"Aylin",
""
]
] |
new_dataset
| 0.998956 |
1203.4349
|
Hyon Lim
|
Hyon Lim, Hyeonbeom Lee and H. Jin Kim
|
Onboard Flight Control of a Small Quadrotor Using Single Strapdown
Optical Flow Sensor
|
I would like to remove this article due to copyright problem. Please
remove my article as soon as possible
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers onboard control of a small-sized quadrotor using a
strapdown embedded optical flow sensor which is conventionally used for desktop
mice. The vehicle considered in this paper can carry only few dozen grams of
payload, therefore conventional camera-based optical flow methods are not
applicable. We present hovering control of the small-sized quadrotor using a
single-chip optical flow sensor, implemented on an 8-bit microprocessor without
external sensors or communication with a ground control station. Detailed
description of all the system components is provided along with evaluation of
the accuracy. Experimental results from flight tests are validated with the
ground-truth data provided by a high-accuracy reference system.
|
[
{
"version": "v1",
"created": "Tue, 20 Mar 2012 09:16:49 GMT"
},
{
"version": "v2",
"created": "Tue, 27 Mar 2012 05:11:36 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Lim",
"Hyon",
""
],
[
"Lee",
"Hyeonbeom",
""
],
[
"Kim",
"H. Jin",
""
]
] |
new_dataset
| 0.997705 |
1203.5822
|
Cheng Wan
|
Cheng Wan
|
Coalitions in nonatomic network congestion games
|
22 pages, 2 figures
| null | null | null |
cs.GT cs.SI math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work shows that the formation of a finite number of coalitions in a
nonatomic network congestion game benefits everyone. At the equilibrium of the
composite game played by coalitions and individuals, the average cost to each
coalition and the individuals' common cost are all lower than in the
corresponding nonatomic game (without coalitions). The individuals' cost is
lower than the average cost to any coalition. Similarly, the average cost to a
coalition is lower than that to any larger coalition. Whenever some members of
a coalition become individuals, the individuals' payoff is increased. In the
case of a unique coalition, both the average cost to the coalition and the
individuals' cost are decreasing with respect to the size of the coalition. In
a sequence of composite games, if a finite number of coalitions are fixed,
while the size of the remaining coalitions goes to zero, the equilibria of
these games converge to the equilibrium of a composite game played by the same
fixed coalitions and the remaining individuals.
|
[
{
"version": "v1",
"created": "Mon, 26 Mar 2012 21:22:23 GMT"
},
{
"version": "v2",
"created": "Sat, 12 May 2012 10:28:56 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Wan",
"Cheng",
""
]
] |
new_dataset
| 0.987747 |
1203.6027
|
Chiranjib Choudhuri
|
Chiranjib Choudhuri, Young-Han Kim, and Urbashi Mitra
|
Causal State Communication
|
25 pages, 1 figure
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of state communication over a discrete memoryless channel with
discrete memoryless state is studied when the state information is available
strictly causally at the encoder. It is shown that block Markov encoding, in
which the encoder communicates a description of the state sequence in the
previous block by incorporating side information about the state sequence at
the decoder, yields the minimum state estimation error. When the same channel
is used to send additional independent information at the expense of a higher
channel state estimation error, the optimal tradeoff between the rate of the
independent information and the state estimation error is characterized via the
capacity- distortion function. It is shown that any optimal tradeoff pair can
be achieved via rate-splitting. These coding theorems are then extended
optimally to the case of causal channel state information at the encoder using
the Shannon strategy.
|
[
{
"version": "v1",
"created": "Tue, 27 Mar 2012 17:06:40 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Choudhuri",
"Chiranjib",
""
],
[
"Kim",
"Young-Han",
""
],
[
"Mitra",
"Urbashi",
""
]
] |
new_dataset
| 0.986429 |
1204.1672
|
Gabriele Fici
|
Gabriele Fici
|
A Characterization of Bispecial Sturmian Words
|
Accepted to MFCS 2012
|
LNCS 7464, pp. 383-394, 2012
|
10.1007/978-3-642-32589-2_35
| null |
cs.FL cs.CG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A finite Sturmian word w over the alphabet {a,b} is left special (resp. right
special) if aw and bw (resp. wa and wb) are both Sturmian words. A bispecial
Sturmian word is a Sturmian word that is both left and right special. We show
as a main result that bispecial Sturmian words are exactly the maximal internal
factors of Christoffel words, that are words coding the digital approximations
of segments in the Euclidean plane. This result is an extension of the known
relation between central words and primitive Christoffel words. Our
characterization allows us to give an enumerative formula for bispecial
Sturmian words. We also investigate the minimal forbidden words for the set of
Sturmian words.
|
[
{
"version": "v1",
"created": "Sat, 7 Apr 2012 18:56:05 GMT"
},
{
"version": "v2",
"created": "Wed, 11 Apr 2012 20:08:21 GMT"
},
{
"version": "v3",
"created": "Mon, 11 Jun 2012 11:47:23 GMT"
},
{
"version": "v4",
"created": "Mon, 18 Jun 2012 16:25:36 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Fici",
"Gabriele",
""
]
] |
new_dataset
| 0.978879 |
1204.2080
|
Zouheir Rezki Dr.
|
Zouheir Rezk and Mohamed-Slim Alouini
|
Ergodic Capacity of Cognitive Radio under Imperfect Channel State
Information
|
To appear in IEEE TVT. 12 pages, 8 figures, 1 table. Matlab codes to
reproduce results are available upon request. Please contact one of the
authors for this purpose
|
IEEE Transactions on Vehicular Technology, 2012
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A spectrum-sharing communication system where the secondary user is aware of
the instantaneous channel state information (CSI) of the secondary link, but
knows only the statistics and an estimated version of the secondary
transmitter-primary receiver (ST-PR) link, is investigated. The optimum power
profile and the ergodic capacity of the secondary link are derived for general
fading channels (with continuous probability density function) under average
and peak transmit-power constraints and with respect to two different
interference constraints: an interference outage constraint and a
signal-to-interference outage constraint. When applied to Rayleigh fading
channels, our results show, for instance, that the interference constraint is
harmful at high-power regime in the sense that the capacity does not increase
with the power, whereas at low-power regime, it has a marginal impact and
no-interference performance corresponding to the ergodic capacity under average
or peak transmit power constraint in absence of the primary user, may be
achieved.
|
[
{
"version": "v1",
"created": "Tue, 10 Apr 2012 08:38:42 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Rezk",
"Zouheir",
""
],
[
"Alouini",
"Mohamed-Slim",
""
]
] |
new_dataset
| 0.990887 |
1204.3989
|
Chung-Chieh Fang
|
Chung-Chieh Fang
|
Closed-Form Critical Conditions of Saddle-Node Bifurcations for Buck
Converters
|
Submitted to IEEE Transactions on Automatic Control on Jan. 9, 2012.
Seven of my arXiv manuscripts have a common reviewer
|
Nonlinear Dynamics, 70(3), pp. 1767-1789, Nov. 2012
|
10.1007/s11071-012-0572-2
| null |
cs.SY math.DS nlin.CD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A general and exact critical condition of saddle-node bifurcation is derived
in closed form for the buck converter. The critical condition is helpful for
the converter designers to predict or prevent some jump instabilities or
coexistence of multiple solutions associated with the saddle-node bifurcation.
Some previously known critical conditions become special cases in this
generalized framework. Given an arbitrary control scheme, a systematic
procedure is proposed to derive the critical condition for that control scheme.
|
[
{
"version": "v1",
"created": "Wed, 18 Apr 2012 06:25:33 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Fang",
"Chung-Chieh",
""
]
] |
new_dataset
| 0.957646 |
1204.4176
|
David Doty
|
Ho-Lin Chen, David Doty, David Soloveichik
|
Deterministic Function Computation with Chemical Reaction Networks
|
fixed errors in previous version
| null | null | null |
cs.CC cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Chemical reaction networks (CRNs) formally model chemistry in a well-mixed
solution. CRNs are widely used to describe information processing occurring in
natural cellular regulatory networks, and with upcoming advances in synthetic
biology, CRNs are a promising language for the design of artificial molecular
control circuitry. Nonetheless, despite the widespread use of CRNs in the
natural sciences, the range of computational behaviors exhibited by CRNs is not
well understood.
CRNs have been shown to be efficiently Turing-universal when allowing for a
small probability of error. CRNs that are guaranteed to converge on a correct
answer, on the other hand, have been shown to decide only the semilinear
predicates. We introduce the notion of function, rather than predicate,
computation by representing the output of a function f:N^k --> N^l by a count
of some molecular species, i.e., if the CRN starts with n_1,...,n_k molecules
of some "input" species X1,...,Xk, the CRN is guaranteed to converge to having
f(n_1,...,n_k) molecules of the "output" species Y1,...,Yl. We show that a
function f:N^k --> N^l is deterministically computed by a CRN if and only if
its graph {(x,y) | f(x) = y} is a semilinear set. Furthermore, each semilinear
function f can be computed on input x in expected time O(polylog(|x|)).
|
[
{
"version": "v1",
"created": "Wed, 18 Apr 2012 19:57:14 GMT"
},
{
"version": "v2",
"created": "Sat, 8 Sep 2012 21:25:31 GMT"
},
{
"version": "v3",
"created": "Thu, 10 Jan 2013 08:18:05 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Chen",
"Ho-Lin",
""
],
[
"Doty",
"David",
""
],
[
"Soloveichik",
"David",
""
]
] |
new_dataset
| 0.96846 |
1204.4204
|
Tuvi Etzion
|
Sarit Buzaglo and Tuvi Etzion
|
Tilings with $n$-Dimensional Chairs and their Applications to Asymmetric
Codes
| null | null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An $n$-dimensional chair consists of an $n$-dimensional box from which a
smaller $n$-dimensional box is removed. A tiling of an $n$-dimensional chair
has two nice applications in coding for write-once memories. The first one is
in the design of codes which correct asymmetric errors with limited-magnitude.
The second one is in the design of $n$ cells $q$-ary write-once memory codes.
We show an equivalence between the design of a tiling with an integer lattice
and the design of a tiling from a generalization of splitting (or of Sidon
sequences). A tiling of an $n$-dimensional chair can define a perfect code for
correcting asymmetric errors with limited-magnitude. We present constructions
for such tilings and prove cases where perfect codes for these type of errors
do not exist.
|
[
{
"version": "v1",
"created": "Wed, 18 Apr 2012 20:45:11 GMT"
},
{
"version": "v2",
"created": "Thu, 16 Aug 2012 18:11:35 GMT"
},
{
"version": "v3",
"created": "Sun, 21 Oct 2012 12:59:13 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Buzaglo",
"Sarit",
""
],
[
"Etzion",
"Tuvi",
""
]
] |
new_dataset
| 0.998435 |
1204.4209
|
Venkatesan Guruswami
|
Venkatesan Guruswami and Chaoping Xing
|
Folded Codes from Function Field Towers and Improved Optimal Rate List
Decoding
|
Conference version appears at STOC 2012
| null | null | null |
cs.IT cs.DS math.AG math.IT math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give a new construction of algebraic codes which are efficiently list
decodable from a fraction $1-R-\eps$ of adversarial errors where $R$ is the
rate of the code, for any desired positive constant $\eps$. The worst-case list
size output by the algorithm is $O(1/\eps)$, matching the existential bound for
random codes up to constant factors. Further, the alphabet size of the codes is
a constant depending only on $\eps$ - it can be made
$\exp(\tilde{O}(1/\eps^2))$ which is not much worse than the lower bound of
$\exp(\Omega(1/\eps))$. The parameters we achieve are thus quite close to the
existential bounds in all three aspects - error-correction radius, alphabet
size, and list-size - simultaneously. Our code construction is Monte Carlo and
has the claimed list decoding property with high probability. Once the code is
(efficiently) sampled, the encoding/decoding algorithms are deterministic with
a running time $O_\eps(N^c)$ for an absolute constant $c$, where $N$ is the
code's block length.
Our construction is based on a linear-algebraic approach to list decoding
folded codes from towers of function fields, and combining it with a special
form of subspace-evasive sets. Instantiating this with the explicit
"asymptotically good" Garcia-Stichtenoth tower of function fields yields the
above parameters. To illustrate the method in a simpler setting, we also
present a construction based on Hermitian function fields, which offers similar
guarantees with a list and alphabet size polylogarithmic in the block length
$N$. Along the way, we shed light on how to use automorphisms of certain
function fields to enable list decoding of the folded version of the associated
algebraic-geometric codes.
|
[
{
"version": "v1",
"created": "Wed, 18 Apr 2012 21:02:36 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Guruswami",
"Venkatesan",
""
],
[
"Xing",
"Chaoping",
""
]
] |
new_dataset
| 0.965268 |
1204.4880
|
Yngve Villanger
|
Fedor V. Fomin and Saket Saurabh and Yngve Villanger
|
A Polynomial kernel for Proper Interval Vertex Deletion
|
13 pages, 1 figure
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is known that the problem of deleting at most k vertices to obtain a
proper interval graph (Proper Interval Vertex Deletion) is fixed parameter
tractable. However, whether the problem admits a polynomial kernel or not was
open. Here, we answers this question in affirmative by obtaining a polynomial
kernel for Proper Interval Vertex Deletion. This resolves an open question of
van Bevern, Komusiewicz, Moser, and Niedermeier.
|
[
{
"version": "v1",
"created": "Sun, 22 Apr 2012 11:24:42 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Fomin",
"Fedor V.",
""
],
[
"Saurabh",
"Saket",
""
],
[
"Villanger",
"Yngve",
""
]
] |
new_dataset
| 0.999547 |
1204.5057
|
Jan K\v{r}et\'insk\'y
|
Jan K\v{r}et\'insk\'y and Javier Esparza
|
Deterministic Automata for the (F,G)-fragment of LTL
| null | null | null | null |
cs.LO cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When dealing with linear temporal logic properties in the setting of e.g.
games or probabilistic systems, one often needs to express them as
deterministic omega-automata. In order to translate LTL to deterministic
omega-automata, the traditional approach first translates the formula to a
non-deterministic B\"uchi automaton. Then a determinization procedure such as
of Safra is performed yielding a deterministic \omega-automaton. We present a
direct translation of the (F,G)-fragment of LTL into deterministic
\omega-automata with no determinization procedure involved. Since our approach
is tailored to LTL, we often avoid the typically unnecessarily large blowup
caused by general determinization algorithms. We investigate the complexity of
this translation and provide experimental results and compare them to the
traditional method.
|
[
{
"version": "v1",
"created": "Mon, 23 Apr 2012 13:19:24 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Křetínský",
"Jan",
""
],
[
"Esparza",
"Javier",
""
]
] |
new_dataset
| 0.965625 |
1204.5317
|
Jarek Duda dr
|
Jaros{\l}aw Duda, Pawe{\l} Korus
|
Correction Trees as an Alternative to Turbo Codes and Low Density Parity
Check Codes
|
14 pages, 7 figures, submitted to IEEE Transactions on Information
Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The rapidly improving performance of modern hardware renders convolutional
codes obsolete, and allows for the practical implementation of more
sophisticated correction codes such as low density parity check (LDPC) and
turbo codes (TC). Both are decoded by iterative algorithms, which require a
disproportional computational effort for low channel noise. They are also
unable to correct higher noise levels, still below the Shannon theoretical
limit. In this paper, we discuss an enhanced version of a convolutional-like
decoding paradigm which adopts very large spaces of possible system states, of
the order of $2^{64}$. Under such conditions, the traditional convolution
operation is rendered useless and needs to be replaced by a carefully designed
state transition procedure. The size of the system state space completely
changes the correction philosophy, as state collisions are virtually impossible
and the decoding procedure becomes a correction tree. The proposed decoding
algorithm is practically cost-free for low channel noise. As the channel noise
approaches the Shannon limit, it is still possible to perform correction,
although its cost increases to infinity. In many applications, the implemented
decoder can essentially outperform both LDPC and TC. This paper describes the
proposed correction paradigm and theoretically analyzes the asymptotic
correction performance. The considered encoder and decoder were verified
experimentally for the binary symmetric channel. The correction process remains
practically cost-free for channel error rates below 0.05 and 0.13 for the 1/2
and 1/4 rate codes, respectively. For the considered resource limit, the output
bit error rates reach the order of $10^{-3}$ for channel error rates 0.08 and
0.18. The proposed correction paradigm can be easily extended to other
communication channels; the appropriate generalizations are also discussed in
this study.
|
[
{
"version": "v1",
"created": "Tue, 24 Apr 2012 09:25:24 GMT"
},
{
"version": "v2",
"created": "Thu, 24 May 2012 14:35:37 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Duda",
"Jarosław",
""
],
[
"Korus",
"Paweł",
""
]
] |
new_dataset
| 0.985911 |
1204.6291
|
Michael Elberfeld
|
Michael Elberfeld, Martin Grohe, Till Tantau
|
Where First-Order and Monadic Second-Order Logic Coincide
| null | null | null | null |
cs.LO cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study on which classes of graphs first-order logic (FO) and monadic
second-order logic (MSO) have the same expressive power. We show that for all
classes C of graphs that are closed under taking subgraphs, FO and MSO have the
same expressive power on C if, and only if, C has bounded tree depth. Tree
depth is a graph invariant that measures the similarity of a graph to a star in
a similar way that tree width measures the similarity of a graph to a tree. For
classes just closed under taking induced subgraphs, we show an analogous result
for guarded second-order logic (GSO), the variant of MSO that not only allows
quantification over vertex sets but also over edge sets. A key tool in our
proof is a Feferman-Vaught-type theorem that is constructive and still works
for unbounded partitions.
|
[
{
"version": "v1",
"created": "Fri, 27 Apr 2012 18:52:15 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Elberfeld",
"Michael",
""
],
[
"Grohe",
"Martin",
""
],
[
"Tantau",
"Till",
""
]
] |
new_dataset
| 0.960126 |
1205.0913
|
Bjarki Holm
|
Anuj Dawar, Bjarki Holm
|
Pebble games with algebraic rules
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define a general framework of partition games for formulating two-player
pebble games over finite structures. We show that one particular such game,
which we call the invertible-map game, yields a family of polynomial-time
approximations of graph isomorphism that is strictly stronger than the
well-known Weisfeiler-Lehman method. The general framework we introduce
includes as special cases the pebble games for finite-variable logics with and
without counting. It also includes a matrix-equivalence game, introduced here,
which characterises equivalence in the finite-variable fragments of matrix-rank
logic. We show that the equivalence defined by the invertible-map game is a
refinement of the equivalence defined by each of these games for
finite-variable logics.
|
[
{
"version": "v1",
"created": "Fri, 4 May 2012 10:48:06 GMT"
},
{
"version": "v2",
"created": "Mon, 7 May 2012 14:04:23 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Dawar",
"Anuj",
""
],
[
"Holm",
"Bjarki",
""
]
] |
new_dataset
| 0.999193 |
1205.4839
|
Thomas Degris
|
Thomas Degris, Martha White, Richard S. Sutton
|
Off-Policy Actor-Critic
|
Full version of the paper, appendix and errata included; Proceedings
of the 2012 International Conference on Machine Learning
| null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the first actor-critic algorithm for off-policy
reinforcement learning. Our algorithm is online and incremental, and its
per-time-step complexity scales linearly with the number of learned weights.
Previous work on actor-critic algorithms is limited to the on-policy setting
and does not take advantage of the recent advances in off-policy gradient
temporal-difference learning. Off-policy techniques, such as Greedy-GQ, enable
a target policy to be learned while following and obtaining data from another
(behavior) policy. For many problems, however, actor-critic methods are more
practical than action value methods (like Greedy-GQ) because they explicitly
represent the policy; consequently, the policy can be stochastic and utilize a
large action space. In this paper, we illustrate how to practically combine the
generality and learning potential of off-policy learning with the flexibility
in action selection given by actor-critic methods. We derive an incremental,
linear time and space complexity algorithm that includes eligibility traces,
prove convergence under assumptions similar to previous off-policy algorithms,
and empirically show better or comparable performance to existing algorithms on
standard reinforcement-learning benchmark problems.
|
[
{
"version": "v1",
"created": "Tue, 22 May 2012 08:36:41 GMT"
},
{
"version": "v2",
"created": "Wed, 23 May 2012 14:36:42 GMT"
},
{
"version": "v3",
"created": "Tue, 17 Jul 2012 20:40:47 GMT"
},
{
"version": "v4",
"created": "Tue, 14 Aug 2012 07:08:17 GMT"
},
{
"version": "v5",
"created": "Thu, 20 Jun 2013 10:53:42 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Degris",
"Thomas",
""
],
[
"White",
"Martha",
""
],
[
"Sutton",
"Richard S.",
""
]
] |
new_dataset
| 0.955375 |
1205.5263
|
Jingjin Yu
|
Jingjin Yu and Daniela Rus
|
Pebble Motion on Graphs with Rotations: Efficient Feasibility Tests and
Planning Algorithms
|
WAFR submission
| null | null | null |
cs.DS cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the problem of planning paths for $p$ distinguishable pebbles
(robots) residing on the vertices of an $n$-vertex connected graph with $p \le
n$. A pebble may move from a vertex to an adjacent one in a time step provided
that it does not collide with other pebbles. When $p = n$, the only collision
free moves are synchronous rotations of pebbles on disjoint cycles of the
graph. We show that the feasibility of such problems is intrinsically
determined by the diameter of a (unique) permutation group induced by the
underlying graph. Roughly speaking, the diameter of a group $\mathbf G$ is the
minimum length of the generator product required to reach an arbitrary element
of $\mathbf G$ from the identity element. Through bounding the diameter of this
associated permutation group, which assumes a maximum value of $O(n^2)$, we
establish a linear time algorithm for deciding the feasibility of such problems
and an $O(n^3)$ algorithm for planning complete paths.
|
[
{
"version": "v1",
"created": "Wed, 23 May 2012 19:45:18 GMT"
},
{
"version": "v2",
"created": "Sun, 15 Jul 2012 16:03:19 GMT"
},
{
"version": "v3",
"created": "Mon, 29 Oct 2012 19:52:09 GMT"
},
{
"version": "v4",
"created": "Thu, 31 Jul 2014 04:22:50 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Yu",
"Jingjin",
""
],
[
"Rus",
"Daniela",
""
]
] |
new_dataset
| 0.998892 |
1207.1187
|
Hardik Shah Mr
|
Hardik Shah, Andreas Raabe and Alois Knoll
|
Dynamic Priority Queue: An SDRAM Arbiter With Bounded Access Latencies
for Tight WCET Calculation
| null | null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This report introduces a shared resource arbitration scheme "DPQ - Dynamic
Priority Queue" which provides bandwidth guarantees and low worst case latency
to each master in an MPSoC. Being a non-trivial candidate for timing analysis,
SDRAM has been chosen as a showcase, but the approach is valid for any shared
resource arbitration.
Due to its significant cost, data rate and physical size advantages, SDRAM is
a potential candidate for cost sensitive, safety critical and space conserving
systems. The variable access latency is a major drawback of SDRAM that induces
largely over estimated Worst Case Execution Time (WCET) bounds of applications.
In this report we present the DPQ together with an algorithm to predict the
shared SDRAM's worst case latencies. We use the approach to calculate WCET
bounds of six hardware tasks executing on an Altera Cyclone III FPGA with
shared DDR2 memory. The results show that the DPQ is a fair arbitration scheme
and produces low WCET bounds.
|
[
{
"version": "v1",
"created": "Thu, 5 Jul 2012 08:20:02 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Shah",
"Hardik",
""
],
[
"Raabe",
"Andreas",
""
],
[
"Knoll",
"Alois",
""
]
] |
new_dataset
| 0.996326 |
1207.3202
|
Michael Kerber
|
Michael Kerber
|
Embedding the dual complex of hyper-rectangular partitions
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A rectangular partition is the partition of an (axis-aligned) rectangle into
interior-disjoint rectangles. We ask whether a rectangular partition permits a
"nice" drawing of its dual, that is, a straight-line embedding of it such that
each dual vertex is placed into the rectangle that it represents. We show that
deciding whether such a drawing exists is NP-complete. Moreover, we consider
the drawing where a vertex is placed in the center of the represented rectangle
and consider sufficient conditions for this drawing to be nice. This question
is studied both in the plane and for the higher-dimensional generalization of
rectangular partitions.
|
[
{
"version": "v1",
"created": "Fri, 13 Jul 2012 11:19:35 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Mar 2013 20:50:25 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Kerber",
"Michael",
""
]
] |
new_dataset
| 0.953984 |
1207.4017
|
Shohreh Sharif Mansouri
|
Shohreh Sharif Mansouri and Elena Dubrova
|
Ring Oscillator Physical Unclonable Function with Multi Level Supply
Voltages
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the most common types of Physical Unclonable Functions (PUFs) is the
ring oscillator PUF (RO-PUF), in which the output bits are obtained by
comparing the oscillation frequencies of different ring oscillators. In this
paper we design a new type of ring oscillator PUF in which the different
inverters composing the ring oscillators can be supplied by different voltages.
The new RO-PUF can be used to (1) increase the maximum number of possible
challenge/response pairs produced by the PUF; (2) generate a high number of
bits while consuming a low area; (3) improve the reliability of the PUF in case
of temperature variations. We present the basic idea of the new RO-PUF and then
discuss its applications.
|
[
{
"version": "v1",
"created": "Tue, 17 Jul 2012 14:46:16 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Mansouri",
"Shohreh Sharif",
""
],
[
"Dubrova",
"Elena",
""
]
] |
new_dataset
| 0.998672 |
1207.5419
|
Andreas Cord-Landwehr
|
Andreas Cord-Landwehr and Martina H\"ullmann and Peter Kling and
Alexander Setzer
|
Basic Network Creation Games with Communication Interests
|
An extended abstract of this paper has been accepted for publication
in the proceedings of the 5th International Symposium on Algorithmic Game
Theory (SAGT)
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Network creation games model the creation and usage costs of networks formed
by a set of selfish peers. Each peer has the ability to change the network in a
limited way, e.g., by creating or deleting incident links. In doing so, a peer
can reduce its individual communication cost. Typically, these costs are
modeled by the maximum or average distance in the network. We introduce a
generalized version of the basic network creation game (BNCG). In the BNCG (by
Alon et al., SPAA 2010), each peer may replace one of its incident links by a
link to an arbitrary peer. This is done in a selfish way in order to minimize
either the maximum or average distance to all other peers. That is, each peer
works towards a network structure that allows himself to communicate
efficiently with all other peers. However, participants of large networks are
seldom interested in all peers. Rather, they want to communicate efficiently
only with a small subset of peers. Our model incorporates these (communication)
interests explicitly. In the MAX-version, each node tries to minimize its
maximum distance to nodes it is interested in.
Given peers with interests and a communication network forming a tree, we
prove several results on the structure and quality of equilibria in our model.
For the MAX-version, we give an upper worst case bound of O(\sqrt{n}) for the
private costs in an equilibrium of n peers. Moreover, we give an equilibrium
for a circular interest graph where a node has private cost \Omega(\sqrt{n}),
showing that our bound is tight. This example can be extended such that we get
a tight bound of \Theta(\sqrt{n}) for the price of anarchy. For the case of
general communication networks we show the price of anarchy to be \Theta(n).
Additionally, we prove an interesting connection between a maximum independent
set in the interest graph and the private costs of the peers.
|
[
{
"version": "v1",
"created": "Mon, 23 Jul 2012 15:01:11 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Cord-Landwehr",
"Andreas",
""
],
[
"Hüllmann",
"Martina",
""
],
[
"Kling",
"Peter",
""
],
[
"Setzer",
"Alexander",
""
]
] |
new_dataset
| 0.976032 |
1208.0798
|
Michael Mitzenmacher
|
Michael Mitzenmacher, George Varghese
|
Biff (Bloom Filter) Codes : Fast Error Correction for Large Data Sets
|
5 pages, Corrected typos from ISIT 2012 conference version
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Large data sets are increasingly common in cloud and virtualized
environments. For example, transfers of multiple gigabytes are commonplace, as
are replicated blocks of such sizes. There is a need for fast error-correction
or data reconciliation in such settings even when the expected number of errors
is small.
Motivated by such cloud reconciliation problems, we consider error-correction
schemes designed for large data, after explaining why previous approaches
appear unsuitable. We introduce Biff codes, which are based on Bloom filters
and are designed for large data. For Biff codes with a message of length $L$
and $E$ errors, the encoding time is $O(L)$, decoding time is $O(L + E)$ and
the space overhead is $O(E)$. Biff codes are low-density parity-check codes;
they are similar to Tornado codes, but are designed for errors instead of
erasures. Further, Biff codes are designed to be very simple, removing any
explicit graph structures and based entirely on hash tables. We derive Biff
codes by a simple reduction from a set reconciliation algorithm for a recently
developed data structure, invertible Bloom lookup tables. While the underlying
theory is extremely simple, what makes this code especially attractive is the
ease with which it can be implemented and the speed of decoding. We present
results from a prototype implementation that decodes messages of 1 million
words with thousands of errors in well under a second.
|
[
{
"version": "v1",
"created": "Fri, 3 Aug 2012 17:15:53 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Mitzenmacher",
"Michael",
""
],
[
"Varghese",
"George",
""
]
] |
new_dataset
| 0.989094 |
1208.4165
|
Joseph Hellerstein
|
Joe Hellerstein, Christopher R\'e, Florian Schoppmann, Daisy Zhe Wang,
Eugene Fratkin, Aleksander Gorajek, Kee Siong Ng, Caleb Welton, Xixuan Feng,
Kun Li, Arun Kumar
|
The MADlib Analytics Library or MAD Skills, the SQL
|
VLDB2012
|
Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 12, pp.
1700-1711 (2012)
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
MADlib is a free, open source library of in-database analytic methods. It
provides an evolving suite of SQL-based algorithms for machine learning, data
mining and statistics that run at scale within a database engine, with no need
for data import/export to other tools. The goal is for MADlib to eventually
serve a role for scalable database systems that is similar to the CRAN library
for R: a community repository of statistical methods, this time written with
scale and parallelism in mind. In this paper we introduce the MADlib project,
including the background that led to its beginnings, and the motivation for its
open source nature. We provide an overview of the library's architecture and
design patterns, and provide a description of various statistical methods in
that context. We include performance and speedup results of a core design
pattern from one of those methods over the Greenplum parallel DBMS on a
modest-sized test cluster. We then report on two initial efforts at
incorporating academic research into MADlib, which is one of the project's
goals. MADlib is freely available at http://madlib.net, and the project is open
for contributions of both new methods, and ports to additional database
platforms.
|
[
{
"version": "v1",
"created": "Tue, 21 Aug 2012 02:52:27 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Hellerstein",
"Joe",
""
],
[
"Ré",
"Christopher",
""
],
[
"Schoppmann",
"Florian",
""
],
[
"Wang",
"Daisy Zhe",
""
],
[
"Fratkin",
"Eugene",
""
],
[
"Gorajek",
"Aleksander",
""
],
[
"Ng",
"Kee Siong",
""
],
[
"Welton",
"Caleb",
""
],
[
"Feng",
"Xixuan",
""
],
[
"Li",
"Kun",
""
],
[
"Kumar",
"Arun",
""
]
] |
new_dataset
| 0.993376 |
1208.4405
|
Alexander Fish
|
Alexander Fish, Shamgar Gurevich, Ronny Hadani, Akbar Sayeed, and Oded
Schwartz
|
Delay-Doppler Channel Estimation with Almost Linear Complexity
|
11 pages
| null | null | null |
cs.IT math.IT math.NT math.RT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A fundamental task in wireless communication is Channel Estimation: Compute
the channel parameters a signal undergoes while traveling from a transmitter to
a receiver. In the case of delay-Doppler channel, a widely used method is the
Matched Filter algorithm. It uses a pseudo-random sequence of length N, and, in
case of non-trivial relative velocity between transmitter and receiver, its
computational complexity is O(N^{2}log(N)). In this paper we introduce a novel
approach of designing sequences that allow faster channel estimation. Using
group representation techniques we construct sequences, which enable us to
introduce a new algorithm, called the flag method, that significantly improves
the matched filter algorithm. The flag method finds the channel parameters in
O(mNlog(N)) operations, for channel of sparsity m. We discuss applications of
the flag method to GPS, radar system, and mobile communication as well.
|
[
{
"version": "v1",
"created": "Wed, 22 Aug 2012 00:10:18 GMT"
},
{
"version": "v2",
"created": "Thu, 23 Aug 2012 21:16:48 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Fish",
"Alexander",
""
],
[
"Gurevich",
"Shamgar",
""
],
[
"Hadani",
"Ronny",
""
],
[
"Sayeed",
"Akbar",
""
],
[
"Schwartz",
"Oded",
""
]
] |
new_dataset
| 0.999473 |
1208.4434
|
Roman Vetter
|
Roman Vetter, Norbert Stoop, Thomas Jenni, Falk K. Wittel, Hans J.
Herrmann
|
Subdivision Shell Elements with Anisotropic Growth
|
20 pages, 12 figures, 1 table
|
Int. J. Numer. Meth. Eng. 95, 791-810 (2013)
|
10.1002/nme.4536
| null |
cs.NA cs.CE physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A thin shell finite element approach based on Loop's subdivision surfaces is
proposed, capable of dealing with large deformations and anisotropic growth. To
this end, the Kirchhoff-Love theory of thin shells is derived and extended to
allow for arbitrary in-plane growth. The simplicity and computational
efficiency of the subdivision thin shell elements is outstanding, which is
demonstrated on a few standard loading benchmarks. With this powerful tool at
hand, we demonstrate the broad range of possible applications by numerical
solution of several growth scenarios, ranging from the uniform growth of a
sphere, to boundary instabilities induced by large anisotropic growth. Finally,
it is shown that the problem of a slowly and uniformly growing sheet confined
in a fixed hollow sphere is equivalent to the inverse process where a sheet of
fixed size is slowly crumpled in a shrinking hollow sphere in the frictionless,
quasi-static, elastic limit.
|
[
{
"version": "v1",
"created": "Wed, 22 Aug 2012 07:18:44 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Mar 2013 17:14:45 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Vetter",
"Roman",
""
],
[
"Stoop",
"Norbert",
""
],
[
"Jenni",
"Thomas",
""
],
[
"Wittel",
"Falk K.",
""
],
[
"Herrmann",
"Hans J.",
""
]
] |
new_dataset
| 0.998577 |
1208.4877
|
Sonia Jahid
|
Sonia Jahid and Nikita Borisov
|
PIRATTE: Proxy-based Immediate Revocation of ATTribute-based Encryption
|
14 pages, Under review in TDSC
| null | null | null |
cs.CR cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Access control to data in traditional enterprises is typically enforced
through reference monitors. However, as more and more enterprise data is
outsourced, trusting third party storage servers is getting challenging. As a
result, cryptography, specifically Attribute-based encryption (ABE) is getting
popular for its expressiveness. The challenge of ABE is revocation.
To address this challenge, we propose PIRATTE, an architecture that supports
fine-grained access control policies and dynamic group membership. PIRATTE is
built using attribute-based encryption; a key and novel feature of our
architecture, however, is that it is possible to remove access from a user
without issuing new keys to other users or re-encrypting existing ciphertexts.
We achieve this by introducing a proxy that participates in the decryption
process and enforces revocation constraints. The proxy is minimally trusted and
cannot decrypt ciphertexts or provide access to previously revoked users. We
describe the PIRATTE construction and provide a security analysis along with
performance evaluation.We also describe an architecture for online social
network that can use PIRATTE, and prototype application of PIRATTE on Facebook.
|
[
{
"version": "v1",
"created": "Thu, 23 Aug 2012 23:42:22 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Jahid",
"Sonia",
""
],
[
"Borisov",
"Nikita",
""
]
] |
new_dataset
| 0.997985 |
1209.1482
|
Haya Shulman
|
Amir Herzberg and Haya Shulman
|
Unilateral Antidotes to DNS Cache Poisoning
| null |
SecureComm 2011
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate defenses against DNS cache poisoning focusing on mechanisms
that can be readily deployed unilaterally by the resolving organisation,
preferably in a single gateway or a proxy. DNS poisoning is (still) a major
threat to Internet security; determined spoofing attackers are often able to
circumvent currently deployed antidotes such as port randomisation. The
adoption of DNSSEC, which would foil DNS poisoning, remains a long-term
challenge. We discuss limitations of the prominent resolver-only defenses,
mainly port and IP randomisation, 0x20 encoding and birthday protection. We
then present two new (unilateral) defenses: the sandwich antidote and the NAT
antidote. The defenses are simple, effective and efficient, and can be
implemented in a gateway connecting the resolver to the Internet. The sandwich
antidote is composed of two phases: poisoning-attack detection and then
prevention. The NAT antidote adds entropy to DNS requests by switching the
resolver's IP address to a random address (belonging to the same autonomous
system). Finally, we show how to implement the birthday protection mechanism in
the gateway, thus allowing to restrict the number of DNS requests with the same
query to 1 even when the resolver does not support this.
|
[
{
"version": "v1",
"created": "Fri, 7 Sep 2012 10:28:00 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Herzberg",
"Amir",
""
],
[
"Shulman",
"Haya",
""
]
] |
new_dataset
| 0.993584 |
1503.05287
|
Abhisek Ukil
|
A. Ukil, R. Zivanovic
|
Adjusted Haar Wavelet for Application in the Power Systems Disturbance
Analysis
|
13 pages in final printed version
|
Digital Signal Processing, Elsevier, vol. 18, issue 2, pp.
103-115, 2008
|
10.1016/j.dsp.2007.04.001
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Abrupt change detection based on the wavelet transform and threshold method
is very effective in detecting the abrupt changes and hence segmenting the
signals recorded during disturbances in the electrical power network. The
wavelet method estimates the time-instants of the changes in the signal model
parameters during the pre-fault condition, after initiation of fault, after
circuit-breaker opening and auto-reclosure. Certain kinds of disturbance
signals do not show distinct abrupt changes in the signal parameters. In those
cases, the standard mother wavelets fail to achieve correct event-specific
segmentations. A new adjustment technique to the standard Haar wavelet is
proposed in this paper, by introducing 2n adjusting zeros in the Haar wavelet
scaling filter, n being a positive integer. This technique is quite effective
in segmenting those fault signals into pre- and post-fault segments, and it is
an improvement over the standard mother wavelets for this application. This
paper presents many practical examples where recorded signals from the power
network in South Africa have been used.
|
[
{
"version": "v1",
"created": "Wed, 18 Mar 2015 05:50:39 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Ukil",
"A.",
""
],
[
"Zivanovic",
"R.",
""
]
] |
new_dataset
| 0.999704 |
1503.05619
|
Mathew Samimi
|
Mathew K. Samimi and Theodore S. Rappaport
|
3-D Statistical Channel Model for Millimeter-Wave Outdoor Mobile
Broadband Communications
|
7 pages, 6 figures, ICC 2015 (London, UK, to appear)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents an omnidirectional spatial and temporal 3-dimensional
statistical channel model for 28 GHz dense urban non-line of sight
environments. The channel model is developed from 28 GHz ultrawideband
propagation measurements obtained with a 400 megachips per second broadband
sliding correlator channel sounder and highly directional, steerable horn
antennas in New York City. A 3GPP-like statistical channel model that is easy
to implement in software or hardware is developed from measured power delay
profiles and a synthesized method for providing absolute propagation delays
recovered from 3-D ray-tracing, as well as measured angle of departure and
angle of arrival power spectra. The extracted statistics are used to implement
a MATLAB-based statistical simulator that generates 3-D millimeter-wave
temporal and spatial channel coefficients that reproduce realistic impulse
responses of measured urban channels. The methods and model presented here can
be used for millimeter-wave system-wide simulations, and air interface design
and capacity analyses.
|
[
{
"version": "v1",
"created": "Thu, 19 Mar 2015 00:08:21 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Samimi",
"Mathew K.",
""
],
[
"Rappaport",
"Theodore S.",
""
]
] |
new_dataset
| 0.99608 |
1503.05667
|
Sourish Dasgupta
|
Sourish Dasgupta, Gaurav Maheshwari, Priyansh Trivedi
|
BitSim: An Algebraic Similarity Measure for Description Logics Concepts
| null | null | null | null |
cs.AI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper, we propose an algebraic similarity measure {\sigma}BS (BS
stands for BitSim) for assigning semantic similarity score to concept
definitions in ALCH+ an expressive fragment of Description Logics (DL). We
define an algebraic interpretation function, I_B, that maps a concept
definition to a unique string ({\omega}_B) called bit-code) over an alphabet
{\Sigma}_B of 11 symbols belonging to L_B - the language over P B. IB has
semantic correspondence with conventional model-theoretic interpretation of DL.
We then define {\sigma}_BS on L_B. A detailed analysis of I_B and {\sigma}_BS
has been given.
|
[
{
"version": "v1",
"created": "Thu, 19 Mar 2015 08:05:03 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Dasgupta",
"Sourish",
""
],
[
"Maheshwari",
"Gaurav",
""
],
[
"Trivedi",
"Priyansh",
""
]
] |
new_dataset
| 0.996532 |
1503.05704
|
Chinnappillai Durairajan
|
P. Chella Pandian and C. Durairajan
|
On Various Parameters of $Z_q$-Simplex codes for an even integer q
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we defined the $Z_q$-linear codes and discussed its various
parameters. We constructed $Z_q$-Simplex code and $Z_q$-MacDonald code and
found its parameters. We have given a lower and an upper bounds of its covering
radius for q is an even integer.
|
[
{
"version": "v1",
"created": "Thu, 19 Mar 2015 10:57:26 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Pandian",
"P. Chella",
""
],
[
"Durairajan",
"C.",
""
]
] |
new_dataset
| 0.999522 |
1503.05733
|
Steve Kerrison
|
Steve Kerrison and Kerstin Eder
|
A software controlled voltage tuning system using multi-purpose ring
oscillators
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel software driven voltage tuning method that
utilises multi-purpose Ring Oscillators (ROs) to provide process variation and
environment sensitive energy reductions. The proposed technique enables voltage
tuning based on the observed frequency of the ROs, taken as a representation of
the device speed and used to estimate a safe minimum operating voltage at a
given core frequency. A conservative linear relationship between RO frequency
and silicon speed is used to approximate the critical path of the processor.
Using a multi-purpose RO not specifically implemented for critical path
characterisation is a unique approach to voltage tuning. The parameters
governing the relationship between RO and silicon speed are obtained through
the testing of a sample of processors from different wafer regions. These
parameters can then be used on all devices of that model. The tuning method and
software control framework is demonstrated on a sample of XMOS XS1-U8A-64
embedded microprocessors, yielding a dynamic power saving of up to 25% with no
performance reduction and no negative impact on the real-time constraints of
the embedded software running on the processor.
|
[
{
"version": "v1",
"created": "Thu, 19 Mar 2015 12:16:33 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Kerrison",
"Steve",
""
],
[
"Eder",
"Kerstin",
""
]
] |
new_dataset
| 0.964984 |
1503.05767
|
Francois Chung
|
Fran\c{c}ois Chung and Tom\'as Rodr\'iguez
|
Automatic Pollen Grain and Exine Segmentation from Microscope Images
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, we propose an automatic method for the segmentation of
pollen grains from microscope images, followed by the automatic segmentation of
their exine. The objective of exine segmentation is to separate the pollen
grain in two regions of interest: exine and inner part. A coarse-to-fine
approach ensures a smooth and accurate segmentation of both structures. As a
rough stage, grain segmentation is performed by a procedure involving
clustering and morphological operations, while the exine is approximated by an
iterative procedure consisting in consecutive cropping steps of the pollen
grain. A snake-based segmentation is performed to refine the segmentation of
both structures. Results have shown that our segmentation method is able to
deal with different pollen types, as well as with different types of exine and
inner part appearance. The proposed segmentation method aims to be generic and
has been designed as one of the core steps of an automatic pollen
classification framework.
|
[
{
"version": "v1",
"created": "Thu, 19 Mar 2015 13:58:15 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Chung",
"François",
""
],
[
"Rodríguez",
"Tomás",
""
]
] |
new_dataset
| 0.998398 |
1503.05881
|
Roman Chyla
|
Roman Chyla, Alberto Accomazzi, Alexandra Holachek, Carolyn S. Grant,
Jonathan Elliott, Edwin A. Henneken, Donna M. Thompson, Michael J. Kurtz,
Stephen S. Murray, Vladimir Sudilovsky
|
ADS 2.0: new architecture, API and services
|
ADASS Conference 2014
| null | null | null |
cs.DL
|
http://creativecommons.org/licenses/publicdomain/
|
The ADS platform is undergoing the biggest rewrite of its 20-year history.
While several components have been added to its architecture over the past
couple of years, this talk will concentrate on the underpinnings of ADS's
search layer and its API. To illustrate the design of the components in the new
system, we will show how the new ADS user interface is built exclusively on top
of the API using RESTful web services. Taking one step further, we will discuss
how we plan to expose the treasure trove of information hosted by ADS (10
million records and fulltext for much of the Astronomy and Physics refereed
literature) to partners interested in using this API. This will provide you
(and your intelligent applications) with access to ADS's underlying data to
enable the extraction of new knowledge and the ingestion of these results back
into the ADS. Using this framework, researchers could run controlled
experiments with content extraction, machine learning, natural language
processing, etc. In this talk, we will discuss what is already implemented,
what will be available soon, and where we are going next.
|
[
{
"version": "v1",
"created": "Thu, 19 Mar 2015 18:54:03 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Chyla",
"Roman",
""
],
[
"Accomazzi",
"Alberto",
""
],
[
"Holachek",
"Alexandra",
""
],
[
"Grant",
"Carolyn S.",
""
],
[
"Elliott",
"Jonathan",
""
],
[
"Henneken",
"Edwin A.",
""
],
[
"Thompson",
"Donna M.",
""
],
[
"Kurtz",
"Michael J.",
""
],
[
"Murray",
"Stephen S.",
""
],
[
"Sudilovsky",
"Vladimir",
""
]
] |
new_dataset
| 0.993157 |
1503.05907
|
Daniel Christen Mr.
|
Daniel Christen
|
Syntagma Lexical Database
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper discusses the structure of Syntagma's Lexical Database (focused on
Italian). The basic database consists in four tables. Table Forms contains word
inflections, used by the POS-tagger for the identification of input-words.
Forms is related to Lemma. Table Lemma stores all kinds of grammatical features
of words, word-level semantic data and restrictions. In the table Meanings
meaning-related data are stored: definition, examples, domain, and semantic
information. Table Valency contains the argument structure of each meaning,
with syntactic and semantic features for each argument. The extended version of
SLD contains the links to Syntagma's Semantic Net and to the WordNet synsets of
other languages.
|
[
{
"version": "v1",
"created": "Thu, 19 Mar 2015 19:45:24 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Christen",
"Daniel",
""
]
] |
new_dataset
| 0.981485 |
1102.3227
|
Stefano Rini
|
Stefano Riniy, Daniela Tuninetti, Natasha Devroye and Andrea Goldsmith
|
The Capacity of the Interference Channel with a Cognitive Relay in Very
Strong Interference
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The interference channel with a cognitive relay consists of a classical
interference channel with two sourcedestination pairs and with an additional
cognitive relay that has a priori knowledge of the sources' messages and aids
in the sources' transmission. We derive a new outer bound for this channel
using an argument originally devised for the "more capable" broadcast channel,
and show the achievability of the proposed outer bound in the "very strong
interference" regime, a class of channels where there is no loss in optimality
if both destinations decode both messages. This result is analogous to the
"very strong interference" capacity result for the classical interference
channel and for the cognitive interference channel, and is the first capacity
known capacity result for the general interference channel with a cognitive
relay.
|
[
{
"version": "v1",
"created": "Wed, 16 Feb 2011 03:24:38 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Riniy",
"Stefano",
""
],
[
"Tuninetti",
"Daniela",
""
],
[
"Devroye",
"Natasha",
""
],
[
"Goldsmith",
"Andrea",
""
]
] |
new_dataset
| 0.992421 |
1102.3298
|
Laura Luzzi
|
Laura Luzzi and Fr\'ed\'erique Oggier
|
A family of fast-decodable MIDO codes from crossed-product algebras over
Q
|
5 pages, 1 figure, conference
| null | null | null |
cs.IT math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multiple Input Double Output (MIDO) asymmetric space-time codes for 4
transmit antennas and 2 receive antennas can be employed in the downlink from
base stations to portable devices. Previous MIDO code constructions with low
Maximum Likelihood (ML) decoding complexity, full diversity and the
non-vanishing determinant (NVD) property are mostly based on cyclic division
algebras. In this paper, a new family of MIDO codes with the NVD property based
on crossed-product algebras over Q is introduced. Fast decodability follows
naturally from the structure of the codewords which consist of four generalized
Alamouti blocks. The associated ML complexity order is the lowest known for
full-rate MIDO codes (O(M^{10}) instead of O(M^{16}) with respect to the real
constellation size M). Numerical simulations show that these codes have a
performance from comparable up to 1dB gain compared to the best known MIDO code
with the same complexity.
|
[
{
"version": "v1",
"created": "Wed, 16 Feb 2011 10:57:30 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Luzzi",
"Laura",
""
],
[
"Oggier",
"Frédérique",
""
]
] |
new_dataset
| 0.996163 |
1102.5461
|
Hai Jiang
|
Zhou Zhang and Hai Jiang
|
Distributed Opportunistic Channel Access in Wireless Relay Networks
|
20 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, the problem of distributed opportunistic channel access in
wireless relaying is investigated. A relay network with multiple
source-destination pairs and multiple relays is considered. All the source
nodes contend through a random access procedure. A winner source node may give
up its transmission opportunity if its link quality is poor. In this research,
we apply the optimal stopping theory to analyze when a winner node should give
up its transmission opportunity. By assuming the winner node has information of
channel gains of links from itself to relays and from relays to its
destination, the existence and uniqueness of an optimal stopping rule are
rigorously proved. It is also found that the optimal stopping rule is a
pure-threshold strategy. The case when the winner node does not have
information of channel gains of links from relays to its destination is also
studied. Two stopping problems exist, one in the main layer (for channel access
of source nodes), and the other in the sub-layer (for channel access of relay
nodes). An intuitive stopping rule, where the sub-layer and the main layer
maximize their throughput respectively, is shown to be a semi-pure-threshold
strategy. The intuitive stopping rule turns out to be non-optimal. An optimal
stopping rule is then derived theoretically. Our research reveals that
multi-user (including multi-source and multi-relay) diversity and time
diversity can be fully utilized in a relay network by our proposed strategies.
|
[
{
"version": "v1",
"created": "Sat, 26 Feb 2011 23:56:03 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Zhang",
"Zhou",
""
],
[
"Jiang",
"Hai",
""
]
] |
new_dataset
| 0.998261 |
1103.1353
|
Manfred Kufleitner
|
Manfred Kufleitner and Alexander Lauser
|
Around Dot-depth One
| null | null | null |
Technical report no. 2011/03, University of Stuttgart, Computer
Science
|
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The dot-depth hierarchy is a classification of star-free languages. It is
related to the quantifier alternation hierarchy of first-order logic over
finite words. We consider fragments of languages with dot-depth 1/2 and
dot-depth 1 obtained by prohibiting the specification of prefixes or suffixes.
As it turns out, these language classes are in one-to-one correspondence with
fragments of existential first-order logic without min- or max-predicate. For
all fragments, we obtain effective algebraic characterizations. Moreover, we
give new combinatorial proofs for the decidability of the membership problem
for dot-depth 1/2 and dot-depth 1.
|
[
{
"version": "v1",
"created": "Mon, 7 Mar 2011 19:45:33 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Kufleitner",
"Manfred",
""
],
[
"Lauser",
"Alexander",
""
]
] |
new_dataset
| 0.953336 |
1103.2303
|
Emmanuel Lochin
|
Pascal Anelli and Remi Diana and Emmanuel Lochin
|
FavourQueue: a Parameterless Active Queue Management to Speed Up Short
TCP Flows (and others too!)
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents and analyses the implementation of a novel active queue
management (AQM) named FavorQueue that aims to improve delay transfer of short
lived TCP flows over best-effort networks. The idea is to dequeue packets that
do not belong to a flow previously enqueued first. The rationale is to mitigate
the delay induced by long-lived TCP flows over the pace of short TCP data
requests and to prevent dropped packets at the beginning of a connection and
during recovery period. Although the main target of this AQM is to accelerate
short TCP traffic, we show that FavorQueue does not only improve the
performance of short TCP traffic but also improves the performance of all TCP
traffic in terms of drop ratio and latency whatever the flow size. In
particular, we demonstrate that FavorQueue reduces the loss of a retransmitted
packet, decreases the number of dropped packets recovered by RTO and improves
the latency up to 30% compared to DropTail. Finally, we show that this scheme
remains compliant with recent TCP updates such as the increase of the initial
slow-start value.
|
[
{
"version": "v1",
"created": "Fri, 11 Mar 2011 15:58:33 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Mar 2011 15:28:47 GMT"
},
{
"version": "v3",
"created": "Fri, 27 Sep 2013 15:55:13 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Anelli",
"Pascal",
""
],
[
"Diana",
"Remi",
""
],
[
"Lochin",
"Emmanuel",
""
]
] |
new_dataset
| 0.996894 |
1103.2793
|
Anastasios Zouzias
|
Anastasios Zouzias
|
A Matrix Hyperbolic Cosine Algorithm and Applications
|
16 pages, simplified proof and corrected acknowledging of prior work
in (current) Section 4
| null |
10.1007/978-3-642-31594-7_71
| null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we generalize Spencer's hyperbolic cosine algorithm to the
matrix-valued setting. We apply the proposed algorithm to several problems by
analyzing its computational efficiency under two special cases of matrices; one
in which the matrices have a group structure and an other in which they have
rank-one. As an application of the former case, we present a deterministic
algorithm that, given the multiplication table of a finite group of size $n$,
it constructs an expanding Cayley graph of logarithmic degree in near-optimal
O(n^2 log^3 n) time. For the latter case, we present a fast deterministic
algorithm for spectral sparsification of positive semi-definite matrices, which
implies an improved deterministic algorithm for spectral graph sparsification
of dense graphs. In addition, we give an elementary connection between spectral
sparsification of positive semi-definite matrices and element-wise matrix
sparsification. As a consequence, we obtain improved element-wise
sparsification algorithms for diagonally dominant-like matrices.
|
[
{
"version": "v1",
"created": "Mon, 14 Mar 2011 21:43:27 GMT"
},
{
"version": "v2",
"created": "Sun, 26 Feb 2012 02:21:23 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Zouzias",
"Anastasios",
""
]
] |
new_dataset
| 0.975257 |
1103.5421
|
Zoltan Esik
|
Zoltan Esik, Szabolcs Ivan
|
Context-free ordinals
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider context-free languages equipped with the lexicographic ordering.
We show that when the lexicographic ordering of a context-free language is
scattered, then its Hausdorff rank is less than $\omega^\omega$. As a corollary
of this result we obtain that an ordinal is the order type of a well-ordered
context-free language iff it is less than $\omega^{\omega^\omega}$.
|
[
{
"version": "v1",
"created": "Mon, 28 Mar 2011 17:12:05 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Esik",
"Zoltan",
""
],
[
"Ivan",
"Szabolcs",
""
]
] |
new_dataset
| 0.975937 |
1104.0735
|
Vijayvaradharaj Muralidharan
|
Vijayvaradharaj T Muralidharan, B. Sundar Rajan
|
A Non-Orthogonal DF Scheme for the Single Relay Channel and the Effect
of Labelling
|
10 pages, 14 figures, 4 tables
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the uncoded transmission over the half-duplex single relay
channel, with a single antenna at the source, relay and destination nodes, in a
Rayleigh fading environment. The phase during which the relay is in reception
mode is referred to as Phase 1 and the phase during which the relay is in
transmission mode is referred to as Phase 2. The following two cases are
considered: the Non-Orthogonal Decode and Forward (NODF) scheme, in which both
the source and the relay transmit during Phase 2 and the Orthogonal Decode and
Forward (ODF) scheme, in which the relay alone transmits during Phase 2. A near
ML decoder which gives full diversity (diversity order 2) for the NODF scheme
is proposed. Due to the proximity of the relay to the destination, the
Source-Destination link, in general, is expected to be much weaker than the
Relay-Destination link. Hence it is not clear whether the transmission made by
the source during Phase 2 in the NODF scheme, provides any performance
improvement over the ODF scheme or not. In this regard, it is shown that the
NODF scheme provides significant performance improvement over the ODF scheme.
In fact, at high SNR, the performance of the NODF scheme with the non-ideal
Source-Relay link, is same as that of the NODF scheme with an ideal
Source-Relay link. In other words, to study the high SNR performance of the
NODF scheme, one can assume that the Source-Relay link is ideal, whereas the
same is not true for the ODF scheme. Further, it is shown that proper choice of
the mapping of the bits on to the signal points at the source and the relay,
provides a significant improvement in performance, for both the NODF and the
ODF schemes.
|
[
{
"version": "v1",
"created": "Tue, 5 Apr 2011 05:15:45 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Muralidharan",
"Vijayvaradharaj T",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.997236 |
1104.0753
|
Matias Korman
|
J. M. D\'iaz-Ba\~nez and M. Korman and P. P\'erez-Lantero and I.
Ventura
|
Locating a service facility and a rapid transit line
|
Abstract submitted to the XIV Spanish Meeting on Computational
Geometry
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we study a facility location problem in the plane in which a
single point (facility) and a rapid transit line (highway) are simultaneously
located in order to minimize the total travel time of the clients to the
facility, using the $L_1$ or Manhattan metric. The rapid transit line is
represented by a line segment with fixed length and arbitrary orientation. The
highway is an alternative transportation system that can be used by the clients
to reduce their travel time to the facility. This problem was introduced by
Espejo and Ch\'ia in [7]. They gave both a characterization of the optimal
solutions and an algorithm running in $O(n^3\log n)$ time, where $n$ represents
the number of clients. In this paper we show that the Espejo and Ch\'ia's
algorithm does not always work correctly. At the same time, we provide a proper
characterization of the solutions with a simpler proof and give an algorithm
solving the problem in $O(n^3)$ time.
|
[
{
"version": "v1",
"created": "Tue, 5 Apr 2011 07:43:46 GMT"
},
{
"version": "v2",
"created": "Wed, 6 Apr 2011 12:19:51 GMT"
},
{
"version": "v3",
"created": "Fri, 23 Mar 2012 12:56:09 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Díaz-Bañez",
"J. M.",
""
],
[
"Korman",
"M.",
""
],
[
"Pérez-Lantero",
"P.",
""
],
[
"Ventura",
"I.",
""
]
] |
new_dataset
| 0.996669 |
1104.1044
|
Ming Lam Leung
|
Ming Lam Leung
|
Fixed Parameter Tractable Algorithm for Firefighting Problem
|
14 pages, 5 figures
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The firefighter problem is defined as below. A fire initially breaks out at a
vertex r on a graph G. In each step, a firefighter chooses to protect one
vertex, which is not yet burnt. And the fire spreads out to its unprotected
neighboring vertices afterwards. The objective of the problem is to choose a
sequence of vertices to protect, in order to save maximum number of vertices
from the fire.
In this paper, we will introduce a parameter k into the firefighter problem
and give several FPT algorithms using a random separation technique of Cai,
Chan and Chan. We will prove firefighter problem is FPT on general graph if we
take total number of vertices burnt to be a parameter. If we parameterize the
number of protected vertices, we discover several FPT algorithms of the
firefighter problem on degree bounded graph and unicyclic graph. Furthermore,
we also study the firefighter problem on weighted and valued graph, and the
problem with multiple fire sources on degree-bounded graph.
|
[
{
"version": "v1",
"created": "Wed, 6 Apr 2011 09:33:42 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Apr 2011 10:51:21 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Leung",
"Ming Lam",
""
]
] |
new_dataset
| 0.971559 |
1104.1482
|
Christian Duncan
|
Christian A. Duncan and Emden R. Gansner and Yifan Hu and Michael
Kaufmann and Stephen G. Kobourov
|
Optimal Polygonal Representation of Planar Graphs
|
26 pages, 14 figures. A preliminary version appeared in LATIN 2010,
Oaxaca, Mexico
| null | null | null |
cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider the problem of representing graphs by polygons
whose sides touch. We show that at least six sides per polygon are necessary by
constructing a class of planar graphs that cannot be represented by pentagons.
We also show that the lower bound of six sides is matched by an upper bound of
six sides with a linear-time algorithm for representing any planar graph by
touching hexagons. Moreover, our algorithm produces convex polygons with edges
having at most three slopes and with all vertices lying on an O(n)xO(n) grid.
|
[
{
"version": "v1",
"created": "Fri, 8 Apr 2011 05:10:36 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Duncan",
"Christian A.",
""
],
[
"Gansner",
"Emden R.",
""
],
[
"Hu",
"Yifan",
""
],
[
"Kaufmann",
"Michael",
""
],
[
"Kobourov",
"Stephen G.",
""
]
] |
new_dataset
| 0.981911 |
1104.1601
|
Gregory Kucherov
|
Gregory Kucherov
|
On-line construction of position heaps
|
to appear in Journal of Discrete Algorithms
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a simple linear-time on-line algorithm for constructing a position
heap for a string [Ehrenfeucht et al, 2011]. Our definition of position heap
differs slightly from the one proposed in [Ehrenfeucht et al, 2011] in that it
considers the suffixes ordered from left to right. Our construction is based on
classic suffix pointers and resembles the Ukkonen's algorithm for suffix trees
[Ukkonen, 1995]. Using suffix pointers, the position heap can be extended into
the augmented position heap that allows for a linear-time string matching
algorithm [Ehrenfeucht et al, 2011].
|
[
{
"version": "v1",
"created": "Fri, 8 Apr 2011 15:46:44 GMT"
},
{
"version": "v2",
"created": "Sun, 17 Apr 2011 08:17:27 GMT"
},
{
"version": "v3",
"created": "Mon, 17 Oct 2011 17:57:09 GMT"
},
{
"version": "v4",
"created": "Tue, 22 Nov 2011 16:35:53 GMT"
},
{
"version": "v5",
"created": "Thu, 4 Oct 2012 10:25:19 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Kucherov",
"Gregory",
""
]
] |
new_dataset
| 0.997002 |
1104.2086
|
Slav Petrov
|
Slav Petrov, Dipanjan Das and Ryan McDonald
|
A Universal Part-of-Speech Tagset
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To facilitate future research in unsupervised induction of syntactic
structure and to standardize best-practices, we propose a tagset that consists
of twelve universal part-of-speech categories. In addition to the tagset, we
develop a mapping from 25 different treebank tagsets to this universal set. As
a result, when combined with the original treebank data, this universal tagset
and mapping produce a dataset consisting of common parts-of-speech for 22
different languages. We highlight the use of this resource via two experiments,
including one that reports competitive accuracies for unsupervised grammar
induction without gold standard part-of-speech tags.
|
[
{
"version": "v1",
"created": "Mon, 11 Apr 2011 23:06:54 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Petrov",
"Slav",
""
],
[
"Das",
"Dipanjan",
""
],
[
"McDonald",
"Ryan",
""
]
] |
new_dataset
| 0.997846 |
1104.2486
|
Dimitrios Thilikos
|
Juanjo Ru\'e, Ignasi Sau, and Dimitrios M. Thilikos
|
Dynamic Programming for Graphs on Surfaces
|
28 pages, 3 figures
| null | null | null |
cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We provide a framework for the design and analysis of dynamic programming
algorithms for surface-embedded graphs on n vertices and branchwidth at most k.
Our technique applies to general families of problems where standard dynamic
programming runs in 2^{O(k log k)} n steps. Our approach combines tools from
topological graph theory and analytic combinatorics. In particular, we
introduce a new type of branch decomposition called "surface cut
decomposition", generalizing sphere cut decompositions of planar graphs
introduced by Seymour and Thomas, which has nice combinatorial properties.
Namely, the number of partial solutions that can be arranged on a surface cut
decomposition can be upper-bounded by the number of non-crossing partitions on
surfaces with boundary. It follows that partial solutions can be represented by
a single-exponential (in the branchwidth k) number of configurations. This
proves that, when applied on surface cut decompositions, dynamic programming
runs in 2^{O(k)} n steps. That way, we considerably extend the class of
problems that can be solved in running times with a single-exponential
dependence on branchwidth and unify/improve most previous results in this
direction.
|
[
{
"version": "v1",
"created": "Wed, 13 Apr 2011 13:32:08 GMT"
},
{
"version": "v2",
"created": "Thu, 14 Apr 2011 09:41:52 GMT"
},
{
"version": "v3",
"created": "Fri, 15 Apr 2011 20:16:42 GMT"
},
{
"version": "v4",
"created": "Mon, 25 Apr 2011 16:03:53 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Rué",
"Juanjo",
""
],
[
"Sau",
"Ignasi",
""
],
[
"Thilikos",
"Dimitrios M.",
""
]
] |
new_dataset
| 0.994172 |
1104.2547
|
Mingqiang Li
|
Mingqiang Li and Jiwu Shu
|
C-Codes: Cyclic Lowest-Density MDS Array Codes Constructed Using
Starters for RAID 6
|
A revised version submitted to Designs, Codes and Cryptography for a
second round of review. 22 pages; A revised version of IBM Research Report
RC25218
| null | null | null |
cs.IT cs.DM math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The distance-3 cyclic lowest-density MDS array code (called the C-Code) is a
good candidate for RAID 6 because of its optimal storage efficiency, optimal
update complexity, optimal length, and cyclic symmetry. In this paper, the
underlying connections between C-Codes (or quasi-C-Codes) and starters in group
theory are revealed. It is shown that each C-Code (or quasi-C-Code) of length
$2n$ can be constructed using an even starter (or even multi-starter) in
$(Z_{2n},+)$. It is also shown that each C-Code (or quasi-C-Code) has a twin
C-Code (or quasi-C-Code). Then, four infinite families (three of which are new)
of C-Codes of length $p-1$ are constructed, where $p$ is a prime. Besides the
family of length $p-1$, C-Codes for some sporadic even lengths are also
presented. Even so, there are still some even lengths (such as 8) for which
C-Codes do not exist. To cover this limitation, two infinite families (one of
which is new) of quasi-C-Codes of length $2(p-1)$ are constructed for these
even lengths.
|
[
{
"version": "v1",
"created": "Wed, 13 Apr 2011 16:51:36 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Nov 2011 15:58:28 GMT"
},
{
"version": "v3",
"created": "Thu, 1 Mar 2012 02:45:34 GMT"
},
{
"version": "v4",
"created": "Sat, 24 Mar 2012 16:46:18 GMT"
},
{
"version": "v5",
"created": "Fri, 24 Aug 2012 19:16:13 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Li",
"Mingqiang",
""
],
[
"Shu",
"Jiwu",
""
]
] |
new_dataset
| 0.999661 |
1104.2809
|
Matthew Patitz
|
Bin Fu and Matthew J. Patitz and Robert T. Schweller and Bobby Sheline
|
Self-Assembly with Geometric Tiles
| null | null | null | null |
cs.CG cs.CC cs.DS cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work we propose a generalization of Winfree's abstract Tile Assembly
Model (aTAM) in which tile types are assigned rigid shapes, or geometries,
along each tile face. We examine the number of distinct tile types needed to
assemble shapes within this model, the temperature required for efficient
assembly, and the problem of designing compact geometric faces to meet given
compatibility specifications. Our results show a dramatic decrease in the
number of tile types needed to assemble $n \times n$ squares to
$\Theta(\sqrt{\log n})$ at temperature 1 for the most simple model which meets
a lower bound from Kolmogorov complexity, and $O(\log\log n)$ in a model in
which tile aggregates must move together through obstacle free paths within the
plane. This stands in contrast to the $\Theta(\log n / \log\log n)$ tile types
at temperature 2 needed in the basic aTAM. We also provide a general method for
simulating a large and computationally universal class of temperature 2 aTAM
systems with geometric tiles at temperature 1. Finally, we consider the problem
of computing a set of compact geometric faces for a tile system to implement a
given set of compatibility specifications. We show a number of bounds on the
complexity of geometry size needed for various classes of compatibility
specifications, many of which we directly apply to our tile assembly results to
achieve non-trivial reductions in geometry size.
|
[
{
"version": "v1",
"created": "Thu, 14 Apr 2011 15:46:11 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Fu",
"Bin",
""
],
[
"Patitz",
"Matthew J.",
""
],
[
"Schweller",
"Robert T.",
""
],
[
"Sheline",
"Bobby",
""
]
] |
new_dataset
| 0.991767 |
1104.4044
|
Mathilde Noual
|
Mathilde Noual
|
General Iteration graphs and Boolean automata circuits
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article is set in the field of regulation networks modeled by discrete
dynamical systems. It focuses on Boolean automata networks. In such networks,
there are many ways to update the states of every element. When this is done
deterministically, at each time step of a discretised time flow and according
to a predefined order, we say that the network is updated according to
block-sequential update schedule (blocks of elements are updated sequentially
while, within each block, the elements are updated synchronously). Many
studies, for the sake of simplicity and with some biologically motivated
reasons, have concentrated on networks updated with one particular
block-sequential update schedule (more often the synchronous/parallel update
schedule or the sequential update schedules). The aim of this paper is to give
an argument formally proven and inspired by biological considerations in favour
of the fact that the choice of a particular update schedule does not matter so
much in terms of the possible and likely dynamical behaviours that networks may
display.
|
[
{
"version": "v1",
"created": "Wed, 20 Apr 2011 14:46:38 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Noual",
"Mathilde",
""
]
] |
new_dataset
| 0.98137 |
1104.4137
|
Giovanni Viglietta
|
Giovanni Viglietta
|
Searching Polyhedra by Rotating Half-Planes
|
45 pages, 26 figures
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Searchlight Scheduling Problem was first studied in 2D polygons, where
the goal is for point guards in fixed positions to rotate searchlights to catch
an evasive intruder. Here the problem is extended to 3D polyhedra, with the
guards now boundary segments who rotate half-planes of illumination. After
carefully detailing the 3D model, several results are established. The first is
a nearly direct extension of the planar one-way sweep strategy using what we
call exhaustive guards, a generalization that succeeds despite there being no
well-defined notion in 3D of planar "clockwise rotation". Next follow two
results: every polyhedron with r>0 reflex edges can be searched by at most r^2
suitably placed guards, whereas just r guards suffice if the polyhedron is
orthogonal. (Minimizing the number of guards to search a given polyhedron is
easily seen to be NP-hard.) Finally we show that deciding whether a given set
of guards has a successful search schedule is strongly NP-hard, and that
deciding if a given target area is searchable at all is strongly PSPACE-hard,
even for orthogonal polyhedra. A number of peripheral results are proved en
route to these central theorems, and several open problems remain for future
work.
|
[
{
"version": "v1",
"created": "Wed, 20 Apr 2011 22:26:26 GMT"
},
{
"version": "v2",
"created": "Mon, 25 Apr 2011 21:27:37 GMT"
},
{
"version": "v3",
"created": "Sat, 30 Apr 2011 05:29:30 GMT"
},
{
"version": "v4",
"created": "Mon, 24 Oct 2011 07:05:57 GMT"
},
{
"version": "v5",
"created": "Tue, 20 Dec 2011 18:18:02 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Viglietta",
"Giovanni",
""
]
] |
new_dataset
| 0.983539 |
1105.0903
|
Georgios Zervas
|
John W. Byers, Michael Mitzenmacher, Michalis Potamias, and Georgios
Zervas
|
A Month in the Life of Groupon
|
6 pages
| null |
10.1016/j.elerap.2012.11.006
| null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Groupon has become the latest Internet sensation, providing daily deals to
customers in the form of discount offers for restaurants, ticketed events,
appliances, services, and other items. We undertake a study of the economics of
daily deals on the web, based on a dataset we compiled by monitoring Groupon
over several weeks. We use our dataset to characterize Groupon deal purchases,
and to glean insights about Groupon's operational strategy. Our focus is on
purchase incentives. For the primary purchase incentive, price, our regression
model indicates that demand for coupons is relatively inelastic, allowing room
for price-based revenue optimization. More interestingly, mining our dataset,
we find evidence that Groupon customers are sensitive to other, "soft",
incentives, e.g., deal scheduling and duration, deal featuring, and limited
inventory. Our analysis points to the importance of considering incentives
other than price in optimizing deal sites and similar systems.
|
[
{
"version": "v1",
"created": "Wed, 4 May 2011 19:25:21 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Byers",
"John W.",
""
],
[
"Mitzenmacher",
"Michael",
""
],
[
"Potamias",
"Michalis",
""
],
[
"Zervas",
"Georgios",
""
]
] |
new_dataset
| 0.999817 |
1105.2447
|
Gabriele D'Angelo
|
Gabriele D'Angelo and Stefano Ferretti
|
LUNES: Agent-based Simulation of P2P Systems (Extended Version)
|
Proceedings of the International Workshop on Modeling and Simulation
of Peer-to-Peer Architectures and Systems (MOSPAS 2011). As part of the 2011
International Conference on High Performance Computing and Simulation (HPCS
2011)
| null |
10.1109/HPCSim.2011.5999879
| null |
cs.DC cs.MA cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present LUNES, an agent-based Large Unstructured NEtwork Simulator, which
allows to simulate complex networks composed of a high number of nodes. LUNES
is modular, since it splits the three phases of network topology creation,
protocol simulation and performance evaluation. This permits to easily
integrate external software tools into the main software architecture. The
simulation of the interaction protocols among network nodes is performed via a
simulation middleware that supports both the sequential and the
parallel/distributed simulation approaches. In the latter case, a specific
mechanism for the communication overhead-reduction is used; this guarantees
high levels of performance and scalability. To demonstrate the efficiency of
LUNES, we test the simulator with gossip protocols executed on top of networks
(representing peer-to-peer overlays), generated with different topologies.
Results demonstrate the effectiveness of the proposed approach.
|
[
{
"version": "v1",
"created": "Thu, 12 May 2011 12:26:40 GMT"
},
{
"version": "v2",
"created": "Thu, 27 Dec 2012 08:58:52 GMT"
},
{
"version": "v3",
"created": "Mon, 28 Jul 2014 09:38:29 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"D'Angelo",
"Gabriele",
""
],
[
"Ferretti",
"Stefano",
""
]
] |
new_dataset
| 0.999633 |
1105.3144
|
Lu Lu
|
Lu Lu and Soung Chang Liew
|
Asynchronous Physical-layer Network Coding
|
Full length version of APNC
|
IEEE Transactions on Wireless Communications, 2012
|
10.1109/TWC.2011.120911.111067
| null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A key issue in physical-layer network coding (PNC) is how to deal with the
asynchrony between signals transmitted by multiple transmitters. That is,
symbols transmitted by different transmitters could arrive at the receiver with
symbol misalignment as well as relative carrier-phase offset. A second
important issue is how to integrate channel coding with PNC to achieve reliable
communication. This paper investigates these two issues and makes the following
contributions: 1) We propose and investigate a general framework for decoding
at the receiver based on belief propagation (BP). The framework can effectively
deal with symbol and phase asynchronies while incorporating channel coding at
the same time. 2) For unchannel-coded PNC, we show that for BPSK and QPSK
modulations, our BP method can significantly reduce the asynchrony penalties
compared with prior methods. 3) For unchannel-coded PNC, with half symbol
offset between the transmitters, our BP method can drastically reduce the
performance penalty due to phase asynchrony, from more than 6 dB to no more
than 1 dB. 4) For channel-coded PNC, with our BP method, both symbol and phase
asynchronies actually improve the system performance compared with the
perfectly synchronous case. Furthermore, the performance spread due to
different combinations of symbol and phase offsets between the transmitters in
channel-coded PNC is only around 1 dB. The implication of 3) is that if we
could control the symbol arrival times at the receiver, it would be
advantageous to deliberately introduce a half symbol offset in unchannel-coded
PNC. The implication of 4) is that when channel coding is used, symbol and
phase asynchronies are not major performance concerns in PNC.
|
[
{
"version": "v1",
"created": "Mon, 16 May 2011 16:48:04 GMT"
},
{
"version": "v2",
"created": "Thu, 19 May 2011 07:59:13 GMT"
},
{
"version": "v3",
"created": "Sat, 21 May 2011 12:13:04 GMT"
},
{
"version": "v4",
"created": "Sun, 5 Jun 2011 13:34:38 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Lu",
"Lu",
""
],
[
"Liew",
"Soung Chang",
""
]
] |
new_dataset
| 0.992228 |
1105.3486
|
Ladislau B\"ol\"oni
|
Ladislau B\"ol\"oni
|
Xapagy: a cognitive architecture for narrative reasoning
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the Xapagy cognitive architecture: a software system designed to
perform narrative reasoning. The architecture has been designed from scratch to
model and mimic the activities performed by humans when witnessing, reading,
recalling, narrating and talking about stories.
|
[
{
"version": "v1",
"created": "Tue, 17 May 2011 20:28:31 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Bölöni",
"Ladislau",
""
]
] |
new_dataset
| 0.999472 |
1105.3977
|
Pei Liu
|
Pei Liu, Chun Nie, Thanasis Korakis, Elza Erkip, Shivendra Panwar,
Francesco Verde, Anna Scaglione
|
STiCMAC: A MAC Protocol for Robust Space-Time Coding in Cooperative
Wireless LANs
|
This paper is a revised version of a paper with the same name
submitted to IEEE Transaction on Wireless Communications. STiCMAC protocol
with RTS/CTS turned off is presented in the appendix of this draft
| null |
10.1109/TWC.2012.020712.101900
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Relay-assisted cooperative wireless communication has been shown to have
significant performance gains over the legacy direct transmission scheme.
Compared with single relay based cooperation schemes, utilizing multiple relays
further improves the reliability and rate of transmissions. Distributed
space-time coding (DSTC), as one of the schemes to utilize multiple relays,
requires tight coordination between relays and does not perform well in a
distributed environment with mobility. In this paper, a cooperative medium
access control (MAC) layer protocol, called \emph{STiCMAC}, is designed to
allow multiple relays to transmit at the same time in an IEEE 802.11 network.
The transmission is based on a novel DSTC scheme called \emph{randomized
distributed space-time coding} (\emph{R-DSTC}), which requires minimum
coordination. Unlike conventional cooperation schemes that pick nodes with good
links, \emph{STiCMAC} picks a \emph{transmission mode} that could most improve
the end-to-end data rate. Any station that correctly receives from the source
can act as a relay and participate in forwarding. The MAC protocol is
implemented in a fully decentralized manner and is able to opportunistically
recruit relays on the fly, thus making it \emph{robust} to channel variations
and user mobility. Simulation results show that the network capacity and delay
performance are greatly improved, especially in a mobile environment.
|
[
{
"version": "v1",
"created": "Thu, 19 May 2011 20:01:44 GMT"
},
{
"version": "v2",
"created": "Wed, 21 Sep 2011 15:37:09 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Liu",
"Pei",
""
],
[
"Nie",
"Chun",
""
],
[
"Korakis",
"Thanasis",
""
],
[
"Erkip",
"Elza",
""
],
[
"Panwar",
"Shivendra",
""
],
[
"Verde",
"Francesco",
""
],
[
"Scaglione",
"Anna",
""
]
] |
new_dataset
| 0.999574 |
1106.3402
|
Anas Chaaban
|
Anas Chaaban and Aydin Sezgin
|
The Capacity Region of the Linear Shift Deterministic Y-Channel
|
to appear in ISIT 2011
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The linear shift deterministic Y-channel is studied. That is, we have three
users and one relay, where each user wishes to broadcast one message to each
other user via the relay, resulting in a multi-way relaying setup. The cut-set
bounds for this setup are shown to be not sufficient to characterize its
capacity region. New upper bounds are derived, which when combined with the
cut-set bounds provide an outer bound on the capacity region. It is shown that
this outer bound is achievable, and as a result, the capacity region of the
linear shift deterministic Y-channel is characterized.
|
[
{
"version": "v1",
"created": "Fri, 17 Jun 2011 07:24:14 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Chaaban",
"Anas",
""
],
[
"Sezgin",
"Aydin",
""
]
] |
new_dataset
| 0.976996 |
1106.5039
|
Mai Vu
|
Mai Vu
|
The Capacity of MIMO Channels with Per-Antenna Power Constraint
|
26 pages, 5 figures, submitted for publication
| null | null | null |
cs.IT math.IT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We establish the optimal input signaling and the capacity of MIMO channels
under per-antenna power constraint. While admitting a linear eigenbeam
structure, the optimal input is no longer diagonalizable by the channel right
singular vectors as with sum power constraint. We formulate the capacity
optimization as an SDP problem and solve in closed-form the optimal input
covariance as a function of the dual variable. We then design an efficient
algorithm to find this optimal input signaling for all channel sizes. The
proposed algorithm allows for straightforward implementation in practical
systems in real time. Simulation results show that with equal constraint per
antenna, capacity with per-antenna power can be close to capacity with sum
power, but as the constraint becomes more skew, the two capacities diverge.
Forcing input eigenbeams to match the channel right singular vectors achieves
no improvement over independent signaling and can even be detrimental to
capacity.
|
[
{
"version": "v1",
"created": "Fri, 24 Jun 2011 19:14:33 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Vu",
"Mai",
""
]
] |
new_dataset
| 0.996199 |
1107.0390
|
Ishay Haviv
|
Ishay Haviv and Michael Langberg
|
On Linear Index Coding for Random Graphs
|
16 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A sender wishes to broadcast an n character word x in F^n (for a field F) to
n receivers R_1,...,R_n. Every receiver has some side information on x
consisting of a subset of the characters of x. The side information of the
receivers is represented by a graph G on n vertices in which {i,j} is an edge
if R_i knows x_j. In the index coding problem the goal is to encode x using a
minimum number of characters in F in a way that enables every R_i to retrieve
the ith character x_i using the encoded message and the side information. An
index code is linear if the encoding is linear, and in this case the minimum
possible length is known to be equal to a graph parameter called minrank
(Bar-Yossef et al., FOCS'06). Several bounds on the minimum length of an index
code for side information graphs G were shown in the study of index coding.
However, the minimum length of an index code for the random graph G(n,p) is far
from being understood. In this paper we initiate the study of the typical
minimum length of a linear index code for G(n,p) over a field F. First, we
prove that for every constant size field F and a constant p, the minimum length
of a linear index code for G(n,p) over F is almost surely Omega(\sqrt{n}).
Second, we introduce and study the following two restricted models of index
coding: 1. A locally decodable index code is an index code in which the
receivers are allowed to query at most q characters from the encoded message.
2. A low density index code is a linear index code in which every character of
the word x affects at most q characters in the encoded message. Equivalently,
it is a linear code whose generator matrix has at most q nonzero entries in
each row.
|
[
{
"version": "v1",
"created": "Sat, 2 Jul 2011 15:55:19 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Haviv",
"Ishay",
""
],
[
"Langberg",
"Michael",
""
]
] |
new_dataset
| 0.963547 |
1107.1535
|
Aria Ghasemian Sahebi
|
Aria G. Sahebi and S. Sandeep Pradhan
|
Multilevel Polarization of Polar Codes Over Arbitrary Discrete
Memoryless Channels
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is shown that polar codes achieve the symmetric capacity of discrete
memoryless channels with arbitrary input alphabet sizes. It is shown that in
general, channel polarization happens in several, rather than only two levels
so that the synthesized channels are either useless, perfect or "partially
perfect". Any subset of the channel input alphabet which is closed under
addition, induces a coset partition of the alphabet through its shifts. For any
such partition of the input alphabet, there exists a corresponding partially
perfect channel whose outputs uniquely determine the coset to which the channel
input belongs. By a slight modification of the encoding and decoding rules, it
is shown that perfect transmission of certain information symbols over
partially perfect channels is possible. Our result is general regarding both
the cardinality and the algebraic structure of the channel input alphabet; i.e
we show that for any channel input alphabet size and any Abelian group
structure on the alphabet, polar codes are optimal. It is also shown through an
example that polar codes when considered as group/coset codes, do not achieve
the capacity achievable using coset codes over arbitrary channels.
|
[
{
"version": "v1",
"created": "Thu, 7 Jul 2011 23:41:33 GMT"
},
{
"version": "v2",
"created": "Mon, 25 Jul 2011 00:17:28 GMT"
},
{
"version": "v3",
"created": "Fri, 1 Jun 2012 23:00:08 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Sahebi",
"Aria G.",
""
],
[
"Pradhan",
"S. Sandeep",
""
]
] |
new_dataset
| 0.999324 |
1107.1829
|
Ka Hung Hui
|
Ka Hung Hui, Dongning Guo and Randall A. Berry
|
Medium Access Control for Wireless Networks with Peer-to-Peer State
Exchange
|
12 pages, 17 figures, submitted to IEEE Transactions on Networking
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed medium access control (MAC) protocols are proposed for wireless
networks assuming that one-hop peers can periodically exchange a small amount
of state information. Each station maintains a state and makes state
transitions and transmission decisions based on its state and recent state
information collected from its one-hop peers. A station can adapt its packet
length and the size of its state space to the amount of traffic in its
neighborhood. It is shown that these protocols converge to a steady state,
where stations take turns to transmit in each neighborhood without collision.
In other words, an efficient time-division multiple access (TDMA) like schedule
is formed in a distributed manner, as long as the topology of the network
remains static or changes slowly with respect to the execution of the protocol.
|
[
{
"version": "v1",
"created": "Sun, 10 Jul 2011 03:47:17 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Hui",
"Ka Hung",
""
],
[
"Guo",
"Dongning",
""
],
[
"Berry",
"Randall A.",
""
]
] |
new_dataset
| 0.99965 |
1108.1522
|
Fanggang Wang
|
Fanggang Wang, Soung Chang Liew, Dongning Guo
|
Wireless MIMO Switching with Zero-forcing Relaying and Network-coded
Relaying
|
This version is to appear in IEEE Journal on Selected Areas in
Communications later in 2012
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A wireless relay with multiple antennas is called a
multiple-input-multiple-output (MIMO) switch if it maps its input links to its
output links using "precode-and-forward." Namely, the MIMO switch precodes the
received signal vector in the uplink using some matrix for transmission in the
downlink. This paper studies the scenario of $K$ stations and a MIMO switch,
which has full channel state information. The precoder at the MIMO switch is
either a zero-forcing matrix or a network-coded matrix. With the zero-forcing
precoder, each destination station receives only its desired signal with
enhanced noise but no interference. With the network-coded precoder, each
station receives not only its desired signal and noise, but possibly also
self-interference, which can be perfectly canceled. Precoder design for
optimizing the received signal-to-noise ratios at the destinations is
investigated. For zero-forcing relaying, the problem is solved in closed form
in the two-user case, whereas in the case of more users, efficient algorithms
are proposed and shown to be close to what can be achieved by extensive random
search. For network-coded relaying, we present efficient iterative algorithms
that can boost the throughput further.
|
[
{
"version": "v1",
"created": "Sun, 7 Aug 2011 02:42:26 GMT"
},
{
"version": "v2",
"created": "Sat, 13 Aug 2011 14:46:51 GMT"
},
{
"version": "v3",
"created": "Sun, 17 Jun 2012 16:05:04 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Wang",
"Fanggang",
""
],
[
"Liew",
"Soung Chang",
""
],
[
"Guo",
"Dongning",
""
]
] |
new_dataset
| 0.993947 |
1108.5586
|
Petra Hofstedt
|
Denny Schneeweiss and Petra Hofstedt
|
FdConfig: A Constraint-Based Interactive Product Configurator
|
19th International Conference on Applications of Declarative
Programming and Knowledge Management (INAP 2011)
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a constraint-based approach to interactive product configuration.
Our configurator tool FdConfig is based on feature models for the
representation of the product domain. Such models can be directly mapped into
constraint satisfaction problems and dealt with by appropriate constraint
solvers. During the interactive configuration process the user generates new
constraints as a result of his configuration decisions and even may retract
constraints posted earlier. We discuss the configuration process, explain the
underlying techniques and show optimizations.
|
[
{
"version": "v1",
"created": "Mon, 29 Aug 2011 14:55:47 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Schneeweiss",
"Denny",
""
],
[
"Hofstedt",
"Petra",
""
]
] |
new_dataset
| 0.986843 |
1109.0628
|
Chunming Tang
|
Baocheng Wang, Chunming Tang, Yanfeng Qi, Yixian Yang, Maozhi Xu
|
The Weight Distributions of Cyclic Codes and Elliptic Curves
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic codes with two zeros and their dual codes as a practically and
theoretically interesting class of linear codes, have been studied for many
years. However, the weight distributions of cyclic codes are difficult to
determine. From elliptic curves, this paper determines the weight distributions
of dual codes of cyclic codes with two zeros for a few more cases.
|
[
{
"version": "v1",
"created": "Sat, 3 Sep 2011 15:30:25 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Wang",
"Baocheng",
""
],
[
"Tang",
"Chunming",
""
],
[
"Qi",
"Yanfeng",
""
],
[
"Yang",
"Yixian",
""
],
[
"Xu",
"Maozhi",
""
]
] |
new_dataset
| 0.999592 |
1109.3687
|
Josef Urban
|
Jesse Alama, Lionel Mamane, Josef Urban
|
Dependencies in Formal Mathematics: Applications and Extraction for Coq
and Mizar
| null | null | null | null |
cs.DL cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two methods for extracting detailed formal dependencies from the Coq and
Mizar system are presented and compared. The methods are used for dependency
extraction from two large mathematical repositories: the Coq Repository at
Nijmegen and the Mizar Mathematical Library. Several applications of the
detailed dependency analysis are described and proposed. Motivated by the
different applications, we discuss the various kinds of dependencies that we
are interested in,and the suitability of various dependency extraction methods.
|
[
{
"version": "v1",
"created": "Fri, 16 Sep 2011 18:25:18 GMT"
},
{
"version": "v2",
"created": "Fri, 16 Mar 2012 19:20:02 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Alama",
"Jesse",
""
],
[
"Mamane",
"Lionel",
""
],
[
"Urban",
"Josef",
""
]
] |
new_dataset
| 0.981155 |
1109.3791
|
Fangfei Zhou
|
Fangfei Zhou, Liang Zhang, Eric Franco, Richard Revis, Alan Mislove,
Ravi Sundaram
|
WebCloud: Recruiting web browsers for content distribution
|
This paper is withdraw by the author because we don't want to make it
publicly available for now
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We are at the beginning of a shift in how content is created and exchanged
over the web. While content was previously created primarily by a small set of
entities, today, individual users -- empowered by devices like digital cameras
and services like online social networks -- are creating content that
represents a significant fraction of Internet traffic. As a result, content
today is increasingly generated and exchanged at the edge of the network.
Unfortunately, the existing techniques and infrastructure that are still used
to serve this content, such as centralized content distribution networks, are
ill-suited for these new patterns of content exchange. In this paper, we take a
first step towards addressing this situation by introducing WebCloud, a content
distribution system for online social networking sites that works by re-
purposing web browsers to help serve content. In other words, when a user
browses content, WebCloud tries to fetch it from one of that user's friend's
browsers, instead of from the social networking site. The result is a more
direct exchange of content ; essentially, WebCloud leverages the spatial and
temporal locality of interest between social network users. Because WebCloud is
built using techniques already present in many web browsers, it can be applied
today to many social networking sites. We demonstrate the practicality of
WebCloud with microbenchmarks, simulations, and a prototype deployment.
|
[
{
"version": "v1",
"created": "Sat, 17 Sep 2011 15:28:07 GMT"
},
{
"version": "v2",
"created": "Wed, 21 Sep 2011 21:12:24 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Zhou",
"Fangfei",
""
],
[
"Zhang",
"Liang",
""
],
[
"Franco",
"Eric",
""
],
[
"Revis",
"Richard",
""
],
[
"Mislove",
"Alan",
""
],
[
"Sundaram",
"Ravi",
""
]
] |
new_dataset
| 0.999581 |
1109.4179
|
Negin Golrezaei
|
Karthikeyan Shanmugam, Negin Golrezaei, Alexandros G. Dimakis, Andreas
F. Molisch, and Giuseppe Caire
|
FemtoCaching: Wireless Video Content Delivery through Distributed
Caching Helpers
|
15 pages, 6 figures
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Video on-demand streaming from Internet-based servers is becoming one of the
most important services offered by wireless networks today. In order to improve
the area spectral efficiency of video transmission in cellular systems, small
cells heterogeneous architectures (e.g., femtocells, WiFi off-loading) are
being proposed, such that video traffic to nomadic users can be handled by
short-range links to the nearest small cell access points (referred to as
"helpers"). As the helper deployment density increases, the backhaul capacity
becomes the system bottleneck. In order to alleviate such bottleneck we propose
a system where helpers with low-rate backhaul but high storage capacity cache
popular video files. Files not available from helpers are transmitted by the
cellular base station. We analyze the optimum way of assigning files to the
helpers, in order to minimize the expected downloading time for files. We
distinguish between the uncoded case (where only complete files are stored) and
the coded case, where segments of Fountain-encoded versions of the video files
are stored at helpers. We show that the uncoded optimum file assignment is
NP-hard, and develop a greedy strategy that is provably within a factor 2 of
the optimum. Further, for a special case we provide an efficient algorithm
achieving a provably better approximation ratio of $1-(1-1/d)^d$, where $d$ is
the maximum number of helpers a user can be connected to. We also show that the
coded optimum cache assignment problem is convex that can be further reduced to
a linear program. We present numerical results comparing the proposed schemes.
|
[
{
"version": "v1",
"created": "Mon, 19 Sep 2011 22:01:40 GMT"
},
{
"version": "v2",
"created": "Sat, 7 Apr 2012 01:20:40 GMT"
},
{
"version": "v3",
"created": "Sun, 2 Jun 2013 01:18:59 GMT"
},
{
"version": "v4",
"created": "Mon, 16 Sep 2013 05:00:04 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Shanmugam",
"Karthikeyan",
""
],
[
"Golrezaei",
"Negin",
""
],
[
"Dimakis",
"Alexandros G.",
""
],
[
"Molisch",
"Andreas F.",
""
],
[
"Caire",
"Giuseppe",
""
]
] |
new_dataset
| 0.997354 |
1110.1221
|
Ahmet Kara
|
Ahmet Kara, Thomas Schwentick, Tony Tan
|
Feasible Automata for Two-Variable Logic with Successor on Data Words
|
21 pages
| null | null | null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce an automata model for data words, that is words that carry at
each position a symbol from a finite alphabet and a value from an unbounded
data domain. The model is (semantically) a restriction of data automata,
introduced by Bojanczyk, et. al. in 2006, therefore it is called weak data
automata. It is strictly less expressive than data automata and the expressive
power is incomparable with register automata. The expressive power of weak data
automata corresponds exactly to existential monadic second order logic with
successor +1 and data value equality \sim, EMSO2(+1,\sim). It follows from
previous work, David, et. al. in 2010, that the nonemptiness problem for weak
data automata can be decided in 2-NEXPTIME. Furthermore, we study weak B\"uchi
automata on data omega-strings. They can be characterized by the extension of
EMSO2(+1,\sim) with existential quantifiers for infinite sets. Finally, the
same complexity bound for its nonemptiness problem is established by a
nondeterministic polynomial time reduction to the nonemptiness problem of weak
data automata.
|
[
{
"version": "v1",
"created": "Thu, 6 Oct 2011 10:54:25 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Kara",
"Ahmet",
""
],
[
"Schwentick",
"Thomas",
""
],
[
"Tan",
"Tony",
""
]
] |
new_dataset
| 0.999448 |
1110.2480
|
Mary Schurgot
|
Mary R. Schurgot, Cristina Comaniciu, Katia Jaffr\`es-Runser
|
Beyond Traditional DTN Routing: Social Networks for Opportunistic
Communication
|
8 pages, 4 figures, 1 table
|
Schurgot, M.R.; Comaniciu, C.; Jaffres-Runser, K.; , "Beyond
Traditional DTN Routing: Social Networks for Opportunistic Communication,"
IEEE Communications Magazine, vol.50, no.7, pp.155-162, July 2012
|
10.1109/MCOM.2012.6231292
| null |
cs.NI cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article examines the evolution of routing protocols for intermittently
connected ad hoc networks and discusses the trend toward social-based routing
protocols. A survey of current routing solutions is presented, where routing
protocols for opportunistic networks are classified based on the network graph
employed. The need to capture performance tradeoffs from a multi-objective
perspective is highlighted.
|
[
{
"version": "v1",
"created": "Tue, 11 Oct 2011 19:56:20 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Sep 2012 21:19:55 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Schurgot",
"Mary R.",
""
],
[
"Comaniciu",
"Cristina",
""
],
[
"Jaffrès-Runser",
"Katia",
""
]
] |
new_dataset
| 0.950889 |
1111.3439
|
Zoltan Esik
|
Zoltan Esik, Satoshi Okawa
|
On context-free languages of scattered words
| null | null | null | null |
cs.FL cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is known that if a B\"uchi context-free language (BCFL) consists of
scattered words, then there is an integer $n$, depending only on the language,
such that the Hausdorff rank of each word in the language is bounded by $n$.
Every BCFL is a M\"uller context-free language (MCFL). In the first part of the
paper, we prove that an MCFL of scattered words is a BCFL iff the rank of every
word in the language is bounded by an integer depending only on the language.
Then we establish operational characterizations of the BCFLs of well-ordered
and scattered words. We prove that a language is a BCFL consisting of
well-ordered words iff it can be generated from the singleton languages
containing the letters of the alphabet by substitution into ordinary
context-free languages and the $\omega$-power operation. We also establish a
corresponding result for BCFLs of scattered words and define expressions
denoting BCFLs of well-ordered and scattered words. In the final part of the
paper we give some applications.
|
[
{
"version": "v1",
"created": "Tue, 15 Nov 2011 07:02:14 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Esik",
"Zoltan",
""
],
[
"Okawa",
"Satoshi",
""
]
] |
new_dataset
| 0.999032 |
1111.3606
|
Hamid A. Toussi
|
Hamid A. Toussi
|
tym: Typed Matlab
|
Presented at University of Sistan and Baluchestan, 2011
| null | null | null |
cs.PL cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although, many scientists and engineers use Octave or MATLAB as their
preferred programming language, dynamic nature of these languages can lead to
slower running-time of programs written in these languages compared to programs
written in languages which are not as dynamic, like C, C++ and Fortran. In this
work we developed a translator for a new programming language (tym) which tries
to address performance issues, common in scientific programs, by adding new
constructs to a subset of Octave/MATLAB language. Our translator compiles
programs written in tym, to efficient C++ code.
|
[
{
"version": "v1",
"created": "Tue, 15 Nov 2011 18:32:29 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Jan 2013 19:28:21 GMT"
},
{
"version": "v3",
"created": "Thu, 12 Feb 2015 13:12:12 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Toussi",
"Hamid A.",
""
]
] |
new_dataset
| 0.99976 |
1112.0564
|
Ayan Chaudhury
|
Amlan Chakrabarti, Susmita Sur-Kolay, Ayan Chaudhury
|
Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph
Partitioning
| null | null | null | null |
cs.ET quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear Nearest Neighbor (LNN) synthesis in reversible circuits has emerged as
an important issue in terms of technological implementation for quantum
computation. The objective is to obtain a LNN architecture with minimum gate
cost. As achieving optimal synthesis is a hard problem, heuristic methods have
been proposed in recent literature. In this work we present a graph
partitioning based approach for LNN synthesis with reduction in circuit cost.
In particular, the number of SWAP gates required to convert a given gate-level
quantum circuit to its equivalent LNN configuration is minimized. Our algorithm
determines the reordering of indices of the qubit line(s) for both single
control and multiple controlled gates. Experimental results for placing the
target qubits of Multiple Controlled Toffoli (MCT) library of benchmark
circuits show a significant reduction in gate count and quantum gate cost
compared to those of related research works.
|
[
{
"version": "v1",
"created": "Fri, 2 Dec 2011 16:30:08 GMT"
},
{
"version": "v2",
"created": "Thu, 27 Dec 2012 03:02:39 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Chakrabarti",
"Amlan",
""
],
[
"Sur-Kolay",
"Susmita",
""
],
[
"Chaudhury",
"Ayan",
""
]
] |
new_dataset
| 0.981376 |
1112.1158
|
Xi Fang
|
Xi Fang and Dejun Yang and Guoliang Xue
|
Wireless Communications and Networking Technologies for Smart Grid:
Paradigms and Challenges
|
7 pages, 6 figures, keywords: Smart grid, wireless communications,
wireless networking, smart home, microgrid, vehicle-to-grid, paradigm,
challenge, vision
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Smart grid, regarded as the next generation power grid, uses two-way flows of
electricity and information to create a widely distributed automated energy
delivery network. In this work we present our vision on smart grid from the
perspective of wireless communications and networking technologies. We present
wireless communication and networking paradigms for four typical scenarios in
the future smart grid and also point out the research challenges of the
wireless communication and networking technologies used in smart grid
|
[
{
"version": "v1",
"created": "Tue, 6 Dec 2011 04:55:32 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Fang",
"Xi",
""
],
[
"Yang",
"Dejun",
""
],
[
"Xue",
"Guoliang",
""
]
] |
new_dataset
| 0.964456 |
1112.1181
|
Hassan Halabian
|
Hassan Halabian, Ioannis Lambadaris, Chung-Horng Lung
|
On the Stability Region of Multi-Queue Multi-Server Queueing Systems
with Stationary Channel Distribution
|
5 pages, 2 figures, Proc. ISIT 2011
| null | null | null |
cs.IT cs.SY math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we characterize the stability region of multi-queue
multi-server (MQMS) queueing systems with stationary channel and packet arrival
processes. Toward this, the necessary and sufficient conditions for the
stability of the system are derived under general arrival processes with finite
first and second moments. We show that when the arrival processes are
stationary, the stability region form is a polytope for which we explicitly
find the coefficients of the linear inequalities which characterize the
stability region polytope.
|
[
{
"version": "v1",
"created": "Tue, 6 Dec 2011 07:47:01 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Halabian",
"Hassan",
""
],
[
"Lambadaris",
"Ioannis",
""
],
[
"Lung",
"Chung-Horng",
""
]
] |
new_dataset
| 0.968222 |
1112.1554
|
Tristan Crolard
|
Tristan Crolard and Emmanuel Polonowski
|
A program logic for higher-order procedural variables and non-local
jumps
| null | null | null |
TR-LACL-2011-4
|
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Relying on the formulae-as-types paradigm for classical logic, we define a
program logic for an imperative language with higher-order procedural variables
and non-local jumps. Then, we show how to derive a sound program logic for this
programming language. As a by-product, we obtain a non-dependent type system
which is more permissive than what is usually found in statically typed
imperative languages. As a generic example, we encode imperative versions of
delimited continuations operators shift and reset.
|
[
{
"version": "v1",
"created": "Wed, 7 Dec 2011 13:23:37 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Crolard",
"Tristan",
""
],
[
"Polonowski",
"Emmanuel",
""
]
] |
new_dataset
| 0.990019 |
1201.0946
|
Athanasios Kehagias
|
Athanasios Kehagias and Dieter Mitsche and Pawel Pralat
|
Cops and Invisible Robbers: the Cost of Drunkenness
| null | null | null | null |
cs.DM cs.GT cs.RO math.CO math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We examine a version of the Cops and Robber (CR) game in which the robber is
invisible, i.e., the cops do not know his location until they capture him.
Apparently this game (CiR) has received little attention in the CR literature.
We examine two variants: in the first the robber is adversarial (he actively
tries to avoid capture); in the second he is drunk (he performs a random walk).
Our goal in this paper is to study the invisible Cost of Drunkenness (iCOD),
which is defined as the ratio ct_i(G)/dct_i(G), with ct_i(G) and dct_i(G) being
the expected capture times in the adversarial and drunk CiR variants,
respectively. We show that these capture times are well defined, using game
theory for the adversarial case and partially observable Markov decision
processes (POMDP) for the drunk case. We give exact asymptotic values of iCOD
for several special graph families such as $d$-regular trees, give some bounds
for grids, and provide general upper and lower bounds for general classes of
graphs. We also give an infinite family of graphs showing that iCOD can be
arbitrarily close to any value in [2,infinty). Finally, we briefly examine one
more CiR variant, in which the robber is invisible and "infinitely fast"; we
argue that this variant is significantly different from the Graph Search game,
despite several similarities between the two games.
|
[
{
"version": "v1",
"created": "Wed, 4 Jan 2012 17:50:01 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Kehagias",
"Athanasios",
""
],
[
"Mitsche",
"Dieter",
""
],
[
"Pralat",
"Pawel",
""
]
] |
new_dataset
| 0.971725 |
1503.02675
|
Clemens Arth
|
Clemens Arth, Christian Pirchheim, Jonathan Ventura, Vincent Lepetit
|
Global 6DOF Pose Estimation from Untextured 2D City Models
|
9 pages excluding supplementary material
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by/3.0/
|
We propose a method for estimating the 3D pose for the camera of a mobile
device in outdoor conditions, using only an untextured 2D model. Previous
methods compute only a relative pose using a SLAM algorithm, or require many
registered images, which are cumbersome to acquire. By contrast, our method
returns an accurate, absolute camera pose in an absolute referential using
simple 2D+height maps, which are broadly available, to refine a first estimate
of the pose provided by the device's sensors. We show how to first estimate the
camera absolute orientation from straight line segments, and then how to
estimate the translation by aligning the 2D map with a semantic segmentation of
the input image. We demonstrate the robustness and accuracy of our approach on
a challenging dataset.
|
[
{
"version": "v1",
"created": "Mon, 9 Mar 2015 20:18:19 GMT"
},
{
"version": "v2",
"created": "Wed, 18 Mar 2015 12:11:35 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Arth",
"Clemens",
""
],
[
"Pirchheim",
"Christian",
""
],
[
"Ventura",
"Jonathan",
""
],
[
"Lepetit",
"Vincent",
""
]
] |
new_dataset
| 0.999296 |
1503.05269
|
Diana Maamari Diana Maamari
|
Diana Maamari, Natasha Devroye, Daniela Tuninetti
|
Coverage in mmWave Cellular Networks with Base station Cooperation
|
30 pages, 8 figures
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The presence of signal outage, due to shadowing and blockage, is expected to
be the main bottleneck in millimeter wave (mmWave) networks. Moreover, with the
anticipated vision that mmWave networks would have a dense deployment of base
stations, interference from strong line-of-sight base stations increases too,
thus further increasing the probability of outage. To address the issue of
reducing outage, this paper explores the possibility of base station
cooperation in the downlink of a mmWave heterogenous network. The main focus of
this work is showing that, in a stochastic geometry framework, cooperation from
randomly located base stations decreases outage probability. With the presumed
vision that less severe fading will be experienced due to highly directional
transmissions, one might expect that cooperation would increase the coverage
probability; our numerical examples suggest that is in fact the case. Coverage
probabilities are derived accounting for: different fading distributions,
antenna directionality and blockage. Numerical results suggest that coverage
with base station cooperation in dense mmWave systems and with no small scale
fading considerably exceeds coverage with no cooperation. In contrast, an
insignificant increase is reported when mmWave networks are less dense with a
high probability of signal blockage and with Rayleigh fading.
|
[
{
"version": "v1",
"created": "Wed, 18 Mar 2015 02:36:11 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Maamari",
"Diana",
""
],
[
"Devroye",
"Natasha",
""
],
[
"Tuninetti",
"Daniela",
""
]
] |
new_dataset
| 0.960705 |
1503.05271
|
Qinqin Chen
|
Jiadi Chen, Hang Long, Qiang Zheng, Minyao Xing, Wenbo Wang
|
An SMDP-based Resource Management Scheme for Distributed Cloud Systems
|
5 pages, 5 figures, conference
| null | null | null |
cs.NI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, the resource management problem in geographically distributed
cloud systems is considered. The Follow Me Cloud concept which enables service
migration across federated data centers (DCs) is adopted. Therefore, there are
two types of service requests to the DC, i.e., new requests (NRs) initiated in
the local service area and migration requests (MRs) generated when mobile users
move across service areas. A novel resource management scheme is proposed to
help the resource manager decide whether to accept the service requests (NRs or
MRs) or not and determine how much resources should be allocated to each
service (if accepted). The optimization objective is to maximize the average
system reward and keep the rejection probability of service requests under a
certain threshold. Numerical results indicate that the proposed scheme can
significantly improve the overall system utility as well as the user experience
compared with other resource management schemes.
|
[
{
"version": "v1",
"created": "Wed, 18 Mar 2015 02:47:58 GMT"
}
] | 2015-03-19T00:00:00 |
[
[
"Chen",
"Jiadi",
""
],
[
"Long",
"Hang",
""
],
[
"Zheng",
"Qiang",
""
],
[
"Xing",
"Minyao",
""
],
[
"Wang",
"Wenbo",
""
]
] |
new_dataset
| 0.997942 |
1101.4667
|
Adrian Dumitrescu
|
Adrian Dumitrescu and Minghui Jiang
|
Sweeping an oval to a vanishing point
|
9 pages, 4 figures
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a convex region in the plane, and a sweep-line as a tool, what is best
way to reduce the region to a single point by a sequence of sweeps? The problem
of sweeping points by orthogonal sweeps was first studied in [2]. Here we
consider the following \emph{slanted} variant of sweeping recently introduced
in [1]: In a single sweep, the sweep-line is placed at a start position
somewhere in the plane, then moved continuously according to a sweep vector
$\vec v$ (not necessarily orthogonal to the sweep-line) to another parallel end
position, and then lifted from the plane. The cost of a sequence of sweeps is
the sum of the lengths of the sweep vectors. The (optimal) sweeping cost of a
region is the infimum of the costs over all finite sweeping sequences for that
region. An optimal sweeping sequence for a region is one with a minimum total
cost, if it exists. Another parameter of interest is the number of sweeps.
We show that there exist convex regions for which the optimal sweeping cost
cannot be attained by two sweeps. This disproves a conjecture of Bousany,
Karker, O'Rourke, and Sparaco stating that two sweeps (with vectors along the
two adjacent sides of a minimum-perimeter enclosing parallelogram) always
suffice [1]. Moreover, we conjecture that for some convex regions, no finite
sweeping sequence is optimal. On the other hand, we show that both the 2-sweep
algorithm based on minimum-perimeter enclosing rectangle and the 2-sweep
algorithm based on minimum-perimeter enclosing parallelogram achieve a $4/\pi
\approx 1.27$ approximation in this sweeping model.
|
[
{
"version": "v1",
"created": "Mon, 24 Jan 2011 21:33:39 GMT"
}
] | 2015-03-18T00:00:00 |
[
[
"Dumitrescu",
"Adrian",
""
],
[
"Jiang",
"Minghui",
""
]
] |
new_dataset
| 0.97199 |
1101.5569
|
Piotr Jacek Puczynski
|
Piotr J. Puczynski
|
T2Script Programming Language
|
27 pages, 9 figures
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Event-driven programming is used in many fields of modern Computer Science.
In event-driven programming languages user interacts with a program by
triggering the events. We propose a new approach that we denote command-event
driven programming in which the user interacts with a program by means of
events and commands. We describe a new programming language, T2Script, which is
based on command-event driven paradigm. T2Script has been already implemented
and used in one of industrial products. We describe the rationale, basic
concepts and advanced programming techniques of new T2Script language. We
evaluate the new language and show what advantages and limitations it has.
|
[
{
"version": "v1",
"created": "Fri, 28 Jan 2011 16:42:00 GMT"
}
] | 2015-03-18T00:00:00 |
[
[
"Puczynski",
"Piotr J.",
""
]
] |
new_dataset
| 0.999288 |
1101.5830
|
Imdadullah Khan
|
Imdadullah Khan
|
Perfect matching in 3-uniform hypergraphs with large vertex degree
|
arXiv admin note: text overlap with arXiv:1101.5675
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A perfect matching in a 3-uniform hypergraph on $n=3k$ vertices is a subset
of $\frac{n}{3}$ disjoint edges. We prove that if $H$ is a 3-uniform hypergraph
on $n=3k$ vertices such that every vertex belongs to at least ${n-1\choose 2} -
{2n/3\choose 2}+1$ edges then $H$ contains a perfect matching. We give a
construction to show that this result is best possible.
|
[
{
"version": "v1",
"created": "Sun, 30 Jan 2011 23:05:17 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Feb 2011 10:36:41 GMT"
},
{
"version": "v3",
"created": "Sat, 7 Jul 2012 16:04:16 GMT"
}
] | 2015-03-18T00:00:00 |
[
[
"Khan",
"Imdadullah",
""
]
] |
new_dataset
| 0.992154 |
1102.0755
|
Min Li
|
Min Li, Osvaldo Simeone, Aylin Yener
|
Message and State Cooperation in a Relay Channel When the Relay Has
Strictly Causal State Information
|
6 pages, 3 figures, to appear in Information Theory and Applications
Workshop, February 2011
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A state-dependent relay channel is studied in which strictly causal channel
state information is available at the relay and no state information is
available at the source and destination. Source and relay are connected via two
unidirectional out-of-band orthogonal links of finite capacity, and a
state-dependent memoryless channel connects source and relay, on one side, and
the destination, on the other. Via the orthogonal links, the source can convey
information about the message to be delivered to the destination to the relay
while the relay can forward state information to the source. This exchange
enables cooperation between source and relay on both transmission of message
and state information to the destination. First, an achievable scheme, inspired
by noisy network coding, is proposed that exploits both message and state
cooperation. Next, based on the given achievable rate and appropriate upper
bounds, capacity results are identified for some special cases. Finally, a
Gaussian model is studied, along with corresponding numerical results that
illuminate the relative merits of state and message cooperation.
|
[
{
"version": "v1",
"created": "Thu, 3 Feb 2011 19:41:59 GMT"
}
] | 2015-03-18T00:00:00 |
[
[
"Li",
"Min",
""
],
[
"Simeone",
"Osvaldo",
""
],
[
"Yener",
"Aylin",
""
]
] |
new_dataset
| 0.999831 |
1102.0768
|
Min Li
|
Min Li, Osvaldo Simeone, Aylin Yener
|
Message and State Cooperation in a Relay Channel When Only the Relay
Knows the State
|
Submitted to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A state-dependent relay channel is studied in which strictly causal channel
state information is available at the relay and no state information is
available at the source and destination. The source and the relay are connected
via two unidirectional out-of-band orthogonal links of finite capacity, and a
state-dependent memoryless channel connects the source and the relay, on one
side, and the destination, on the other. Via the orthogonal links, the source
can convey information about the message to be delivered to the destination to
the relay while the relay can forward state information to the source. This
exchange enables cooperation between the source and the relay on transmission
of message and state information to the destination. First, two achievable
schemes are proposed that exploit both message and state cooperation. It is
shown that a transmission scheme inspired by noisy network coding performs
better than a strategy based on block Markov coding and backward decoding.
Next, based on the given achievable schemes and appropriate upper bounds,
capacity results are identified for some special cases. Finally, a Gaussian
model is studied, along with corresponding numerical results that illuminate
the relative merits of state and message cooperation.
|
[
{
"version": "v1",
"created": "Thu, 3 Feb 2011 20:21:45 GMT"
},
{
"version": "v2",
"created": "Sun, 13 Jul 2014 23:45:44 GMT"
}
] | 2015-03-18T00:00:00 |
[
[
"Li",
"Min",
""
],
[
"Simeone",
"Osvaldo",
""
],
[
"Yener",
"Aylin",
""
]
] |
new_dataset
| 0.99986 |
1102.1064
|
Sherif Sakr
|
Sherif Sakr and Mohammad Alomari
|
A Decade of Database Research Publications
| null | null | null | null |
cs.DL cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We analyze the database research publications of four major core database
technology conferences (SIGMOD, VLDB, ICDE, EDBT), two main theoretical
database conferences (PODS, ICDT) and three database journals (TODS, VLDB
Journal, TKDE) over a period of 10 years (2001 - 2010). Our analysis considers
only regular papers as we do not include short papers, demo papers, posters,
tutorials or panels into our statistics. We rank the research scholars
according to their number of publication in each conference/journal separately
and in combined. We also report about the growth in the number of research
publications and the size of the research community in the last decade.
|
[
{
"version": "v1",
"created": "Sat, 5 Feb 2011 11:52:53 GMT"
}
] | 2015-03-18T00:00:00 |
[
[
"Sakr",
"Sherif",
""
],
[
"Alomari",
"Mohammad",
""
]
] |
new_dataset
| 0.959447 |
1102.1408
|
Zhenghao Zhang
|
Zhenghao Zhang, Shuping Gong, Husheng Li, Changxing Pei
|
Time Stamp Attack on Wide Area Monitoring System in Smart Grid
|
This paper has been withdrawn by the author due to a crucial sign
error in derivation
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Security becomes an extremely important issue in smart grid. To maintain the
steady operation for smart power grid, massive measurement devices must be
allocated widely among the power grid. Previous studies are focused on false
data injection attack to the smart grid system. In practice, false data
injection attack is not easy to implement, since it is not easy to hack the
power grid data communication system. In this paper, we demonstrate that a
novel time stamp attack is a practical and dangerous attack scheme for smart
grid. Since most of measurement devices are equipped with global positioning
system (GPS) to provide the time information of measurements, it is highly
probable to attack the measurement system by spoofing the GPS. By employing the
real measurement data in North American Power Grid, simulation results
demonstrate the effectiveness of the time stamp attack on smart grid.
|
[
{
"version": "v1",
"created": "Mon, 7 Feb 2011 20:27:56 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Sep 2011 23:38:31 GMT"
}
] | 2015-03-18T00:00:00 |
[
[
"Zhang",
"Zhenghao",
""
],
[
"Gong",
"Shuping",
""
],
[
"Li",
"Husheng",
""
],
[
"Pei",
"Changxing",
""
]
] |
new_dataset
| 0.990977 |
1102.1609
|
Kenneth Shum
|
Kenneth W. Shum and Yuchong Hu
|
Exact Minimum-Repair-Bandwidth Cooperative Regenerating Codes for
Distributed Storage Systems
|
5 pages, 4 figures, presented at IEEE ISIT 2011
| null | null | null |
cs.IT cs.DC math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In order to provide high data reliability, distributed storage systems
disperse data with redundancy to multiple storage nodes. Regenerating codes is
a new class of erasure codes to introduce redundancy for the purpose of
improving the data repair performance in distributed storage. Most of the
studies on regenerating codes focus on the single-failure recovery, but it is
not uncommon to see two or more node failures at the same time in large storage
networks. To exploit the opportunity of repairing multiple failed nodes
simultaneously, a cooperative repair mechanism, in the sense that the nodes to
be repaired can exchange data among themselves, is investigated. A lower bound
on the repair-bandwidth for cooperative repair is derived and a construction of
a family of exact cooperative regenerating codes matching this lower bound is
presented.
|
[
{
"version": "v1",
"created": "Tue, 8 Feb 2011 14:11:58 GMT"
},
{
"version": "v2",
"created": "Wed, 11 May 2011 12:03:54 GMT"
},
{
"version": "v3",
"created": "Wed, 1 Jun 2011 03:56:38 GMT"
}
] | 2015-03-18T00:00:00 |
[
[
"Shum",
"Kenneth W.",
""
],
[
"Hu",
"Yuchong",
""
]
] |
new_dataset
| 0.971591 |
1503.01180
|
Chenhao Tan
|
Chenhao Tan and Lillian Lee
|
All Who Wander: On the Prevalence and Characteristics of Multi-community
Engagement
|
11 pages, data available at
https://chenhaot.com/pages/multi-community.html, Proceedings of WWW 2015
(updated references)
| null |
10.1145/2736277.2741661
| null |
cs.SI cs.CL physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although analyzing user behavior within individual communities is an active
and rich research domain, people usually interact with multiple communities
both on- and off-line. How do users act in such multi-community environments?
Although there are a host of intriguing aspects to this question, it has
received much less attention in the research community in comparison to the
intra-community case. In this paper, we examine three aspects of
multi-community engagement: the sequence of communities that users post to, the
language that users employ in those communities, and the feedback that users
receive, using longitudinal posting behavior on Reddit as our main data source,
and DBLP for auxiliary experiments. We also demonstrate the effectiveness of
features drawn from these aspects in predicting users' future level of
activity.
One might expect that a user's trajectory mimics the "settling-down" process
in real life: an initial exploration of sub-communities before settling down
into a few niches. However, we find that the users in our data continually post
in new communities; moreover, as time goes on, they post increasingly evenly
among a more diverse set of smaller communities. Interestingly, it seems that
users that eventually leave the community are "destined" to do so from the very
beginning, in the sense of showing significantly different "wandering" patterns
very early on in their trajectories; this finding has potentially important
design implications for community maintainers. Our multi-community perspective
also allows us to investigate the "situation vs. personality" debate from
language usage across different communities.
|
[
{
"version": "v1",
"created": "Wed, 4 Mar 2015 01:05:41 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Mar 2015 20:00:27 GMT"
}
] | 2015-03-18T00:00:00 |
[
[
"Tan",
"Chenhao",
""
],
[
"Lee",
"Lillian",
""
]
] |
new_dataset
| 0.974838 |
1503.05025
|
Mathieu Hoyrup
|
Mathieu Hoyrup
|
A Rice-like theorem for primitive recursive functions
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We provide an explicit characterization of the properties of primitive
recursive functions that are decidable or semi-decidable, given a primitive
recursive index for the function. The result is much more general as it applies
to any c.e. class of total computable functions. This is an analog of Rice and
Rice-Shapiro theorem, for restricted classes of total computable functions.
|
[
{
"version": "v1",
"created": "Tue, 17 Mar 2015 12:56:59 GMT"
}
] | 2015-03-18T00:00:00 |
[
[
"Hoyrup",
"Mathieu",
""
]
] |
new_dataset
| 0.991231 |
1001.4457
|
Nicolas Nisse
|
J\'er\'emie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vax\`es
|
Cop and robber games when the robber can hide and ride
| null |
SIAM J. Discrete Math. 25(2011) 333-359
| null |
INRIA-RR7178
|
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the classical cop and robber game, two players, the cop C and the robber
R, move alternatively along edges of a finite graph G. The cop captures the
robber if both players are on the same vertex at the same moment of time. A
graph G is called cop win if the cop always captures the robber after a finite
number of steps. Nowakowski, Winkler (1983) and Quilliot (1983) characterized
the cop-win graphs as graphs admitting a dismantling scheme. In this paper, we
characterize in a similar way the class CW(s,s') of cop-win graphs in the game
in which the cop and the robber move at different speeds s' and s, s'<= s. We
also establish some connections between cop-win graphs for this game with s'<s
and Gromov's hyperbolicity. In the particular case s'=1 and s=2, we prove that
the class of cop-win graphs is exactly the well-known class of dually chordal
graphs. We show that all classes CW(s,1), s>=3, coincide and we provide a
structural characterization of these graphs. We also investigate several
dismantling schemes necessary or sufficient for the cop-win graphs in the game
in which the robber is visible only every k moves for a fixed integer k>1. We
characterize the graphs which are cop-win for any value of k. Finally, we
consider the game where the cop wins if he is at distance at most 1 from the
robber and we characterize via a specific dismantling scheme the bipartite
graphs where a single cop wins in this game.
|
[
{
"version": "v1",
"created": "Mon, 25 Jan 2010 15:23:59 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Chalopin",
"Jérémie",
""
],
[
"Chepoi",
"Victor",
""
],
[
"Nisse",
"Nicolas",
""
],
[
"Vaxès",
"Yann",
""
]
] |
new_dataset
| 0.999553 |
1004.4804
|
Vadim E. Levit
|
Vadim E. Levit and Eugen Mandrescu
|
When G^2 is a Konig-Egervary graph?
|
6 pages, 4 figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The square of a graph G is the graph G^2 with the same vertex set as in G,
and an edge of G^2 is joining two distinct vertices, whenever the distance
between them in G is at most 2. G is a square-stable graph if it enjoys the
property alpha(G)=alpha(G^2), where alpha(G) is the size of a maximum stable
set in G. In this paper we show that G^2 is a Konig-Egervary graph if and only
if G is a square-stable Konig-Egervary graph.
|
[
{
"version": "v1",
"created": "Tue, 27 Apr 2010 13:44:55 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Levit",
"Vadim E.",
""
],
[
"Mandrescu",
"Eugen",
""
]
] |
new_dataset
| 0.980806 |
1004.4944
|
Stefano Rini
|
Stefano Rini, Daniela Tuninetti, and Natasha Devroye
|
Outer Bounds for the Interference Channel with a Cognitive Relay
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we first present an outer bound for a general interference
channel with a cognitive relay, i.e., a relay that has non-causal knowledge of
both independent messages transmitted in the interference channel. This outer
bound reduces to the capacity region of the deterministic broadcast channel and
of the deterministic cognitive interference channel through nulling of certain
channel inputs. It does not, however, reduce to that of certain deterministic
interference channels for which capacity is known. As such, we subsequently
tighten the bound for channels whose outputs satisfy an "invertibility"
condition. This second outer bound now reduces to the capacity of this special
class of deterministic interference channels. The second outer bound is further
tightened for the high SNR deterministic approximation of the Gaussian
interference channel with a cognitive relay by exploiting the special structure
of the interference. We provide an example that suggests that this third bound
is tight in at least some parameter regimes for the high SNR deterministic
approximation of the Gaussian channel. Another example shows that the third
bound is capacity in the special case where there are no direct links between
the non-cognitive transmitters.
|
[
{
"version": "v1",
"created": "Wed, 28 Apr 2010 02:53:34 GMT"
},
{
"version": "v2",
"created": "Tue, 18 May 2010 19:35:04 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Rini",
"Stefano",
""
],
[
"Tuninetti",
"Daniela",
""
],
[
"Devroye",
"Natasha",
""
]
] |
new_dataset
| 0.99641 |
1004.5157
|
Pascal Vontobel
|
Ali E. Pusane, Roxana Smarandache, Pascal O. Vontobel, Daniel J.
Costello Jr
|
Deriving Good LDPC Convolutional Codes from LDPC Block Codes
|
Submitted to IEEE Transactions on Information Theory, April 2010;
revised August 2010, revised November 2010 (essentially final version).
(Besides many small changes, the first and second revised versions contain
corrected entries in Tables I and II.)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Low-density parity-check (LDPC) convolutional codes are capable of achieving
excellent performance with low encoding and decoding complexity. In this paper
we discuss several graph-cover-based methods for deriving families of
time-invariant and time-varying LDPC convolutional codes from LDPC block codes
and show how earlier proposed LDPC convolutional code constructions can be
presented within this framework. Some of the constructed convolutional codes
significantly outperform the underlying LDPC block codes. We investigate some
possible reasons for this "convolutional gain," and we also discuss the ---
mostly moderate --- decoder cost increase that is incurred by going from LDPC
block to LDPC convolutional codes.
|
[
{
"version": "v1",
"created": "Wed, 28 Apr 2010 22:19:52 GMT"
},
{
"version": "v2",
"created": "Thu, 19 Aug 2010 02:16:06 GMT"
},
{
"version": "v3",
"created": "Wed, 1 Dec 2010 00:10:06 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Pusane",
"Ali E.",
""
],
[
"Smarandache",
"Roxana",
""
],
[
"Vontobel",
"Pascal O.",
""
],
[
"Costello",
"Daniel J.",
"Jr"
]
] |
new_dataset
| 0.96229 |
1005.0072
|
Rania El-Badry
|
Rania El-Badry, Ahmed Sultan and Moustafa Youssef
|
HyberLoc: Providing Physical Layer Location Privacy in Hybrid Sensor
Networks
|
7 pages, 4 figures, ICC'10
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In many hybrid wireless sensor networks' applications, sensor nodes are
deployed in hostile environments where trusted and un-trusted nodes co-exist.
In anchor-based hybrid networks, it becomes important to allow trusted nodes to
gain full access to the location information transmitted in beacon frames
while, at the same time, prevent un-trusted nodes from using this information.
The main challenge is that un-trusted nodes can measure the physical signal
transmitted from anchor nodes, even if these nodes encrypt their transmission.
Using the measured signal strength, un-trusted nodes can still tri-laterate the
location of anchor nodes. In this paper, we propose HyberLoc, an algorithm that
provides anchor physical layer location privacy in anchor-based hybrid sensor
networks. The idea is for anchor nodes to dynamically change their transmission
power following a certain probability distribution, degrading the localization
accuracy at un-trusted nodes while maintaining high localization accuracy at
trusted nodes. Given an average power constraint, our analysis shows that the
discretized exponential distribution is the distribution that maximizes
location uncertainty at the untrusted nodes. Detailed evaluation through
analysis, simulation, and implementation shows that HyberLoc gives trusted
nodes up to 3.5 times better localization accuracy as compared to untrusted
nodes.
|
[
{
"version": "v1",
"created": "Sat, 1 May 2010 13:43:03 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"El-Badry",
"Rania",
""
],
[
"Sultan",
"Ahmed",
""
],
[
"Youssef",
"Moustafa",
""
]
] |
new_dataset
| 0.999649 |
1005.1062
|
David G. M. Mitchell
|
Michael Lentmaier, David G. M. Mitchell, Gerhard P. Fettweis, and
Daniel J. Costello, Jr.
|
Asymptotically Regular LDPC Codes with Linear Distance Growth and
Thresholds Close to Capacity
|
Presented at the 2010 Information Theory and Applications Workshop,
San Diego, CA.
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Families of "asymptotically regular" LDPC block code ensembles can be formed
by terminating (J,K)-regular protograph-based LDPC convolutional codes. By
varying the termination length, we obtain a large selection of LDPC block code
ensembles with varying code rates and substantially better iterative decoding
thresholds than those of (J,K)-regular LDPC block code ensembles, despite the
fact that the terminated ensembles are almost regular. Also, by means of an
asymptotic weight enumerator analysis, we show that minimum distance grows
linearly with block length for all of the ensembles in these families, i.e.,
the ensembles are asymptotically good. We find that, as the termination length
increases, families of "asymptotically regular" codes with capacity approaching
iterative decoding thresholds and declining minimum distance growth rates are
obtained, allowing a code designer to trade-off between distance growth rate
and threshold. Further, we show that the thresholds and the distance growth
rates can be improved by carefully choosing the component protographs used in
the code construction.
|
[
{
"version": "v1",
"created": "Thu, 6 May 2010 19:44:26 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Lentmaier",
"Michael",
""
],
[
"Mitchell",
"David G. M.",
""
],
[
"Fettweis",
"Gerhard P.",
""
],
[
"Costello,",
"Daniel J.",
"Jr."
]
] |
new_dataset
| 0.996144 |
1005.1475
|
Luca Saiu
|
Jean-Vincent Loddo and Luca Saiu
|
How to correctly prune tropical trees
|
To appear in "Artificial Intelligence and Symbolic Computation,
2010".
| null | null | null |
cs.AI cs.DM cs.GT cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present tropical games, a generalization of combinatorial min-max games
based on tropical algebras. Our model breaks the traditional symmetry of
rational zero-sum games where players have exactly opposed goals (min vs. max),
is more widely applicable than min-max and also supports a form of pruning,
despite it being less effective than alpha-beta. Actually, min-max games may be
seen as particular cases where both the game and its dual are tropical: when
the dual of a tropical game is also tropical, the power of alpha-beta is
completely recovered. We formally develop the model and prove that the tropical
pruning strategy is correct, then conclude by showing how the problem of
approximated parsing can be modeled as a tropical game, profiting from pruning.
|
[
{
"version": "v1",
"created": "Mon, 10 May 2010 09:06:26 GMT"
},
{
"version": "v2",
"created": "Tue, 11 May 2010 06:35:47 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Loddo",
"Jean-Vincent",
""
],
[
"Saiu",
"Luca",
""
]
] |
new_dataset
| 0.965624 |
1005.1716
|
Christian Drescher
|
Christian Drescher and Martin Gebser and Benjamin Kaufmann and Torsten
Schaub
|
Heuristics in Conflict Resolution
| null |
Proceedings of the Twelfth International Workshop on Nonmonotonic
Reasoning (2008) 141-149
| null | null |
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming
(ASP) are based on sophisticated Boolean constraint solving techniques. In both
areas, conflict-driven learning and related techniques constitute key features
whose application is enabled by conflict analysis. Although various conflict
analysis schemes have been proposed, implemented, and studied both
theoretically and practically in the SAT area, the heuristic aspects involved
in conflict analysis have not yet received much attention. Assuming a fixed
conflict analysis scheme, we address the open question of how to identify
"good'' reasons for conflicts, and we investigate several heuristics for
conflict analysis in ASP solving. To our knowledge, a systematic study like
ours has not yet been performed in the SAT area, thus, it might be beneficial
for both the field of ASP as well as the one of SAT solving.
|
[
{
"version": "v1",
"created": "Tue, 11 May 2010 05:32:37 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Drescher",
"Christian",
""
],
[
"Gebser",
"Martin",
""
],
[
"Kaufmann",
"Benjamin",
""
],
[
"Schaub",
"Torsten",
""
]
] |
new_dataset
| 0.966923 |
1005.2443
|
Ernest Kurniawan
|
E. Kurniawan, S. Sun, K. Yen, and K. F. E. Chong
|
Network Coded Transmission of Fountain Codes over Cooperative Relay
Networks
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a transmission strategy of fountain codes over cooperative
relay networks is proposed. When more than one relay nodes are available, we
apply network coding to fountain-coded packets. By doing this, partial
information is made available to the destination node about the upcoming
message block. It is therefore able to reduce the required number of
transmissions over erasure channels, hence increasing the effective throughput.
Its application to wireless channels with Rayleigh fading and AWGN noise is
also analysed, whereby the role of analogue network coding and optimal weight
selection is demonstrated.
|
[
{
"version": "v1",
"created": "Fri, 14 May 2010 01:29:33 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Kurniawan",
"E.",
""
],
[
"Sun",
"S.",
""
],
[
"Yen",
"K.",
""
],
[
"Chong",
"K. F. E.",
""
]
] |
new_dataset
| 0.99819 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.