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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1108.0471
|
EPTCS
|
Massimo Bartoletti (Dipartimento di Matematica e Informatica,
Universita' degli Studi di Cagliari, Italy), Emilio Tuosto (Department of
Computer Science, University of Leicester, UK), Roberto Zunino
(DISI-Universita' degli Studi di Trento and COSBI, Italy)
|
Contracts in distributed systems
|
In Proceedings ICE 2011, arXiv:1108.0144
|
EPTCS 59, 2011, pp. 130-147
|
10.4204/EPTCS.59.11
| null |
cs.PL cs.DC cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a parametric calculus for contract-based computing in distributed
systems. By abstracting from the actual contract language, our calculus
generalises both the contracts-as-processes and contracts-as-formulae
paradigms. The calculus features primitives for advertising contracts, for
reaching agreements, and for querying the fulfilment of contracts. Coordination
among principals happens via multi-party sessions, which are created once
agreements are reached. We present two instances of our calculus, by modelling
contracts as (i) processes in a variant of CCS, and (ii) as formulae in a
logic. With the help of a few examples, we discuss the primitives of our
calculus, as well as some possible variants.
|
[
{
"version": "v1",
"created": "Tue, 2 Aug 2011 02:27:50 GMT"
}
] | 2011-08-03T00:00:00 |
[
[
"Bartoletti",
"Massimo",
"",
"Dipartimento di Matematica e Informatica,\n Universita' degli Studi di Cagliari, Italy"
],
[
"Tuosto",
"Emilio",
"",
"Department of\n Computer Science, University of Leicester, UK"
],
[
"Zunino",
"Roberto",
"",
"DISI-Universita' degli Studi di Trento and COSBI, Italy"
]
] |
new_dataset
| 0.999335 |
1004.2972
|
Marcin Pilipczuk
|
Marek Cygan and Marcin Pilipczuk and Michal Pilipczuk and Jakub Onufry
Wojtaszczyk
|
Subset feedback vertex set is fixed parameter tractable
|
full version of a paper presented at ICALP'11
| null | null | null |
cs.DS cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The classical Feedback Vertex Set problem asks, for a given undirected graph
G and an integer k, to find a set of at most k vertices that hits all the
cycles in the graph G. Feedback Vertex Set has attracted a large amount of
research in the parameterized setting, and subsequent kernelization and
fixed-parameter algorithms have been a rich source of ideas in the field.
In this paper we consider a more general and difficult version of the
problem, named Subset Feedback Vertex Set (SUBSET-FVS in short) where an
instance comes additionally with a set S ? V of vertices, and we ask for a set
of at most k vertices that hits all simple cycles passing through S. Because of
its applications in circuit testing and genetic linkage analysis SUBSET-FVS was
studied from the approximation algorithms perspective by Even et al.
[SICOMP'00, SIDMA'00].
The question whether the SUBSET-FVS problem is fixed-parameter tractable was
posed independently by Kawarabayashi and Saurabh in 2009. We answer this
question affirmatively. We begin by showing that this problem is
fixed-parameter tractable when parametrized by |S|. Next we present an
algorithm which reduces the given instance to 2^k n^O(1) instances with the
size of S bounded by O(k^3), using kernelization techniques such as the
2-Expansion Lemma, Menger's theorem and Gallai's theorem. These two facts allow
us to give a 2^O(k log k) n^O(1) time algorithm solving the Subset Feedback
Vertex Set problem, proving that it is indeed fixed-parameter tractable.
|
[
{
"version": "v1",
"created": "Sat, 17 Apr 2010 17:19:47 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Nov 2010 12:56:53 GMT"
},
{
"version": "v3",
"created": "Mon, 1 Aug 2011 17:57:56 GMT"
}
] | 2011-08-02T00:00:00 |
[
[
"Cygan",
"Marek",
""
],
[
"Pilipczuk",
"Marcin",
""
],
[
"Pilipczuk",
"Michal",
""
],
[
"Wojtaszczyk",
"Jakub Onufry",
""
]
] |
new_dataset
| 0.97259 |
1108.0232
|
EPTCS
|
Jos\'e Proen\c{c}a (KUL), Dave Clarke (KUL), Erik de Vink (TUE),
Farhad Arbab (CWI)
|
Decoupled execution of synchronous coordination models via behavioural
automata
|
In Proceedings FOCLASA 2011, arXiv:1107.5847
|
EPTCS 58, 2011, pp. 65-79
|
10.4204/EPTCS.58.5
| null |
cs.FL cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Synchronous coordination systems allow the exchange of data by logically
indivisible actions involving all coordinated entities. This paper introduces
behavioural automata, a logically synchronous coordination model based on the
Reo coordination language, which focuses on relevant aspects for the concurrent
evolution of these systems. We show how our automata model encodes the Reo and
Linda coordination models and how it introduces an explicit predicate that
captures the concurrent evolution, distinguishing local from global actions,
and lifting the need of most synchronous models to involve all entities at each
coordination step, paving the way to more scalable implementations.
|
[
{
"version": "v1",
"created": "Mon, 1 Aug 2011 03:58:23 GMT"
}
] | 2011-08-02T00:00:00 |
[
[
"Proença",
"José",
"",
"KUL"
],
[
"Clarke",
"Dave",
"",
"KUL"
],
[
"de Vink",
"Erik",
"",
"TUE"
],
[
"Arbab",
"Farhad",
"",
"CWI"
]
] |
new_dataset
| 0.991343 |
1104.0807
|
Lutz Bornmann Dr.
|
Lutz Bornmann, Werner Marx
|
The Anna Karenina principle: A concept for the explanation of success in
science
| null | null | null | null |
cs.DL physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The first sentence of Leo Tolstoy's novel Anna Karenina is: "Happy families
are all alike; every unhappy family is unhappy in its own way." Here Tolstoy
means that for a family to be happy, several key aspects must be given (such as
good health of all family members, acceptable financial security, and mutual
affection). If there is a deficiency in any one or more of these key aspects,
the family will be unhappy. In this paper we introduce the Anna Karenina
principle as a concept that can explain success in science. Here we will refer
to three central areas in modern science in which scarce resources will most
usually lead to failure: (1) peer review of research grant proposals and
manuscripts (money and journal space as scarce resources), (2) citation of
publications (reception as a scarce resource), and (3) new scientific
discoveries (recognition as a scarce resource). If resources are scarce
(journal space, funds, reception, and recognition), there can be success only
when several key prerequisites for the allocation of the resources are
fulfilled. If any one of these prerequisites is not fulfilled, the grant
proposal, manuscript submission, the published paper, or the discovery will not
be successful.
|
[
{
"version": "v1",
"created": "Tue, 5 Apr 2011 10:48:21 GMT"
},
{
"version": "v2",
"created": "Fri, 29 Jul 2011 08:31:24 GMT"
}
] | 2011-08-01T00:00:00 |
[
[
"Bornmann",
"Lutz",
""
],
[
"Marx",
"Werner",
""
]
] |
new_dataset
| 0.999605 |
1107.5370
|
Cristina Fernandes
|
Cristina G. Fernandes and Robin Thomas
|
Edge-coloring series-parallel multigraphs
| null | null | null | null |
cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give a simpler proof of Seymour's Theorem on edge-coloring series-parallel
multigraphs and derive a linear-time algorithm to check whether a given
series-parallel multigraph can be colored with a given number of colors.
|
[
{
"version": "v1",
"created": "Wed, 27 Jul 2011 02:54:20 GMT"
}
] | 2011-08-01T00:00:00 |
[
[
"Fernandes",
"Cristina G.",
""
],
[
"Thomas",
"Robin",
""
]
] |
new_dataset
| 0.999371 |
1101.0309
|
Edward Grefenstette
|
Edward Grefenstette, Mehrnoosh Sadrzadeh, Stephen Clark, Bob Coecke
and Stephen Pulman
|
Concrete Sentence Spaces for Compositional Distributional Models of
Meaning
|
10 pages, presented at the International Conference on Computational
Semantics 2011 (IWCS'11), to be published in proceedings
|
Proceedings of the 9th International Conference on Computational
Semantics (2011)
| null | null |
cs.CL cs.AI cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Coecke, Sadrzadeh, and Clark (arXiv:1003.4394v1 [cs.CL]) developed a
compositional model of meaning for distributional semantics, in which each word
in a sentence has a meaning vector and the distributional meaning of the
sentence is a function of the tensor products of the word vectors. Abstractly
speaking, this function is the morphism corresponding to the grammatical
structure of the sentence in the category of finite dimensional vector spaces.
In this paper, we provide a concrete method for implementing this linear
meaning map, by constructing a corpus-based vector space for the type of
sentence. Our construction method is based on structured vector spaces whereby
meaning vectors of all sentences, regardless of their grammatical structure,
live in the same vector space. Our proposed sentence space is the tensor
product of two noun spaces, in which the basis vectors are pairs of words each
augmented with a grammatical role. This enables us to compare meanings of
sentences by simply taking the inner product of their vectors.
|
[
{
"version": "v1",
"created": "Fri, 31 Dec 2010 23:57:06 GMT"
}
] | 2011-07-29T00:00:00 |
[
[
"Grefenstette",
"Edward",
""
],
[
"Sadrzadeh",
"Mehrnoosh",
""
],
[
"Clark",
"Stephen",
""
],
[
"Coecke",
"Bob",
""
],
[
"Pulman",
"Stephen",
""
]
] |
new_dataset
| 0.974131 |
1107.5782
|
Matilde Marcolli
|
Matilde Marcolli and Christopher Perez
|
Codes as fractals and noncommutative spaces
|
18 pages LaTeX, one png figure
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the CSS algorithm relating self-orthogonal classical linear codes
to q-ary quantum stabilizer codes and we show that to such a pair of a
classical and a quantum code one can associate geometric spaces constructed
using methods from noncommutative geometry, arising from rational
noncommutative tori and finite abelian group actions on Cuntz algebras and
fractals associated to the classical codes.
|
[
{
"version": "v1",
"created": "Thu, 28 Jul 2011 17:59:09 GMT"
}
] | 2011-07-29T00:00:00 |
[
[
"Marcolli",
"Matilde",
""
],
[
"Perez",
"Christopher",
""
]
] |
new_dataset
| 0.997 |
1107.5399
|
Suzhi Bi
|
Suzhi Bi, Ying Jun (Angela) Zhang
|
TDMA Achieves the Optimal Diversity Gain in Relay-Assisted Cellular
Networks
|
26 pages, 8 figures
| null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In multi-access wireless networks, transmission scheduling is a key component
that determines the efficiency and fairness of wireless spectrum allocation. At
one extreme, greedy opportunistic scheduling that allocates airtime to the user
with the largest instantaneous channel gain achieves the optimal spectrum
efficiency and transmission reliability but the poorest user-level fairness. At
the other extreme, fixed TDMA scheduling achieves the fairest airtime
allocation but the lowest spectrum efficiency and transmission reliability. To
balance the two competing objectives, extensive research efforts have been
spent on designing opportunistic scheduling schemes that reach certain tradeoff
points between the two extremes. In this paper and in contrast to the
conventional wisdom, we find that in relay-assisted cellular networks, fixed
TDMA achieves the same optimal diversity gain as greedy opportunistic
scheduling. In addition, by incorporating very limited opportunism, a simple
relaxed-TDMA scheme asymptotically achieves the same optimal system reliability
in terms of outage probability as greedy opportunistic scheduling. This reveals
a surprising fact: transmission reliability and user fairness are no longer
contradicting each other in relay-assisted systems. They can be both achieved
by the simple TDMA schemes. For practical implementations, we further propose a
fully distributed algorithm to implement the relaxed-TDMA scheme. Our results
here may find applications in the design of next-generation wireless
communication systems with relay architectures such as LTE-advanced and WiMAX.
|
[
{
"version": "v1",
"created": "Wed, 27 Jul 2011 07:44:04 GMT"
}
] | 2011-07-28T00:00:00 |
[
[
"Bi",
"Suzhi",
"",
"Angela"
],
[
"Jun",
"Ying",
"",
"Angela"
],
[
"Zhang",
"",
""
]
] |
new_dataset
| 0.999469 |
1107.5462
|
Gabriela Ochoa
|
Edmund Burke, Tim Curtois, Matthew Hyde, Gabriela Ochoa, Jose A.
Vazquez-Rodriguez
|
HyFlex: A Benchmark Framework for Cross-domain Heuristic Search
|
28 pages, 9 figures
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Automating the design of heuristic search methods is an active research field
within computer science, artificial intelligence and operational research. In
order to make these methods more generally applicable, it is important to
eliminate or reduce the role of the human expert in the process of designing an
effective methodology to solve a given computational search problem.
Researchers developing such methodologies are often constrained on the number
of problem domains on which to test their adaptive, self-configuring
algorithms; which can be explained by the inherent difficulty of implementing
their corresponding domain specific software components.
This paper presents HyFlex, a software framework for the development of
cross-domain search methodologies. The framework features a common software
interface for dealing with different combinatorial optimisation problems, and
provides the algorithm components that are problem specific. In this way, the
algorithm designer does not require a detailed knowledge the problem domains,
and thus can concentrate his/her efforts in designing adaptive general-purpose
heuristic search algorithms. Four hard combinatorial problems are fully
implemented (maximum satisfiability, one dimensional bin packing, permutation
flow shop and personnel scheduling), each containing a varied set of instance
data (including real-world industrial applications) and an extensive set of
problem specific heuristics and search operators. The framework forms the basis
for the first International Cross-domain Heuristic Search Challenge (CHeSC),
and it is currently in use by the international research community. In summary,
HyFlex represents a valuable new benchmark of heuristic search generality, with
which adaptive cross-domain algorithms are being easily developed, and reliably
compared.
|
[
{
"version": "v1",
"created": "Wed, 27 Jul 2011 13:07:39 GMT"
}
] | 2011-07-28T00:00:00 |
[
[
"Burke",
"Edmund",
""
],
[
"Curtois",
"Tim",
""
],
[
"Hyde",
"Matthew",
""
],
[
"Ochoa",
"Gabriela",
""
],
[
"Vazquez-Rodriguez",
"Jose A.",
""
]
] |
new_dataset
| 0.987683 |
1107.5538
|
Jaydip Sen
|
Jaydip Sen
|
An Anonymous Authentication and Communication Protocol for Wireless Mesh
Networks
|
13 pages, 6 figures. First International Conference on Advances in
Computing and Communication (ACC 2011), Kochi, India, July 22 - 24, 2011
| null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless mesh networks (WMNs) have emerged as a key technology for next
generation wireless broadband networks showing rapid progress and inspiring
numerous compelling applications. A WMN comprises of a set of mesh routers
(MRs) and mesh clients (MCs), where MRs are connected to the Internet backbone
through the Internet gateways (IGWs). The MCs are wireless devices and
communicate among themselves over possibly multi-hop paths with or without the
involvement of MRs. User privacy and security have been primary concerns in
WMNs due to their peer-to-peer network topology, shared wireless medium,
stringent resource constraints, and highly dynamic environment. Moreover, to
support real-time applications, WMNs must also be equipped with robust,
reliable and efficient communication protocols so as to minimize the end-to-end
latency and packet drops. Design of a secure and efficient communication
protocol for WMNs, therefore, is of paramount importance. In this paper, we
propose a security and privacy protocol that provides security and user
anonymity while maintaining communication efficiency in a WMN. The security
protocol ensures secure authentication and encryption in access and the
backbone networks. The user anonymity, authentication and data privacy is
achieved by application of a protocol that is based on Rivest's ring signature
scheme. Simulation results demonstrate that while the protocols have minimal
storage and communication overhead, they are robust and provide high level of
security and privacy to the users of the network services.
|
[
{
"version": "v1",
"created": "Wed, 27 Jul 2011 17:01:28 GMT"
}
] | 2011-07-28T00:00:00 |
[
[
"Sen",
"Jaydip",
""
]
] |
new_dataset
| 0.999511 |
1107.5541
|
Jiangyuan Li
|
Jiangyuan Li and Athina Petropulu
|
Closed Form Secrecy Capacity of MIMO Wiretap Channels with Two Transmit
Antennas
|
1 figure
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Gaussian multiple-input multiple-output (MIMO) wiretap channel model is
considered. The input is a two-antenna transmitter, while the outputs are the
legitimate receiver and an eavesdropper, both equipped with multiple antennas.
All channels are assumed to be known. The problem of obtaining the optimal
input covariance matrix that achieves secrecy capacity subject to a power
constraint is addressed, and a closed-form expression for the secrecy capacity
is obtained.
|
[
{
"version": "v1",
"created": "Wed, 27 Jul 2011 17:09:39 GMT"
}
] | 2011-07-28T00:00:00 |
[
[
"Li",
"Jiangyuan",
""
],
[
"Petropulu",
"Athina",
""
]
] |
new_dataset
| 0.97688 |
1107.5186
|
Preben Gr{\aa}berg Nes
|
Preben Gr{\aa}berg Nes
|
Fast multi-scale edge-detection in medical ultrasound signals
| null | null | null | null |
cs.CV physics.med-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article we suggest a fast multi-scale edge-detection scheme for
medical ultrasound signals. The edge-detector is based on well-known properties
of the continuous wavelet trans- form. To achieve both good localization of
edges and detect only significant edges, we study the maxima-lines of the
wavelet transform. One can obtain the maxima-lines between two scales by
computing the wavelet transform at several intermediate scales. To reduce
computational effort and time we suggest a time-scale filtering procedure which
uses only few scales to connect modulus-maxima across time-scale plane. The
design of this procedure is based on a study of maxima-lines corresponding to
edges typical for medical ultrasound signals. This study allows us to construct
an algorithm for medical ultrasound signals which meets the demand for speed,
but not on expense of reliability. The edge-detection algorithm has been
applied to a large class of medical ultrasound sig- nals including tumour-,
liver- and artery-images. Our results show that the proposed algorithm
effectively detects major features in such signals, including edges with low
contrast.
|
[
{
"version": "v1",
"created": "Tue, 26 Jul 2011 11:59:40 GMT"
}
] | 2011-07-27T00:00:00 |
[
[
"Nes",
"Preben Gråberg",
""
]
] |
new_dataset
| 0.984947 |
0901.2120
|
Mahdi Cheraghchi
|
Mahdi Cheraghchi, Frederic Didier, Amin Shokrollahi
|
Invertible Extractors and Wiretap Protocols
|
Full version. A preliminary summary of this work appears (under the
same title) in proceedings of the 2009 IEEE International Symposium on
Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A wiretap protocol is a pair of randomized encoding and decoding functions
such that knowledge of a bounded fraction of the encoding of a message reveals
essentially no information about the message, while knowledge of the entire
encoding reveals the message using the decoder. In this paper we study the
notion of efficiently invertible extractors and show that a wiretap protocol
can be constructed from such an extractor. We will then construct invertible
extractors for symbol-fixing, affine, and general sources and apply them to
create wiretap protocols with asymptotically optimal trade-offs between their
rate (ratio of the length of the message versus its encoding) and resilience
(ratio of the observed positions of the encoding and the length of the
encoding). We will then apply our results to create wiretap protocols for
challenging communication problems, such as active intruders who change
portions of the encoding, network coding, and intruders observing arbitrary
boolean functions of the encoding.
As a by-product of our constructions we obtain new explicit extractors for a
restricted family of affine sources over large fields (that in particular
generalizes the notion of symbol-fixing sources) which is of independent
interest. These extractors are able to extract the entire source entropy with
zero error.
Keywords: Wiretap Channel, Extractors, Network Coding, Active Intrusion,
Exposure Resilient Cryptography.
|
[
{
"version": "v1",
"created": "Wed, 14 Jan 2009 21:21:05 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Jul 2011 20:21:34 GMT"
}
] | 2011-07-26T00:00:00 |
[
[
"Cheraghchi",
"Mahdi",
""
],
[
"Didier",
"Frederic",
""
],
[
"Shokrollahi",
"Amin",
""
]
] |
new_dataset
| 0.986124 |
1106.0855
|
Eyal Ackerman
|
Eyal Ackerman, Tsachik Gelander, and Rom Pinchasi
|
Ice-Creams and Wedge Graphs
|
7 pages
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
What is the minimum angle $\alpha >0$ such that given any set of
$\alpha$-directional antennas (that is, antennas each of which can communicate
along a wedge of angle $\alpha$), one can always assign a direction to each
antenna such that the resulting communication graph is connected? Here two
antennas are connected by an edge if and only if each lies in the wedge
assigned to the other. This problem was recently presented by Carmi, Katz,
Lotker, and Ros\'en \cite{CKLR10} who also found the minimum such $\alpha$
namely $\alpha=\frac{\pi}{3}$. In this paper we give a simple proof of this
result. Moreover, we obtain a much stronger and optimal result (see Theorem
\ref{theorem:main}) saying in particular that one can chose the directions of
the antennas so that the communication graph has diameter $\le 4$.
Our main tool is a surprisingly basic geometric lemma that is of independent
interest. We show that for every compact convex set $S$ in the plane and every
$0 < \alpha < \pi$, there exist a point $O$ and two supporting lines to $S$
passing through $O$ and touching $S$ at two \emph{single points} $X$ and $Y$,
respectively, such that $|OX|=|OY|$ and the angle between the two lines is
$\alpha$.
|
[
{
"version": "v1",
"created": "Sat, 4 Jun 2011 20:24:50 GMT"
},
{
"version": "v2",
"created": "Sun, 24 Jul 2011 13:07:44 GMT"
}
] | 2011-07-26T00:00:00 |
[
[
"Ackerman",
"Eyal",
""
],
[
"Gelander",
"Tsachik",
""
],
[
"Pinchasi",
"Rom",
""
]
] |
new_dataset
| 0.95645 |
1107.4138
|
Gilles Geeraerts
|
Gilles Geeraerts and Jean-Fran\c{c}ois Raskin and Nathalie Sznajder
|
Event-Clock Automata: From Theory to Practice
|
Full version of the FORMATS 2011 version
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Event clock automata (ECA) are a model for timed languages that has been
introduced by Alur, Fix and Henzinger as an alternative to timed automata, with
better theoretical properties (for instance, ECA are determinizable while timed
automata are not). In this paper, we revisit and extend the theory of ECA. We
first prove that no finite time abstract language equivalence exists for ECA,
thereby disproving a claim in the original work on ECA. This means in
particular that regions do not form a time abstract bisimulation. Nevertheless,
we show that regions can still be used to build a finite automaton recognizing
the untimed language of an ECA. Then, we extend the classical notions of zones
and DBMs to let them handle event clocks instead of plain clocks (as in timed
automata) by introducing event zones and Event DBMs (EDBMs). We discuss
algorithms to handle event zones represented as EDBMs, as well as (semi-)
algorithms based on EDBMs to decide language emptiness of ECA.
|
[
{
"version": "v1",
"created": "Wed, 20 Jul 2011 23:09:47 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Jul 2011 20:08:52 GMT"
}
] | 2011-07-26T00:00:00 |
[
[
"Geeraerts",
"Gilles",
""
],
[
"Raskin",
"Jean-François",
""
],
[
"Sznajder",
"Nathalie",
""
]
] |
new_dataset
| 0.997509 |
1107.4796
|
Ali Jowharpour
|
Ali Jowharpour, Masha allah abbasi dezfuli, Mohammad hosein Yektaee
|
Use Pronunciation by Analogy for text to speech system in Persian
language
| null |
IJCSI Volume 8, Issue 3, May 2011
| null | null |
cs.CL
|
http://creativecommons.org/licenses/by/3.0/
|
The interest in text to speech synthesis increased in the world .text to
speech have been developed formany popular languages such as English, Spanish
and French and many researches and developmentshave been applied to those
languages. Persian on the other hand, has been given little attentioncompared
to other languages of similar importance and the research in Persian is still
in its infancy.Persian language possess many difficulty and exceptions that
increase complexity of text to speechsystems. For example: short vowels is
absent in written text or existence of homograph words. in thispaper we propose
a new method for persian text to phonetic that base on pronunciations by
analogy inwords, semantic relations and grammatical rules for finding proper
phonetic. Keywords:PbA, text to speech, Persian language, FPbA
|
[
{
"version": "v1",
"created": "Sun, 24 Jul 2011 20:37:57 GMT"
}
] | 2011-07-26T00:00:00 |
[
[
"Jowharpour",
"Ali",
""
],
[
"dezfuli",
"Masha allah abbasi",
""
],
[
"Yektaee",
"Mohammad hosein",
""
]
] |
new_dataset
| 0.998288 |
1107.4850
|
Debabala Swain
|
Debabala Swain, S.P. Panigrahi, S.K. Routray, P.K. Dash, R.R. Mohanty,
S.K. Dash
|
WLAN location system: Background theories and future directions
| null | null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This paper presents background theories and required steps towards
preparation of a WLAN location system. This paper targets on a software project
and intention behind this paper is to motivate the young researchers in the
area.
|
[
{
"version": "v1",
"created": "Mon, 25 Jul 2011 06:40:48 GMT"
}
] | 2011-07-26T00:00:00 |
[
[
"Swain",
"Debabala",
""
],
[
"Panigrahi",
"S. P.",
""
],
[
"Routray",
"S. K.",
""
],
[
"Dash",
"P. K.",
""
],
[
"Mohanty",
"R. R.",
""
],
[
"Dash",
"S. K.",
""
]
] |
new_dataset
| 0.999068 |
1107.4970
|
Joachim Spoerhase
|
Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase,
Alexander Wolff
|
Drawing Graphs with Vertices at Specified Positions and Crossings at
Large Angles
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Point-set embeddings and large-angle crossings are two areas of graph drawing
that independently have received a lot of attention in the past few years. In
this paper, we consider problems in the intersection of these two areas. Given
the point-set-embedding scenario, we are interested in how much we gain in
terms of computational complexity, curve complexity, and generality if we allow
large-angle crossings as compared to the planar case. We investigate two
drawing styles where only bends or both bends and edges must be drawn on an
underlying grid. We present various results for drawings with one, two, and
three bends per edge.
|
[
{
"version": "v1",
"created": "Mon, 25 Jul 2011 15:10:12 GMT"
}
] | 2011-07-26T00:00:00 |
[
[
"Fink",
"Martin",
""
],
[
"Haunert",
"Jan-Henrik",
""
],
[
"Mchedlidze",
"Tamara",
""
],
[
"Spoerhase",
"Joachim",
""
],
[
"Wolff",
"Alexander",
""
]
] |
new_dataset
| 0.99243 |
1107.4463
|
Tao Ye
|
Wenqi Huang, Tao Ye, Duanbing Chen
|
Bottom-Left Placement Theorem for Rectangle Packing
| null | null | null | null |
cs.DM cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proves a bottom-left placement theorem for the rectangle packing
problem, stating that if it is possible to orthogonally place n arbitrarily
given rectangles into a rectangular container without overlapping, then we can
achieve a feasible packing by successively placing a rectangle onto a
bottom-left corner in the container. This theorem shows that even for the
real-parameter rectangle packing problem, we can solve it after finite times of
bottom-left placement actions. Based on this theorem, we might develop
efficient heuristic algorithms for solving the rectangle packing problem.
|
[
{
"version": "v1",
"created": "Fri, 22 Jul 2011 09:27:23 GMT"
}
] | 2011-07-25T00:00:00 |
[
[
"Huang",
"Wenqi",
""
],
[
"Ye",
"Tao",
""
],
[
"Chen",
"Duanbing",
""
]
] |
new_dataset
| 0.956582 |
1107.4498
|
Damien Chablat
|
Michel Coste (IRMAR), Philippe Wenger (IRCCyN), Damien Chablat
(IRCCyN)
|
Singular surfaces and cusps in symmetric planar 3-RPR manipulators
|
IEEE/RSJ International Conference on Intelligent Robots and Systems,
San Franisco : United States (2011)
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study in this paper a class of 3-RPR manipulators for which the direct
kinematic problem (DKP) is split into a cubic problem followed by a quadratic
one. These manipulators are geometrically characterized by the fact that the
moving triangle is the image of the base triangle by an indirect isometry. We
introduce a specific coordinate system adapted to this geometric feature and
which is also well adapted to the splitting of the DKP. This allows us to
obtain easily precise descriptions of the singularities and of the cusp edges.
These latter second order singularities are important for nonsingular assembly
mode changing. We show how to sort assembly modes and use this sorting for
motion planning in the joint space.
|
[
{
"version": "v1",
"created": "Fri, 22 Jul 2011 12:39:45 GMT"
}
] | 2011-07-25T00:00:00 |
[
[
"Coste",
"Michel",
"",
"IRMAR"
],
[
"Wenger",
"Philippe",
"",
"IRCCyN"
],
[
"Chablat",
"Damien",
"",
"IRCCyN"
]
] |
new_dataset
| 0.965786 |
1107.4500
|
Georg B\"ocherer
|
Fabian Altenbach and Georg B\"ocherer and Rudolf Mathar
|
Short Huffman Codes Producing 1s Half of the Time
|
submitted to ICSPCS 2011, Honolulu
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The design of the channel part of a digital communication system (e.g., error
correction, modulation) is heavily based on the assumption that the data to be
transmitted forms a fair bit stream. However, simple source encoders such as
short Huffman codes generate bit streams that poorly match this assumption. As
a result, the channel input distribution does not match the original design
criteria. In this work, a simple method called half Huffman coding (halfHc) is
developed. halfHc transforms a Huffman code into a source code whose output is
more similar to a fair bit stream. This is achieved by permuting the codewords
such that the frequency of 1s at the output is close to 0.5. The permutations
are such that the optimality in terms of achieved compression ratio is
preserved. halfHc is applied in a practical example, and the resulting overall
system performs better than when conventional Huffman coding is used.
|
[
{
"version": "v1",
"created": "Fri, 22 Jul 2011 12:41:22 GMT"
}
] | 2011-07-25T00:00:00 |
[
[
"Altenbach",
"Fabian",
""
],
[
"Böcherer",
"Georg",
""
],
[
"Mathar",
"Rudolf",
""
]
] |
new_dataset
| 0.996737 |
1107.4600
|
Stefano Rini
|
Stefano Rini, Daniela Tuninetti, Natasha Devroye, Andrea Goldsmith
|
On the Capacity of the Interference Channel with a Cognitive Relay
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The InterFerence Channel with a Cognitive Relay (IFC-CR) consists of the
classical interference channel with two independent source-destination pairs
whose communication is aided by an additional node, referred to as the
cognitive relay, that has a priori knowledge of both sources' messages. This a
priori message knowledge is termed cognition and idealizes the relay learning
the messages of the two sources from their transmissions over a wireless
channel. This paper presents new inner and outer bounds for the capacity region
of the general memoryless IFC-CR that are shown to be tight for a certain class
of channels. The new outer bound follows from arguments originally devised for
broadcast channels among which Sato's observation that the capacity region of
channels with non-cooperative receivers only depends on the channel output
conditional marginal distributions. The new inner bound is shown to include all
previously proposed coding schemes and it is thus the largest known achievable
rate region to date. The new inner and outer bounds coincide for a subset of
channel satisfying a strong interference condition. For these channels there is
no loss in optimality if both destinations decode both messages. This result
parallels analogous results for the classical IFC and for the cognitive IFC and
is the first known capacity result for the general IFC-CR. Numerical
evaluations of the proposed inner and outer bounds are presented for the
Gaussian noise case.
|
[
{
"version": "v1",
"created": "Fri, 22 Jul 2011 19:49:13 GMT"
}
] | 2011-07-25T00:00:00 |
[
[
"Rini",
"Stefano",
""
],
[
"Tuninetti",
"Daniela",
""
],
[
"Devroye",
"Natasha",
""
],
[
"Goldsmith",
"Andrea",
""
]
] |
new_dataset
| 0.999679 |
1107.4230
|
Elzbieta Zielinska
|
Elzbieta Zielinska, Krzysztof Szczypiorski
|
Direct Sequence Spread Spectrum Steganographic Scheme for IEEE 802.15.4
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work addresses the issues related to network steganography in IEEE
802.15.4 Wireless Personal Area Networks (WPAN). The proposed communication
scheme employs illicit Direct Sequence Spread Spectrum code sequences for the
transmission of steganographic data. The presented approach is a compromise
between minimising the probability of covert channel disclosure and providing
robustness against random errors and a high steganographic data rate. The
conducted analyses show that it is possible to create a covert channel with a
data rate comparable to the raw data rate of IEEE 802.15.4 without much impact
on the perceived receiver sensitivity, the Chip Error Rate and the Bit Error
Rate.
|
[
{
"version": "v1",
"created": "Thu, 21 Jul 2011 10:37:29 GMT"
}
] | 2011-07-22T00:00:00 |
[
[
"Zielinska",
"Elzbieta",
""
],
[
"Szczypiorski",
"Krzysztof",
""
]
] |
new_dataset
| 0.988469 |
0904.1630
|
Aaron Sterling
|
Aaron Sterling
|
Self-Assembly of a Statistically Self-Similar Fractal
|
I am withdrawing all work I would like to polish before resubmitting,
including this paper. Several typos fixed
| null | null | null |
cs.CC cs.DS cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We demonstrate existence of a tile assembly system that self-assembles the
statistically self-similar Sierpinski Triangle in the Winfree-Rothemund Tile
Assembly Model. This appears to be the first paper that considers self-assembly
of a random fractal, instead of a deterministic fractal or a finite, bounded
shape. Our technical contributions include a way to remember, and use,
unboundedly-long prefixes of an infinite coding sequence at each stage of
fractal construction; a tile assembly mechanism for nested recursion; and a
definition of "almost-everywhere local determinism," to describe a tileset
whose assembly is locally determined, conditional upon a zeta-dimension zero
set of (infinitely many) "input" tiles. This last is similar to the definition
of randomized computation for Turing machines, in which an algorithm is
deterministic relative to an oracle sequence of coin flips that provides advice
but does not itself compute. Keywords: tile self-assembly, statistically
self-similar Sierpinski Triangle.
|
[
{
"version": "v1",
"created": "Fri, 10 Apr 2009 03:19:04 GMT"
},
{
"version": "v2",
"created": "Sat, 11 Apr 2009 15:58:20 GMT"
},
{
"version": "v3",
"created": "Wed, 20 Jul 2011 14:00:06 GMT"
}
] | 2011-07-21T00:00:00 |
[
[
"Sterling",
"Aaron",
""
]
] |
new_dataset
| 0.995217 |
1104.4426
|
Maurizio Serva
|
Maurizio Serva
|
Phylogeny and geometry of languages from normalized Levenshtein distance
|
Review paper
| null | null | null |
cs.CL q-bio.PE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The idea that the distance among pairs of languages can be evaluated from
lexical differences seems to have its roots in the work of the French explorer
Dumont D'Urville. He collected comparative words lists of various languages
during his voyages aboard the Astrolabe from 1826 to 1829 and, in his work
about the geographical division of the Pacific, he proposed a method to measure
the degree of relation between languages.
The method used by the modern lexicostatistics, developed by Morris Swadesh
in the 1950s, measures distances from the percentage of shared cognates, which
are words with a common historical origin. The weak point of this method is
that subjective judgment plays a relevant role.
Recently, we have proposed a new automated method which is motivated by the
analogy with genetics. The new approach avoids any subjectivity and results can
be easily replicated by other scholars. The distance between two languages is
defined by considering a renormalized Levenshtein distance between pair of
words with the same meaning and averaging on the words contained in a list. The
renormalization, which takes into account the length of the words, plays a
crucial role, and no sensible results can be found without it.
In this paper we give a short review of our automated method and we
illustrate it by considering the cluster of Malagasy dialects. We show that it
sheds new light on their kinship relation and also that it furnishes a lot of
new information concerning the modalities of the settlement of Madagascar.
|
[
{
"version": "v1",
"created": "Fri, 22 Apr 2011 12:20:56 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Apr 2011 18:07:21 GMT"
},
{
"version": "v3",
"created": "Fri, 29 Apr 2011 06:26:36 GMT"
}
] | 2011-07-21T00:00:00 |
[
[
"Serva",
"Maurizio",
""
]
] |
new_dataset
| 0.998475 |
1106.2696
|
Peter Schaffer Dr.
|
Peter Schaffer, Djamila Aouada, Shishir Nagaraja
|
Who clicks there!: Anonymizing the photographer in a camera saturated
society
| null | null | null | null |
cs.CR cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, social media has played an increasingly important role in
reporting world events. The publication of crowd-sourced photographs and videos
in near real-time is one of the reasons behind the high impact. However, the
use of a camera can draw the photographer into a situation of conflict.
Examples include the use of cameras by regulators collecting evidence of Mafia
operations; citizens collecting evidence of corruption at a public service
outlet; and political dissidents protesting at public rallies. In all these
cases, the published images contain fairly unambiguous clues about the location
of the photographer (scene viewpoint information). In the presence of adversary
operated cameras, it can be easy to identify the photographer by also combining
leaked information from the photographs themselves. We call this the camera
location detection attack. We propose and review defense techniques against
such attacks. Defenses such as image obfuscation techniques do not protect
camera-location information; current anonymous publication technologies do not
help either. However, the use of view synthesis algorithms could be a promising
step in the direction of providing probabilistic privacy guarantees.
|
[
{
"version": "v1",
"created": "Tue, 14 Jun 2011 12:49:48 GMT"
}
] | 2011-07-21T00:00:00 |
[
[
"Schaffer",
"Peter",
""
],
[
"Aouada",
"Djamila",
""
],
[
"Nagaraja",
"Shishir",
""
]
] |
new_dataset
| 0.981812 |
1107.3614
|
Zahid Mounir
|
Zahid Mounir
|
New construction of APN quaratic
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
The purpose of this paper is to detail the article of Carlet. Along the way I
recall some interesting results in the theory of finite fields, I give (new)
proofs of some known results, and then I generalize the construction of a
family of APN function. The reference precedes each result, and in the absence
of reference the proof is due to the author.
Keywords: boolean, bent, APN
|
[
{
"version": "v1",
"created": "Tue, 19 Jul 2011 02:54:51 GMT"
}
] | 2011-07-20T00:00:00 |
[
[
"Mounir",
"Zahid",
""
]
] |
new_dataset
| 0.97005 |
1107.3622
|
Soubhik Chakraborty
|
Kiran Kumar Sundararajan, Mita Pal, Soubhik Chakraborty and N.C.
Mahanti
|
K-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs!
|
9 pages, 9 figures
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sundararajan and Chakraborty (2007) introduced a new version of Quick sort
removing the interchanges. Khreisat (2007) found this algorithm to be competing
well with some other versions of Quick sort. However, it uses an auxiliary
array thereby increasing the space complexity. Here, we provide a second
version of our new sort where we have removed the auxiliary array. This second
improved version of the algorithm, which we call K-sort, is found to sort
elements faster than Heap sort for an appreciably large array size (n <=
70,00,000) for uniform U[0, 1] inputs.
|
[
{
"version": "v1",
"created": "Tue, 19 Jul 2011 04:21:58 GMT"
}
] | 2011-07-20T00:00:00 |
[
[
"Sundararajan",
"Kiran Kumar",
""
],
[
"Pal",
"Mita",
""
],
[
"Chakraborty",
"Soubhik",
""
],
[
"Mahanti",
"N. C.",
""
]
] |
new_dataset
| 0.978442 |
1107.3695
|
Abderrahim Bourouis
|
Abderrahim Bourouis, Mohamed Feham and Abdelhamid Bouchachia
|
Ubiquitous Mobile Health Monitoring System for Elderly (UMHMSE)
|
9 pages,5 figures
|
International Journal of Computer Science & Information Technology
(IJCSIT), Vol 3, No 3, June 2011
| null | null |
cs.NI
|
http://creativecommons.org/licenses/by/3.0/
|
Recent research in ubiquitous computing uses technologies of Body Area
Networks (BANs) to monitor the person's kinematics and physiological
parameters. In this paper we propose a real time mobile health system for
monitoring elderly patients from indoor or outdoor environments. The system
uses a bio- signal sensor worn by the patient and a Smartphone as a central
node. The sensor data is collected and transmitted to the intelligent server
through GPRS/UMTS to be analyzed. The prototype (UMHMSE) monitors the elderly
mobility, location and vital signs such as Sp02 and Heart Rate. Remote users
(family and medical personnel) might have a real time access to the collected
information through a web application.
|
[
{
"version": "v1",
"created": "Tue, 19 Jul 2011 12:10:23 GMT"
}
] | 2011-07-20T00:00:00 |
[
[
"Bourouis",
"Abderrahim",
""
],
[
"Feham",
"Mohamed",
""
],
[
"Bouchachia",
"Abdelhamid",
""
]
] |
new_dataset
| 0.996163 |
1107.3785
|
Vladimir Tregub Mr
|
Vladimir Vasilich Tregub
|
Teaching Introductory Electrical Engineering Course to CS Students in a
Russian University
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article is about the author's experience with developing and teaching an
introductory electrical engineering course for students of Faculty (department)
of Information Technology of a Russian university. The curriculum of this
department conforms to typical computer science curricula of US engineering
schools with a noticeable omission of comparable electrical engineering
courses. When developing the course, I did my best to pay attention to learning
preferences of the department's student body. I also hoped to contribute to a
degree to meeting labor market demands for developers of electrical engineering
CAD software. As for inspiration, I was enchanted with ideas of the Mead &
Conway revolution, albeit indirectly related to my enterprise.
|
[
{
"version": "v1",
"created": "Tue, 19 Jul 2011 17:36:18 GMT"
}
] | 2011-07-20T00:00:00 |
[
[
"Tregub",
"Vladimir Vasilich",
""
]
] |
new_dataset
| 0.989076 |
1107.3363
|
Pankaj Sehgal Kumar
|
Rajender Nath and Pankaj Kumar Sehgal
|
SD-AODV: A Protocol for Secure and Dynamic Data Dissemination in Mobile
Ad Hoc Network
|
8 pages, 11 figures, 1 table, IJCSI International Journal of Computer
Science Issues, Vol. 7, Issue 6, November 2010
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Security remains as a major concern in the mobile ad hoc networks. This paper
presents a new protocol SD-AODV, which is an extension of the exiting protocol
AODV. The proposed protocol is made secure and dynamic against three main types
of routing attacks- wormhole attack, byzantine attack and blackhole attack.
SD-AODV protocol was evaluated through simulation experiments done on Glomosim
and performance of the network was measured in terms of packet delivery
fraction, average end-to-end delay, global throughput and route errors of a
mobile ad hoc network where a defined percentage of nodes behave maliciously.
Experimentally it was found that the performance of the network did not degrade
in the presence of the above said attacks indicating that the proposed protocol
was secure against these attacks.
|
[
{
"version": "v1",
"created": "Mon, 18 Jul 2011 06:34:38 GMT"
}
] | 2011-07-19T00:00:00 |
[
[
"Nath",
"Rajender",
""
],
[
"Sehgal",
"Pankaj Kumar",
""
]
] |
new_dataset
| 0.999589 |
1107.2437
|
Ignacio Vega-Paez M en C
|
Harold V. McIntosh
|
A CONVERT compiler of REC for PDP-8
|
This paper is seminal formal definition for REC language was
published in "Acta Mexicana de Ciencia y Tecnolog\'ia" of IPN, Jan-April
1968. REC is a programming language of extremely simple structure and what it
was proved that the well publicized inconvenience of programming without a
goto was a myth in Sixties endings
|
Acta Mexicana de Ciencia y Tecnologia of IPN, Vol. II, No. 1, pp
33-43, Jan-April 1968, Mexico, D.F
| null |
IBP-Memo 2011-07
|
cs.PL
|
http://creativecommons.org/licenses/publicdomain/
|
REC (REGULAR EXPRESSION COMPILER) is a programming language of simple
structure developed originally for the PDP-8 computer of the Digital Equipment,
Corporation, but readily adaptable to any other general purpose computer. It
has been used extensively in teaching Algebra and Numerical Analysis in the
Escuela Superior de F\'isica y Matem\'aticas of the Instituto Polit\'ecnico
Nacional. Moreover, the fact that the same control language, REC, is equally
applicable and equally efficient over the whole range of computer facilities
available to the students gives a very welcome coherence to the entire teaching
program, including the course of Mathematical Logic which is devoted to the
theoretical aspects of such matters.
REC; derives its appeal from the fact that computers can be regarded
reasonably well as Turing Machines. The REC notation is simply a manner of
writing regular expression, somewhat more amenable to programming the Turing
Machine which they control. If one does not wish to think so strictly in terms
of Turing Machines, REC expressions still provide a means of defining the flow
of control in a program which is quite convenient for many applications.
|
[
{
"version": "v1",
"created": "Tue, 12 Jul 2011 23:43:18 GMT"
}
] | 2011-07-15T00:00:00 |
[
[
"McIntosh",
"Harold V.",
""
]
] |
new_dataset
| 0.992168 |
1107.2683
|
Carlos Alberto Fernandez-y-Fernandez
|
Carlos Alberto Fernandez-y-Fernandez, Jose Angel Quintanar Morales and
Hermenegildo Fernandez Santos
|
An IDE to Build and Check Task Flow Models
| null |
Fernandez-y-Fernandez, C.A., Quintanar Morales, J.A and Fernandez
Santos, H. An IDE to Build and Check Task Flow Models. Advances in Computer
Science and Applications, Research in Computer Science 53, 2011, pp. 23-33
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the Eclipse plug-ins for the Task Flow model in the
Discovery Method. These plug-ins provide an IDE for the Task Algebra compiler
and the model-checking tools. The Task Algebra is the formal representation for
the Task Model and it is based on simple and compound tasks. The model-checking
techniques were developed to validate Task Models represented in the algebra.
|
[
{
"version": "v1",
"created": "Wed, 13 Jul 2011 21:58:38 GMT"
}
] | 2011-07-15T00:00:00 |
[
[
"Fernandez-y-Fernandez",
"Carlos Alberto",
""
],
[
"Morales",
"Jose Angel Quintanar",
""
],
[
"Santos",
"Hermenegildo Fernandez",
""
]
] |
new_dataset
| 0.994217 |
1004.5367
|
Kenta Kasai
|
Kenta Kasai, David Declercq, Charly Poulliat, Kohichi Sakaniwa
|
Multiplicatively Repeated Non-Binary LDPC Codes
|
To appear in IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
We propose non-binary LDPC codes concatenated with multiplicative repetition
codes. By multiplicatively repeating the (2,3)-regular non-binary LDPC mother
code of rate 1/3, we construct rate-compatible codes of lower rates 1/6, 1/9,
1/12,... Surprisingly, such simple low-rate non-binary LDPC codes outperform
the best low-rate binary LDPC codes so far. Moreover, we propose the decoding
algorithm for the proposed codes, which can be decoded with almost the same
computational complexity as that of the mother code.
|
[
{
"version": "v1",
"created": "Thu, 29 Apr 2010 19:15:02 GMT"
},
{
"version": "v2",
"created": "Wed, 13 Jul 2011 08:48:46 GMT"
}
] | 2011-07-14T00:00:00 |
[
[
"Kasai",
"Kenta",
""
],
[
"Declercq",
"David",
""
],
[
"Poulliat",
"Charly",
""
],
[
"Sakaniwa",
"Kohichi",
""
]
] |
new_dataset
| 0.995037 |
1107.2157
|
Matthew Sottile
|
Matthew J. Sottile and Craig E Rasmussen and Wayne N. Weseloh and
Robert W. Robey and Daniel Quinlan and Jeffrey Overbey
|
ForOpenCL: Transformations Exploiting Array Syntax in Fortran for
Accelerator Programming
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Emerging GPU architectures for high performance computing are well suited to
a data-parallel programming model. This paper presents preliminary work
examining a programming methodology that provides Fortran programmers with
access to these emerging systems. We use array constructs in Fortran to show
how this infrequently exploited, standardized language feature is easily
transformed to lower-level accelerator code. The transformations in ForOpenCL
are based on a simple mapping from Fortran to OpenCL. We demonstrate, using a
stencil code solving the shallow-water fluid equations, that the performance of
the ForOpenCL compiler-generated transformations is comparable with that of
hand-optimized OpenCL code.
|
[
{
"version": "v1",
"created": "Mon, 11 Jul 2011 22:07:32 GMT"
}
] | 2011-07-13T00:00:00 |
[
[
"Sottile",
"Matthew J.",
""
],
[
"Rasmussen",
"Craig E",
""
],
[
"Weseloh",
"Wayne N.",
""
],
[
"Robey",
"Robert W.",
""
],
[
"Quinlan",
"Daniel",
""
],
[
"Overbey",
"Jeffrey",
""
]
] |
new_dataset
| 0.99412 |
cs/0703088
|
Ignacio Vega-Paez M en C
|
Ignacio Vega-Paez and Carlos Alberto Hernandez-Hernandez
|
Plot 94 in ambiance X-Window
| null |
Proceedings in Information Systems Analysis and Synthesis ISAS
1995, 5th, International Symposium on Systems Research, Informatics and
Cybernetics, pp. 135-139, August 16-20, 95, Baden-Baden, Germany
| null |
IBP-TR1995-01
|
cs.CV cs.GR
| null |
<PLOT > is a collection of routines to draw surfaces, contours and so on. In
this work we are presenting a version, that functions over work stations with
the operative system UNIX, that count with the graphic ambiance X-WINDOW with
the tools XLIB and OSF/MOTIF. This implant was realized for the work stations
DEC 5000-200, DEC IPX, and DEC ALFA of the CINVESTAV (Center of Investigation
and Advanced Studies). Also implanted in SILICON GRAPHICS of the CENAC
(National Center of Calculation of the Polytechnic National Institute
|
[
{
"version": "v1",
"created": "Fri, 16 Mar 2007 00:18:11 GMT"
}
] | 2011-07-13T00:00:00 |
[
[
"Vega-Paez",
"Ignacio",
""
],
[
"Hernandez-Hernandez",
"Carlos Alberto",
""
]
] |
new_dataset
| 0.999368 |
0905.0740
|
Ignacio Vega-Paez M en C
|
Gerardo Cisneros
|
A FORTRAN coded regular expression Compiler for IBM 1130 Computing
System
|
This version of REC is archaeological reconstruction of REC/A
language on IBM1130 Simulator (SIMH IBM 1130 Emulator and Disk Monitor System
R2V12) from Computer History Simulation Project (www.ibm1130.org), also see
REC language is a live for Ignacio Vega-Paez
|
Acta Mexicana de Ciencia y Tecnologia Vol. IV No. 1, page 30-86,
1970
| null |
IBP-Memo 2008-12
|
cs.CL cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
REC (Regular Expression Compiler) is a concise programming language which
allows students to write programs without knowledge of the complicated syntax
of languages like FORTRAN and ALGOL. The language is recursive and contains
only four elements for control. This paper describes an interpreter of REC
written in FORTRAN.
|
[
{
"version": "v1",
"created": "Wed, 6 May 2009 04:29:51 GMT"
}
] | 2011-07-12T00:00:00 |
[
[
"Cisneros",
"Gerardo",
""
]
] |
new_dataset
| 0.999673 |
1009.0143
|
Jean Mairesse
|
Philippe Chassaing (IECN), Jean Mairesse (LIAFA)
|
A non-ergodic probabilistic cellular automaton with a unique invariant
measure
|
To appear in Stochastic Processes and their Applications
| null | null | null |
cs.FL cs.DM math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We exhibit a Probabilistic Cellular Automaton (PCA) on the integers with an
alphabet and a neighborhood of size 2 which is non-ergodic although it has a
unique invariant measure. This answers by the negative an old open question on
whether uniqueness of the invariant measure implies ergodicity for a PCA.
|
[
{
"version": "v1",
"created": "Wed, 1 Sep 2010 09:51:37 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Oct 2010 15:24:22 GMT"
},
{
"version": "v3",
"created": "Fri, 8 Jul 2011 15:04:09 GMT"
}
] | 2011-07-11T00:00:00 |
[
[
"Chassaing",
"Philippe",
"",
"IECN"
],
[
"Mairesse",
"Jean",
"",
"LIAFA"
]
] |
new_dataset
| 0.992265 |
1107.1563
|
Jiadong Wang
|
Jiadong Wang, Thomas Courtade, Tsung-Yi Chen, Bike Xie and Richard
Wesel
|
Designing Nonlinear Turbo Codes with a Target Ones Density
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Certain binary asymmetric channels, such as Z-channels in which one of the
two crossover probabilities is zero, demand optimal ones densities different
from 50%. Some broadcast channels, such as broadcast binary symmetric channels
(BBSC) where each component channel is a binary symmetric channel, also require
a non-uniform input distribution due to the superposition coding scheme, which
is known to achieve the boundary of capacity region. This paper presents a
systematic technique for designing nonlinear turbo codes that are able to
support ones densities different from 50%. To demonstrate the effectiveness of
our design technique, we design and simulate nonlinear turbo codes for the
Z-channel and the BBSC. The best nonlinear turbo code is less than 0.02 bits
from capacity.
|
[
{
"version": "v1",
"created": "Fri, 8 Jul 2011 06:05:55 GMT"
}
] | 2011-07-11T00:00:00 |
[
[
"Wang",
"Jiadong",
""
],
[
"Courtade",
"Thomas",
""
],
[
"Chen",
"Tsung-Yi",
""
],
[
"Xie",
"Bike",
""
],
[
"Wesel",
"Richard",
""
]
] |
new_dataset
| 0.961717 |
1107.1642
|
Yipeng Liu Dr.
|
Yipeng Liu and Qun Wan
|
Indirect Channel Sensing for Cognitive Amplify-and-Forward Relay
Networks
|
5 pages, 5 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In cognitive radio network the primary channel information is beneficial. But
it can not be obtained by direct channel estimation in cognitive system as
pervious methods. And only one possible way is the primary receiver broadcasts
the primary channel information to the cognitive users, but it would require
the modification of the primary receiver and additional precious spectrum
resource. Cooperative communication is also a promising technique. And this
paper introduces an indirect channel sensing method for the primary channel in
cognitive amplify-and-forward (AF) relay network. As the signal retransmitted
from the primary AF relay node includes channel effects, the cognitive radio
can receive retransmitted signal from AF node, and then extract the channel
information from them. Afterwards, Least squares channel estimation and sparse
channel estimation can be used to address the dense and sparse multipath
channels respectively. Numerical experiment demonstrates that the proposed
indirect channel sensing method has an acceptable performance.
|
[
{
"version": "v1",
"created": "Fri, 8 Jul 2011 14:24:03 GMT"
}
] | 2011-07-11T00:00:00 |
[
[
"Liu",
"Yipeng",
""
],
[
"Wan",
"Qun",
""
]
] |
new_dataset
| 0.998642 |
1107.1644
|
Jocelyne Troccaz
|
Michael Baumann (TIMC), Pierre Mozer, Vincent Daanen, Jocelyne Troccaz
(TIMC)
|
Prostate biopsy tracking with deformation estimation
|
Medical Image Analysis (2011) epub ahead of print
| null |
10.1016/j.media.2011.01.008
| null |
cs.CV physics.med-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Transrectal biopsies under 2D ultrasound (US) control are the current
clinical standard for prostate cancer diagnosis. The isoechogenic nature of
prostate carcinoma makes it necessary to sample the gland systematically,
resulting in a low sensitivity. Also, it is difficult for the clinician to
follow the sampling protocol accurately under 2D US control and the exact
anatomical location of the biopsy cores is unknown after the intervention.
Tracking systems for prostate biopsies make it possible to generate biopsy
distribution maps for intra- and post-interventional quality control and 3D
visualisation of histological results for diagnosis and treatment planning.
They can also guide the clinician toward non-ultrasound targets. In this paper,
a volume-swept 3D US based tracking system for fast and accurate estimation of
prostate tissue motion is proposed. The entirely image-based system solves the
patient motion problem with an a priori model of rectal probe kinematics.
Prostate deformations are estimated with elastic registration to maximize
accuracy. The system is robust with only 17 registration failures out of 786
(2%) biopsy volumes acquired from 47 patients during biopsy sessions. Accuracy
was evaluated to 0.76$\pm$0.52mm using manually segmented fiducials on 687
registered volumes stemming from 40 patients. A clinical protocol for assisted
biopsy acquisition was designed and implemented as a biopsy assistance system,
which allows to overcome the draw-backs of the standard biopsy procedure.
|
[
{
"version": "v1",
"created": "Thu, 7 Jul 2011 06:31:05 GMT"
}
] | 2011-07-11T00:00:00 |
[
[
"Baumann",
"Michael",
"",
"TIMC"
],
[
"Mozer",
"Pierre",
"",
"TIMC"
],
[
"Daanen",
"Vincent",
"",
"TIMC"
],
[
"Troccaz",
"Jocelyne",
"",
"TIMC"
]
] |
new_dataset
| 0.997578 |
1107.1292
|
Christian Wulff-Nilsen
|
Christian Wulff-Nilsen
|
Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with
Applications
|
To appear at FOCS 2011
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Alon, Seymour, and Thomas generalized Lipton and Tarjan's planar separator
theorem and showed that a $K_h$-minor free graph with $n$ vertices has a
separator of size at most $h^{3/2}\sqrt n$. They gave an algorithm that, given
a graph $G$ with $m$ edges and $n$ vertices and given an integer $h\geq 1$,
outputs in $O(\sqrt{hn}m)$ time such a separator or a $K_h$-minor of $G$.
Plotkin, Rao, and Smith gave an $O(hm\sqrt{n\log n})$ time algorithm to find a
separator of size $O(h\sqrt{n\log n})$. Kawarabayashi and Reed improved the
bound on the size of the separator to $h\sqrt n$ and gave an algorithm that
finds such a separator in $O(n^{1 + \epsilon})$ time for any constant $\epsilon
> 0$, assuming $h$ is constant. This algorithm has an extremely large
dependency on $h$ in the running time (some power tower of $h$ whose height is
itself a function of $h$), making it impractical even for small $h$. We are
interested in a small polynomial time dependency on $h$ and we show how to find
an $O(h\sqrt{n\log n})$-size separator or report that $G$ has a $K_h$-minor in
$O(\poly(h)n^{5/4 + \epsilon})$ time for any constant $\epsilon > 0$. We also
present the first $O(\poly(h)n)$ time algorithm to find a separator of size
$O(n^c)$ for a constant $c < 1$. As corollaries of our results, we get improved
algorithms for shortest paths and maximum matching. Furthermore, for integers
$\ell$ and $h$, we give an $O(m + n^{2 + \epsilon}/\ell)$ time algorithm that
either produces a $K_h$-minor of depth $O(\ell\log n)$ or a separator of size
at most $O(n/\ell + \ell h^2\log n)$. This improves the shallow minor algorithm
of Plotkin, Rao, and Smith when $m = \Omega(n^{1 + \epsilon})$. We get a
similar running time improvement for an approximation algorithm for the problem
of finding a largest $K_h$-minor in a given graph.
|
[
{
"version": "v1",
"created": "Thu, 7 Jul 2011 04:28:37 GMT"
}
] | 2011-07-08T00:00:00 |
[
[
"Wulff-Nilsen",
"Christian",
""
]
] |
new_dataset
| 0.998611 |
1107.1099
|
Steven Meyer
|
Steven Meyer
|
Selling train tickets by SMS
|
June 2010
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Selling train tickets has evolved in the last ten years from queuing in the
railway station, to buying tickets on the internet and printing them. Both
alternatives are still viable options, though they are time consuming or need
printing devices. Nowadays it is essential to offer a service that is as fast
and efficient as possible: mobile phones provide an accessible, affordable and
widely available tool for supplying information and transferring data. The goal
of this project is to design a train ticket contained in a SMS message. While
there are several challenges related to the project, the main one is the
security and how we can digitally sign a train ticket that is contained in 160
characters. The solution offered in this project is the implementation of the
MOVA Signature (from the name of the inventors MOnnerat and VAudenay) that uses
an interactive verification and therefore allows signature of 20 bits (roughly
4 characters).
|
[
{
"version": "v1",
"created": "Wed, 6 Jul 2011 11:21:34 GMT"
}
] | 2011-07-07T00:00:00 |
[
[
"Meyer",
"Steven",
""
]
] |
new_dataset
| 0.999438 |
1107.1101
|
Steven Meyer
|
Steven Meyer
|
Misbehavior in Mobile Application Markets
|
December 2010
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile application markets facilitate the distribution of applications and
thus help developers advertise their work and customers find useful
applications. In addition, the operators of mobile application markets can
control the quality and the content of the applications. These markets are
growing rapidly with more than 300'000 application in the App Store of Apple
and more than 100'000 in the Android Market of Google. This is not only a great
opportunity for phone manufacturers to earn money but also for indie developers
(single or small teams of developers with small financial support) who can thus
have a great distribution channel. Steve Demeter, the Trim game developer for
iPhone, became millionaire with a single puzzle game . Obviously, as new
markets generate a lot of money, the temptation of misbehavior to steal part of
the benefits is big. The first famous case was the one of Molinker who
self-rated his applications with 5 stars to pump up his ranking in order to
increase its revenue stream. In this report, we will consider the problem of
misbehavior in mobile application markets. We will investigate multiple attacks
by misbehaving developers, users or network operators that aim at breaking
rules for their own benefit, managing to outwit the operators' control on which
applications can be installed. We notably suggest novel attacks that may affect
mobile markets in the future: in particular, we show that it is possible to get
revenue for applications created by someone else, trick a user to download and
buy an application and new ways to pump up an application's ranking. We will
also discuss possible solutions against spyware applications and cheating
developer
|
[
{
"version": "v1",
"created": "Wed, 6 Jul 2011 11:30:13 GMT"
}
] | 2011-07-07T00:00:00 |
[
[
"Meyer",
"Steven",
""
]
] |
new_dataset
| 0.999821 |
1106.5156
|
Mallikarjun Hangarge Dr.
|
B.V.Dhandra, Mallikarjun Hangarge
|
Morphological Reconstruction for Word Level Script Identification
|
11 Pages, 8 Figures,5 Tables; Revised: 15-06-2007,Published:
30-06-2007
|
International Journal of Computer Science and Security
(IJCSS),Volume (1) : Issue (1), 41 - 51, 2007
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A line of a bilingual document page may contain text words in regional
language and numerals in English. For Optical Character Recognition (OCR) of
such a document page, it is necessary to identify different script forms before
running an individual OCR system. In this paper, we have identified a tool of
morphological opening by reconstruction of an image in different directions and
regional descriptors for script identification at word level, based on the
observation that every text has a distinct visual appearance. The proposed
system is developed for three Indian major bilingual documents, Kannada, Telugu
and Devnagari containing English numerals. The nearest neighbour and k-nearest
neighbour algorithms are applied to classify new word images. The proposed
algorithm is tested on 2625 words with various font styles and sizes. The
results obtained are quite encouraging
|
[
{
"version": "v1",
"created": "Sat, 25 Jun 2011 18:16:59 GMT"
},
{
"version": "v2",
"created": "Mon, 4 Jul 2011 13:35:35 GMT"
}
] | 2011-07-05T00:00:00 |
[
[
"Dhandra",
"B. V.",
""
],
[
"Hangarge",
"Mallikarjun",
""
]
] |
new_dataset
| 0.999118 |
1107.0439
|
H. Reiju Mihara
|
Masahiro Kumabe, H. Reiju Mihara
|
The Nakamura numbers for computable simple games
|
24+1 pages
|
Social Choice and Welfare (2008) 31:621-640
|
10.1007/s00355-008-0300-5
| null |
cs.GT cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Nakamura number of a simple game plays a critical role in preference
aggregation (or multi-criterion ranking): the number of alternatives that the
players can always deal with rationally is less than this number. We
comprehensively study the restrictions that various properties for a simple
game impose on its Nakamura number. We find that a computable game has a finite
Nakamura number greater than three only if it is proper, nonstrong, and
nonweak, regardless of whether it is monotonic or whether it has a finite
carrier. The lack of strongness often results in alternatives that cannot be
strictly ranked.
|
[
{
"version": "v1",
"created": "Sun, 3 Jul 2011 09:03:44 GMT"
}
] | 2011-07-05T00:00:00 |
[
[
"Kumabe",
"Masahiro",
""
],
[
"Mihara",
"H. Reiju",
""
]
] |
new_dataset
| 0.978721 |
1107.0011
|
Kundan Singh
|
Kundan Singh and Carol Davids
|
Flash-based Audio and Video Communication in the Cloud
|
Technical Implementation Report, 13 pages, 15 figures
| null | null | null |
cs.NI cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Internet telephony and multimedia communication protocols have matured over
the last fifteen years. Recently, the web is evolving as a popular platform for
everything we do on the Internet including email, text chat, voice calls,
discussions, enterprise apps and multi-party collaboration. Unfortunately,
there is a disconnect between web and traditional Internet telephony protocols
as they have ignored the constraints and requirements of each other.
Consequently, the Flash Player is being used as a web browser plugin by many
developers for web-based voice and video calls. We describe the challenges of
video communication using a web browser, present a simple API using a Flash
Player application, show how it supports wide range of web communication
scenarios in the cloud, and describe how it can interoperate with Session
Initiation Protocol (SIP)-based systems. We describe both the advantages and
challenges of Flash Player based communication applications. The presented API
could guide future work on communication-related web protocol extensions.
|
[
{
"version": "v1",
"created": "Thu, 30 Jun 2011 20:06:50 GMT"
}
] | 2011-07-04T00:00:00 |
[
[
"Singh",
"Kundan",
""
],
[
"Davids",
"Carol",
""
]
] |
new_dataset
| 0.997583 |
1107.0026
|
M. J. Nederhof
|
M. J. Nederhof, G. Satta
|
IDL-Expressions: A Formalism for Representing and Parsing Finite
Languages in Natural Language Processing
| null |
Journal Of Artificial Intelligence Research, Volume 21, pages
287-317, 2004
|
10.1613/jair.1309
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a formalism for representation of finite languages, referred to as
the class of IDL-expressions, which combines concepts that were only considered
in isolation in existing formalisms. The suggested applications are in natural
language processing, more specifically in surface natural language generation
and in machine translation, where a sentence is obtained by first generating a
large set of candidate sentences, represented in a compact way, and then by
filtering such a set through a parser. We study several formal properties of
IDL-expressions and compare this new formalism with more standard ones. We also
present a novel parsing algorithm for IDL-expressions and prove a non-trivial
upper bound on its time complexity.
|
[
{
"version": "v1",
"created": "Thu, 30 Jun 2011 20:33:50 GMT"
}
] | 2011-07-04T00:00:00 |
[
[
"Nederhof",
"M. J.",
""
],
[
"Satta",
"G.",
""
]
] |
new_dataset
| 0.995035 |
1107.0028
|
M. Babaioff
|
M. Babaioff, N. Nisan
|
Concurrent Auctions Across The Supply Chain
| null |
Journal Of Artificial Intelligence Research, Volume 21, pages
595-629, 2004
|
10.1613/jair.1316
| null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the recent technological feasibility of electronic commerce over the
Internet, much attention has been given to the design of electronic markets for
various types of electronically-tradable goods. Such markets, however, will
normally need to function in some relationship with markets for other related
goods, usually those downstream or upstream in the supply chain. Thus, for
example, an electronic market for rubber tires for trucks will likely need to
be strongly influenced by the rubber market as well as by the truck market. In
this paper we design protocols for exchange of information between a sequence
of markets along a single supply chain. These protocols allow each of these
markets to function separately, while the information exchanged ensures
efficient global behavior across the supply chain. Each market that forms a
link in the supply chain operates as a double auction, where the bids on one
side of the double auction come from bidders in the corresponding segment of
the industry, and the bids on the other side are synthetically generated by the
protocol to express the combined information from all other links in the chain.
The double auctions in each of the markets can be of several types, and we
study several variants of incentive compatible double auctions, comparing them
in terms of their efficiency and of the market revenue.
|
[
{
"version": "v1",
"created": "Thu, 30 Jun 2011 20:34:24 GMT"
}
] | 2011-07-04T00:00:00 |
[
[
"Babaioff",
"M.",
""
],
[
"Nisan",
"N.",
""
]
] |
new_dataset
| 0.998861 |
1106.6323
|
Sanjay Karmakar
|
Sanjay Karmakar and Mahesh K. Varanasi
|
The Diversity Multiplexing Tradeoff of the MIMO Half-Duplex Relay
Channel
|
42 pages, 7 figures; submitted to the Trans. of IT
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The fundamental diversity-multiplexing tradeoff of the three-node,
multi-input, multi-output (MIMO), quasi-static, Rayleigh faded, half-duplex
relay channel is characterized for an arbitrary number of antennas at each node
and in which opportunistic scheduling (or dynamic operation) of the relay is
allowed, i.e., the relay can switch between receive and transmit modes at a
channel dependent time. In this most general case, the diversity-multiplexing
tradeoff is characterized as a solution to a simple, two-variable optimization
problem. This problem is then solved in closed form for special classes of
channels defined by certain restrictions on the numbers of antennas at the
three nodes. The key mathematical tool developed here that enables the explicit
characterization of the diversity-multiplexing tradeoff is the joint eigenvalue
distribution of three mutually correlated random Wishart matrices. Previously,
without actually characterizing the diversity-multiplexing tradeoff, the
optimality in this tradeoff metric of the dynamic compress-and-forward (DCF)
protocol based on the classical compress-and-forward scheme of Cover and El
Gamal was shown by Yuksel and Erkip. However, this scheme requires global
channel state information (CSI) at the relay. In this work, the so-called
quantize-map and forward (QMF) coding scheme due to Avestimehr {\em et} {\em
al} is adopted as the achievability scheme with the added benefit that it
achieves optimal tradeoff with only the knowledge of the (channel dependent)
switching time at the relay node. Moreover, in special classes of the MIMO
half-duplex relay channel, the optimal tradeoff is shown to be attainable even
without this knowledge. Such a result was previously known only for the
half-duplex relay channel with a single antenna at each node, also via the QMF
scheme.
|
[
{
"version": "v1",
"created": "Thu, 30 Jun 2011 18:16:20 GMT"
}
] | 2011-07-01T00:00:00 |
[
[
"Karmakar",
"Sanjay",
""
],
[
"Varanasi",
"Mahesh K.",
""
]
] |
new_dataset
| 0.993946 |
1106.6333
|
Kundan Singh
|
Carol Davids, Alan Johnston, Kundan Singh, Henry Sinnreich and Wilhelm
Wimmreuter
|
SIP APIs for Voice and Video Communications on the Web
|
Accepted at IPTcomm 2011, 7 pages, 4 figures
| null | null | null |
cs.NI cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Existing standard protocols for the web and Internet telephony fail to
deliver real-time interactive communication from within a web browser. In
particular, the client-server web protocol over reliable TCP is not always
suitable for end-to-end low latency media path needed for interactive voice and
video communication. To solve this, we compare the available platform options
using the existing technologies such as modifying the web programming language
and protocol, using an existing web browser plugin, and a separate host
resident application that the web browser can talk to. We argue that using a
separate application as an adaptor is a promising short term as well as
long-term strategy for voice and video communications on the web. Our project
aims at developing the open technology and sample implementations for web-based
real-time voice and video communication applications. We describe the
architecture of our project including (1) a RESTful web communication API over
HTTP inspired by SIP message flows, (2) a web-friendly set of metadata for
session description, and (3) an UDP-based end-to-end media path. All other
telephony functions reside in the web application itself and/or in web feature
servers. The adaptor approach allows us to easily add new voice and video
codecs and NAT traversal technologies such as Host Identity Protocol. We want
to make web-based communication accessible to millions of web developers,
maximize the end user experience and security, and preserve the huge global
investment in and experience from SIP systems while adhering to web standards
and development tools as much as possible. We have created an open source
prototype that allows you to freely use the conference application by directing
a browser to the conference URL.
|
[
{
"version": "v1",
"created": "Thu, 30 Jun 2011 18:40:48 GMT"
}
] | 2011-07-01T00:00:00 |
[
[
"Davids",
"Carol",
""
],
[
"Johnston",
"Alan",
""
],
[
"Singh",
"Kundan",
""
],
[
"Sinnreich",
"Henry",
""
],
[
"Wimmreuter",
"Wilhelm",
""
]
] |
new_dataset
| 0.992237 |
0911.2023
|
Aditya Mahajan
|
Aditya Mahajan and Sekhar Tatikonda
|
Opportunistic capacity and error exponent regions for compound channel
with feedback
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Variable length communication over a compound channel with feedback is
considered. Traditionally, capacity of a compound channel without feedback is
defined as the maximum rate that is determined before the start of
communication such that communication is reliable. This traditional definition
is pessimistic. In the presence of feedback, an opportunistic definition is
given. Capacity is defined as the maximum rate that is determined at the end of
communication such that communication is reliable. Thus, the transmission rate
can adapt to the channel chosen by nature. Under this definition, feedback
communication over a compound channel is conceptually similar to multi-terminal
communication. Transmission rate is a vector rather than a scalar; channel
capacity is a region rather than a scalar; error exponent is a region rather
than a scalar. In this paper, variable length communication over a compound
channel with feedback is formulated, its opportunistic capacity region is
characterized, and lower bounds for its error exponent region are provided..
|
[
{
"version": "v1",
"created": "Tue, 10 Nov 2009 22:52:23 GMT"
},
{
"version": "v2",
"created": "Tue, 6 Apr 2010 20:35:30 GMT"
},
{
"version": "v3",
"created": "Wed, 29 Jun 2011 18:10:44 GMT"
}
] | 2011-06-30T00:00:00 |
[
[
"Mahajan",
"Aditya",
""
],
[
"Tatikonda",
"Sekhar",
""
]
] |
new_dataset
| 0.996014 |
1106.5551
|
Hema Swetha Koppula
|
Hema Swetha Koppula, Abhishek Anand, Thorsten Joachims, Ashutosh
Saxena
|
Labeling 3D scenes for Personal Assistant Robots
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Inexpensive RGB-D cameras that give an RGB image together with depth data
have become widely available. We use this data to build 3D point clouds of a
full scene. In this paper, we address the task of labeling objects in this 3D
point cloud of a complete indoor scene such as an office. We propose a
graphical model that captures various features and contextual relations,
including the local visual appearance and shape cues, object co-occurrence
relationships and geometric relationships. With a large number of object
classes and relations, the model's parsimony becomes important and we address
that by using multiple types of edge potentials. The model admits efficient
approximate inference, and we train it using a maximum-margin learning
approach. In our experiments over a total of 52 3D scenes of homes and offices
(composed from about 550 views, having 2495 segments labeled with 27 object
classes), we get a performance of 84.06% in labeling 17 object classes for
offices, and 73.38% in labeling 17 object classes for home scenes. Finally, we
applied these algorithms successfully on a mobile robot for the task of finding
an object in a large cluttered room.
|
[
{
"version": "v1",
"created": "Tue, 28 Jun 2011 02:02:00 GMT"
}
] | 2011-06-29T00:00:00 |
[
[
"Koppula",
"Hema Swetha",
""
],
[
"Anand",
"Abhishek",
""
],
[
"Joachims",
"Thorsten",
""
],
[
"Saxena",
"Ashutosh",
""
]
] |
new_dataset
| 0.993555 |
1106.5568
|
Lin Zhong
|
Ardalan Amiri Sani, Wolfgang Richter, Xuan Bao, Trevor Narayan,
Mahadev Satyanarayanan, Lin Zhong, Romit Roy Choudhury
|
Opportunistic Content Search of Smartphone Photos
| null | null | null |
Technical Report TR0627-2011, Rice University
|
cs.IR cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Photos taken by smartphone users can accidentally contain content that is
timely and valuable to others, often in real-time. We report the system design
and evaluation of a distributed search system, Theia, for crowd-sourced
real-time content search of smartphone photos. Because smartphones are
resource-constrained, Theia incorporates two key innovations to control search
cost and improve search efficiency. Incremental Search expands search scope
incrementally and exploits user feedback. Partitioned Search leverages the
cloud to reduce the energy consumption of search in smartphones. Through user
studies, measurement studies, and field studies, we show that Theia reduces the
cost per relevant photo by an average of 59%. It reduces the energy consumption
of search by up to 55% and 81% compared to alternative strategies of executing
entirely locally or entirely in the cloud. Search results from smartphones are
obtained in seconds. Our experiments also suggest approaches to further improve
these results.
|
[
{
"version": "v1",
"created": "Tue, 28 Jun 2011 05:36:11 GMT"
}
] | 2011-06-29T00:00:00 |
[
[
"Sani",
"Ardalan Amiri",
""
],
[
"Richter",
"Wolfgang",
""
],
[
"Bao",
"Xuan",
""
],
[
"Narayan",
"Trevor",
""
],
[
"Satyanarayanan",
"Mahadev",
""
],
[
"Zhong",
"Lin",
""
],
[
"Choudhury",
"Romit Roy",
""
]
] |
new_dataset
| 0.997769 |
1106.5570
|
Ciprian Dobre
|
Ramiro Voicu, Iosif Legrand, Harvey Newman, Nicolae Tapus, Ciprian
Dobre
|
A distributed service for on demand end to end optical circuits
|
17th International Conference on Control Systems and Computer Science
(CSCS 17), Bucharest, Romania, May 26-29, 2009. Vol. 1, pp. 155-161, ISSN:
2066-4451
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a system for monitoring and controlling dynamic
network circuits inside the USLHCNet network. This distributed service system
provides in near real-time complete topological information for all the
circuits, resource allocation and usage, accounting, detects automatically
failures in the links and network equipment, generate alarms and has the
functionality to take automatic actions. The system is developed based on the
MonALISA framework, which provides a robust monitoring and controlling service
oriented architecture, with no single points of failure.
|
[
{
"version": "v1",
"created": "Tue, 28 Jun 2011 06:01:49 GMT"
}
] | 2011-06-29T00:00:00 |
[
[
"Voicu",
"Ramiro",
""
],
[
"Legrand",
"Iosif",
""
],
[
"Newman",
"Harvey",
""
],
[
"Tapus",
"Nicolae",
""
],
[
"Dobre",
"Ciprian",
""
]
] |
new_dataset
| 0.996219 |
1106.5622
|
Luca Roversi
|
Emanuele Cesena and Marco Pedicini and Luca Roversi
|
Typing a Core Binary Field Arithmetic in a Light Logic
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We design a library for binary field arithmetic and we supply a core API
which is completely developed in DLAL, extended with a fix point formula. Since
DLAL is a restriction of linear logic where only functional programs with
polynomial evaluation cost can be typed, we obtain the core of a functional
programming setting for binary field arithmetic with built-in polynomial
complexity.
|
[
{
"version": "v1",
"created": "Tue, 28 Jun 2011 10:39:42 GMT"
}
] | 2011-06-29T00:00:00 |
[
[
"Cesena",
"Emanuele",
""
],
[
"Pedicini",
"Marco",
""
],
[
"Roversi",
"Luca",
""
]
] |
new_dataset
| 0.999085 |
1106.5648
|
Xiaofu Wu Dr
|
Xiaofu Wu, Chunming Zhao, and Xiaohu You
|
Joint LDPC and Physical-layer Network Coding for Asynchronous
Bi-directional Relaying
|
8 pages, 5 figures, submitted to IEEE Journal on Selected Areas in
Communications - Special Issue on Theories and Methods for Advanced Wireless
Relays
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In practical asynchronous bi-directional relaying, symbols transmitted by two
sources cannot arrive at the relay with perfect frame and symbol alignments and
the asynchronous multiple-access channel (MAC) should be seriously considered.
Recently, Lu et al. proposed a Tanner-graph representation of the
symbol-asynchronous MAC with rectangular-pulse shaping and further developed
the message-passing algorithm for optimal decoding of the symbol-asynchronous
physical-layer network coding. In this paper, we present a general channel
model for the asynchronous MAC with arbitrary pulse-shaping. Then, the Bahl,
Cocke, Jelinek, and Raviv (BCJR) algorithm is developed for optimal decoding of
the asynchronous MAC channel. For Low-Density Parity-Check (LDPC)-coded BPSK
signalling over the symbol-asynchronous MAC, we present a formal log-domain
generalized sum-product-algorithm (Log-G-SPA) for efficient decoding.
Furthermore, we propose to use cyclic codes for combating the
frame-asynchronism and the resolution of the relative delay inherent in this
approach can be achieved by employing the simple cyclic-redundancy-check (CRC)
coding technique. Simulation results demonstrate the effectiveness of the
proposed approach.
|
[
{
"version": "v1",
"created": "Tue, 28 Jun 2011 12:46:26 GMT"
}
] | 2011-06-29T00:00:00 |
[
[
"Wu",
"Xiaofu",
""
],
[
"Zhao",
"Chunming",
""
],
[
"You",
"Xiaohu",
""
]
] |
new_dataset
| 0.996809 |
1106.5736
|
Erik Demaine
|
Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw,
Andrew Winslow
|
Algorithms for Solving Rubik's Cubes
|
34 pages, 9 figures. A short version of this paper is to appear at
the 19th Annual European Symposium on Algorithms
| null | null | null |
cs.DS cs.CC cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Rubik's Cube is perhaps the world's most famous and iconic puzzle,
well-known to have a rich underlying mathematical structure (group theory). In
this paper, we show that the Rubik's Cube also has a rich underlying
algorithmic structure. Specifically, we show that the n x n x n Rubik's Cube,
as well as the n x n x 1 variant, has a "God's Number" (diameter of the
configuration space) of Theta(n^2/log n). The upper bound comes from
effectively parallelizing standard Theta(n^2) solution algorithms, while the
lower bound follows from a counting argument. The upper bound gives an
asymptotically optimal algorithm for solving a general Rubik's Cube in the
worst case. Given a specific starting state, we show how to find the shortest
solution in an n x O(1) x O(1) Rubik's Cube. Finally, we show that finding this
optimal solution becomes NP-hard in an n x n x 1 Rubik's Cube when the
positions and colors of some of the cubies are ignored (not used in determining
whether the cube is solved).
|
[
{
"version": "v1",
"created": "Tue, 28 Jun 2011 17:35:09 GMT"
}
] | 2011-06-29T00:00:00 |
[
[
"Demaine",
"Erik D.",
""
],
[
"Demaine",
"Martin L.",
""
],
[
"Eisenstat",
"Sarah",
""
],
[
"Lubiw",
"Anna",
""
],
[
"Winslow",
"Andrew",
""
]
] |
new_dataset
| 0.956998 |
1004.0653
|
Oliver Kullmann
|
Oliver Kullmann
|
Exact Ramsey Theory: Green-Tao numbers and SAT
|
25 pages; a shortened version appears in LNCS (Springer), "Theory and
Applications of Satisfiability Testing - SAT 2010", editors O. Strichman and
S. Szeider. Revision contains new van-der-Waerden and Green-Tao numbers,
especially "transversal numbers", corresponding to independence numbers of
hypergraphs of arithmetic progressions. Some new comments discussing
behaviour of vdW- and GT-numbers.
|
Theory and Applications of Satisfiability Testing - SAT 2010, LNCS
6175, 352-362
|
10.1007/978-3-642-14186-7_32
| null |
cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the links between Ramsey theory in the integers, based on van der
Waerden's theorem, and (boolean, CNF) SAT solving. We aim at using the problems
from exact Ramsey theory, concerned with computing Ramsey-type numbers, as a
rich source of test problems, where especially methods for solving hard
problems can be developed. In order to control the growth of the problem
instances, we introduce "transversal extensions" as a natural way of
constructing mixed parameter tuples (k_1, ..., k_m) for van-der-Waerden-like
numbers N(k_1, ..., k_m), such that the growth of these numbers is guaranteed
to be linear. Based on Green-Tao's theorem we introduce the "Green-Tao numbers"
grt(k_1, ..., k_m), which in a sense combine the strict structure of van der
Waerden problems with the (pseudo-)randomness of the distribution of prime
numbers. Using standard SAT solvers (look-ahead, conflict-driven, and local
search) we determine the basic values. It turns out that already for this
single form of Ramsey-type problems, when considering the best-performing
solvers a wide variety of solver types is covered. For m > 2 the problems are
non-boolean, and we introduce the "generic translation scheme", which offers an
infinite variety of translations ("encodings") and covers the known methods. In
most cases the special instance called "nested translation" proved to be far
superior.
|
[
{
"version": "v1",
"created": "Mon, 5 Apr 2010 16:14:31 GMT"
},
{
"version": "v2",
"created": "Sat, 24 Apr 2010 18:47:14 GMT"
}
] | 2011-06-28T00:00:00 |
[
[
"Kullmann",
"Oliver",
""
]
] |
new_dataset
| 0.987279 |
1106.5168
|
Ciprian Dobre
|
Iosif C. Legrand, Ciprian Dobre, Ramiro Voicu, Corina Stratan, Catalin
Cirstoiu, Lucian Musat
|
LISA (Localhost Information Service Agent)
|
Proc. of the 15th International Conference on Control Systems and
Computer Science (CSCS-15), Bucharest, Romania, 2005, pp. 127-130, ISBN:
973-8449-89-8
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Grid computing has gained an increasing importance in the last years,
especially in the academic environments, offering the possibility to rapidly
solve complex scientific problems. The monitoring of the Grid jobs has a vital
importance for analyzing the system's performance, for providing the users an
appropriate feed-back, and for obtaining historical data which may be used for
performance prediction. Several monitoring systems have been developed, with
different strategies to collect and store the information. We shall present
here a solution based on MonALISA, a distributed service for monitoring,
control and global optimization of complex systems, and LISA, a component
application of MonALISA which can help in optimizing other applications by
means of monitoring services. The advantages of this system are, among others,
flexibility, dynamic configuration, high communication performance.
|
[
{
"version": "v1",
"created": "Sat, 25 Jun 2011 20:49:17 GMT"
}
] | 2011-06-28T00:00:00 |
[
[
"Legrand",
"Iosif C.",
""
],
[
"Dobre",
"Ciprian",
""
],
[
"Voicu",
"Ramiro",
""
],
[
"Stratan",
"Corina",
""
],
[
"Cirstoiu",
"Catalin",
""
],
[
"Musat",
"Lucian",
""
]
] |
new_dataset
| 0.999283 |
1106.5171
|
Ciprian Dobre
|
Ciprian Dobre, Ramiro Voicu, Adrian Muraru, Iosif C. Legrand
|
A Distributed Agent Based System to Control and Coordinate Large Scale
Data Transfers
|
Proc. of 16th International Conference on Control Systems and
Computer Science (CSCS-16), pp. 64-68, Bucharest, Romania, ISBN:
978-973-718-741-3
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a distributed agent based system used to monitor, configure and
control complex, large scale data transfers in the Wide Area Network. The
Localhost Information Service Agent (LISA) is a lightweight dynamic service
that provides complete system and applications monitoring, is capable to
dynamically configure system parameters and can help in optimizing distributed
applications.
As part of the MonALISA (Monitoring Agents in A Large Integrated Services
Architecture) system, LISA is an end host agent capable to collect any type of
monitoring information, to distribute them, and to take actions based on local
or global decision units. The system has been used for the Bandwidth Challenge
at Supercomputing 2006 to coordinate global large scale data transfers using
Fast Data Transfer (FDT) application between hundreds of servers distributed on
major Grid sites involved in processing High Energy Physics data for the future
Large Hadron Collider experiments.
|
[
{
"version": "v1",
"created": "Sat, 25 Jun 2011 20:54:12 GMT"
}
] | 2011-06-28T00:00:00 |
[
[
"Dobre",
"Ciprian",
""
],
[
"Voicu",
"Ramiro",
""
],
[
"Muraru",
"Adrian",
""
],
[
"Legrand",
"Iosif C.",
""
]
] |
new_dataset
| 0.998379 |
1106.5260
|
M. Do
|
M. Do, S. Kambhampati
|
SAPA: A Multi-objective Metric Temporal Planner
| null |
Journal Of Artificial Intelligence Research, Volume 20, pages
155-194, 2003
|
10.1613/jair.1156
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SAPA is a domain-independent heuristic forward chaining planner that can
handle durative actions, metric resource constraints, and deadline goals. It is
designed to be capable of handling the multi-objective nature of metric
temporal planning. Our technical contributions include (i) planning-graph based
methods for deriving heuristics that are sensitive to both cost and makespan
(ii) techniques for adjusting the heuristic estimates to take action
interactions and metric resource limitations into account and (iii) a linear
time greedy post-processing technique to improve execution flexibility of the
solution plans. An implementation of SAPA using many of the techniques
presented in this paper was one of the best domain independent planners for
domains with metric and temporal constraints in the third International
Planning Competition, held at AIPS-02. We describe the technical details of
extracting the heuristics and present an empirical evaluation of the current
implementation of SAPA.
|
[
{
"version": "v1",
"created": "Sun, 26 Jun 2011 21:03:40 GMT"
}
] | 2011-06-28T00:00:00 |
[
[
"Do",
"M.",
""
],
[
"Kambhampati",
"S.",
""
]
] |
new_dataset
| 0.958048 |
1106.5262
|
S. Kambhampati
|
S. Kambhampati, R. Sanchez
|
AltAltp: Online Parallelization of Plans with Heuristic State Search
| null |
Journal Of Artificial Intelligence Research, Volume 19, pages
631-657, 2003
|
10.1613/jair.1168
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite their near dominance, heuristic state search planners still lag
behind disjunctive planners in the generation of parallel plans in classical
planning. The reason is that directly searching for parallel solutions in state
space planners would require the planners to branch on all possible subsets of
parallel actions, thus increasing the branching factor exponentially. We
present a variant of our heuristic state search planner AltAlt, called AltAltp
which generates parallel plans by using greedy online parallelization of
partial plans. The greedy approach is significantly informed by the use of
novel distance heuristics that AltAltp derives from a graphplan-style planning
graph for the problem. While this approach is not guaranteed to provide optimal
parallel plans, empirical results show that AltAltp is capable of generating
good quality parallel plans at a fraction of the cost incurred by the
disjunctive planners.
|
[
{
"version": "v1",
"created": "Sun, 26 Jun 2011 21:04:32 GMT"
}
] | 2011-06-28T00:00:00 |
[
[
"Kambhampati",
"S.",
""
],
[
"Sanchez",
"R.",
""
]
] |
new_dataset
| 0.982194 |
1106.5299
|
Ciprian Dobre
|
Ciprian Dobre, Florin Pop, Valentin Cristea
|
DistHash: A robust P2P DHT-based system for replicated objects
|
Proceedings of 17th International Conference on Control Systems and
Computer Science (CSCS 17), Bucharest, Romania, May 26-29, 2009. Vol. 1, pp.
453-460, ISSN: 2066-4451
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Over the Internet today, computing and communications environments are
significantly more complex and chaotic than classical distributed systems,
lacking any centralized organization or hierarchical control. There has been
much interest in emerging Peer-to-Peer (P2P) network overlays because they
provide a good substrate for creating large-scale data sharing, content
distribution and application-level multicast applications. In this paper we
present DistHash, a P2P overlay network designed to share large sets of
replicated distributed objects in the context of large-scale highly dynamic
infrastructures. We present original solutions to achieve optimal message
routing in hop-count and throughput, provide an adequate consistency approach
among replicas, as well as provide a fault-tolerant substrate.
|
[
{
"version": "v1",
"created": "Mon, 27 Jun 2011 05:49:21 GMT"
}
] | 2011-06-28T00:00:00 |
[
[
"Dobre",
"Ciprian",
""
],
[
"Pop",
"Florin",
""
],
[
"Cristea",
"Valentin",
""
]
] |
new_dataset
| 0.999507 |
1106.5304
|
Florin Pop Mr.
|
George Milescu, Gabriel Noaje, Florin Pop
|
OpenPh - Numerical Physics Library
|
(ISSN 1223-7027)
|
UPB Scientific Bulletin, Series A: Applied Mathematics and
Physics, volume 68, number 1, pp: 73-78, 2006
| null | null |
cs.DL physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Numerical physics has gained a lot of importance in the last decade, its
efficiency being motivated and sustained by the growth of computational power.
This paper presents a concept that is to be developed in the next few years:
OpenPh. OpenPh is a numerical physics library that makes use of the advantages
of both open source software and MATLAB programming. Its aim is to deliver the
instruments for providing numerical and graphical solutions for various physics
problems. It has a modular structure, allowing the user to add new modules to
the existing ones and to create its own modules according to its needs, being
virtually unlimited extendable. The modules of OpenPh are implemented using
MATLAB engine because it is the best solution used in engineering and science,
providing a wide range of optimized methods to accomplish even the toughest
jobs. Current version of OpenPh includes two modules, the first one providing
tools for quantum physics and the second one for mechanics. The quantum physics
module deals with the photoelectric effect, the radioactive decay of carbon-11,
and the Schr\"odinger equation - particle in a box. The classical mechanics
module includes the study of the uniform circular motion, the forced damped
harmonic oscillations and the vibration of a fixed-fixed string.
|
[
{
"version": "v1",
"created": "Mon, 27 Jun 2011 06:03:50 GMT"
}
] | 2011-06-28T00:00:00 |
[
[
"Milescu",
"George",
""
],
[
"Noaje",
"Gabriel",
""
],
[
"Pop",
"Florin",
""
]
] |
new_dataset
| 0.975338 |
1106.5308
|
Florin Pop Mr.
|
Florin Pop, Diana Petrescu, \c{S}tefan Trau\c{s}an-Matu
|
Clasificarea distribuita a mesajelor de e-mail
|
ISSN 1453-1305
|
A Treia Conferin\c{t}\u{a} Na\c{t}ional\u{a} de Interac\c{t}iune
Om-Calculator 2006, Informatica Economica, vol. X, Bucuresti, pp. 79-82, 2006
| null | null |
cs.HC cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A basic component in Internet applications is the electronic mail and its
various implications. The paper proposes a mechanism for automatically
classifying emails and create dynamic groups that belong to these messages.
Proposed mechanisms will be based on natural language processing techniques and
will be designed to facilitate human-machine interaction in this direction.
|
[
{
"version": "v1",
"created": "Mon, 27 Jun 2011 06:24:34 GMT"
}
] | 2011-06-28T00:00:00 |
[
[
"Pop",
"Florin",
""
],
[
"Petrescu",
"Diana",
""
],
[
"Trauşan-Matu",
"Ştefan",
""
]
] |
new_dataset
| 0.983737 |
1106.5309
|
Florin Pop Mr.
|
Diana Moise, Eliza Moise, Florin Pop, Valentin Cristea
|
Resource CoAllocation for Scheduling Tasks with Dependencies, in Grid
|
ISSN: 2065-0701
|
Proceedings of The Second International Workshop on High
Performance in Grid Middleware (HiPerGRID 2008), Bucharest, Romania,
Published by IEEE Romania, 2008, pages: 41-48
| null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Scheduling applications on wide-area distributed systems is useful for
obtaining quick and reliable results in an efficient manner. Optimized
scheduling algorithms are fundamentally important in order to achieve optimized
resources utilization. The existing and potential applications include many
fields of activity like satellite image processing and medicine. The paper
proposes a scheduling algorithm for tasks with dependencies in Grid
environments. CoAllocation represents a strategy that provides a schedule for
task with dependencies, having as main purpose the efficiency of the schedule,
in terms of load balancing and minimum time for the execution of the tasks.
|
[
{
"version": "v1",
"created": "Mon, 27 Jun 2011 06:24:40 GMT"
}
] | 2011-06-28T00:00:00 |
[
[
"Moise",
"Diana",
""
],
[
"Moise",
"Eliza",
""
],
[
"Pop",
"Florin",
""
],
[
"Cristea",
"Valentin",
""
]
] |
new_dataset
| 0.996731 |
1106.5465
|
Ilango Sriram
|
Ilango Leonardo Sriram, Dave Cliff
|
SPECI-2: An open-source framework for predictive simulation of
cloud-scale data-centres
|
To appear in Proceedings of SIMULTECH 2011, see also speci.org
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce Version 2 of SPECI, a system for predictive simulation modeling
of large-scale data-centres, i.e. warehouse-sized facilities containing
hundreds of thousands of servers, as used to provide cloud services.
|
[
{
"version": "v1",
"created": "Mon, 27 Jun 2011 18:01:03 GMT"
}
] | 2011-06-28T00:00:00 |
[
[
"Sriram",
"Ilango Leonardo",
""
],
[
"Cliff",
"Dave",
""
]
] |
new_dataset
| 0.997091 |
1106.4866
|
P. Liberatore
|
P. Liberatore
|
On Polynomial Sized MDP Succinct Policies
| null |
Journal Of Artificial Intelligence Research, Volume 21, pages
551-577, 2004
|
10.1613/jair.1134
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Policies of Markov Decision Processes (MDPs) determine the next action to
execute from the current state and, possibly, the history (the past states).
When the number of states is large, succinct representations are often used to
compactly represent both the MDPs and the policies in a reduced amount of
space. In this paper, some problems related to the size of succinctly
represented policies are analyzed. Namely, it is shown that some MDPs have
policies that can only be represented in space super-polynomial in the size of
the MDP, unless the polynomial hierarchy collapses. This fact motivates the
study of the problem of deciding whether a given MDP has a policy of a given
size and reward. Since some algorithms for MDPs work by finding a succinct
representation of the value function, the problem of deciding the existence of
a succinct representation of a value function of a given size and reward is
also considered.
|
[
{
"version": "v1",
"created": "Fri, 24 Jun 2011 00:57:19 GMT"
}
] | 2011-06-27T00:00:00 |
[
[
"Liberatore",
"P.",
""
]
] |
new_dataset
| 0.997102 |
1106.4869
|
T. C. Au
|
T. C. Au, O. Ilghami, U. Kuter, J. W. Murdock, D. S. Nau, D. Wu, F.
Yaman
|
SHOP2: An HTN Planning System
| null |
Journal Of Artificial Intelligence Research, Volume 20, pages
379-404, 2003
|
10.1613/jair.1141
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The SHOP2 planning system received one of the awards for distinguished
performance in the 2002 International Planning Competition. This paper
describes the features of SHOP2 which enabled it to excel in the competition,
especially those aspects of SHOP2 that deal with temporal and metric planning
domains.
|
[
{
"version": "v1",
"created": "Fri, 24 Jun 2011 00:58:42 GMT"
}
] | 2011-06-27T00:00:00 |
[
[
"Au",
"T. C.",
""
],
[
"Ilghami",
"O.",
""
],
[
"Kuter",
"U.",
""
],
[
"Murdock",
"J. W.",
""
],
[
"Nau",
"D. S.",
""
],
[
"Wu",
"D.",
""
],
[
"Yaman",
"F.",
""
]
] |
new_dataset
| 0.966541 |
1101.0698
|
Gerhard de Koning Gans
|
Gerhard de Koning Gans and Eric R. Verheul
|
Best Effort and Practice Activation Codes
|
15 pages, 3 figures, TrustBus 2011
| null | null | null |
cs.CR cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Activation Codes are used in many different digital services and known by
many different names including voucher, e-coupon and discount code. In this
paper we focus on a specific class of ACs that are short, human-readable,
fixed-length and represent value. Even though this class of codes is
extensively used there are no general guidelines for the design of Activation
Code schemes. We discuss different methods that are used in practice and
propose BEPAC, a new Activation Code scheme that provides both authenticity and
confidentiality. The small message space of activation codes introduces some
problems that are illustrated by an adaptive chosen-plaintext attack (CPA-2) on
a general 3-round Feis- tel network of size 2^(2n) . This attack recovers the
complete permutation from at most 2^(n+2) plaintext-ciphertext pairs. For this
reason, BEPAC is designed in such a way that authenticity and confidentiality
are in- dependent properties, i.e. loss of confidentiality does not imply loss
of authenticity.
|
[
{
"version": "v1",
"created": "Tue, 4 Jan 2011 10:41:27 GMT"
},
{
"version": "v2",
"created": "Thu, 23 Jun 2011 11:26:51 GMT"
}
] | 2011-06-24T00:00:00 |
[
[
"Gans",
"Gerhard de Koning",
""
],
[
"Verheul",
"Eric R.",
""
]
] |
new_dataset
| 0.97362 |
1106.4561
|
M. Fox
|
M. Fox, D. Long
|
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
| null |
Journal Of Artificial Intelligence Research, Volume 20, pages
61-124, 2003
|
10.1613/jair.1129
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years research in the planning community has moved increasingly
toward s application of planners to realistic problems involving both time and
many typ es of resources. For example, interest in planning demonstrated by the
space res earch community has inspired work in observation scheduling,
planetary rover ex ploration and spacecraft control domains. Other temporal and
resource-intensive domains including logistics planning, plant control and
manufacturing have also helped to focus the community on the modelling and
reasoning issues that must be confronted to make planning technology meet the
challenges of application. The International Planning Competitions have acted
as an important motivating fo rce behind the progress that has been made in
planning since 1998. The third com petition (held in 2002) set the planning
community the challenge of handling tim e and numeric resources. This
necessitated the development of a modelling langua ge capable of expressing
temporal and numeric properties of planning domains. In this paper we describe
the language, PDDL2.1, that was used in the competition. We describe the syntax
of the language, its formal semantics and the validation of concurrent plans.
We observe that PDDL2.1 has considerable modelling power --- exceeding the
capabilities of current planning technology --- and presents a number of
important challenges to the research community.
|
[
{
"version": "v1",
"created": "Wed, 22 Jun 2011 20:20:10 GMT"
}
] | 2011-06-24T00:00:00 |
[
[
"Fox",
"M.",
""
],
[
"Long",
"D.",
""
]
] |
new_dataset
| 0.999151 |
1106.4578
|
J. Lang
|
J. Lang, P. Liberatore, P. Marquis
|
Propositional Independence - Formula-Variable Independence and
Forgetting
| null |
Journal Of Artificial Intelligence Research, Volume 18, pages
391-443, 2003
|
10.1613/jair.1113
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Independence -- the study of what is relevant to a given problem of reasoning
-- has received an increasing attention from the AI community. In this paper,
we consider two basic forms of independence, namely, a syntactic one and a
semantic one. We show features and drawbacks of them. In particular, while the
syntactic form of independence is computationally easy to check, there are
cases in which things that intuitively are not relevant are not recognized as
such. We also consider the problem of forgetting, i.e., distilling from a
knowledge base only the part that is relevant to the set of queries constructed
from a subset of the alphabet. While such process is computationally hard, it
allows for a simplification of subsequent reasoning, and can thus be viewed as
a form of compilation: once the relevant part of a knowledge base has been
extracted, all reasoning tasks to be performed can be simplified.
|
[
{
"version": "v1",
"created": "Wed, 22 Jun 2011 21:01:16 GMT"
}
] | 2011-06-24T00:00:00 |
[
[
"Lang",
"J.",
""
],
[
"Liberatore",
"P.",
""
],
[
"Marquis",
"P.",
""
]
] |
new_dataset
| 0.993806 |
1105.5553
|
Feng Shu
|
Shu Feng, Wang Mao, Shi Xiajie, Liu Junhao, Sheng Weixin, and Xie
Renhong
|
A Frequency-domain Compensation Scheme for IQ-Imbalance in OFDM
Receivers
|
17 pages, 6 figures
| null | null | null |
cs.NI cs.MM
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
A pilot pattern across two OFDM symbols with special structure is devised for
channel estimation in OFDM systems with IQ imbalance at receiver. Based on this
pilot pattern, a high-efficiency time-domain (TD) least square (LS) channel
estimator is proposed to significantly suppress channel noise by a factor
N/(L+1) in comparison with the frequency-domain LS one in [1] where N and L+1
are the total number of subcarriers and the length of cyclic prefix,
respectively. Following this, a low-complexity frequency-domain (FD) Gaussian
elimination (GE) equalizer is proposed to eliminate IQ distortion by using only
2N complex multiplications per OFDM symbol. From simulation, the proposed
scheme TD-LS/FD-GE using only two pilot OFDM symbols achieves the same bit
error rate (BER) performance under ideal channel knowledge and no IQ imbalances
at low and medium signal-to-noise ratio (SNR) regions whereas these
compensation schemes including FD-LS/Post-FFT LS, FD-LS/Pre-FFT Corr, and
SPP/Pre-FFT Corr in [1] require about twenty OFDM training symbols to reach the
same performance where A/B denotes compensation scheme with A being channel
estimator and B being equalizer.
|
[
{
"version": "v1",
"created": "Fri, 27 May 2011 13:08:30 GMT"
},
{
"version": "v2",
"created": "Mon, 13 Jun 2011 10:06:07 GMT"
},
{
"version": "v3",
"created": "Tue, 21 Jun 2011 11:19:14 GMT"
}
] | 2011-06-22T00:00:00 |
[
[
"Feng",
"Shu",
""
],
[
"Mao",
"Wang",
""
],
[
"Xiajie",
"Shi",
""
],
[
"Junhao",
"Liu",
""
],
[
"Weixin",
"Sheng",
""
],
[
"Renhong",
"Xie",
""
]
] |
new_dataset
| 0.981974 |
1106.4092
|
EPTCS
|
John Derrick, Siobh\'an North, Anthony J.H. Simons
|
Building a refinement checker for Z
|
In Proceedings Refine 2011, arXiv:1106.3488
|
EPTCS 55, 2011, pp. 37-52
|
10.4204/EPTCS.55.3
| null |
cs.SE cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In previous work we have described how refinements can be checked using a
temporal logic based model-checker, and how we have built a model-checker for Z
by providing a translation of Z into the SAL input language. In this paper we
draw these two strands of work together and discuss how we have implemented
refinement checking in our Z2SAL toolset.
The net effect of this work is that the SAL toolset can be used to check
refinements between Z specifications supplied as input files written in the
LaTeX mark-up. Two examples are used to illustrate the approach and compare it
with a manual translation and refinement check.
|
[
{
"version": "v1",
"created": "Tue, 21 Jun 2011 05:24:24 GMT"
}
] | 2011-06-22T00:00:00 |
[
[
"Derrick",
"John",
""
],
[
"North",
"Siobhán",
""
],
[
"Simons",
"Anthony J. H.",
""
]
] |
new_dataset
| 0.998033 |
1106.4184
|
Sebastian Gerling
|
Michael Backes and Sebastian Gerling and Philipp von Styp-Rekowsky
|
A Novel Attack against Android Phones
|
1 page
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the first quarter of 2011, Android has become the top-selling operating
system for smartphones. In this paper, we present a novel, highly critical
attack that allows unprompted installation of arbitrary applications from the
Android Market. Our attack is based on a single malicious application, which,
in contrast to previously known attacks, does not require the user to grant it
any permissions.
|
[
{
"version": "v1",
"created": "Tue, 21 Jun 2011 12:32:00 GMT"
}
] | 2011-06-22T00:00:00 |
[
[
"Backes",
"Michael",
""
],
[
"Gerling",
"Sebastian",
""
],
[
"von Styp-Rekowsky",
"Philipp",
""
]
] |
new_dataset
| 0.999252 |
1106.4286
|
Ersen Ekrem
|
Ersen Ekrem and Sennur Ulukus
|
Multi-receiver Wiretap Channel with Public and Confidential Messages
|
Submitted to IEEE Transactions on Information Theory, June 2011
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the multi-receiver wiretap channel with public and confidential
messages. In this channel, there is a transmitter that wishes to communicate
with two legitimate users in the presence of an external eavesdropper. The
transmitter sends a pair of public and confidential messages to each legitimate
user. While there are no secrecy constraints on the public messages,
confidential messages need to be transmitted in perfect secrecy. We study the
discrete memoryless multi-receiver wiretap channel as well as its Gaussian
multi-input multi-output (MIMO) instance. First, we consider the degraded
discrete memoryless channel, and obtain an inner bound for the capacity region
by using an achievable scheme that uses superposition coding and binning. Next,
we obtain an outer bound, and show that this outer bound partially matches the
inner bound, providing a partial characterization for the capacity region of
the degraded channel model. Second, we obtain an inner bound for the general,
not necessarily degraded, discrete memoryless channel by using Marton's inner
bound, superposition coding, rate-splitting and binning. Third, we consider the
degraded Gaussian MIMO channel, and show that, to evaluate both the inner and
outer bounds, considering only jointly Gaussian auxiliary random variables and
channel input is sufficient. Since the inner and outer bounds partially match,
these sufficiency results provide a partial characterization of the capacity
region of the degraded Gaussian MIMO channel. Finally, we provide an inner
bound for the capacity region of the general, not necessarily degraded,
Gaussian MIMO multi-receiver wiretap channel.
|
[
{
"version": "v1",
"created": "Tue, 21 Jun 2011 18:18:17 GMT"
}
] | 2011-06-22T00:00:00 |
[
[
"Ekrem",
"Ersen",
""
],
[
"Ulukus",
"Sennur",
""
]
] |
new_dataset
| 0.969194 |
1106.4300
|
Lin Zhong
|
Siqi Zhao and Lin Zhong and Jehan Wickramasuriya and Venu Vasudevan
|
Human as Real-Time Sensors of Social and Physical Events: A Case Study
of Twitter and Sports Games
| null | null | null |
Technical Report TR0620-2011, Rice University and Motorola Labs,
June 2011
|
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we study how Twitter can be used as a sensor to detect frequent
and diverse social and physical events in real-time. We devise efficient data
collection and event recognition solutions that work despite various limits on
free access to Twitter data. We describe a web service implementation of our
solution and report our experience with the 2010-2011 US National Football
League (NFL) games. The service was able to recognize NFL game events within 40
seconds and with accuracy up to 90%. This capability will be very useful for
not only real-time electronic program guide for live broadcast programs but
also refined auction of advertisement slots. More importantly, it demonstrates
for the first time the feasibility of using Twitter for real-time social and
physical event detection for ubiquitous computing.
|
[
{
"version": "v1",
"created": "Tue, 21 Jun 2011 19:35:48 GMT"
}
] | 2011-06-22T00:00:00 |
[
[
"Zhao",
"Siqi",
""
],
[
"Zhong",
"Lin",
""
],
[
"Wickramasuriya",
"Jehan",
""
],
[
"Vasudevan",
"Venu",
""
]
] |
new_dataset
| 0.997172 |
1004.4063
|
Aline Parreau
|
Olivier Delmas (LaBRI), Sylvain Gravier (IF), Mickael Montassier
(LaBRI), Aline Parreau (IF)
|
On two variations of identifying codes
| null |
Discrete Mathematics 311, 17 (2011) 1948-1956
|
10.1016/j.disc.2011.05.018
| null |
cs.DM cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Identifying codes have been introduced in 1998 to model fault-detection in
multiprocessor systems. In this paper, we introduce two variations of
identifying codes: weak codes and light codes. They correspond to
fault-detection by successive rounds. We give exact bounds for those two
definitions for the family of cycles.
|
[
{
"version": "v1",
"created": "Fri, 23 Apr 2010 07:51:31 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Jun 2011 14:48:12 GMT"
}
] | 2011-06-21T00:00:00 |
[
[
"Delmas",
"Olivier",
"",
"LaBRI"
],
[
"Gravier",
"Sylvain",
"",
"IF"
],
[
"Montassier",
"Mickael",
"",
"LaBRI"
],
[
"Parreau",
"Aline",
"",
"IF"
]
] |
new_dataset
| 0.999167 |
1106.2352
|
Nicolaie Popescu-Bodorin
|
Nicolaie Popescu-Bodorin, Luminita State
|
Cognitive Binary Logic - The Natural Unified Formal Theory of
Propositional Binary Logic
| null |
Recent Advances in Computational Intelligence, Proc. 4th
International Conference on Computational Intelligence, pp. 135-142, ISSN:
1790-5117, ISBN 978-960-474-179-3, WSEAS Press, April 2010
| null | null |
cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a formal theory which describes propositional binary
logic as a semantically closed formal language, and allows for syntactically
and semantically well-formed formulae, formal proofs (demonstrability in
Hilbertian acception), deduction (Gentzen's view of demonstrability),
CNF-ization, and deconstruction to be expressed and tested in the same
(computational) formal language, using the same data structure. It is also
shown here that Cognitive Binary Logic is a self-described theory in which the
Liar Paradox is deconstructed.
|
[
{
"version": "v1",
"created": "Sun, 12 Jun 2011 22:22:07 GMT"
}
] | 2011-06-21T00:00:00 |
[
[
"Popescu-Bodorin",
"Nicolaie",
""
],
[
"State",
"Luminita",
""
]
] |
new_dataset
| 0.990131 |
1106.3981
|
Kenneth Mackenthun Jr.
|
Kenneth M. Mackenthun Jr
|
Group Codes and the Schreier matrix form
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a group trellis, the sequence of branches that split from the identity
path and merge to the identity path form two normal chains. The Schreier
refinement theorem can be applied to these two normal chains. The refinement of
the two normal chains can be written in the form of a matrix, called the
Schreier matrix form, with rows and columns determined by the two normal
chains.
Based on the Schreier matrix form, we give an encoder structure for a group
code which is an estimator. The encoder uses the important idea of shortest
length generator sequences previously explained by Forney and Trott. In this
encoder the generator sequences are shown to have an additional property: the
components of the generators are coset representatives in a chain coset
decomposition of the branch group B of the code. Therefore this encoder appears
to be a natural form for a group code encoder. The encoder has a register
implementation which is somewhat different from the classical shift register
structure.
This form of the encoder can be extended. We find a composition chain of the
branch group B and give an encoder which uses coset representatives in the
composition chain of B. When B is solvable, the generators are constructed
using coset representatives taken from prime cyclic groups.
|
[
{
"version": "v1",
"created": "Mon, 20 Jun 2011 18:22:52 GMT"
}
] | 2011-06-21T00:00:00 |
[
[
"Mackenthun",
"Kenneth M.",
"Jr"
]
] |
new_dataset
| 0.999263 |
1106.3498
|
Olivier Bailleux
|
Olivier Bailleux
|
On the expressive power of unit resolution
| null | null | null | null |
cs.AI cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This preliminary report addresses the expressive power of unit resolution
regarding input data encoded with partial truth assignments of propositional
variables. A characterization of the functions that are computable in this way,
which we propose to call propagatable functions, is given. By establishing that
propagatable functions can also be computed using monotone circuits, we show
that there exist polynomial time complexity propagable functions requiring an
exponential amount of clauses to be computed using unit resolution. These
results shed new light on studying CNF encodings of NP-complete problems in
order to solve them using propositional satisfiability algorithms.
|
[
{
"version": "v1",
"created": "Fri, 17 Jun 2011 14:35:28 GMT"
}
] | 2011-06-20T00:00:00 |
[
[
"Bailleux",
"Olivier",
""
]
] |
new_dataset
| 0.981111 |
1106.3508
|
Adriane Chapman
|
Barbara Blaustein (MITRE), Adriane Chapman (MITRE), Len Seligman
(MITRE), M. David Allen (MITRE), Arnon Rosenthal (MITRE)
|
Surrogate Parenthood: Protected and Informative Graphs
|
VLDB2011
| null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many applications, including provenance and some analyses of social networks,
require path-based queries over graph-structured data. When these graphs
contain sensitive information, paths may be broken, resulting in uninformative
query results. This paper presents innovative techniques that give users more
informative graph query results; the techniques leverage a common industry
practice of providing what we call surrogates: alternate, less sensitive
versions of nodes and edges releasable to a broader community. We describe
techniques for interposing surrogate nodes and edges to protect sensitive graph
components, while maximizing graph connectivity and giving users as much
information as possible. In this work, we formalize the problem of creating a
protected account G' of a graph G. We provide a utility measure to compare the
informativeness of alternate protected accounts and an opacity measure for
protected accounts, which indicates the likelihood that an attacker can
recreate the topology of the original graph from the protected account. We
provide an algorithm to create a maximally useful protected account of a
sensitive graph, and show through evaluation with the PLUS prototype that using
surrogates and protected accounts adds value for the user, with no significant
impact on the time required to generate results for graph queries.
|
[
{
"version": "v1",
"created": "Fri, 17 Jun 2011 15:04:31 GMT"
}
] | 2011-06-20T00:00:00 |
[
[
"Blaustein",
"Barbara",
"",
"MITRE"
],
[
"Chapman",
"Adriane",
"",
"MITRE"
],
[
"Seligman",
"Len",
"",
"MITRE"
],
[
"Allen",
"M. David",
"",
"MITRE"
],
[
"Rosenthal",
"Arnon",
"",
"MITRE"
]
] |
new_dataset
| 0.975388 |
1106.3517
|
Shashikumar D R
|
Shashi Kumar D. R., K. B. Raja, R. K. Chhootaray, Sabyasachi Pattanaik
|
DWT Based Fingerprint Recognition using Non Minutiae Features
|
9 pages
|
IJCSI International Journal of Computer Science Issues, Vol. 8,
Issue 2, March 2011, 257-265
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Forensic applications like criminal investigations, terrorist identification
and National security issues require a strong fingerprint data base and
efficient identification system. In this paper we propose DWT based Fingerprint
Recognition using Non Minutiae (DWTFR) algorithm. Fingerprint image is
decomposed into multi resolution sub bands of LL, LH, HL and HH by applying 3
level DWT. The Dominant local orientation angle {\theta} and Coherence are
computed on LL band only. The Centre Area Features and Edge Parameters are
determined on each DWT level by considering all four sub bands. The comparison
of test fingerprint with database fingerprint is decided based on the Euclidean
Distance of all the features. It is observed that the values of FAR, FRR and
TSR are improved compared to the existing algorithm.
|
[
{
"version": "v1",
"created": "Fri, 17 Jun 2011 15:52:56 GMT"
}
] | 2011-06-20T00:00:00 |
[
[
"R.",
"Shashi Kumar D.",
""
],
[
"Raja",
"K. B.",
""
],
[
"Chhootaray",
"R. K.",
""
],
[
"Pattanaik",
"Sabyasachi",
""
]
] |
new_dataset
| 0.998109 |
1106.2877
|
Chungang Zhu
|
Frank Sottile, Chungang Zhu
|
Injectivity of 2D Toric B\'{e}zier Patches
|
4 pages, extended abstract, to be publised in Proceedings of
CAD/Graphis 2011
| null | null |
Mittag-Leffler-2011spring
|
cs.GR math.AG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Rational B\'{e}zier functions are widely used as mapping functions in surface
reparameterization, finite element analysis, image warping and morphing. The
injectivity (one-to-one property) of a mapping function is typically necessary
for these applications. Toric B\'{e}zier patches are generalizations of
classical patches (triangular, tensor product) which are defined on the convex
hull of a set of integer lattice points. We give a geometric condition on the
control points that we show is equivalent to the injectivity of every 2D toric
B\'{e}zier patch with those control points for all possible choices of weights.
This condition refines that of Craciun, et al., which only implied injectivity
on the interior of a patch.
|
[
{
"version": "v1",
"created": "Wed, 15 Jun 2011 05:35:51 GMT"
}
] | 2011-06-16T00:00:00 |
[
[
"Sottile",
"Frank",
""
],
[
"Zhu",
"Chungang",
""
]
] |
new_dataset
| 0.992936 |
1106.2593
|
Oleg Mazonka
|
Oleg Mazonka and Alex Kolodin
|
A Simple Multi-Processor Computer Based on Subleq
|
24 pages
| null | null | null |
cs.DC cs.AR cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Subleq (Subtract and Branch on result Less than or Equal to zero) is both an
instruction set and a programming language for One Instruction Set Computer
(OISC). We describe a hardware implementation of an array of 28 one-instruction
Subleq processors on a low-cost FPGA board. Our test results demonstrate that
computational power of our Subleq OISC multi-processor is comparable to that of
CPU of a modern personal computer. Additionally, we provide implementation
details of our complier from a C-style language to Subleq.
|
[
{
"version": "v1",
"created": "Tue, 14 Jun 2011 01:26:41 GMT"
}
] | 2011-06-15T00:00:00 |
[
[
"Mazonka",
"Oleg",
""
],
[
"Kolodin",
"Alex",
""
]
] |
new_dataset
| 0.994239 |
1106.2684
|
Pascal Heus
|
Pascal Heus, Richard Gomez
|
QIS-XML: An Extensible Markup Language for Quantum Information Science
|
83 pages, 58 figures
| null | null | null |
cs.SE cs.ET cs.PL quant-ph
|
http://creativecommons.org/licenses/by/3.0/
|
This Master thesis examines issues of interoperability and integration
between the Classic Information Science (CIS) and Quantum Information Science
(QIS). It provides a short introduction to the Extensible Markup Language (XML)
and proceeds to describe the development steps that have lead to a prototype
XML specification for quantum computing (QIS-XML). QIS-XML is a proposed
framework, based on the widely used standard (XML) to describe, visualize,
exchange and process quantum gates and quantum circuits. It also provides a
potential approach to a generic programming language for quantum computers
through the concept of XML driven compilers. Examples are provided for the
description of commonly used quantum gates and circuits, accompanied with tools
to visualize them in standard web browsers. An algorithmic example is also
presented, performing a simple addition operation with quantum circuits and
running the program on a quantum computer simulator. Overall, this initial
effort demonstrates how XML technologies could be at the core of the
architecture for describing and programming quantum computers. By leveraging a
widely accepted standard, QIS-XML also builds a bridge between classic and
quantum IT, which could foster the acceptance of QIS by the ICT community and
facilitate the understanding of quantum technology by IT experts. This would
support the consolidation of Classic Information Science and Quantum
Information Science into a Complete Information Science, a challenge that could
be referred to as the "Information Science Grand Unification Challenge".
|
[
{
"version": "v1",
"created": "Tue, 14 Jun 2011 12:04:57 GMT"
}
] | 2011-06-15T00:00:00 |
[
[
"Heus",
"Pascal",
""
],
[
"Gomez",
"Richard",
""
]
] |
new_dataset
| 0.99886 |
1106.2694
|
Antonios Symvonis
|
Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios
Symvonis
|
Geometric Simultaneous RAC Drawings of Graphs
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce and study "geometric simultaneous RAC drawing
problems", i.e., a combination of problems on geometric RAC drawings and
geometric simultaneous graph drawings. To the best of our knowledge, this is
the first time where such a combination is attempted.
|
[
{
"version": "v1",
"created": "Tue, 14 Jun 2011 12:42:31 GMT"
}
] | 2011-06-15T00:00:00 |
[
[
"Argyriou",
"Evmorfia N.",
""
],
[
"Bekos",
"Michael A.",
""
],
[
"Kaufmann",
"Michael",
""
],
[
"Symvonis",
"Antonios",
""
]
] |
new_dataset
| 0.980916 |
1106.2792
|
Shizheng Li
|
Shizheng Li and Aditya Ramamoorthy
|
Algebraic codes for Slepian-Wolf code design
|
5 pages, accepted by ISIT 2011
| null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
Practical constructions of lossless distributed source codes (for the
Slepian-Wolf problem) have been the subject of much investigation in the past
decade. In particular, near-capacity achieving code designs based on LDPC codes
have been presented for the case of two binary sources, with a binary-symmetric
correlation. However, constructing practical codes for the case of non-binary
sources with arbitrary correlation remains by and large open. From a practical
perspective it is also interesting to consider coding schemes whose performance
remains robust to uncertainties in the joint distribution of the sources.
In this work we propose the usage of Reed-Solomon (RS) codes for the
asymmetric version of this problem. We show that algebraic soft-decision
decoding of RS codes can be used effectively under certain correlation
structures. In addition, RS codes offer natural rate adaptivity and performance
that remains constant across a family of correlation structures with the same
conditional entropy. The performance of RS codes is compared with dedicated and
rate adaptive multistage LDPC codes (Varodayan et al. '06), where each LDPC
code is used to compress the individual bit planes. Our simulations show that
in classical Slepian-Wolf scenario, RS codes outperform both dedicated and
rate-adaptive LDPC codes under $q$-ary symmetric correlation, and are better
than rate-adaptive LDPC codes in the case of sparse correlation models, where
the conditional distribution of the sources has only a few dominant entries. In
a feedback scenario, the performance of RS codes is comparable with both
designs of LDPC codes. Our simulations also demonstrate that the performance of
RS codes in the presence of inaccuracies in the joint distribution of the
sources is much better as compared to multistage LDPC codes.
|
[
{
"version": "v1",
"created": "Tue, 14 Jun 2011 19:17:21 GMT"
}
] | 2011-06-15T00:00:00 |
[
[
"Li",
"Shizheng",
""
],
[
"Ramamoorthy",
"Aditya",
""
]
] |
new_dataset
| 0.985273 |
0912.3310
|
David Kempe
|
David Kempe, Mahyar Salek, Cristopher Moore
|
Frugal and Truthful Auctions for Vertex Covers, Flows, and Cuts
| null | null | null | null |
cs.CC cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study truthful mechanisms for hiring a team of agents in three classes of
set systems: Vertex Cover auctions, k-flow auctions, and cut auctions. For
Vertex Cover auctions, the vertices are owned by selfish and rational agents,
and the auctioneer wants to purchase a vertex cover from them. For k-flow
auctions, the edges are owned by the agents, and the auctioneer wants to
purchase k edge-disjoint s-t paths, for given s and t. In the same setting, for
cut auctions, the auctioneer wants to purchase an s-t cut. Only the agents know
their costs, and the auctioneer needs to select a feasible set and payments
based on bids made by the agents.
We present constant-competitive truthful mechanisms for all three set
systems. That is, the maximum overpayment of the mechanism is within a constant
factor of the maximum overpayment of any truthful mechanism, for every set
system in the class. The mechanism for Vertex Cover is based on scaling each
bid by a multiplier derived from the dominant eigenvector of a certain matrix.
The mechanism for k-flows prunes the graph to be minimally (k+1)-connected, and
then applies the Vertex Cover mechanism. Similarly, the mechanism for cuts
contracts the graph until all s-t paths have length exactly 2, and then applies
the Vertex Cover mechanism.
|
[
{
"version": "v1",
"created": "Thu, 17 Dec 2009 02:40:36 GMT"
},
{
"version": "v2",
"created": "Mon, 13 Jun 2011 07:23:15 GMT"
}
] | 2011-06-14T00:00:00 |
[
[
"Kempe",
"David",
""
],
[
"Salek",
"Mahyar",
""
],
[
"Moore",
"Cristopher",
""
]
] |
new_dataset
| 0.99948 |
1105.5676
|
Anthony Fanous
|
Anthony Fanous and Anthony Ephremides
|
Transmission Control of Two-User Slotted ALOHA Over Gilbert-Elliott
Channel: Stability and Delay Analysis
|
7 pages, 3 figures, to appear in part in IEEE International Symposium
on Information Theory (ISIT) 2011. This version has all the proofs omitted in
the conference version due to space limitations. Version 2 fixed a minor typo
in equation (36), all the results are correct and unchanged
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider the problem of calculating the stability region
and average delay of two user slotted ALOHA over a Gilbert-Elliott channel,
where users have channel state information and adapt their transmission
probabilities according to the channel state. Each channel has two states,
namely, the 'good' and 'bad' states. In the 'bad' state, the channel is assumed
to be in deep fade and the transmission fails with probability one, while in
the 'good' state, there is some positive success probability. We calculate the
Stability region with and without Multipacket Reception capability as well as
the average delay without MPR. Our results show that the stability region of
the controlled S-ALOHA is always a superset of the stability region of
uncontrolled S-ALOHA. Moreover, if the channel tends to be in the 'bad' state
for long proportion of time, then the stability region is a convex Polyhedron
strictly containing the TDMA stability region and the optimal transmission
strategy is to transmit with probability one whenever the nodes have packets
and it is shown that this strategy is delay optimal. On the other hand, if the
channel tends to be in the 'good' state more often, then the stability region
is bounded by a convex curve and is strict subset of the TDMA stability region.
We also show that enhancing the physical layer by allowing MPR capability can
significantly enhance the performance while simplifying the MAC Layer design by
the lack of the need of scheduling under some conditions. Furthermore, it is
shown that transmission control not only allows handling higher stable arrival
rates but also leads to lower delay for the same arrival rate compared with
ordinary S-ALOHA.
|
[
{
"version": "v1",
"created": "Sat, 28 May 2011 00:48:34 GMT"
},
{
"version": "v2",
"created": "Sat, 11 Jun 2011 01:16:16 GMT"
}
] | 2011-06-14T00:00:00 |
[
[
"Fanous",
"Anthony",
""
],
[
"Ephremides",
"Anthony",
""
]
] |
new_dataset
| 0.99584 |
1106.2351
|
Aleksandar Ilic
|
Aleksandar Ilic and Andreja Ilic
|
On vertex covers and matching number of trapezoid graphs
|
9 pages, 1 figure, 4 algorithms
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The intersection graph of a collection of trapezoids with corner points lying
on two parallel lines is called a trapezoid graph. Using binary indexed tree
data structure, we improve algorithms for calculating the size and the number
of minimum vertex covers (or independent sets), as well as the total number of
vertex covers, and reduce the time complexity from $O (n^2)$ to $O (n \log n)$,
where $n$ is the number of trapezoids. Furthermore, we present the family of
counterexamples for recently proposed algorithm with time complexity $O (n^2)$
for calculating the maximum cardinality matching in trapezoid graphs.
|
[
{
"version": "v1",
"created": "Sun, 12 Jun 2011 22:11:56 GMT"
}
] | 2011-06-14T00:00:00 |
[
[
"Ilic",
"Aleksandar",
""
],
[
"Ilic",
"Andreja",
""
]
] |
new_dataset
| 0.995293 |
cs/0304016
|
Robert Burger PhD
|
J. R. Burger
|
Symmetric and anti-symmetric quantum functions
|
Rewrote for clarity; added references to reversible computing;
removed mention of Simon's functions
| null | null | null |
cs.OH quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces and analyzes symmetric and anti-symmetric quantum
binary functions. Generally, such functions uniquely convert a given
computational basis state into a different basis state, but with either a plus
or a minus sign. Such functions may serve along with a constant function (in a
Deutsch-Jozsa type of algorithm) to provide 2**n deterministic qubit
combinations (for n qubits) instead of just one.
|
[
{
"version": "v1",
"created": "Thu, 10 Apr 2003 17:13:33 GMT"
},
{
"version": "v2",
"created": "Mon, 13 Jun 2011 18:38:25 GMT"
}
] | 2011-06-14T00:00:00 |
[
[
"Burger",
"J. R.",
""
]
] |
new_dataset
| 0.995377 |
1106.1811
|
Arnab Bhattacharya
|
Arnab Bhattacharya and B. Palvali Teja and Sourav Dutta
|
Caching Stars in the Sky: A Semantic Caching Approach to Accelerate
Skyline Queries
|
11 pages; will be published in DEXA 2011
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multi-criteria decision making has been made possible with the advent of
skyline queries. However, processing such queries for high dimensional datasets
remains a time consuming task. Real-time applications are thus infeasible,
especially for non-indexed skyline techniques where the datasets arrive online.
In this paper, we propose a caching mechanism that uses the semantics of
previous skyline queries to improve the processing time of a new query. In
addition to exact queries, utilizing such special semantics allow accelerating
related queries. We achieve this by generating partial result sets guaranteed
to be in the skyline sets. We also propose an index structure for efficient
organization of the cached queries. Experiments on synthetic and real datasets
show the effectiveness and scalability of our proposed methods.
|
[
{
"version": "v1",
"created": "Thu, 9 Jun 2011 13:47:34 GMT"
},
{
"version": "v2",
"created": "Fri, 10 Jun 2011 07:32:04 GMT"
}
] | 2011-06-13T00:00:00 |
[
[
"Bhattacharya",
"Arnab",
""
],
[
"Teja",
"B. Palvali",
""
],
[
"Dutta",
"Sourav",
""
]
] |
new_dataset
| 0.964627 |
1106.2104
|
Martyn Amos
|
Robin Houston, Joseph White and Martyn Amos
|
Zen Puzzle Garden is NP-complete
|
Submitted
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Zen Puzzle Garden (ZPG) is a one-player puzzle game. In this paper, we prove
that deciding the solvability of ZPG is NP-complete.
|
[
{
"version": "v1",
"created": "Fri, 10 Jun 2011 15:59:30 GMT"
}
] | 2011-06-13T00:00:00 |
[
[
"Houston",
"Robin",
""
],
[
"White",
"Joseph",
""
],
[
"Amos",
"Martyn",
""
]
] |
new_dataset
| 0.999786 |
1106.1652
|
Dimitris S. Papailiopoulos
|
Dimitris S. Papailiopoulos and Alexandros G. Dimakis
|
Distributed Storage Codes through Hadamard Designs
|
5 pages, 3 figures, to be presented at ISIT
| null | null | null |
cs.IT cs.DC cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In distributed storage systems that employ erasure coding, the issue of
minimizing the total {\it repair bandwidth} required to exactly regenerate a
storage node after a failure arises. This repair bandwidth depends on the
structure of the storage code and the repair strategies used to restore the
lost data. Minimizing it requires that undesired data during a repair align in
the smallest possible spaces, using the concept of interference alignment (IA).
Here, a points-on-a-lattice representation of the symbol extension IA of
Cadambe {\it et al.} provides cues to perfect IA instances which we combine
with fundamental properties of Hadamard matrices to construct a new storage
code with favorable repair properties. Specifically, we build an explicit
$(k+2,k)$ storage code over $\mathbb{GF}(3)$, whose single systematic node
failures can be repaired with bandwidth that matches exactly the theoretical
minimum. Moreover, the repair of single parity node failures generates at most
the same repair bandwidth as any systematic node failure. Our code can tolerate
any single node failure and any pair of failures that involves at most one
systematic failure.
|
[
{
"version": "v1",
"created": "Wed, 8 Jun 2011 20:02:19 GMT"
}
] | 2011-06-10T00:00:00 |
[
[
"Papailiopoulos",
"Dimitris S.",
""
],
[
"Dimakis",
"Alexandros G.",
""
]
] |
new_dataset
| 0.997329 |
1106.1862
|
Jacques Carette
|
Jacques Carette, William M. Farmer, Filip Jeremic, Vincent Maccio,
Russell O'Connor, Quang M. Tran
|
The MathScheme Library: Some Preliminary Experiments
|
Accepted as a work-in-progress paper at CICM 2011
| null | null | null |
cs.MS cs.SC cs.SE math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present some of the experiments we have performed to best test our design
for a library for MathScheme, the mechanized mathematics software system we are
building. We wish for our library design to use and reflect, as much as
possible, the mathematical structure present in the objects which populate the
library.
|
[
{
"version": "v1",
"created": "Thu, 9 Jun 2011 17:16:38 GMT"
}
] | 2011-06-10T00:00:00 |
[
[
"Carette",
"Jacques",
""
],
[
"Farmer",
"William M.",
""
],
[
"Jeremic",
"Filip",
""
],
[
"Maccio",
"Vincent",
""
],
[
"O'Connor",
"Russell",
""
],
[
"Tran",
"Quang M.",
""
]
] |
new_dataset
| 0.999747 |
1106.1516
|
Francesco De Pellegrini Dr.
|
Francesco De Pellegrini, Karina Gomez, Daniele Miorandi and Imrich
Chlamtac
|
Distributed Wake-Up Scheduling for Energy Saving in Wireless Networks
|
13 pages, 4 figures
| null | null | null |
cs.NI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A customary solution to reduce the energy consumption of wireless
communication devices is to periodically put the radio into low-power sleep
mode. A relevant problem is to schedule the wake-up of nodes in such a way as
to ensure proper coordination among devices, respecting delay constraints while
still saving energy. In this paper, we introduce a simple algebraic
characterization of the problem of periodic wake-up scheduling under both
energy consumption and delay constraints. We demonstrate that the general
problem of wake-up times coordination is equivalent to integer factorization
and discuss the implications on the design of efficient scheduling algorithms.
We then propose simple polynomial time heuristic algorithms that can be
implemented in a distributed fashion and present a message complexity of the
order of the number of links in the network. Numerical results are provided in
order to assess the performance of the proposed techniques when applied to
wireless sensor networks.
|
[
{
"version": "v1",
"created": "Wed, 8 Jun 2011 08:12:19 GMT"
}
] | 2011-06-09T00:00:00 |
[
[
"De Pellegrini",
"Francesco",
""
],
[
"Gomez",
"Karina",
""
],
[
"Miorandi",
"Daniele",
""
],
[
"Chlamtac",
"Imrich",
""
]
] |
new_dataset
| 0.978748 |
1106.1287
|
Arunmozhi Annamalai Ms.
|
S.A.Arunmozhi, Y.Venkataramani
|
DDoS Attack and Defense Scheme in Wireless Ad hoc Networks
|
6 pages, 5 figures
|
Arunmozhi S.A., Venkataramani Y.,DDoS Attack and Defense Scheme in
Wireless Ad hoc Networks,International Journal of Network Security & Its
Applications (IJNSA), Vol.3, No.3, May 2011
|
10.5121/ijnsa.2011.3312
| null |
cs.CR cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The wireless ad hoc networks are highly vulnerable to distributed denial of
service(DDoS) attacks because of its unique characteristics such as open
network architecture, shared wireless medium and stringent resource
constraints. These attacks throttle the tcp throughput heavily and reduce the
quality of service(QoS) to end systems gradually rather than refusing the
clients from the services completely. In this paper, we discussed the DDoS
attacks and proposed a defense scheme to improve the performance of the ad hoc
networks. Our proposed defense mechanism uses the medium access control (MAC)
layer information to detect the attackers. The status values from MAC layer
that can be used for detection are Frequency of receiving RTS/CTS packets,
Frequency of sensing a busy channel and the number of RTS/DATA retransmissions.
Once the attackers are identified, all the packets from those nodes will be
blocked. The network resources are made available to the legitimate users. We
perform the simulation with Network Simulator NS2 and we proved that our
proposed system improves the network performance.
|
[
{
"version": "v1",
"created": "Tue, 7 Jun 2011 09:09:18 GMT"
}
] | 2011-06-08T00:00:00 |
[
[
"Arunmozhi",
"S. A.",
""
],
[
"Venkataramani",
"Y.",
""
]
] |
new_dataset
| 0.997866 |
1004.3807
|
Liangbin Li
|
Liangbin Li, Yindi Jing, Hamid Jafarkhani
|
Interference Cancellation at the Relay for Multi-User Wireless
Cooperative Networks
|
submitted to IEEE Transaction on Wireless Communication
|
Wireless Communications, IEEE Transactions on , vol.10, no.3,
pp.930-939, March 2011
|
10.1109/TWC.2010.011111.100640
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study multi-user transmission and detection schemes for a multi-access
relay network (MARN) with linear constraints at all nodes. In a $(J, J_a, R_a,
M)$ MARN, $J$ sources, each equipped with $J_a$ antennas, communicate to one
$M$-antenna destination through one $R_a$-antenna relay. A new protocol called
IC-Relay-TDMA is proposed which takes two phases. During the first phase,
symbols of different sources are transmitted concurrently to the relay. At the
relay, interference cancellation (IC) techniques, previously proposed for
systems with direct transmission, are applied to decouple the information of
different sources without decoding. During the second phase, symbols of
different sources are forwarded to the destination in a time division
multi-access (TDMA) fashion. At the destination, the maximum-likelihood (ML)
decoding is performed source-by-source. The protocol of IC-Relay-TDMA requires
the number of relay antennas no less than the number of sources, i.e., $R_a\ge
J$. Through outage analysis, the achievable diversity gain of the proposed
scheme is shown to be $\min\{J_a(R_a-J+1),R_aM\}$. When {\small$M\le
J_a\left(1-\frac{J-1}{R_a}\right)$}, the proposed scheme achieves the maximum
interference-free (int-free) diversity gain $R_aM$. Since concurrent
transmission is allowed during the first phase, compared to full TDMA
transmission, the proposed scheme achieves the same diversity, but with a
higher symbol rate.
|
[
{
"version": "v1",
"created": "Wed, 21 Apr 2010 21:12:41 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Nov 2010 01:09:23 GMT"
}
] | 2011-06-06T00:00:00 |
[
[
"Li",
"Liangbin",
""
],
[
"Jing",
"Yindi",
""
],
[
"Jafarkhani",
"Hamid",
""
]
] |
new_dataset
| 0.994222 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.