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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0906.3192
|
Mari Kobayashi
|
Mari Kobayashi, Merouane Debbah, Shlomo Shamai (Shitz)
|
Secured Communication over Frequency-Selective Fading Channels: a
practical Vandermonde precoding
|
To appear in EURASIP journal on Wireless Communications and
Networking, special issue on Wireless Physical Security, 2009
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study the frequency-selective broadcast channel with
confidential messages (BCC) in which the transmitter sends a confidential
message to receiver 1 and a common message to receivers 1 and 2. In the case of
a block transmission of N symbols followed by a guard interval of L symbols,
the frequency-selective channel can be modeled as a N * (N+L) Toeplitz matrix.
For this special type of multiple-input multiple-output (MIMO) channels, we
propose a practical Vandermonde precoding that consists of projecting the
confidential messages in the null space of the channel seen by receiver 2 while
superposing the common message. For this scheme, we provide the achievable rate
region, i.e. the rate-tuple of the common and confidential messages, and
characterize the optimal covariance inputs for some special cases of interest.
It is proved that the proposed scheme achieves the optimal degree of freedom
(d.o.f) region. More specifically, it enables to send l <= L confidential
messages and N-l common messages simultaneously over a block of N+L symbols.
Interestingly, the proposed scheme can be applied to secured multiuser
scenarios such as the K+1-user frequency-selective BCC with K confidential
messages and the two-user frequency-selective BCC with two confidential
messages. For each scenario, we provide the achievable secrecy degree of
freedom (s.d.o.f.) region of the corresponding frequency-selective BCC and
prove the optimality of the Vandermonde precoding. One of the appealing
features of the proposed scheme is that it does not require any specific
secrecy encoding technique but can be applied on top of any existing powerful
encoding schemes.
|
[
{
"version": "v1",
"created": "Wed, 17 Jun 2009 14:28:30 GMT"
}
] | 2009-06-18T00:00:00 |
[
[
"Kobayashi",
"Mari",
"",
"Shitz"
],
[
"Debbah",
"Merouane",
"",
"Shitz"
],
[
"Shamai",
"Shlomo",
"",
"Shitz"
]
] |
new_dataset
| 0.971813 |
0906.3208
|
EPTCS
|
Alexander Okhotin
|
Representing a P-complete problem by small trellis automata
| null |
EPTCS 1, 2009, pp. 185-198
|
10.4204/EPTCS.1.18
| null |
cs.CC cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A restricted case of the Circuit Value Problem known as the Sequential NOR
Circuit Value Problem was recently used to obtain very succinct examples of
conjunctive grammars, Boolean grammars and language equations representing
P-complete languages (Okhotin, http://dx.doi.org/10.1007/978-3-540-74593-8_23
"A simple P-complete problem and its representations by language equations",
MCU 2007). In this paper, a new encoding of the same problem is proposed, and a
trellis automaton (one-way real-time cellular automaton) with 11 states solving
this problem is constructed.
|
[
{
"version": "v1",
"created": "Wed, 17 Jun 2009 15:21:41 GMT"
}
] | 2009-06-18T00:00:00 |
[
[
"Okhotin",
"Alexander",
""
]
] |
new_dataset
| 0.960366 |
0906.3286
|
Niall Murphy
|
Fred Lunnon
|
The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls,
D0L Sequences, Finite State Automata, and Aperiodic Tilings
| null |
EPTCS 1, 2009, pp. 130-148
|
10.4204/EPTCS.1.13
| null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We review the concept of the number wall as an alternative to the traditional
linear complexity profile (LCP), and sketch the relationship to other topics
such as linear feedback shift-register (LFSR) and context-free Lindenmayer
(D0L) sequences. A remarkable ternary analogue of the Thue-Morse sequence is
introduced having deficiency 2 modulo 3, and this property verified via the
re-interpretation of the number wall as an aperiodic plane tiling.
|
[
{
"version": "v1",
"created": "Wed, 17 Jun 2009 19:47:52 GMT"
}
] | 2009-06-18T00:00:00 |
[
[
"Lunnon",
"Fred",
""
]
] |
new_dataset
| 0.999369 |
0906.2866
|
Pierre Hyvernat
|
Pierre Hyvernat (LAMA, Iml)
|
Predicate Transformers, (co)Monads and Resolutions
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This short note contains random thoughts about a factorization theorem for
closure/interior operators on a powerset which is reminiscent to the notion of
resolution for a monad/comonad. The question originated from formal topology
but is interesting in itself. The result holds constructively (even if it
classically has several variations); but usually not predicatively (in the
sense that the interpolant will no be given by a set). For those not familiar
with predicativity issues, we look at a ``classical'' version where we bound
the size of the interpolant.
|
[
{
"version": "v1",
"created": "Tue, 16 Jun 2009 08:33:18 GMT"
}
] | 2009-06-17T00:00:00 |
[
[
"Hyvernat",
"Pierre",
"",
"LAMA, Iml"
]
] |
new_dataset
| 0.999176 |
0906.2315
|
Raphael Jolly
|
Raphael Jolly, Heinz Kredel
|
Symbolic Script Programming for Java
| null | null | null | null |
cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Computer algebra in Java is a promising field of development. It has not yet
reached an industrial strength, in part because of a lack of good user
interfaces. Using a general purpose scripting language can bring a natural
mathematical notation, akin to the one of specialized interfaces included in
most computer algebra systems. We present such an interface for Java computer
algebra libraries, using scripts available in the JSR 223 framework. We
introduce the concept of `symbolic programming' and show its usefulness by
prototypes of symbolic polynomials and polynomial rings.
|
[
{
"version": "v1",
"created": "Fri, 12 Jun 2009 12:38:22 GMT"
},
{
"version": "v2",
"created": "Sun, 14 Jun 2009 10:39:44 GMT"
}
] | 2009-06-15T00:00:00 |
[
[
"Jolly",
"Raphael",
""
],
[
"Kredel",
"Heinz",
""
]
] |
new_dataset
| 0.998752 |
0906.2061
|
Rethnakaran Pulikkoonattu
|
Rethnakaran Pulikkoonattu
|
On the Minimum Distance of Non Binary LDPC Codes
|
Student project report LTHC, EPFL, Switzerland, Jun. 2008
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Minimum distance is an important parameter of a linear error correcting code.
For improved performance of binary Low Density Parity Check (LDPC) codes, we
need to have the minimum distance grow fast with n, the codelength. However,
the best we can hope for is a linear growth in dmin with n. For binary LDPC
codes, the necessary and sufficient conditions on the LDPC ensemble parameters,
to ensure linear growth of minimum distance is well established. In the case of
non-binary LDPC codes, the structure of logarithmic weight codewords is
different from that of binary codes. We have carried out a preliminary study on
the logarithmic bound on the the minimum distance of non-binary LDPC code
ensembles. In particular, we have investigated certain configurations which
would lead to low weight codewords. A set of simulations are performed to
identify some of these configurations. Finally, we have provided a bound on the
logarithmic minimum distance of nonbinary codes, using a strategy similar to
the girth bound for binary codes. This bound has the same asymptotic behaviour
as that of binary codes.
|
[
{
"version": "v1",
"created": "Thu, 11 Jun 2009 09:32:11 GMT"
}
] | 2009-06-12T00:00:00 |
[
[
"Pulikkoonattu",
"Rethnakaran",
""
]
] |
new_dataset
| 0.996474 |
0906.2143
|
Andrea Manara
|
J. T. Moscicki, A. Manara, M. Lamanna, P. Mendez, A. Muraru
|
Dependable Distributed Computing for the International Telecommunication
Union Regional Radio Conference RRC06
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The International Telecommunication Union (ITU) Regional Radio Conference
(RRC06) established in 2006 a new frequency plan for the introduction of
digital broadcasting in European, African, Arab, CIS countries and Iran. The
preparation of the plan involved complex calculations under short deadline and
required dependable and efficient computing capability. The ITU designed and
deployed in-situ a dedicated PC farm, in parallel to the European Organization
for Nuclear Research (CERN) which provided and supported a system based on the
EGEE Grid. The planning cycle at the RRC06 required a periodic execution in the
order of 200,000 short jobs, using several hundreds of CPU hours, in a period
of less than 12 hours. The nature of the problem required dynamic
workload-balancing and low-latency access to the computing resources. We
present the strategy and key technical choices that delivered a reliable
service to the RRC06.
|
[
{
"version": "v1",
"created": "Thu, 11 Jun 2009 16:04:12 GMT"
}
] | 2009-06-12T00:00:00 |
[
[
"Moscicki",
"J. T.",
""
],
[
"Manara",
"A.",
""
],
[
"Lamanna",
"M.",
""
],
[
"Mendez",
"P.",
""
],
[
"Muraru",
"A.",
""
]
] |
new_dataset
| 0.999139 |
0906.1644
|
Florentina Pintea
|
Dorel Micle, Marcel Torok-Oance, Liviu Maruia
|
The morpho-topographic and cartographic analysis of the archaeological
site Cornesti "Iarcuri", Timis County, Romania, using computer sciences
methods (GIS and Remote Sensing techniques)
|
14 pages, exposed on 5th International Conference "Actualities and
Perspectives on Hardware and Software" - APHS2009, Timisoara, Romania
|
Ann. Univ. Tibiscus Comp. Sci. Series VII(2009),249-262
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The archaeological site Cornesti "Iarcuri" is the largest earth fortification
in Romania, made out of four concentric compounds, spreading over 1780
hectares. It is known since 1700, but it had only a few small attempts of
systematic research, the fortress gained interest only after the publishing of
some satellite images by Google Earth. It is located in an area of high fields
and it occupies three interfluves and contains two streams. Our paper contains
a geomorphologic, topographic and cartographic analysis of the site in order to
determine the limits, the structure, the morphology, the construction technique
and the functionality of such a fortification.Our research is based on
satellite image analysis, on archaeological topography, on soil, climate and
vegetation analysis as a way to offer a complex image, through this
interdisciplinary study of landscape archaeology. Through our work we try not
to date the site as this objective will be achieved only after completing the
systematic excavations which started in 2007, but only to analyze the
co-relationship with the environment.
|
[
{
"version": "v1",
"created": "Tue, 9 Jun 2009 07:02:11 GMT"
}
] | 2009-06-10T00:00:00 |
[
[
"Micle",
"Dorel",
""
],
[
"Torok-Oance",
"Marcel",
""
],
[
"Maruia",
"Liviu",
""
]
] |
new_dataset
| 0.999613 |
0906.1226
|
Jianhua Fan
|
Jorg Peters and Jianhua Fan
|
On the Complexity of Smooth Spline Surfaces from Quad Meshes
| null | null | null | null |
cs.GR cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper derives strong relations that boundary curves of a smooth complex
of patches have to obey when the patches are computed by local averaging. These
relations restrict the choice of reparameterizations for geometric continuity.
In particular, when one bicubic tensor-product B-spline patch is associated
with each facet of a quadrilateral mesh with n-valent vertices and we do not
want segments of the boundary curves forced to be linear, then the relations
dictate the minimal number and multiplicity of knots: For general data, the
tensor-product spline patches must have at least two internal double knots per
edge to be able to model a G^1-conneced complex of C^1 splines. This lower
bound on the complexity of any construction is proven to be sharp by suitably
interpreting an existing surface construction. That is, we have a tight bound
on the complexity of smoothing quad meshes with bicubic tensor-product B-spline
patches.
|
[
{
"version": "v1",
"created": "Fri, 5 Jun 2009 22:57:04 GMT"
}
] | 2009-06-09T00:00:00 |
[
[
"Peters",
"Jorg",
""
],
[
"Fan",
"Jianhua",
""
]
] |
new_dataset
| 0.993 |
0906.0859
|
Florentina Pintea
|
Emil Daniel Schwab
|
A Partial Order on Bipartite Graphs with n Vertices
|
10 pages,exposed on 5th International Conference "Actualities and
Perspectives on Hardware and Software" - APHS2009, Timisoara, Romania
|
Ann. Univ. Tibiscus Comp. Sci. Series VII(2009),315-324
| null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper examines a partial order on bipartite graphs (X1, X2, E) with n
vertices, X1UX2={1,2,...,n}. This partial order is a natural partial order of
subobjects of an object in a triangular category with bipartite graphs as
morphisms.
|
[
{
"version": "v1",
"created": "Thu, 4 Jun 2009 09:25:43 GMT"
}
] | 2009-06-05T00:00:00 |
[
[
"Schwab",
"Emil Daniel",
""
]
] |
new_dataset
| 0.99521 |
0906.0866
|
Florentina Pintea
|
Virgiliu Streian, Adela Ionescu
|
Web Publishing of the Files Obtained by Flash
|
10 pages, exposed on 5th International Conference "Actualities and
Perspectives on Hardware and Software" - APHS2009, Timisoara, Romania
|
Ann. Univ. Tibiscus Comp. Sci. Series VII(2009),349-358
| null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The aim of this article is to familiarize the user with the Web publishing of
the files obtained by Flash. The article contains an overview of Macromedia
Flash 5, as well as the running of a Playing Flash movie, information on Flash
and Generator, the publishing of Flash movies, a HTLM publishing for Flash
Player files and publishing by Generator templates.
|
[
{
"version": "v1",
"created": "Thu, 4 Jun 2009 09:52:22 GMT"
}
] | 2009-06-05T00:00:00 |
[
[
"Streian",
"Virgiliu",
""
],
[
"Ionescu",
"Adela",
""
]
] |
new_dataset
| 0.98615 |
0906.0869
|
Florentina Pintea
|
Valentin Vieriu, Catalin Tuican
|
Adobe AIR, Bringing Rich Internet Applications to the Desktop
|
14 pages, exposed on 5th International Conference "Actualities and
Perspectives on Hardware and Software" - APHS2009, Timisoara, Romania
|
Ann. Univ. Tibiscus Comp. Sci. Series VII(2009),367-380
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Rich Internet Applications are the new trend in software development today.
Adobe AIR offers the possibility to create cross-platform desktop applications
using popular Web technologies like HTML, JavaScript, Flash and Flex. This
article is focused on presenting the advantages that this new environment has
to offer for the web development community and how quickly you can develop a
desktop application using Adobe AIR.
|
[
{
"version": "v1",
"created": "Thu, 4 Jun 2009 10:00:21 GMT"
}
] | 2009-06-05T00:00:00 |
[
[
"Vieriu",
"Valentin",
""
],
[
"Tuican",
"Catalin",
""
]
] |
new_dataset
| 0.984265 |
0906.0877
|
Florentina Pintea
|
Florentina Anica Pintea, Georgiana Petruta Fintineanu, Bogdan Ioan
Selariu
|
PayPal in Romania
|
8 pages, exposed on 5th International Conference "Actualities and
Perspectives on Hardware and Software" - APHS2009, Timisoara, Romania
|
Ann. Univ. Tibiscus Comp. Sci. Series VII(2009),277-284
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The present paper refers to the usefulness of online payment through PayPal
and to the development of this payment manner in Romania. PayPal is an example
of a payment intermediary service that facilitates worldwide e-commerce.
|
[
{
"version": "v1",
"created": "Thu, 4 Jun 2009 10:31:19 GMT"
}
] | 2009-06-05T00:00:00 |
[
[
"Pintea",
"Florentina Anica",
""
],
[
"Fintineanu",
"Georgiana Petruta",
""
],
[
"Selariu",
"Bogdan Ioan",
""
]
] |
new_dataset
| 0.998166 |
0906.0964
|
Brian Carroll
|
Brian Carroll
|
On Sparse Channel Estimation
|
M.S. Thesis (106 pages, 35 figures)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Channel Estimation is an essential component in applications such as radar
and data communication. In multi path time varying environments, it is
necessary to estimate time-shifts, scale-shifts (the wideband equivalent of
Doppler-shifts), and the gains/phases of each of the multiple paths. With
recent advances in sparse estimation (or "compressive sensing"), new estimation
techniques have emerged which yield more accurate estimates of these channel
parameters than traditional strategies. These estimation strategies, however,
restrict potential estimates of time-shifts and scale-shifts to a finite set of
values separated by a choice of grid spacing. A small grid spacing increases
the number of potential estimates, thus lowering the quantization error, but
also increases complexity and estimation time. Conversely, a large grid spacing
lowers the number of potential estimates, thus lowering the complexity and
estimation time, but increases the quantization error. In this thesis, we
derive an expression which relates the choice of grid spacing to the
mean-squared quantization error. Furthermore, we consider the case when
scale-shifts are approximated by Doppler-shifts, and derive a similar
expression relating the choice of the grid spacing and the quantization error.
Using insights gained from these expressions, we further explore the effects of
the choice and grid spacing, and examine when a wideband model can be well
approximated by a narrowband model.
|
[
{
"version": "v1",
"created": "Thu, 4 Jun 2009 19:45:40 GMT"
}
] | 2009-06-05T00:00:00 |
[
[
"Carroll",
"Brian",
""
]
] |
new_dataset
| 0.988425 |
0807.4247
|
Merce Villanueva
|
Cristina Fernandez-Cordoba, Jaume Pujol, and Merce Villanueva
|
Z2Z4-linear codes: rank and kernel
| null | null | null | null |
cs.IT cs.DM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A code C is Z2Z4-additive if the set of coordinates can be partitioned into
two subsets X and Y such that the punctured code of C by deleting the
coordinates outside X (respectively, Y) is a binary linear code (respectively,
a quaternary linear code). In this paper, the rank and dimension of the kernel
for Z2Z4-linear codes, which are the corresponding binary codes of
Z2Z4-additive codes, are studied. The possible values of these two parameters
for Z2Z4-linear codes, giving lower and upper bounds, are established. For each
possible rank r between these bounds, the construction of a Z2Z4-linear code
with rank r is given. Equivalently, for each possible dimension of the kernel
k, the construction of a Z2Z4-linear code with dimension of the kernel k is
given. Finally, the bounds on the rank, once the kernel dimension is fixed, are
established and the construction of a Z2Z4-additive code for each possible pair
(r,k) is given.
|
[
{
"version": "v1",
"created": "Sat, 26 Jul 2008 18:30:23 GMT"
},
{
"version": "v2",
"created": "Thu, 4 Jun 2009 09:42:16 GMT"
}
] | 2009-06-04T00:00:00 |
[
[
"Fernandez-Cordoba",
"Cristina",
""
],
[
"Pujol",
"Jaume",
""
],
[
"Villanueva",
"Merce",
""
]
] |
new_dataset
| 0.998095 |
0906.0731
|
Paul Vitanyi
|
Paul M.B. Vitanyi (CWI, Amsterdam)
|
Distributed elections in an Archimedean ring of processors
| null |
16th ACM Symposium on Theory of Computing, Washington D.C., 1984,
542 - 547
| null | null |
cs.DC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Unlimited asynchronism is intolerable in real physically distributed computer
systems. Such systems, synchronous or not, use clocks and timeouts. Therefore
the magnitudes of elapsed absolute time in the system need to satisfy the axiom
of Archimedes. Under this restriction of asynchronicity logically
time-independent solutions can be derived which are nonetheless better (in
number of message passes) than is possible otherwise. The use of clocks by the
individual processors, in elections in a ring of asynchronous processors
without central control, allows a deterministic solution which requires but a
linear number of message passes. To obtain the result it has to be assumed that
the clocks measure finitely proportional absolute time-spans for their time
units, that is, the magnitudes of elapsed time in the ring network satisfy the
axiom of Archimedes. As a result, some basic subtilities associated with
distributed computations are highlighted. For instance, the known nonlinear
lower bound on the required number of message passes is cracked. For the
synchronous case, in which the necessary assumptions hold a fortiori, the
method is -asymptotically- the most efficient one yet, and of optimal order of
magnitude. The deterministic algorithm is of -asymptotically- optimal bit
complexity, and, in the synchronous case, also yields an optimal method to
determine the ring size. All of these results improve the known ones.
|
[
{
"version": "v1",
"created": "Wed, 27 May 2009 16:07:56 GMT"
}
] | 2009-06-04T00:00:00 |
[
[
"Vitanyi",
"Paul M. B.",
"",
"CWI, Amsterdam"
]
] |
new_dataset
| 0.99076 |
0906.0739
|
Kun Zheng
|
Kun Zheng, Husheng Li, Seddik M. Djouadi and Jun Wang
|
Spectrum Sensing in Low SNR Regime via Stochastic Resonance
|
5 pages, 9 figures, submitted to Asilomar 2009
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spectrum sensing is essential in cognitive radio to enable dynamic spectrum
access. In many scenarios, primary user signal must be detected reliably in low
signal-to-noise ratio (SNR) regime under required sensing time. We propose to
use stochastic resonance, a nonlinear filter having certain resonance
frequency, to detect primary users when the SNR is very low. Both block and
sequential detection schemes are studied. Simulation results show that, under
the required false alarm rate, both detection probability and average detection
delay can be substantially improved. A few implementation issues are also
discussed.
|
[
{
"version": "v1",
"created": "Wed, 3 Jun 2009 16:29:22 GMT"
}
] | 2009-06-04T00:00:00 |
[
[
"Zheng",
"Kun",
""
],
[
"Li",
"Husheng",
""
],
[
"Djouadi",
"Seddik M.",
""
],
[
"Wang",
"Jun",
""
]
] |
new_dataset
| 0.984604 |
0906.0550
|
Josep Rif\`a
|
J. Borges J. Rifa V. Zinoviev
|
On linear completely regular codes with covering radius $\rho=1$.
Construction and classification
|
Submitted to IEEE, Trans. Inf. Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Completely regular codes with covering radius $\rho=1$ must have minimum
distance $d\leq 3$. For $d=3$, such codes are perfect and their parameters are
well known. In this paper, the cases $d=1$ and $d=2$ are studied and completely
characterized when the codes are linear. Moreover, it is proven that all these
codes are completely transitive.
|
[
{
"version": "v1",
"created": "Tue, 2 Jun 2009 17:48:02 GMT"
}
] | 2009-06-03T00:00:00 |
[
[
"Zinoviev",
"J. Borges J. Rifa V.",
""
]
] |
new_dataset
| 0.992297 |
0906.0151
|
Didehvar Farzaad
|
Mahtab Hoseininia, Farzad Didehvar, Mir Mehdi Seyyed Esfahani
|
Inventory competition in a multi channel distribution system: The Nash
and Stackelberg game
|
20 pages, 1 figure
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates inventory management in a multi channel distribution
system consisting of one manufacturer and an arbitrary number of retailers that
face stochastic demand. Existence of the pure Nash equilibrium is proved and
parameter restriction which implies uniqueness of it is derived. Also the
Stackelberg game where the manufacturer plays a roll as a leader is discussed.
Under specified parameter restrictions which guarantee profitability,
sufficient condition for uniqueness of Stackelberg equilibrium is obtained. In
addition comparison with simultaneous move game is made. The result shows that
when whole prices are equal to production cost, manufacturer carries more
inventory than simultaneous move game. Keywords: Inventory management,
Substitution, Nash equilibrium, Stackelberg equilibrium.
|
[
{
"version": "v1",
"created": "Sun, 31 May 2009 12:25:12 GMT"
}
] | 2009-06-02T00:00:00 |
[
[
"Hoseininia",
"Mahtab",
""
],
[
"Didehvar",
"Farzad",
""
],
[
"Esfahani",
"Mir Mehdi Seyyed",
""
]
] |
new_dataset
| 0.996544 |
0906.0268
|
Vincent N\'elis
|
Vincent Nelis and Joel Goossens
|
MORA: an Energy-Aware Slack Reclamation Scheme for Scheduling Sporadic
Real-Time Tasks upon Multiprocessor Platforms
|
11 pages
| null | null | null |
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we address the global and preemptive energy-aware scheduling
problem of sporadic constrained-deadline tasks on DVFS-identical multiprocessor
platforms. We propose an online slack reclamation scheme which profits from the
discrepancy between the worst- and actual-case execution time of the tasks by
slowing down the speed of the processors in order to save energy. Our algorithm
called MORA takes into account the application-specific consumption profile of
the tasks. We demonstrate that MORA does not jeopardize the system
schedulability and we show by performing simulations that it can save up to 32%
of energy (in average) compared to execution without using any energy-aware
algorithm.
|
[
{
"version": "v1",
"created": "Mon, 1 Jun 2009 12:10:10 GMT"
}
] | 2009-06-02T00:00:00 |
[
[
"Nelis",
"Vincent",
""
],
[
"Goossens",
"Joel",
""
]
] |
new_dataset
| 0.997127 |
0905.4612
|
Inge Bethke
|
Jan A. Bergstra and Inge Bethke
|
Straight-line instruction sequence completeness for total calculation on
cancellation meadows
|
24 pages
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A combination of program algebra with the theory of meadows is designed
leading to a theory of computation in algebraic structures which use in
addition to a zero test and copying instructions the instruction set $\{x
\Leftarrow 0, x \Leftarrow 1, x\Leftarrow -x, x\Leftarrow x^{-1}, x\Leftarrow
x+y, x\Leftarrow x\cdot y\}$. It is proven that total functions on cancellation
meadows can be computed by straight-line programs using at most 5 auxiliary
variables. A similar result is obtained for signed meadows.
|
[
{
"version": "v1",
"created": "Thu, 28 May 2009 11:13:58 GMT"
},
{
"version": "v2",
"created": "Fri, 29 May 2009 14:14:17 GMT"
}
] | 2009-05-29T00:00:00 |
[
[
"Bergstra",
"Jan A.",
""
],
[
"Bethke",
"Inge",
""
]
] |
new_dataset
| 0.972498 |
0905.3713
|
Limin Xiang
|
Limin Xiang
|
A formal proof of the four color theorem
|
9 pages, 2 Figures
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A formal proof has not been found for the four color theorem since 1852 when
Francis Guthrie first conjectured the four color theorem. Why? A bad idea, we
think, directed people to a rough road. Using a similar method to that for the
formal proof of the five color theorem, a formal proof is proposed in this
paper of the four color theorem, namely, every planar graph is four-colorable.
The formal proof proposed can also be regarded as an algorithm to color a
planar graph using four colors so that no two adjacent vertices receive the
same color.
|
[
{
"version": "v1",
"created": "Fri, 22 May 2009 15:57:26 GMT"
},
{
"version": "v2",
"created": "Wed, 27 May 2009 09:44:28 GMT"
}
] | 2009-05-27T00:00:00 |
[
[
"Xiang",
"Limin",
""
]
] |
new_dataset
| 0.985237 |
0905.4090
|
Bart Jacobs
|
Bart Jacobs
|
Orthomodular lattices, Foulis Semigroups and Dagger Kernel Categories
|
31 pages
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is a sequel to arXiv:0902.2355 and continues the study of quantum
logic via dagger kernel categories. It develops the relation between these
categories and both orthomodular lattices and Foulis semigroups. The relation
between the latter two notions has been uncovered in the 1960s. The current
categorical perspective gives a broader context and reconstructs this
relationship between orthomodular lattices and Foulis semigroups as special
instance.
|
[
{
"version": "v1",
"created": "Mon, 25 May 2009 22:38:41 GMT"
}
] | 2009-05-27T00:00:00 |
[
[
"Jacobs",
"Bart",
""
]
] |
new_dataset
| 0.97983 |
0905.4163
|
Murat Guzeltepe Mr
|
Murat Guzeltepe, Mehmet Ozen
|
Cyclic Codes over Some Finite Rings
| null | null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper cyclic codes are established with respect to the Mannheim
metric over some finite rings by using Gaussian integers and the decoding
algorithm for these codes is given.
|
[
{
"version": "v1",
"created": "Tue, 26 May 2009 11:06:33 GMT"
}
] | 2009-05-27T00:00:00 |
[
[
"Guzeltepe",
"Murat",
""
],
[
"Ozen",
"Mehmet",
""
]
] |
new_dataset
| 0.997781 |
0905.4200
|
Tom Hirschowitz
|
Richard Garner, Tom Hirschowitz (LAMA), Aur\'elien Pardon (LIP)
|
Variable binding, symmetric monoidal closed theories, and bigraphs
|
An introduction to two more technical previous preprints. Accepted at
Concur '09
| null | null | null |
cs.LO cs.PL math.CT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates the use of symmetric monoidal closed (SMC) structure
for representing syntax with variable binding, in particular for languages with
linear aspects. In our setting, one first specifies an SMC theory T, which may
express binding operations, in a way reminiscent from higher-order abstract
syntax. This theory generates an SMC category S(T) whose morphisms are, in a
sense, terms in the desired syntax. We apply our approach to Jensen and
Milner's (abstract binding) bigraphs, which are linear w.r.t. processes. This
leads to an alternative category of bigraphs, which we compare to the original.
|
[
{
"version": "v1",
"created": "Tue, 26 May 2009 13:43:16 GMT"
}
] | 2009-05-27T00:00:00 |
[
[
"Garner",
"Richard",
"",
"LAMA"
],
[
"Hirschowitz",
"Tom",
"",
"LAMA"
],
[
"Pardon",
"Aurélien",
"",
"LIP"
]
] |
new_dataset
| 0.985676 |
0905.3946
|
Chih-Hong Cheng
|
Chih-Hong Cheng, Christian Buckl, Javier Esparza, Alois Knoll
|
FTOS-Verify: Analysis and Verification of Non-Functional Properties for
Fault-Tolerant Systems
|
(bibliography update)
| null | null | null |
cs.DC cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The focus of the tool FTOS is to alleviate designers' burden by offering code
generation for non-functional aspects including fault-tolerance mechanisms. One
crucial aspect in this context is to ensure that user-selected mechanisms for
the system model are sufficient to resist faults as specified in the underlying
fault hypothesis. In this paper, formal approaches in verification are proposed
to assist the claim. We first raise the precision of FTOS into pure
mathematical constructs, and formulate the deterministic assumption, which is
necessary as an extension of Giotto-like systems (e.g., FTOS) to equip with
fault-tolerance abilities. We show that local properties of a system with the
deterministic assumption will be preserved in a modified synchronous system
used as the verification model. This enables the use of techniques known from
hardware verification. As for implementation, we develop a prototype tool
called FTOS-Verify, deploy it as an Eclipse add-on for FTOS, and conduct
several case studies.
|
[
{
"version": "v1",
"created": "Mon, 25 May 2009 06:11:42 GMT"
}
] | 2009-05-26T00:00:00 |
[
[
"Cheng",
"Chih-Hong",
""
],
[
"Buckl",
"Christian",
""
],
[
"Esparza",
"Javier",
""
],
[
"Knoll",
"Alois",
""
]
] |
new_dataset
| 0.985908 |
0905.3998
|
Pierre Hyvernat
|
Pierre Hyvernat (IML)
|
Predicate Transformers and Linear Logic, yet another denotational model
| null |
Computer Science and Logic 2004, Karpacz : Pologne (2004)
| null | null |
cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the refinement calculus, monotonic predicate transformers are used to
model specifications for (imperative) programs. Together with a natural notion
of simulation, they form a category enjoying many algebraic properties. We
build on this structure to make predicate transformers into a de notational
model of full linear logic: all the logical constructions have a natural
interpretation in terms of predicate transformers (i.e. in terms of
specifications). We then interpret proofs of a formula by a safety property for
the corresponding specification.
|
[
{
"version": "v1",
"created": "Mon, 25 May 2009 19:16:00 GMT"
}
] | 2009-05-26T00:00:00 |
[
[
"Hyvernat",
"Pierre",
"",
"IML"
]
] |
new_dataset
| 0.994595 |
0902.0084
|
Miled Abdelwaheb
|
Abdelwaheb Miled
|
On a problem of Frobenius in three numbers
|
5 pages
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For three positive integers ai, aj, ak pairwise coprime, we present an
algorithm that find the least multiple of ai that is a positive linear
combination of aj, ak. The average running time of this algorithm is O(1).
Using this algorithm and the chinese remainder theorem leads to a direct
computation of the Frobenius number f(a1, a2, a3).
|
[
{
"version": "v1",
"created": "Mon, 2 Feb 2009 14:13:52 GMT"
},
{
"version": "v2",
"created": "Mon, 25 May 2009 17:37:11 GMT"
}
] | 2009-05-25T00:00:00 |
[
[
"Miled",
"Abdelwaheb",
""
]
] |
new_dataset
| 0.96654 |
0901.2207
|
Ryuhei Mori
|
Ryuhei Mori and Toshiyuki Tanaka
|
Performance and Construction of Polar Codes on Symmetric Binary-Input
Memoryless Channels
|
5 pages, 3 figures, submitted to ISIT2009; revised
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Channel polarization is a method of constructing capacity achieving codes for
symmetric binary-input discrete memoryless channels (B-DMCs) [1]. In the
original paper, the construction complexity is exponential in the blocklength.
In this paper, a new construction method for arbitrary symmetric binary
memoryless channel (B-MC) with linear complexity in the blocklength is
proposed. Furthermore, new upper and lower bounds of the block error
probability of polar codes are derived for the BEC and the arbitrary symmetric
B-MC, respectively.
|
[
{
"version": "v1",
"created": "Thu, 15 Jan 2009 17:08:36 GMT"
},
{
"version": "v2",
"created": "Sat, 23 May 2009 09:21:04 GMT"
}
] | 2009-05-23T00:00:00 |
[
[
"Mori",
"Ryuhei",
""
],
[
"Tanaka",
"Toshiyuki",
""
]
] |
new_dataset
| 0.98937 |
cs/0307023
|
David Eppstein
|
David Eppstein
|
Testing Bipartiteness of Geometric Intersection Graphs
|
32 pages, 20 figures. A shorter (10 page) version of this paper was
presented at the 15th ACM-SIAM Symp. Discrete Algorithms, New Orleans, 2004,
pp. 853-861
|
ACM Trans. Algorithms 5(2):15, 2009
|
10.1145/1497290.1497291
| null |
cs.CG
| null |
We show how to test the bipartiteness of an intersection graph of n line
segments or simple polygons in the plane, or of balls in R^d, in time O(n log
n). More generally we find subquadratic algorithms for connectivity and
bipartiteness testing of intersection graphs of a broad class of geometric
objects. For unit balls in R^d, connectivity testing has equivalent randomized
complexity to construction of Euclidean minimum spanning trees, and hence is
unlikely to be solved as efficiently as bipartiteness testing. For line
segments or planar disks, testing k-colorability of intersection graphs for k>2
is NP-complete.
|
[
{
"version": "v1",
"created": "Wed, 9 Jul 2003 21:29:49 GMT"
},
{
"version": "v2",
"created": "Fri, 16 Nov 2007 06:41:36 GMT"
}
] | 2009-05-23T00:00:00 |
[
[
"Eppstein",
"David",
""
]
] |
new_dataset
| 0.973947 |
0901.2370
|
Satish Babu Korada
|
Nadine Hussami, Satish Babu Korada, Rudiger Urbanke
|
Performance of Polar Codes for Channel and Source Coding
|
accepted in ISIT 2009, Figure 5 is different from the previous
version
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes, introduced recently by Ar\i kan, are the first family of codes
known to achieve capacity of symmetric channels using a low complexity
successive cancellation decoder. Although these codes, combined with successive
cancellation, are optimal in this respect, their finite-length performance is
not record breaking. We discuss several techniques through which their
finite-length performance can be improved. We also study the performance of
these codes in the context of source coding, both lossless and lossy, in the
single-user context as well as for distributed applications.
|
[
{
"version": "v1",
"created": "Fri, 16 Jan 2009 14:58:11 GMT"
},
{
"version": "v2",
"created": "Fri, 22 May 2009 16:20:03 GMT"
}
] | 2009-05-22T00:00:00 |
[
[
"Hussami",
"Nadine",
""
],
[
"Korada",
"Satish Babu",
""
],
[
"Urbanke",
"Rudiger",
""
]
] |
new_dataset
| 0.999668 |
0905.3356
|
Rom\`an R. Zapatrin
|
George Parfionov, Rom\`an Zapatrin
|
Memento Ludi: Information Retrieval from a Game-Theoretic Perspective
| null | null | null | null |
cs.IR cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We develop a macro-model of information retrieval process using Game Theory
as a mathematical theory of conflicts. We represent the participants of the
Information Retrieval process as a game of two abstract players. The first
player is the `intellectual crowd' of users of search engines, the second is a
community of information retrieval systems. In order to apply Game Theory, we
treat search log data as Nash equilibrium strategies and solve the inverse
problem of finding appropriate payoff functions. For that, we suggest a
particular model, which we call Alpha model. Within this model, we suggest a
method, called shifting, which makes it possible to partially control the
behavior of massive users.
This Note is addressed to researchers in both game theory (providing a new
class of real life problems) and information retrieval, for whom we present new
techniques to control the IR environment.
|
[
{
"version": "v1",
"created": "Wed, 20 May 2009 17:04:07 GMT"
}
] | 2009-05-21T00:00:00 |
[
[
"Parfionov",
"George",
""
],
[
"Zapatrin",
"Romàn",
""
]
] |
new_dataset
| 0.996887 |
0905.3107
|
Travis Gagie
|
Travis Gagie, Gonzalo Navarro, Yakov Nekrich
|
Fast and Compact Prefix Codes
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is well-known that, given a probability distribution over $n$ characters,
in the worst case it takes (\Theta (n \log n)) bits to store a prefix code with
minimum expected codeword length. However, in this paper we first show that,
for any $0<\epsilon<1/2$ with (1 / \epsilon = \Oh{\polylog{n}}), it takes
$\Oh{n \log \log (1 / \epsilon)}$ bits to store a prefix code with expected
codeword length within $\epsilon$ of the minimum. We then show that, for any
constant (c > 1), it takes $\Oh{n^{1 / c} \log n}$ bits to store a prefix code
with expected codeword length at most $c$ times the minimum. In both cases, our
data structures allow us to encode and decode any character in $\Oh{1}$ time.
|
[
{
"version": "v1",
"created": "Tue, 19 May 2009 14:19:08 GMT"
}
] | 2009-05-20T00:00:00 |
[
[
"Gagie",
"Travis",
""
],
[
"Navarro",
"Gonzalo",
""
],
[
"Nekrich",
"Yakov",
""
]
] |
new_dataset
| 0.999194 |
0905.2540
|
Swan Dubois
|
Alain Cournier (MIS), Swan Dubois (LIP6, INRIA Rocquencourt), Vincent
Villain (MIS)
|
Two snap-stabilizing point-to-point communication protocols in
message-switched networks
| null | null | null | null |
cs.DS cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A snap-stabilizing protocol, starting from any configuration, always behaves
according to its specification. In this paper, we present a snap-stabilizing
protocol to solve the message forwarding problem in a message-switched network.
In this problem, we must manage resources of the system to deliver messages to
any processor of the network. In this purpose, we use information given by a
routing algorithm. By the context of stabilization (in particular, the system
starts in an arbitrary configuration), this information can be corrupted. So,
the existence of a snap-stabilizing protocol for the message forwarding problem
implies that we can ask the system to begin forwarding messages even if routing
information are initially corrupted. In this paper, we propose two
snap-stabilizing algorithms (in the state model) for the following
specification of the problem: - Any message can be generated in a finite time.
- Any emitted message is delivered to its destination once and only once in a
finite time. This implies that our protocol can deliver any emitted message
regardless of the state of routing tables in the initial configuration. These
two algorithms are based on the previous work of [MS78]. Each algorithm needs a
particular method to be transform into a snap-stabilizing one but both of them
do not introduce a significant overcost in memory or in time with respect to
algorithms of [MS78].
|
[
{
"version": "v1",
"created": "Fri, 15 May 2009 12:41:01 GMT"
}
] | 2009-05-18T00:00:00 |
[
[
"Cournier",
"Alain",
"",
"MIS"
],
[
"Dubois",
"Swan",
"",
"LIP6, INRIA Rocquencourt"
],
[
"Villain",
"Vincent",
"",
"MIS"
]
] |
new_dataset
| 0.97057 |
0804.4073
|
Gilles Champenois
|
Gilles Champenois
|
Grainy Numbers
| null | null | null | null |
cs.LO cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Grainy numbers are defined as tuples of bits. They form a lattice where the
meet and the join operations are an addition and a multiplication. They may be
substituted for the real numbers in the definition of fuzzy sets. The aim is to
propose an alternative negation for the complement that we'll call supplement.
|
[
{
"version": "v1",
"created": "Fri, 25 Apr 2008 09:36:17 GMT"
},
{
"version": "v2",
"created": "Thu, 8 May 2008 09:07:18 GMT"
},
{
"version": "v3",
"created": "Thu, 12 Jun 2008 22:10:31 GMT"
},
{
"version": "v4",
"created": "Wed, 9 Jul 2008 11:01:54 GMT"
},
{
"version": "v5",
"created": "Thu, 10 Jul 2008 09:23:47 GMT"
},
{
"version": "v6",
"created": "Sun, 17 May 2009 13:45:46 GMT"
}
] | 2009-05-17T00:00:00 |
[
[
"Champenois",
"Gilles",
""
]
] |
new_dataset
| 0.999853 |
0904.0768
|
Andrew Thangaraj
|
Srimathy Srinivasan, Andrew Thangaraj
|
Codes on Planar Graphs
|
several improvements in presentation; more figures for illustration
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Codes defined on graphs and their properties have been subjects of intense
recent research. On the practical side, constructions for capacity-approaching
codes are graphical. On the theoretical side, codes on graphs provide several
intriguing problems in the intersection of coding theory and graph theory. In
this paper, we study codes defined by planar Tanner graphs. We derive an upper
bound on minimum distance $d$ of such codes as a function of the code rate $R$
for $R \ge 5/8$. The bound is given by $$d\le \lceil \frac{7-8R}{2(2R-1)}
\rceil + 3\le 7.$$ Among the interesting conclusions of this result are the
following: (1) planar graphs do not support asymptotically good codes, and (2)
finite-length, high-rate codes on graphs with high minimum distance will
necessarily be non-planar.
|
[
{
"version": "v1",
"created": "Sun, 5 Apr 2009 12:43:37 GMT"
},
{
"version": "v2",
"created": "Fri, 15 May 2009 06:42:29 GMT"
}
] | 2009-05-15T00:00:00 |
[
[
"Srinivasan",
"Srimathy",
""
],
[
"Thangaraj",
"Andrew",
""
]
] |
new_dataset
| 0.999773 |
0904.2541
|
Heidi Gebauer
|
Heidi Gebauer
|
Disproof of the Neighborhood Conjecture with Implications to SAT
|
12 pages, 1 figure
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study a Maker/Breaker game described by Beck. As a result we disprove a
conjecture of Beck on positional games, establish a connection between this
game and SAT and construct an unsatisfiable k-CNF formula with few occurrences
per variable, thereby improving a previous result by Hoory and Szeider and
showing that the bound obtained from the Lovasz Local Lemma is tight up to a
constant factor. The Maker/Breaker game we study is as follows. Maker and
Breaker take turns in choosing vertices from a given n-uniform hypergraph F,
with Maker going first. Maker's goal is to completely occupy a hyperedge and
Breaker tries to avoid this. Beck conjectures that if the maximum neighborhood
size of F is at most 2^(n-1) then Breaker has a winning strategy. We disprove
this conjecture by establishing an n-uniform hypergraph with maximum
neighborhood size 3*2^(n - 3) where Maker has a winning strategy. Moreover, we
show how to construct an n-uniform hypergraph with maximum degree (2^(n-1))/n
where maker has a winning strategy. Finally, we establish a connection between
SAT and the Maker/Breaker game we study. We can use this connection to derive
new results in SAT. Kratochvil, Savicky and Tuza showed that for every k >= 3
there is an integer f(k) such that every (k,f(k))-formula is satisfiable, but
(k,f(k) + 1)-SAT is already NP-complete (it is not known whether f(k) is
computable). Kratochvil, Savicky and Tuza also gave the best known lower bound
f(k) = Omega(2^k/k), which is a consequence of the Lovasz Local Lemma. We prove
that, in fact, f(k) = Theta(2^k/k), improving upon the best known upper bound
O((log k) * 2^k/k) by Hoory and Szeider.
|
[
{
"version": "v1",
"created": "Thu, 16 Apr 2009 17:04:21 GMT"
},
{
"version": "v2",
"created": "Thu, 7 May 2009 21:25:14 GMT"
},
{
"version": "v3",
"created": "Fri, 15 May 2009 07:59:53 GMT"
}
] | 2009-05-15T00:00:00 |
[
[
"Gebauer",
"Heidi",
""
]
] |
new_dataset
| 0.99428 |
0905.2214
|
Michael Goodrich
|
Michael T. Goodrich, Michael J. Nelson, Jonathan Z. Sun
|
The Rainbow Skip Graph: A Fault-Tolerant Constant-Degree P2P Relay
Structure
|
Expanded version of a paper appearing in ACM-SIAM Symp. on Discrete
Algorithms (SODA)
| null | null | null |
cs.DS cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a distributed data structure, which we call the rainbow skip
graph. To our knowledge, this is the first peer-to-peer data structure that
simultaneously achieves high fault tolerance, constant-sized nodes, and fast
update and query times for ordered data. It is a non-trivial adaptation of the
SkipNet/skip-graph structures of Harvey et al. and Aspnes and Shah, so as to
provide fault-tolerance as these structures do, but to do so using
constant-sized nodes, as in the family tree structure of Zatloukal and Harvey.
It supports successor queries on a set of n items using O(log n) messages with
high probability, an improvement over the expected O(log n) messages of the
family tree.
|
[
{
"version": "v1",
"created": "Wed, 13 May 2009 22:40:52 GMT"
}
] | 2009-05-15T00:00:00 |
[
[
"Goodrich",
"Michael T.",
""
],
[
"Nelson",
"Michael J.",
""
],
[
"Sun",
"Jonathan Z.",
""
]
] |
new_dataset
| 0.996477 |
0905.2249
|
Joseph O'Rourke
|
Joseph O'Rourke
|
Some Properties of Yao Y4 Subgraphs
|
7 pages, 6 figures
| null | null |
Smith Technical Report 093
|
cs.CG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Yao graph for k=4, Y4, is naturally partitioned into four subgraphs, one
per quadrant. We show that the subgraphs for one quadrant differ from the
subgraphs for two adjacent quadrants in three properties: planarity,
connectedness, and whether the directed graphs are spanners.
|
[
{
"version": "v1",
"created": "Thu, 14 May 2009 04:49:00 GMT"
}
] | 2009-05-15T00:00:00 |
[
[
"O'Rourke",
"Joseph",
""
]
] |
new_dataset
| 0.96302 |
0812.0581
|
Arnaud Legout
|
Stevens Le Blond (INRIA Sophia Antipolis / INRIA Rh\^one-Alpes),
Arnaud Legout (INRIA Sophia Antipolis / INRIA Rh\^one-Alpes), Walid Dabbous
(INRIA Sophia Antipolis / INRIA Rh\^one-Alpes)
|
Pushing BitTorrent Locality to the Limit
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Peer-to-peer (P2P) locality has recently raised a lot of interest in the
community. Indeed, whereas P2P content distribution enables financial savings
for the content providers, it dramatically increases the traffic on inter-ISP
links. To solve this issue, the idea to keep a fraction of the P2P traffic
local to each ISP was introduced a few years ago. Since then, P2P solutions
exploiting locality have been introduced. However, several fundamental issues
on locality still need to be explored. In particular, how far can we push
locality, and what is, at the scale of the Internet, the reduction of traffic
that can be achieved with locality? In this paper, we perform extensive
experiments on a controlled environment with up to 10 000 BitTorrent clients to
evaluate the impact of high locality on inter-ISP links traffic and peers
download completion time. We introduce two simple mechanisms that make high
locality possible in challenging scenarios and we show that we save up to
several orders of magnitude inter-ISP traffic compared to traditional locality
without adversely impacting peers download completion time. In addition, we
crawled 214 443 torrents representing 6 113 224 unique peers spread among 9 605
ASes. We show that whereas the torrents we crawled generated 11.6 petabytes of
inter-ISP traffic, our locality policy implemented for all torrents would have
reduced the global inter-ISP traffic by 40%.
|
[
{
"version": "v1",
"created": "Tue, 2 Dec 2008 20:07:47 GMT"
},
{
"version": "v2",
"created": "Tue, 12 May 2009 15:06:58 GMT"
}
] | 2009-05-12T00:00:00 |
[
[
"Blond",
"Stevens Le",
"",
"INRIA Sophia Antipolis / INRIA Rhône-Alpes"
],
[
"Legout",
"Arnaud",
"",
"INRIA Sophia Antipolis / INRIA Rhône-Alpes"
],
[
"Dabbous",
"Walid",
"",
"INRIA Sophia Antipolis / INRIA Rhône-Alpes"
]
] |
new_dataset
| 0.994974 |
0711.2605
|
Gregory Price
|
Gregory N. Price and Erik D. Demaine
|
Generalized D-Forms Have No Spurious Creases
|
revised
| null | null | null |
cs.CG
|
http://creativecommons.org/licenses/by/3.0/
|
A convex surface that is flat everywhere but on finitely many smooth curves
(or "seams") and points is a seam form. We show that the only creases through
the flat components of a seam form are either between vertices or tangent to
the seams. As corollaries we resolve open problems about certain special seam
forms: the flat components of a D-form have no creases at all, and the flat
component of a pita-form has at most one crease, between the seam's endpoints.
|
[
{
"version": "v1",
"created": "Fri, 16 Nov 2007 20:58:57 GMT"
},
{
"version": "v2",
"created": "Thu, 7 May 2009 05:45:19 GMT"
}
] | 2009-05-07T00:00:00 |
[
[
"Price",
"Gregory N.",
""
],
[
"Demaine",
"Erik D.",
""
]
] |
new_dataset
| 0.998791 |
0905.0737
|
Ignacio Vega-Paez M en C
|
Ignacio Vega-Paez, Jose Angel Ortega, Georgina G. Pulido
|
REC language is a live on IBM1130 simulator, EL lenguaje REC esta vivo
en el simulador de la IBM 1130
|
This work is archaeological reconstruction of REC/A language
| null | null |
IBP-TR2009-04
|
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
REC (Regular Expression Compiler) is a concise programming language
development in mayor Mexican Universities at end of 60s 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 use of the interpreter of REC written in
FORTRAN on IBM1130 Simulator from -Computer History Simulation- Project.
|
[
{
"version": "v1",
"created": "Wed, 6 May 2009 04:21:15 GMT"
}
] | 2009-05-07T00:00:00 |
[
[
"Vega-Paez",
"Ignacio",
""
],
[
"Ortega",
"Jose Angel",
""
],
[
"Pulido",
"Georgina G.",
""
]
] |
new_dataset
| 0.99969 |
0905.0749
|
Daniel Sidobre
|
Xavier Broqu\`ere (LAAS), Daniel Sidobre (LAAS), Ignacio
Herrera-Aguilar (LAAS)
|
Soft Motion Trajectory Planner for Service Manipulator Robot
| null |
International Conference on Intelligent Robots and Systems, IROS
2008. IEEE/RSJ, Nice : France (2008)
| null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Human interaction introduces two main constraints: Safety and Comfort.
Therefore service robot manipulator can't be controlled like industrial robotic
manipulator where personnel is isolated from the robot's work envelope. In this
paper, we present a soft motion trajectory planner to try to ensure that these
constraints are satisfied. This planner can be used on-line to establish visual
and force control loop suitable in presence of human. The cubic trajectories
build by this planner are good candidates as output of a manipulation task
planner. The obtained system is then homogeneous from task planning to robot
control. The soft motion trajectory planner limits jerk, acceleration and
velocity in cartesian space using quaternion. Experimental results carried out
on a Mitsubishi PA10-6CE arm are presented.
|
[
{
"version": "v1",
"created": "Wed, 6 May 2009 06:12:28 GMT"
}
] | 2009-05-07T00:00:00 |
[
[
"Broquère",
"Xavier",
"",
"LAAS"
],
[
"Sidobre",
"Daniel",
"",
"LAAS"
],
[
"Herrera-Aguilar",
"Ignacio",
"",
"LAAS"
]
] |
new_dataset
| 0.99619 |
0804.1932
|
Martin Grohe
|
Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley
|
A complexity dichotomy for partition functions with mixed signs
| null | null | null | null |
cs.CC cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Partition functions, also known as homomorphism functions, form a rich family
of graph invariants that contain combinatorial invariants such as the number of
k-colourings or the number of independent sets of a graph and also the
partition functions of certain "spin glass" models of statistical physics such
as the Ising model.
Building on earlier work by Dyer, Greenhill and Bulatov, Grohe, we completely
classify the computational complexity of partition functions. Our main result
is a dichotomy theorem stating that every partition function is either
computable in polynomial time or #P-complete. Partition functions are described
by symmetric matrices with real entries, and we prove that it is decidable in
polynomial time in terms of the matrix whether a given partition function is in
polynomial time or #P-complete.
While in general it is very complicated to give an explicit algebraic or
combinatorial description of the tractable cases, for partition functions
described by a Hadamard matrices -- these turn out to be central in our proofs
-- we obtain a simple algebraic tractability criterion, which says that the
tractable cases are those "representable" by a quadratic polynomial over the
field GF(2).
|
[
{
"version": "v1",
"created": "Fri, 11 Apr 2008 18:36:01 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Jul 2008 15:24:13 GMT"
},
{
"version": "v3",
"created": "Tue, 5 May 2009 16:47:49 GMT"
}
] | 2009-05-05T00:00:00 |
[
[
"Goldberg",
"Leslie Ann",
""
],
[
"Grohe",
"Martin",
""
],
[
"Jerrum",
"Mark",
""
],
[
"Thurley",
"Marc",
""
]
] |
new_dataset
| 0.992136 |
0905.0417
|
N. Prasanth Anthapadmanabhan
|
N. Prasanth Anthapadmanabhan and Alexander Barg
|
Two-Level Fingerprinting Codes
|
5 pages, 1 figure, Proc. 2009 IEEE International Symposium on
Information Theory (ISIT 2009), Seoul, Korea, June 28 - July 3, 2009
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the notion of two-level fingerprinting and traceability codes.
In this setting, the users are organized in a hierarchical manner by
classifying them into various groups; for instance, by dividing the
distribution area into several geographic regions, and collecting users from
the same region into one group. Two-level fingerprinting and traceability codes
have the following property: As in traditional (one-level) codes, when given an
illegal copy produced by a coalition of users, the decoder identifies one of
the guilty users if the coalition size is less than a certain threshold $t$.
Moreover, even when the coalition is of a larger size $s$ $(> t)$, the decoder
still provides partial information by tracing one of the groups containing a
guilty user.
We establish sufficient conditions for a code to possess the two-level
traceability property. In addition, we also provide constructions for two-level
fingerprinting codes and characterize the corresponding set of achievable
rates.
|
[
{
"version": "v1",
"created": "Mon, 4 May 2009 16:26:27 GMT"
}
] | 2009-05-05T00:00:00 |
[
[
"Anthapadmanabhan",
"N. Prasanth",
""
],
[
"Barg",
"Alexander",
""
]
] |
new_dataset
| 0.999782 |
0904.4926
|
Athanasios Lioumpas S.
|
Athanasios S. Lioumpas and George K. Karagiannidis
|
Variable-Rate M-PSK Communications without Channel Amplitude Estimation
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Channel estimation at the receiver side is essential to adaptive modulation
schemes, prohibiting low complexity systems from using variable rate and/or
variable power transmissions. Towards providing a solution to this problem, we
introduce a variable-rate (VR) M-PSK modulation scheme, for communications over
fading channels, in the absence of channel gain estimation at the receiver. The
choice of the constellation size is based on the signal-plus-noise (S+N)
sampling value rather than on the signal-to-noise ratio (S/N). It is
analytically shown that S+N can serve as an excellent simpler criterion,
alternative to S/N, for determining the modulation order in VR systems. In this
way, low complexity transceivers can use VR transmissions in order to increase
their spectral efficiency under an error performance constraint. As an
application, we utilize the proposed VR modulation scheme in equal gain
combining (EGC) diversity receivers.
|
[
{
"version": "v1",
"created": "Thu, 30 Apr 2009 19:35:17 GMT"
}
] | 2009-05-01T00:00:00 |
[
[
"Lioumpas",
"Athanasios S.",
""
],
[
"Karagiannidis",
"George K.",
""
]
] |
new_dataset
| 0.994942 |
0901.2062
|
Yanling Chen
|
Yanling Chen and Han Vinck
|
Notes on Reed-Muller Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider the Reed-Muller (RM) codes. For the first order RM
code, we prove that it is unique in the sense that any linear code with the
same length, dimension and minimum distance must be the first order RM code;
For the second order RM code, we give a constructive linear sub-code family for
the case when m is even. This is an extension of Corollary 17 of Ch. 15 in the
coding book by MacWilliams and Sloane. Furthermore, we show that the specified
sub-codes of length <= 256 have minimum distance equal to the upper bound or
the best known lower bound for all linear codes of the same length and
dimension. As another interesting result, we derive an additive commutative
group of the symplectic matrices with full rank.
|
[
{
"version": "v1",
"created": "Wed, 14 Jan 2009 16:47:41 GMT"
},
{
"version": "v2",
"created": "Thu, 30 Apr 2009 14:40:19 GMT"
}
] | 2009-04-30T00:00:00 |
[
[
"Chen",
"Yanling",
""
],
[
"Vinck",
"Han",
""
]
] |
new_dataset
| 0.981452 |
0904.3827
|
Annick Valibouze
|
Annick Valibouze (LSTA, Lip6)
|
La R\'esolvante de Lagrange et ses Applications
|
26 pages
| null | null | null |
cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, the changes of representations of a group are used in order to
describe its action as algebraic Galois group of an univariate polynomial on
the roots of factors of any Lagrange resolvent. By this way, the Galois group
of resolvent factors are pre-determinated. In follows, different applications
are exposed; in particular, some classical results of algebraic Galois theory.
|
[
{
"version": "v1",
"created": "Fri, 24 Apr 2009 09:00:48 GMT"
}
] | 2009-04-27T00:00:00 |
[
[
"Valibouze",
"Annick",
"",
"LSTA, Lip6"
]
] |
new_dataset
| 0.980418 |
0904.3552
|
Florentina Pintea
|
Papin Nicolae, Tiberiu Marius Karnyanszky
|
Internet: Romania vs. Europe
|
14 pages,exposed on 1st "European Conference on Computer Sciences &
Applications" - XA2006, Timisoara, Romania
|
Ann. Univ. Tibiscus Comp. Sci. Series IV (2006), 153-166
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents various access ways to Internet for home users, both for
those who are low consumers (consumed time online or traffic monthly value), or
large consumers (unlimited connection). The main purpose of the work consists
in making a comparison between the situation of the Internet in Romania and
other countries in Europe such as Hungary (more western than Romania, so a
little more developed, still an Eastern country comparing to the more developed
countries in Western Europe and others well developed such as England, Italy,
France, and to those in development such as Poland, and at the periphery of
Europe such as Ukraine.
|
[
{
"version": "v1",
"created": "Thu, 23 Apr 2009 13:30:49 GMT"
}
] | 2009-04-24T00:00:00 |
[
[
"Nicolae",
"Papin",
""
],
[
"Karnyanszky",
"Tiberiu Marius",
""
]
] |
new_dataset
| 0.999368 |
0904.3611
|
Aubin Jarry
|
Florian Huc and Aubin Jarry
|
VRAC: Virtual Raw Anchor Coordinates Routing in Sensor Networks --
Concepts and Experimental Protocol
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In order to make full use of geographic routing techniques developed for
large scale networks, nodes must be localized. However, localization and
virtual localization techniques in sensor networks are dependent either on
expensive and sometimes unavailable hardware (e.g. GPS) or on sophisticated
localization calculus (e.g. triangulation) which are both error-prone and with
a costly overhead.
Instead of localizing nodes in a traditional 2-dimensional space, we intend
to use directly the raw distance to a set of anchors to route messages in the
multi-dimensional space. This should enable us to use any geographic routing
protocol in a robust and efficient manner in a very large range of scenarios.
|
[
{
"version": "v1",
"created": "Thu, 23 Apr 2009 07:40:59 GMT"
}
] | 2009-04-24T00:00:00 |
[
[
"Huc",
"Florian",
""
],
[
"Jarry",
"Aubin",
""
]
] |
new_dataset
| 0.977474 |
0904.3631
|
Florentina Pintea
|
Ioan Despi, Lucian Luca
|
On the Ambiguity of Commercial Open Source
|
10 pages,exposed on 1st "European Conference on Computer Sciences &
Applications" - XA2006, Timisoara, Romania
|
Ann. Univ. Tibiscus Comp. Sci. Series IV (2006), 31-40
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Open source and commercial applications used to be two separate worlds. The
former was the work of amateurs who had little interest in making a profit,
while the latter was only profit oriented and was produced by big companies.
Nowadays open source is a threat and an opportunity to serious businesses of
all kinds, generating good profits while delivering low costs products to
customers. The competition between commercial and open source software has
impacted the industry and the society as a whole. But in the last years, the
markets for commercial and open source software are converging rapidly and it
is interesting to resume and discuss the implications of this new paradigm,
taking into account arguments pro and against it.
|
[
{
"version": "v1",
"created": "Thu, 23 Apr 2009 09:07:15 GMT"
}
] | 2009-04-24T00:00:00 |
[
[
"Despi",
"Ioan",
""
],
[
"Luca",
"Lucian",
""
]
] |
new_dataset
| 0.978228 |
0904.3718
|
Florentina Pintea
|
K. Yermashov, K. H. Siemsen, K. Wolke, R.A. Rasenack
|
Architecture of the Neurath Basic Model View Controller
|
6 pages,exposed on 1st "European Conference on Computer Sciences &
Applications" - XA2006, Timisoara, Romania
|
Ann. Univ. Tibiscus Comp. Sci. Series IV (2006), 277-282
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The idea of the Neurath Basic Model View Controller (NBMVC) appeared during
the discussion of the design of domain-specific modeling tools based on the
Neurath Modeling Language [Yer06]. The NBMVC is the core of the modeling
process within the modeling environment. It reduces complexity out of the
design process by providing domain-specific interfaces between the developer
and the model. These interfaces help to organize and manipulate the model. The
organization includes, for example, a layer with visual components to drop them
in and filter them out. The control routines includes, for example, model
transformations.
|
[
{
"version": "v1",
"created": "Thu, 23 Apr 2009 15:05:01 GMT"
}
] | 2009-04-24T00:00:00 |
[
[
"Yermashov",
"K.",
""
],
[
"Siemsen",
"K. H.",
""
],
[
"Wolke",
"K.",
""
],
[
"Rasenack",
"R. A.",
""
]
] |
new_dataset
| 0.99824 |
0806.3033
|
Eric Sopena
|
Adrien Guignard (LaBRI), Eric Sopena (LaBRI)
|
Compound Node-Kayles on Paths
|
Theoretical Computer Science (2009) to appear
|
Theoretical Computer Science 410, 21-23 (2009) 2033-2044
|
10.1016/j.tcs.2008.12.053
| null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In his celebrated book "On Number and Games" (Academic Press, New-York,
1976), J.H. Conway introduced twelve versions of compound games. We analyze
these twelve versions for the Node-Kayles game on paths. For usual disjunctive
compound, Node-Kayles has been solved for a long time under normal play, while
it is still unsolved under mis\`ere play. We thus focus on the ten remaining
versions, leaving only one of them unsolved.
|
[
{
"version": "v1",
"created": "Wed, 18 Jun 2008 15:47:10 GMT"
},
{
"version": "v2",
"created": "Mon, 5 Jan 2009 20:16:06 GMT"
}
] | 2009-04-23T00:00:00 |
[
[
"Guignard",
"Adrien",
"",
"LaBRI"
],
[
"Sopena",
"Eric",
"",
"LaBRI"
]
] |
new_dataset
| 0.980359 |
0904.3458
|
Praveen Sivadasan
|
Praveen Sivadasan, P Sojan Lal
|
JConstHide: A Framework for Java Source Code Constant Hiding
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Software obfuscation or obscuring a software is an approach to defeat the
practice of reverse engineering a software for using its functionality
illegally in the development of another software. Java applications are more
amenable to reverse engineering and re-engineering attacks through methods such
as decompilation because Java class files store the program in a semi complied
form called byte codes. The existing obfuscation systems obfuscate the Java
class files. Obfuscated source code produce obfuscated byte codes and hence two
level obfuscation (source code and byte code level) of the program makes it
more resilient to reverse engineering attacks . But source code obfuscation is
much more difficult due to richer set of programming constructs and the scope
of the different variables used in the program and only very little progress
has been made on this front. We in this paper are proposing a framework named
JConstHide for hiding constants, especially integers in the java source codes,
to defeat reverse engineering through decompilation. To the best of our
knowledge, no data hiding software are available for java source code constant
hiding.
|
[
{
"version": "v1",
"created": "Wed, 22 Apr 2009 13:15:31 GMT"
}
] | 2009-04-23T00:00:00 |
[
[
"Sivadasan",
"Praveen",
""
],
[
"Lal",
"P Sojan",
""
]
] |
new_dataset
| 0.99905 |
0904.3148
|
Hao Chen
|
Hao Chen
|
CRT-Based High Speed Parallel Architecture for Long BCH Encoding
|
3 pages
| null | null | null |
cs.AR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
BCH (Bose-Chaudhuri-Hocquenghen) error correcting codes ([1]-[2]) are now
widely used in communication systems and digital technology. Direct LFSR(linear
feedback shifted register)-based encoding of a long BCH code suffers from
serial-in and serial-out limitation and large fanout effect of some XOR gates.
This makes the LFSR-based encoders of long BCH codes cannot keep up with the
data transmission speed in some applications. Several parallel long parallel
encoders for long cyclic codes have been proposed in [3]-[8]. The technique for
eliminating the large fanout effect by J-unfolding method and some algebraic
manipulation was presented in [7] and [8] . In this paper we propose a
CRT(Chinese Remainder Theorem)-based parallel architecture for long BCH
encoding. Our novel technique can be used to eliminate the fanout bottleneck.
The only restriction on the speed of long BCH encoding of our CRT-based
architecture is $log_2N$, where $N$ is the length of the BCH code.
|
[
{
"version": "v1",
"created": "Tue, 21 Apr 2009 00:34:43 GMT"
}
] | 2009-04-22T00:00:00 |
[
[
"Chen",
"Hao",
""
]
] |
new_dataset
| 0.999471 |
0904.3165
|
Roy Yates
|
David Tse, Roy Yates
|
Fading Broadcast Channels with State Information at the Receivers
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite considerable progress on the information-theoretic broadcast channel,
the capacity region of fading broadcast channels with channel state known at
the receivers but unknown at the transmitter remains unresolved. We address
this subject by introducing a layered erasure broadcast channel model in which
each component channel has a state that specifies the received signal levels in
an instance of a deterministic binary expansion channel. We find the capacity
region of this class of broadcast channels. The capacity achieving strategy
assigns each signal level to the user that derives the maximum expected rate
from that level. The outer bound is based on a channel enhancement that creates
a degraded broadcast channel for which the capacity region is known. This same
approach is then used to find inner and outer bounds to the capacity region of
fading Gaussian broadcast channels. The achievability scheme employs a
superposition of binary inputs. For intermittent AWGN channels and for Rayleigh
fading channels, the achievable rates are observed to be with 1-2 bits of the
outer bound at high SNR. We also prove that the achievable rate region is
within 6.386 bits/s/Hz of the capacity region for all fading AWGN broadcast
channels.
|
[
{
"version": "v1",
"created": "Tue, 21 Apr 2009 06:11:07 GMT"
}
] | 2009-04-22T00:00:00 |
[
[
"Tse",
"David",
""
],
[
"Yates",
"Roy",
""
]
] |
new_dataset
| 0.992663 |
0804.4896
|
Sidney Rosario
|
Anne Bouillard (IRISA), Sidney Rosario (IRISA), Albert Benveniste
(IRISA), Stefan Haar (IRISA)
|
Monotony in Service Orchestrations
| null | null | null |
RR-6528
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web Service orchestrations are compositions of different Web Services to form
a new service. The services called during the orchestration guarantee a given
performance to the orchestrater, usually in the form of contracts. These
contracts can be used by the orchestrater to deduce the contract it can offer
to its own clients, by performing contract composition. An implicit assumption
in contract based QoS management is: "the better the component services
perform, the better the orchestration's performance will be". Thus, contract
based QoS management for Web services orchestrations implicitly assumes
monotony. In some orchestrations, however, monotony can be violated, i.e., the
performance of the orchestration improves when the performance of a component
service degrades. This is highly undesirable since it can render the process of
contract composition inconsistent. In this paper we define monotony for
orchestrations modelled by Colored Occurrence Nets (CO-nets) and we
characterize the classes of monotonic orchestrations. We show that few
orchestrations are indeed monotonic, mostly since latency can be traded for
quality of data. We also propose a sound refinement of monotony, called
conditional monotony, which forbids this kind of cheating and show that
conditional monotony is widely satisfied by orchestrations. This finding leads
to reconsidering the way SLAs should be formulated.
|
[
{
"version": "v1",
"created": "Wed, 30 Apr 2008 19:59:01 GMT"
},
{
"version": "v2",
"created": "Tue, 13 May 2008 08:22:29 GMT"
}
] | 2009-04-20T00:00:00 |
[
[
"Bouillard",
"Anne",
"",
"IRISA"
],
[
"Rosario",
"Sidney",
"",
"IRISA"
],
[
"Benveniste",
"Albert",
"",
"IRISA"
],
[
"Haar",
"Stefan",
"",
"IRISA"
]
] |
new_dataset
| 0.992558 |
0805.0087
|
Sebastien Tixeuil
|
Adnan Vora, Mikhail Nesterenko, S\'ebastien Tixeuil (LIP6), Sylvie
Dela\"et (LRI)
|
Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks
| null | null | null |
RR-6529
|
cs.DC cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Sybil attack in unknown port networks such as wireless is not considered
tractable. A wireless node is not capable of independently differentiating the
universe of real nodes from the universe of arbitrary non-existent fictitious
nodes created by the attacker. Similar to failure detectors, we propose to use
universe detectors to help nodes determine which universe is real. In this
paper, we (i) define several variants of the neighborhood discovery problem
under Sybil attack (ii) propose a set of matching universe detectors (iii)
demonstrate the necessity of additional topological constraints for the
problems to be solvable: node density and communication range; (iv) present
SAND -- an algorithm that solves these problems with the help of appropriate
universe detectors, this solution demonstrates that the proposed universe
detectors are the weakest detectors possible for each problem.
|
[
{
"version": "v1",
"created": "Thu, 1 May 2008 11:45:54 GMT"
},
{
"version": "v2",
"created": "Tue, 13 May 2008 08:34:03 GMT"
}
] | 2009-04-20T00:00:00 |
[
[
"Vora",
"Adnan",
"",
"LIP6"
],
[
"Nesterenko",
"Mikhail",
"",
"LIP6"
],
[
"Tixeuil",
"Sébastien",
"",
"LIP6"
],
[
"Delaët",
"Sylvie",
"",
"LRI"
]
] |
new_dataset
| 0.99694 |
0807.0425
|
Cedric Adjih
|
Song Yean Cho (INRIA Rocquencourt, LIX), C\'edric Adjih (INRIA
Rocquencourt)
|
Wireless Broadcast with Network Coding in Mobile Ad-Hoc Networks:
DRAGONCAST
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Network coding is a recently proposed method for transmitting data, which has
been shown to have potential to improve wireless network performance. We study
network coding for one specific case of multicast, broadcasting, from one
source to all nodes of the network. We use network coding as a loss tolerant,
energy-efficient, method for broadcast. Our emphasis is on mobile networks. Our
contribution is the proposal of DRAGONCAST, a protocol to perform network
coding in such a dynamically evolving environment. It is based on three
building blocks: a method to permit real-time decoding of network coding, a
method to adjust the network coding transmission rates, and a method for
ensuring the termination of the broadcast. The performance and behavior of the
method are explored experimentally by simulations; they illustrate the
excellent performance of the protocol.
|
[
{
"version": "v1",
"created": "Wed, 2 Jul 2008 19:23:50 GMT"
}
] | 2009-04-20T00:00:00 |
[
[
"Cho",
"Song Yean",
"",
"INRIA Rocquencourt, LIX"
],
[
"Adjih",
"Cédric",
"",
"INRIA\n Rocquencourt"
]
] |
new_dataset
| 0.996413 |
0812.2971
|
Ning Chen
|
Meghanad D. Wagh, Ning Chen, and Zhiyuan Yan
|
Cyclotomic FFT of Length 2047 Based on a Novel 11-point Cyclic
Convolution
|
11 pages, 1 figure
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this manuscript, we propose a novel 11-point cyclic convolution algorithm
based on alternate Fourier transform. With the proposed bilinear form, we
construct a length-2047 cyclotomic FFT.
|
[
{
"version": "v1",
"created": "Tue, 16 Dec 2008 05:04:31 GMT"
},
{
"version": "v2",
"created": "Tue, 10 Mar 2009 00:49:02 GMT"
},
{
"version": "v3",
"created": "Mon, 20 Apr 2009 15:44:27 GMT"
}
] | 2009-04-20T00:00:00 |
[
[
"Wagh",
"Meghanad D.",
""
],
[
"Chen",
"Ning",
""
],
[
"Yan",
"Zhiyuan",
""
]
] |
new_dataset
| 0.998257 |
0904.2584
|
Jose Avelino Manzano Lizcano
|
J. A. Manzano Lizcano, S. A. Jaramillo Florez
|
New technologies for high speed computer networks: a wavelet approach
|
in spanish, 13 pages, associated research in
http://www.airenatural.com; Published in Revista AIELEC de la Universidad
Pontificia Bolivariana. 2001
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Indoor multpropagation channel is modeled by the Kaiser electromagnetic
wavelet. A method for channel characterization is proposed by modeling all the
reflections of indoor propagation in a kernel function instead of its impulse
response. This lead us to consider a fractal modulation scheme in which Kaiser
wavelets substitute the traditional sinusoidal carrier.
|
[
{
"version": "v1",
"created": "Thu, 16 Apr 2009 20:48:43 GMT"
}
] | 2009-04-20T00:00:00 |
[
[
"Lizcano",
"J. A. Manzano",
""
],
[
"Florez",
"S. A. Jaramillo",
""
]
] |
new_dataset
| 0.973489 |
cs/0505088
|
Valmir Barbosa
|
Rodrigo S. C. Leao, Valmir C. Barbosa
|
6-cycle double covers of cubic graphs
|
This version fixes typos and minor technical problems, and updates
references
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A cycle double cover (CDC) of an undirected graph is a collection of the
graph's cycles such that every edge of the graph belongs to exactly two cycles.
We describe a constructive method for generating all the cubic graphs that have
a 6-CDC (a CDC in which every cycle has length 6). As an application of the
method, we prove that all such graphs have a Hamiltonian cycle. A sense of
direction is an edge labeling on graphs that follows a globally consistent
scheme and is known to considerably reduce the complexity of several
distributed problems. In [9], a particular instance of sense of direction,
called a chordal sense of direction (CSD), is studied and the class of
k-regular graphs that admit a CSD with exactly k labels (a minimal CSD) is
analyzed. We now show that nearly all the cubic graphs in this class have a
6-CDC, the only exception being K4.
|
[
{
"version": "v1",
"created": "Tue, 31 May 2005 15:52:37 GMT"
},
{
"version": "v2",
"created": "Wed, 1 Jun 2005 11:58:31 GMT"
},
{
"version": "v3",
"created": "Fri, 3 Jun 2005 12:42:40 GMT"
},
{
"version": "v4",
"created": "Fri, 17 Apr 2009 12:35:28 GMT"
}
] | 2009-04-17T00:00:00 |
[
[
"Leao",
"Rodrigo S. C.",
""
],
[
"Barbosa",
"Valmir C.",
""
]
] |
new_dataset
| 0.993231 |
0705.3015
|
Erik Schnetter
|
Dylan Stark, Gabrielle Allen, Tom Goodale, Thomas Radke, Erik
Schnetter
|
An Extensible Timing Infrastructure for Adaptive Large-scale
Applications
| null |
In Roman Wyrzykowski et al., editors, Parallel Processing and
Applied Mathematics (PPAM), 2007, Gdansk, Poland, volume 4967 of Lecture
Notes in Computer Science (LNCS), pages 1170-1179. Springer, 2007.
| null | null |
cs.PF cs.DC
| null |
Real-time access to accurate and reliable timing information is necessary to
profile scientific applications, and crucial as simulations become increasingly
complex, adaptive, and large-scale. The Cactus Framework provides flexible and
extensible capabilities for timing information through a well designed
infrastructure and timing API. Applications built with Cactus automatically
gain access to built-in timers, such as gettimeofday and getrusage,
system-specific hardware clocks, and high-level interfaces such as PAPI. We
describe the Cactus timer interface, its motivation, and its implementation. We
then demonstrate how this timing information can be used by an example
scientific application to profile itself, and to dynamically adapt itself to a
changing environment at run time.
|
[
{
"version": "v1",
"created": "Mon, 21 May 2007 19:00:25 GMT"
}
] | 2009-04-16T00:00:00 |
[
[
"Stark",
"Dylan",
""
],
[
"Allen",
"Gabrielle",
""
],
[
"Goodale",
"Tom",
""
],
[
"Radke",
"Thomas",
""
],
[
"Schnetter",
"Erik",
""
]
] |
new_dataset
| 0.956605 |
0806.3542
|
Jiwoong Lee
|
Jiwoong Lee, Jean C. Walrand
|
Design and Analysis of an Asynchronous Zero Collision MAC Protocol
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes and analyzes a distributed MAC protocol that achieves
zero collision with no control message exchange nor synchronization. ZC
(ZeroCollision) is neither reservation-based nor dynamic TDMA; the protocol
supports variable-length packets and does not lose efficiency when some of the
stations do not transmit. At the same time, ZC is not a CSMA; in its steady
state, it is completely collision-free. The stations transmit repeatedly in a
round-robin order once the convergence state is reached. If some stations skip
their turn, their transmissions are replaced by idle $20 \mu$-second mini-slots
that enable the other stations to keep track of their order. Because of its
short medium access delay and its efficiency, the protocol supports both
real-time and elastic applications. The protocol allows for nodes leaving and
joining the network; it can allocate more throughput to specific nodes (such as
an access point). The protocol is robust against carrier sensing errors or
clock drift. While collision avoidance is guaranteed in a single collision
domain, it is not the case in a multiple collision one. However, experiments
show ZC supports a comparable amount of goodput to CSMA in a multiple collision
domain environment. The paper presents an analysis and extensive simulations of
the protocol, confirming that ZC outperforms both CSMA and TDMA at high and low
load.
|
[
{
"version": "v1",
"created": "Sun, 22 Jun 2008 03:11:28 GMT"
}
] | 2009-04-16T00:00:00 |
[
[
"Lee",
"Jiwoong",
""
],
[
"Walrand",
"Jean C.",
""
]
] |
new_dataset
| 0.988082 |
0904.2375
|
Navin Kashyap
|
Akiko Manada and Navin Kashyap
|
The Zeta Function of a Periodic-Finite-Type Shift
|
To appear in Proceedings of the 2009 IEEE International Symposium on
Information Theory (ISIT'09); 5 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The class of periodic-finite-type shifts (PFT's) is a class of sofic shifts
that strictly includes the class of shifts of finite type (SFT's), and the zeta
function of a PFT is a generating function for the number of periodic sequences
in the shift. In this paper, we derive a useful formula for the zeta function
of a PFT. This formula allows the zeta function of a PFT to be computed more
efficiently than the specialization of a formula known for a generic sofic
shift
|
[
{
"version": "v1",
"created": "Wed, 15 Apr 2009 18:56:15 GMT"
}
] | 2009-04-16T00:00:00 |
[
[
"Manada",
"Akiko",
""
],
[
"Kashyap",
"Navin",
""
]
] |
new_dataset
| 0.98044 |
0901.3761
|
Jeffrey Shallit
|
J. Brzozowski, E. Grant, J. Shallit
|
Closures in Formal Languages and Kuratowski's Theorem
|
submitted to DLT 2009
| null | null | null |
cs.CC cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A famous theorem of Kuratowski states that in a topological space, at most 14
distinct sets can be produced by repeatedly applying the operations of closure
and complement to a given set. We re-examine this theorem in the setting of
formal languages, where closure is either Kleene closure or positive closure.
We classify languages according to the structure of the algebra they generate
under iterations of complement and closure. We show that there are precisely 9
such algebras in the case of positive closure, and 12 in the case of Kleene
closure.
|
[
{
"version": "v1",
"created": "Fri, 23 Jan 2009 19:45:01 GMT"
}
] | 2009-04-15T00:00:00 |
[
[
"Brzozowski",
"J.",
""
],
[
"Grant",
"E.",
""
],
[
"Shallit",
"J.",
""
]
] |
new_dataset
| 0.99898 |
0904.2012
|
David Spivak
|
David I. Spivak
|
Simplicial Databases
| null | null | null | null |
cs.DB cs.IR
|
http://creativecommons.org/licenses/by/3.0/
|
In this paper, we define a category DB, called the category of simplicial
databases, whose objects are databases and whose morphisms are data-preserving
maps. Along the way we give a precise formulation of the category of relational
databases, and prove that it is a full subcategory of DB. We also prove that
limits and colimits always exist in DB and that they correspond to queries such
as select, join, union, etc.
One feature of our construction is that the schema of a simplicial database
has a natural geometric structure: an underlying simplicial set. The geometry
of a schema is a way of keeping track of relationships between distinct tables,
and can be thought of as a system of foreign keys. The shape of a schema is
generally intuitive (e.g. the schema for round-trip flights is a circle
consisting of an edge from $A$ to $B$ and an edge from $B$ to $A$), and as
such, may be useful for analyzing data.
We give several applications of our approach, as well as possible advantages
it has over the relational model. We also indicate some directions for further
research.
|
[
{
"version": "v1",
"created": "Mon, 13 Apr 2009 21:20:57 GMT"
}
] | 2009-04-15T00:00:00 |
[
[
"Spivak",
"David I.",
""
]
] |
new_dataset
| 0.987731 |
0904.2136
|
Fernando S\'aenz-P\'erez
|
S. Est\'evez-Mart\'in, T. Hortal\'a-Gonz\'alez, Rodr\'iguez-Artalejo,
R. del Vado-V\'irseda, F. S\'aenz-P\'erez, and A. J. Fern\'andez
|
On the Cooperation of the Constraint Domains H, R and FD in CFLP
|
113 pages, 5 figures, 18 tables
| null | null | null |
cs.PL cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a computational model for the cooperation of constraint
domains and an implementation for a particular case of practical importance.
The computational model supports declarative programming with lazy and possibly
higher-order functions, predicates, and the cooperation of different constraint
domains equipped with their respective solvers, relying on a so-called
Constraint Functional Logic Programming (CFLP) scheme. The implementation has
been developed on top of the CFLP system TOY, supporting the cooperation of the
three domains H, R and FD, which supply equality and disequality constraints
over symbolic terms, arithmetic constraints over the real numbers, and finite
domain constraints over the integers, respectively. The computational model has
been proved sound and complete w.r.t. the declarative semantics provided by the
$CFLP$ scheme, while the implemented system has been tested with a set of
benchmarks and shown to behave quite efficiently in comparison to the closest
related approach we are aware of.
To appear in Theory and Practice of Logic Programming (TPLP)
|
[
{
"version": "v1",
"created": "Tue, 14 Apr 2009 14:58:46 GMT"
}
] | 2009-04-15T00:00:00 |
[
[
"Estévez-Martín",
"S.",
""
],
[
"Hortalá-González",
"T.",
""
],
[
"Rodríguez-Artalejo",
"",
""
],
[
"del Vado-Vírseda",
"R.",
""
],
[
"Sáenz-Pérez",
"F.",
""
],
[
"Fernández",
"A. J.",
""
]
] |
new_dataset
| 0.987268 |
0904.1915
|
Zhilin Wu
|
Stephane Grumbach (INRIA Liama), Zhilin Wu (CASIA Liama)
|
Logical locality entails frugal distributed computation over graphs
|
31 pages, 0 figures
| null | null | null |
cs.LO cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
First-order logic is known to have limited expressive power over finite
structures. It enjoys in particular the locality property, which states that
first-order formulae cannot have a global view of a structure. This limitation
ensures on their low sequential computational complexity. We show that the
locality impacts as well on their distributed computational complexity. We use
first-order formulae to describe the properties of finite connected graphs,
which are the topology of communication networks, on which the first-order
formulae are also evaluated. We show that over bounded degree networks and
planar networks, first-order properties can be frugally evaluated, that is,
with only a bounded number of messages, of size logarithmic in the number of
nodes, sent over each link. Moreover, we show that the result carries over for
the extension of first-order logic with unary counting.
|
[
{
"version": "v1",
"created": "Mon, 13 Apr 2009 06:16:39 GMT"
}
] | 2009-04-14T00:00:00 |
[
[
"Grumbach",
"Stephane",
"",
"INRIA Liama"
],
[
"Wu",
"Zhilin",
"",
"CASIA Liama"
]
] |
new_dataset
| 0.999734 |
0904.1931
|
Byron Gao
|
Obi L. Griffith, Byron J. Gao, Mikhail Bilenky, Yuliya Prichyna,
Martin Ester, Steven J.M. Jones
|
KiWi: A Scalable Subspace Clustering Algorithm for Gene Expression
Analysis
|
International Conference on Bioinformatics and Biomedical Engineering
(iCBBE), 2009
| null | null | null |
cs.DB cs.AI q-bio.GN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Subspace clustering has gained increasing popularity in the analysis of gene
expression data. Among subspace cluster models, the recently introduced
order-preserving sub-matrix (OPSM) has demonstrated high promise. An OPSM,
essentially a pattern-based subspace cluster, is a subset of rows and columns
in a data matrix for which all the rows induce the same linear ordering of
columns. Existing OPSM discovery methods do not scale well to increasingly
large expression datasets. In particular, twig clusters having few genes and
many experiments incur explosive computational costs and are completely pruned
off by existing methods. However, it is of particular interest to determine
small groups of genes that are tightly coregulated across many conditions. In
this paper, we present KiWi, an OPSM subspace clustering algorithm that is
scalable to massive datasets, capable of discovering twig clusters and
identifying negative as well as positive correlations. We extensively validate
KiWi using relevant biological datasets and show that KiWi correctly assigns
redundant probes to the same cluster, groups experiments with common clinical
annotations, differentiates real promoter sequences from negative control
sequences, and shows good association with cis-regulatory motif predictions.
|
[
{
"version": "v1",
"created": "Mon, 13 Apr 2009 08:16:53 GMT"
}
] | 2009-04-14T00:00:00 |
[
[
"Griffith",
"Obi L.",
""
],
[
"Gao",
"Byron J.",
""
],
[
"Bilenky",
"Mikhail",
""
],
[
"Prichyna",
"Yuliya",
""
],
[
"Ester",
"Martin",
""
],
[
"Jones",
"Steven J. M.",
""
]
] |
new_dataset
| 0.997526 |
cs/0610159
|
Vaneet Aggarwal
|
Vaneet Aggarwal, A. Robert Calderbank
|
Boolean Functions, Projection Operators and Quantum Error Correcting
Codes
|
Submitted to IEEE Transactions on Information Theory, October 2006,
to appear in IEEE Transactions on Information Theory, 2008
|
IEEE Trans. Inf. Theory, vol. 54, no. 4, pp.1700-1707, Apr. 2008.
|
10.1109/TIT.2008.917720
| null |
cs.IT math.IT quant-ph
| null |
This paper describes a fundamental correspondence between Boolean functions
and projection operators in Hilbert space. The correspondence is widely
applicable, and it is used in this paper to provide a common mathematical
framework for the design of both additive and non-additive quantum error
correcting codes. The new framework leads to the construction of a variety of
codes including an infinite class of codes that extend the original ((5,6,2))
code found by Rains [21]. It also extends to operator quantum error correcting
codes.
|
[
{
"version": "v1",
"created": "Fri, 27 Oct 2006 16:50:41 GMT"
},
{
"version": "v2",
"created": "Thu, 1 Mar 2007 20:58:22 GMT"
},
{
"version": "v3",
"created": "Mon, 24 Sep 2007 13:20:15 GMT"
}
] | 2009-04-14T00:00:00 |
[
[
"Aggarwal",
"Vaneet",
""
],
[
"Calderbank",
"A. Robert",
""
]
] |
new_dataset
| 0.9969 |
0904.1672
|
Joost Vennekens
|
Joost Vennekens, Marc Denecker, Maurice Bruynooghe
|
CP-logic: A Language of Causal Probabilistic Events and Its Relation to
Logic Programming
|
To be published in Theory and Practice of Logic Programming (TPLP)
| null | null | null |
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This papers develops a logical language for representing probabilistic causal
laws. Our interest in such a language is twofold. First, it can be motivated as
a fundamental study of the representation of causal knowledge. Causality has an
inherent dynamic aspect, which has been studied at the semantical level by
Shafer in his framework of probability trees. In such a dynamic context, where
the evolution of a domain over time is considered, the idea of a causal law as
something which guides this evolution is quite natural. In our formalization, a
set of probabilistic causal laws can be used to represent a class of
probability trees in a concise, flexible and modular way. In this way, our work
extends Shafer's by offering a convenient logical representation for his
semantical objects.
Second, this language also has relevance for the area of probabilistic logic
programming. In particular, we prove that the formal semantics of a theory in
our language can be equivalently defined as a probability distribution over the
well-founded models of certain logic programs, rendering it formally quite
similar to existing languages such as ICL or PRISM. Because we can motivate and
explain our language in a completely self-contained way as a representation of
probabilistic causal laws, this provides a new way of explaining the intuitions
behind such probabilistic logic programs: we can say precisely which knowledge
such a program expresses, in terms that are equally understandable by a
non-logician. Moreover, we also obtain an additional piece of knowledge
representation methodology for probabilistic logic programs, by showing how
they can express probabilistic causal laws.
|
[
{
"version": "v1",
"created": "Fri, 10 Apr 2009 10:00:55 GMT"
}
] | 2009-04-13T00:00:00 |
[
[
"Vennekens",
"Joost",
""
],
[
"Denecker",
"Marc",
""
],
[
"Bruynooghe",
"Maurice",
""
]
] |
new_dataset
| 0.981594 |
0904.1703
|
Walid Belkhir
|
Walid Belkhir
|
Closure Under Minors of Undirected Entanglement
| null | null | null | null |
cs.DM cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Entanglement is a digraph complexity measure that origins in fixed-point
theory. Its purpose is to count the nested depth of cycles in digraphs.
In this paper we prove that the class of undirected graphs of entanglement at
most $k$, for arbitrary fixed $k \in \mathbb{N}$, is closed under taking
minors. Our proof relies on the game theoretic characterization of entanglement
in terms of Robber and Cops games.
|
[
{
"version": "v1",
"created": "Fri, 10 Apr 2009 15:32:19 GMT"
}
] | 2009-04-13T00:00:00 |
[
[
"Belkhir",
"Walid",
""
]
] |
new_dataset
| 0.969383 |
0904.1729
|
Sugumar Murugesan
|
Sugumar Murugesan, Philip Schniter
|
Joint Opportunistic Scheduling in Multi-Cellular Systems
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We address the problem of multiuser scheduling with partial channel
information in a multi-cell environment. The scheduling problem is formulated
jointly with the ARQ based channel learning process and the intercell
interference mitigating cell breathing protocol. The optimal joint scheduling
policy under various system constraints is established. The general problem is
posed as a generalized Restless Multiarmed Bandit process and the notion of
indexability is studied. We conjecture, with numerical support, that the
multicell multiuser scheduling problem is indexable and obtain a partial
structure of the index policy.
|
[
{
"version": "v1",
"created": "Fri, 10 Apr 2009 18:55:12 GMT"
}
] | 2009-04-13T00:00:00 |
[
[
"Murugesan",
"Sugumar",
""
],
[
"Schniter",
"Philip",
""
]
] |
new_dataset
| 0.958056 |
0705.0419
|
Luigi Santocanale
|
Walid Belkhir (LIF), Luigi Santocanale (LIF)
|
Undirected Graphs of Entanglement Two
| null |
FSTTCS 2007: Foundations of Software Technology and Theoretical
Computer Science, Inde (2007)
|
10.1007/978-3-540-77050-3_42
| null |
cs.LO cs.GT
| null |
Entanglement is a complexity measure of directed graphs that origins in fixed
point theory. This measure has shown its use in designing efficient algorithms
to verify logical properties of transition systems. We are interested in the
problem of deciding whether a graph has entanglement at most k. As this measure
is defined by means of games, game theoretic ideas naturally lead to design
polynomial algorithms that, for fixed k, decide the problem. Known
characterizations of directed graphs of entanglement at most 1 lead, for k = 1,
to design even faster algorithms. In this paper we present an explicit
characterization of undirected graphs of entanglement at most 2. With such a
characterization at hand, we devise a linear time algorithm to decide whether
an undirected graph has this property.
|
[
{
"version": "v1",
"created": "Thu, 3 May 2007 08:07:11 GMT"
},
{
"version": "v2",
"created": "Thu, 30 Aug 2007 09:04:14 GMT"
}
] | 2009-04-09T00:00:00 |
[
[
"Belkhir",
"Walid",
"",
"LIF"
],
[
"Santocanale",
"Luigi",
"",
"LIF"
]
] |
new_dataset
| 0.990422 |
0904.0813
|
Azadeh Khaleghi
|
Azadeh Khaleghi, Frank R. Kschischang
|
Projective Space Codes for the Injection Metric
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the context of error control in random linear network coding, it is useful
to construct codes that comprise well-separated collections of subspaces of a
vector space over a finite field. In this paper, the metric used is the
so-called "injection distance", introduced by Silva and Kschischang. A
Gilbert-Varshamov bound for such codes is derived. Using the code-construction
framework of Etzion and Silberstein, new non-constant-dimension codes are
constructed; these codes contain more codewords than comparable codes designed
for the subspace metric.
|
[
{
"version": "v1",
"created": "Sun, 5 Apr 2009 20:06:33 GMT"
},
{
"version": "v2",
"created": "Wed, 8 Apr 2009 14:24:02 GMT"
}
] | 2009-04-08T00:00:00 |
[
[
"Khaleghi",
"Azadeh",
""
],
[
"Kschischang",
"Frank R.",
""
]
] |
new_dataset
| 0.999393 |
0904.1084
|
Sylvain Lavernhe
|
Kwamiwi Mawussi (LURPA), Sylvain Lavernhe (LURPA), Claire Lartigue
(LURPA)
|
Usinage de poches en UGV - Aide au choix de strat\'egies
| null |
Revue Internationale de CFAO et d'informatique graphique 18, 3
(2003) 337-349
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper deals with associating the optimal machining strategy to a given
pocket geometry, within the context of High-Speed Machining (HSM) of
aeronautical pockets. First we define different classes of pocket features
according to geometrical criteria. Following, we propose a method allowing to
associate a set of capable tools to the features. Each capable tool defines a
machined zone with a specific geometry. The last part of the paper is thus
dedicated to associate the optimal machining strategy to a given geometry
within the context of HSM. Results highlight that analyses must be conducted in
a dynamical as well as a geometrical viewpoint. In particular, it becomes
necessary to integrate dynamical specifities associated to the behavior of the
couple machine/NC unit in the tool path calculation.
|
[
{
"version": "v1",
"created": "Tue, 7 Apr 2009 09:06:39 GMT"
}
] | 2009-04-08T00:00:00 |
[
[
"Mawussi",
"Kwamiwi",
"",
"LURPA"
],
[
"Lavernhe",
"Sylvain",
"",
"LURPA"
],
[
"Lartigue",
"Claire",
"",
"LURPA"
]
] |
new_dataset
| 0.982694 |
0904.1186
|
Bjoern Grohmann
|
Bjoern Grohmann
|
A New Key-Agreement-Protocol
|
4 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new 4-pass Key-Agreement Protocol is presented. The security of the
protocol mainly relies on the existence of a (polynomial-computable)
One-Way-Function and the supposed computational hardness of solving a specific
system of equations.
|
[
{
"version": "v1",
"created": "Tue, 7 Apr 2009 17:45:52 GMT"
}
] | 2009-04-08T00:00:00 |
[
[
"Grohmann",
"Bjoern",
""
]
] |
new_dataset
| 0.959943 |
0903.4046
|
Baris Baykant Alagoz
|
B. Baykant Alagoz
|
Boolean Logic with Fault Tolerant Coding
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Error detectable and error correctable coding in Hamming space was researched
to discover possible fault tolerant coding constellations, which can implement
Boolean logic with fault tolerant property. Basic logic operators of the
Boolean algebra were developed to apply fault tolerant coding in the logic
circuits. It was shown that application of three-bit fault tolerant codes have
provided the digital system skill of auto-recovery without need for designing
additional-fault tolerance mechanisms.
|
[
{
"version": "v1",
"created": "Tue, 24 Mar 2009 09:33:40 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Apr 2009 08:53:28 GMT"
}
] | 2009-04-07T00:00:00 |
[
[
"Alagoz",
"B. Baykant",
""
]
] |
new_dataset
| 0.996257 |
0904.0962
|
Amelia Sparavigna
|
Amelia Sparavigna
|
Color Dipole Moments for Edge Detection
|
8 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dipole and higher moments are physical quantities used to describe a charge
distribution. In analogy with electromagnetism, it is possible to define the
dipole moments for a gray-scale image, according to the single aspect of a
gray-tone map. In this paper we define the color dipole moments for color
images. For color maps in fact, we have three aspects, the three primary
colors, to consider. Associating three color charges to each pixel, color
dipole moments can be easily defined and used for edge detection.
|
[
{
"version": "v1",
"created": "Mon, 6 Apr 2009 16:25:08 GMT"
}
] | 2009-04-07T00:00:00 |
[
[
"Sparavigna",
"Amelia",
""
]
] |
new_dataset
| 0.982915 |
0904.0589
|
Van Hung Le
|
Van Hung Le (1), Fei Liu (1), and Dinh Khang Tran (2) ((1)La Trobe
University, Australia (2)Hanoi University of Technology, Vietnam)
|
Fuzzy Linguistic Logic Programming and its Applications
|
33 pages, to appear in Theory and Practice of Logic Programming
(TPLP)
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper introduces fuzzy linguistic logic programming, which is a
combination of fuzzy logic programming, introduced by P. Vojtas, and hedge
algebras in order to facilitate the representation and reasoning on human
knowledge expressed in natural languages. In fuzzy linguistic logic
programming, truth values are linguistic ones, e.g., VeryTrue,
VeryProbablyTrue, and LittleFalse, taken from a hedge algebra of a linguistic
truth variable, and linguistic hedges (modifiers) can be used as unary
connectives in formulae. This is motivated by the fact that humans reason
mostly in terms of linguistic terms rather than in terms of numbers, and
linguistic hedges are often used in natural languages to express different
levels of emphasis. The paper presents: (i) the language of fuzzy linguistic
logic programming; (ii) a declarative semantics in terms of Herbrand
interpretations and models; (iii) a procedural semantics which directly
manipulates linguistic terms to compute a lower bound to the truth value of a
query, and proves its soundness; (iv) a fixpoint semantics of logic programs,
and based on it, proves the completeness of the procedural semantics; (v)
several applications of fuzzy linguistic logic programming; and (vi) an idea of
implementing a system to execute fuzzy linguistic logic programs.
|
[
{
"version": "v1",
"created": "Fri, 3 Apr 2009 14:45:20 GMT"
}
] | 2009-04-06T00:00:00 |
[
[
"Le",
"Van Hung",
""
],
[
"Liu",
"Fei",
""
],
[
"Tran",
"Dinh Khang",
""
]
] |
new_dataset
| 0.990842 |
0903.4959
|
Ioannis Koukoutsidis
|
Ioannis Koukoutsidis
|
TCP over 3G links: Problems and Solutions
|
A review paper prepared unofficially for the Institute of Informatics
and Telecommunications of NCSR Demokritos, in November 2005 (13 pages, 3
figures)
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This review paper presents analytical information regarding the transfer of
TCP data flows on paths towards interconnected wireless systems, with emphasis
on 3G cellular networks. The focus is on protocol modifications in face of
problems arising from terminal mobility and wireless transmission. The
objective of this paper is not to present an exhaustive review of the
literature, but to filter out the causes of poor TCP performance in such
systems and give a rationalized view of measures that can be taken against
them.
|
[
{
"version": "v1",
"created": "Sat, 28 Mar 2009 09:23:17 GMT"
},
{
"version": "v2",
"created": "Sun, 5 Apr 2009 12:52:36 GMT"
}
] | 2009-04-05T00:00:00 |
[
[
"Koukoutsidis",
"Ioannis",
""
]
] |
new_dataset
| 0.985455 |
0904.0437
|
Vincent Rialle
|
Vincent Rialle (TIMC, DMIS), Catherine Ollivet (FA 93), Carole Guigui
(TIMC), Christian Herv\'e (LEM)
|
What Do Family Caregivers of Alzheimer's Disease Patients Desire in
Smart Home Technologies?
| null |
Methods of information in medicine 47, 1 (2008) 63-69
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Objectives - The authors' aim was to investigate the representations, wishes,
and fears of family caregivers (FCs) regarding 14 innovative technologies (IT)
for care aiding and burden alleviation, given the severe physical and
psychological stress induced by dementia care, and the very slow uptake of
these technologies in our society. Methods - A cluster sample survey based on a
self-administered questionnaire was carried out on data collected from 270
families of patients with Alzheimer's disease or related disorders, located in
the greater Paris area. Multiple Correspondence Analysis was used in addition
to usual statistical tests to identify homogenous FCs clusters concerning the
appreciation or rejection of the considered technologies. Results - Two
opposite clusters were clearly defined: FCs in favor of a substantial use of
technology, and those rather or totally hostile. Furthermore the distributions
of almost all the answers of appreciations were U shaped. Significant relations
were demonstrated between IT appreciation and FC's family or gender statuses
(e.g., female FCs appreciated more than male FCs a tracking device for quick
recovering of wandering patients: p=0.0025, N=195). Conclusions - The study
provides further evidence of the contrasted perception of technology in
dementia care at home, and suggests the development of public debates based on
rigorous assessment of practices and a strict ethical aim to protect against
misuse.
|
[
{
"version": "v1",
"created": "Thu, 2 Apr 2009 18:16:47 GMT"
}
] | 2009-04-03T00:00:00 |
[
[
"Rialle",
"Vincent",
"",
"TIMC, DMIS"
],
[
"Ollivet",
"Catherine",
"",
"FA 93"
],
[
"Guigui",
"Carole",
"",
"TIMC"
],
[
"Hervé",
"Christian",
"",
"LEM"
]
] |
new_dataset
| 0.988103 |
0904.0034
|
Luis Menasch\'e Schechter
|
Mario R. F. Benevides and L. Menasch\'e Schechter
|
CCS-Based Dynamic Logics for Communicating Concurrent Programs
|
28 pages
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work presents three increasingly expressive Dynamic Logics in which the
programs are CCS processes (sCCS-PDL, CCS-PDL and XCCS-PDL). Their goal is to
reason about properties of concurrent programs and systems described using CCS.
In order to accomplish that, CCS's operators and constructions are added to a
basic modal logic in order to create dynamic logics that are suitable for the
description and verification of properties of communicating, concurrent and
non-deterministic programs and systems, in a similar way as PDL is used for the
sequential case. We provide complete axiomatizations for the three logics.
Unlike Peleg's Concurrent PDL with Channels, our logics have a simple Kripke
semantics, complete axiomatizations and the finite model property.
|
[
{
"version": "v1",
"created": "Wed, 1 Apr 2009 02:07:44 GMT"
}
] | 2009-04-02T00:00:00 |
[
[
"Benevides",
"Mario R. F.",
""
],
[
"Schechter",
"L. Menasché",
""
]
] |
new_dataset
| 0.992145 |
0904.0058
|
Damien Chablat
|
Damien Chablat (IRCCyN), Stefan Staicu
|
Kinematics of A 3-PRP planar parallel robot
| null |
UPB Scientific Bulletin, Series D: Mechanical Engineering 71, 1
(2009) 3-16
| null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recursive modelling for the kinematics of a 3-PRP planar parallel robot is
presented in this paper. Three planar chains connecting to the moving platform
of the manipulator are located in a vertical plane. Knowing the motion of the
platform, we develop the inverse kinematics and determine the positions,
velocities and accelerations of the robot. Several matrix equations offer
iterative expressions and graphs for the displacements, velocities and
accelerations of three prismatic actuators.
|
[
{
"version": "v1",
"created": "Wed, 1 Apr 2009 19:31:33 GMT"
}
] | 2009-04-02T00:00:00 |
[
[
"Chablat",
"Damien",
"",
"IRCCyN"
],
[
"Staicu",
"Stefan",
""
]
] |
new_dataset
| 0.991743 |
0904.0145
|
Damien Chablat
|
Raza Ur-Rehman (IRCCyN), St\'ephane Caro (IRCCyN), Damien Chablat
(IRCCyN), Philippe Wenger (IRCCyN)
|
Kinematic and Dynamic Analysis of the 2-DOF Spherical Wrist of
Orthoglide 5-axis
| null |
Troisi\`eme Congr\`es International. Conception et Mod\'elisation
des Syst\`emes M\'ecaniques, Hammamet : Tunisie (2009)
| null | null |
cs.RO physics.class-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper deals with the kinematics and dynamics of a two degree of freedom
spherical manipulator, the wrist of Orthoglide 5-axis. The latter is a parallel
kinematics machine composed of two manipulators: i) the Orthoglide 3-axis; a
three-dof translational parallel manipulator that belongs to the family of
Delta robots, and ii) the Agile eye; a two-dof parallel spherical wrist. The
geometric and inertial parameters used in the model are determined by means of
a CAD software. The performance of the spherical wrist is emphasized by means
of several test trajectories. The effects of machining and/or cutting forces
and the length of the cutting tool on the dynamic performance of the wrist are
also analyzed. Finally, a preliminary selection of the motors is proposed from
the velocities and torques required by the actuators to carry out the test
trajectories.
|
[
{
"version": "v1",
"created": "Wed, 1 Apr 2009 19:33:59 GMT"
}
] | 2009-04-02T00:00:00 |
[
[
"Ur-Rehman",
"Raza",
"",
"IRCCyN"
],
[
"Caro",
"Stéphane",
"",
"IRCCyN"
],
[
"Chablat",
"Damien",
"",
"IRCCyN"
],
[
"Wenger",
"Philippe",
"",
"IRCCyN"
]
] |
new_dataset
| 0.997137 |
0903.4898
|
Predrag Jelenkovic
|
Predrag R. Jelenkovic and Ana Radovanovic
|
Asymptotic Optimality of the Static Frequency Caching in the Presence of
Correlated Requests
| null | null | null | null |
cs.PF cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is well known that the static caching algorithm that keeps the most
frequently requested documents in the cache is optimal in case when documents
are of the same size and requests are independent and equally distributed.
However, it is hard to develop explicit and provably optimal caching algorithms
when requests are statistically correlated. In this paper, we show that keeping
the most frequently requested documents in the cache is still optimal for large
cache sizes even if the requests are strongly correlated.
|
[
{
"version": "v1",
"created": "Fri, 27 Mar 2009 20:05:17 GMT"
}
] | 2009-03-31T00:00:00 |
[
[
"Jelenkovic",
"Predrag R.",
""
],
[
"Radovanovic",
"Ana",
""
]
] |
new_dataset
| 0.975485 |
0903.5045
|
Amelia Sparavigna
|
Amelia Sparavigna
|
Digital Restoration of Ancient Papyri
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Image processing can be used for digital restoration of ancient papyri, that
is, for a restoration performed on their digital images. The digital
manipulation allows reducing the background signals and enhancing the
readability of texts. In the case of very old and damaged documents, this is
fundamental for identification of the patterns of letters. Some examples of
restoration, obtained with an image processing which uses edges detection and
Fourier filtering, are shown. One of them concerns 7Q5 fragment of the Dead Sea
Scrolls.
|
[
{
"version": "v1",
"created": "Mon, 30 Mar 2009 06:00:15 GMT"
}
] | 2009-03-31T00:00:00 |
[
[
"Sparavigna",
"Amelia",
""
]
] |
new_dataset
| 0.995083 |
cs/0611146
|
Shengtian Yang
|
Shengtian Yang, Yan Chen, Peiliang Qiu
|
Linear-Codes-Based Lossless Joint Source-Channel Coding for
Multiple-Access Channels
|
18 pages, 3 figures
|
IEEE Trans. Inf. Theory 55 (2009) 1468-1486
|
10.1109/TIT.2009.2013009
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A general lossless joint source-channel coding (JSCC) scheme based on linear
codes and random interleavers for multiple-access channels (MACs) is presented
and then analyzed in this paper. By the information-spectrum approach and the
code-spectrum approach, it is shown that a linear code with a good joint
spectrum can be used to establish limit-approaching lossless JSCC schemes for
correlated general sources and general MACs, where the joint spectrum is a
generalization of the input-output weight distribution. Some properties of
linear codes with good joint spectra are investigated. A formula on the
"distance" property of linear codes with good joint spectra is derived, based
on which, it is further proved that, the rate of any systematic codes with good
joint spectra cannot be larger than the reciprocal of the corresponding
alphabet cardinality, and any sparse generator matrices cannot yield linear
codes with good joint spectra. The problem of designing arbitrary rate coding
schemes is also discussed. A novel idea called "generalized puncturing" is
proposed, which makes it possible that one good low-rate linear code is enough
for the design of coding schemes with multiple rates. Finally, various coding
problems of MACs are reviewed in a unified framework established by the
code-spectrum approach, under which, criteria and candidates of good linear
codes in terms of spectrum requirements for such problems are clearly
presented.
|
[
{
"version": "v1",
"created": "Wed, 29 Nov 2006 01:12:57 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Jan 2008 03:05:19 GMT"
},
{
"version": "v3",
"created": "Sun, 2 Nov 2008 04:05:09 GMT"
},
{
"version": "v4",
"created": "Sun, 14 Dec 2008 13:01:38 GMT"
},
{
"version": "v5",
"created": "Tue, 31 Mar 2009 12:00:48 GMT"
}
] | 2009-03-31T00:00:00 |
[
[
"Yang",
"Shengtian",
""
],
[
"Chen",
"Yan",
""
],
[
"Qiu",
"Peiliang",
""
]
] |
new_dataset
| 0.995582 |
0903.4770
|
Sk Sarif Hassan s
|
Pal Choudhury Pabitra, Sahoo Sudhakar, Nayak Birendra Kumar, and
Hassan Sk. Sarif
|
Act of CVT and EVT In The Formation of Number-Theoretic Fractals
|
15 pages
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we have defined two functions that have been used to construct
different fractals having fractal dimensions between 1 and 2. More precisely,
we can say that one of our defined functions produce the fractals whose fractal
dimension lies in [1.58, 2) and rest function produce the fractals whose
fractal dimension lies in (1, 1.58]. Also we tried to calculate the amount of
increment of fractal dimension in accordance with base of the number systems.
And in switching of fractals from one base to another, the increment of fractal
dimension is constant, which is 1.58, its quite surprising!
|
[
{
"version": "v1",
"created": "Fri, 27 Mar 2009 10:38:32 GMT"
}
] | 2009-03-30T00:00:00 |
[
[
"Pabitra",
"Pal Choudhury",
""
],
[
"Sudhakar",
"Sahoo",
""
],
[
"Kumar",
"Nayak Birendra",
""
],
[
"Sarif",
"Hassan Sk.",
""
]
] |
new_dataset
| 0.999498 |
0903.4554
|
Mikko Malinen
|
Mikko Malinen
|
Fountain Codes and Invertible Matrices
|
3 pages, 2 figures, submitted to the IEEE Transactions on Information
Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper deals with Fountain codes, and especially with their encoding
matrices, which are required here to be invertible. A result is stated that an
encoding matrix induces a permutation. Also, a result is that encoding matrices
form a group with multiplication operation. An encoding is a transformation,
which reduces the entropy of an initially high-entropy input vector. A special
encoding matrix, with which the entropy reduction is more effective than with
matrices created by the Ideal Soliton distribution is formed. Experimental
results with entropy reduction are shown.
|
[
{
"version": "v1",
"created": "Thu, 26 Mar 2009 11:15:05 GMT"
}
] | 2009-03-27T00:00:00 |
[
[
"Malinen",
"Mikko",
""
]
] |
new_dataset
| 0.99955 |
0903.4299
|
Florentina Pintea
|
Virgiliu Streian, Adela Ionescu
|
Token Ring Project
|
6 pages, exposed on 4th International Conferences "Actualities and
Perspectives on Hardware and Software" - APHS2007, Timisoara, Romania
|
Ann. Univ. Tibiscus Comp. Sci. Series V (2007), 85-90
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ring topology is a simple configuration used to connect processes that
communicate among themselves. A number of network standards such as token ring,
token bus, and FDDI are based on the ring connectivity. This article will
develop an implementation of a ring of processes that communicate among
themselves via pipe links. The processes are nodes in the ring. Each process
reads from its standard input and writes in its standard output. N-1 process
redirects the its standard output to a standard input of the process through a
pipe. When the ring-structure is designed, the project can be extended to
simulate networks or to implement algorithms for mutual exclusion.
|
[
{
"version": "v1",
"created": "Wed, 25 Mar 2009 11:19:56 GMT"
}
] | 2009-03-26T00:00:00 |
[
[
"Streian",
"Virgiliu",
""
],
[
"Ionescu",
"Adela",
""
]
] |
new_dataset
| 0.980905 |
0903.4302
|
Florentina Pintea
|
Daniela Ilea, Dan L. Lacrama
|
ShopList: Programming PDA applications for Windows Mobile using C#
|
8 pages, exposed on 4th International Conferences "Actualities and
Perspectives on Hardware and Software" - APHS2007, Timisoara, Romania
|
Ann. Univ. Tibiscus Comp. Sci. Series V (2007), 91-98
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is focused on a C# and Sql Server Mobile 2005 application to keep
evidence of a shop list. The purpose of the application is to offer to the user
an easier way to manage his shopping options.
|
[
{
"version": "v1",
"created": "Wed, 25 Mar 2009 11:26:50 GMT"
}
] | 2009-03-26T00:00:00 |
[
[
"Ilea",
"Daniela",
""
],
[
"Lacrama",
"Dan L.",
""
]
] |
new_dataset
| 0.99824 |
0903.4101
|
Evira Mayordomo
|
Elvira Mayordomo, Philippe Moser, Sylvain Perifel
|
Polylog space compression, pushdown compression, and Lempel-Ziv are
incomparable
| null | null | null | null |
cs.CC cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The pressing need for efficient compression schemes for XML documents has
recently been focused on stack computation, and in particular calls for a
formulation of information-lossless stack or pushdown compressors that allows a
formal analysis of their performance and a more ambitious use of the stack in
XML compression, where so far it is mainly connected to parsing mechanisms. In
this paper we introduce the model of pushdown compressor, based on pushdown
transducers that compute a single injective function while keeping the widest
generality regarding stack computation.
We also consider online compression algorithms that use at most
polylogarithmic space (plogon). These algorithms correspond to compressors in
the data stream model.
We compare the performance of these two families of compressors with each
other and with the general purpose Lempel-Ziv algorithm. This comparison is
made without any a priori assumption on the data's source and considering the
asymptotic compression ratio for infinite sequences. We prove that in all cases
they are incomparable.
|
[
{
"version": "v1",
"created": "Tue, 24 Mar 2009 15:37:21 GMT"
}
] | 2009-03-25T00:00:00 |
[
[
"Mayordomo",
"Elvira",
""
],
[
"Moser",
"Philippe",
""
],
[
"Perifel",
"Sylvain",
""
]
] |
new_dataset
| 0.994729 |
0903.2448
|
Mehrnoosh Sadrzadeh
|
Mehrnoosh Sadrzadeh and Roy Dyckhoff
|
Positive Logic with Adjoint Modalities: Proof Theory, Semantics and
Reasoning about Information
|
This paper is the full version of the article that is to appear in
the ENTCS proceedings of the 25th conference on the Mathematical Foundations
of Programming Semantics (MFPS), April 2009, University of Oxford
| null | null | null |
cs.LO cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a simple modal logic whose non-modal part has conjunction and
disjunction as connectives and whose modalities come in adjoint pairs, but are
not in general closure operators. Despite absence of negation and implication,
and of axioms corresponding to the characteristic axioms of (e.g.) T, S4 and
S5, such logics are useful, as shown in previous work by Baltag, Coecke and the
first author, for encoding and reasoning about information and misinformation
in multi-agent systems. For such a logic we present an algebraic semantics,
using lattices with agent-indexed families of adjoint pairs of operators, and a
cut-free sequent calculus. The calculus exploits operators on sequents, in the
style of "nested" or "tree-sequent" calculi; cut-admissibility is shown by
constructive syntactic methods. The applicability of the logic is illustrated
by reasoning about the muddy children puzzle, for which the calculus is
augmented with extra rules to express the facts of the muddy children scenario.
|
[
{
"version": "v1",
"created": "Fri, 13 Mar 2009 18:30:55 GMT"
},
{
"version": "v2",
"created": "Thu, 19 Mar 2009 16:46:40 GMT"
},
{
"version": "v3",
"created": "Mon, 23 Mar 2009 18:42:39 GMT"
}
] | 2009-03-23T00:00:00 |
[
[
"Sadrzadeh",
"Mehrnoosh",
""
],
[
"Dyckhoff",
"Roy",
""
]
] |
new_dataset
| 0.998945 |
0710.2970
|
An-Ping Li
|
An-Ping Li
|
A generic attack to ciphers
|
4 pages
| null | null | null |
cs.CR
| null |
In this paper, we present a generic attack for ciphers, which is in essence a
collision attack on the secret keys of ciphers .
|
[
{
"version": "v1",
"created": "Tue, 16 Oct 2007 07:45:58 GMT"
},
{
"version": "v2",
"created": "Wed, 17 Oct 2007 10:34:37 GMT"
}
] | 2009-03-21T00:00:00 |
[
[
"Li",
"An-Ping",
""
]
] |
new_dataset
| 0.994815 |
0712.1400
|
An-Ping Li
|
An-Ping Li
|
Birthday attack to discrete logarithm
|
4 pages
| null | null | null |
cs.CR
| null |
The discrete logarithm in a finite group of large order has been widely
applied in public key cryptosystem. In this paper, we will present a
probabilistic algorithm for discrete logarithm.
|
[
{
"version": "v1",
"created": "Mon, 10 Dec 2007 06:15:49 GMT"
},
{
"version": "v2",
"created": "Tue, 11 Dec 2007 01:57:48 GMT"
}
] | 2009-03-21T00:00:00 |
[
[
"Li",
"An-Ping",
""
]
] |
new_dataset
| 0.996758 |
0805.3858
|
An-Ping Li
|
An-Ping Li
|
A New Type of Cipher: DICING_csb
|
There is a new variant added in the section 5
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we will propose a new type of cipher named DICING_csb, which
is derived from our previous stream cipher DICING. It has applied a stream of
subkey and an encryption form of block ciphers, so it may be viewed as a
combinative of stream cipher and block cipher. Hence, the new type of cipher
has fast rate like a stream cipher and need no MAC.
|
[
{
"version": "v1",
"created": "Mon, 26 May 2008 02:09:32 GMT"
},
{
"version": "v2",
"created": "Mon, 2 Jun 2008 01:13:20 GMT"
}
] | 2009-03-21T00:00:00 |
[
[
"Li",
"An-Ping",
""
]
] |
new_dataset
| 0.986268 |
0807.3383
|
An-Ping Li
|
An-Ping Li
|
Recover plaintext attack to block ciphers
|
there is a remark added
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
we will present an estimation for the upper-bound of the amount of 16-bytes
plaintexts for English texts, which indicates that the block ciphers with block
length no more than 16-bytes will be subject to recover plaintext attacks in
the occasions of plaintext -known or plaintext-chosen attacks.
|
[
{
"version": "v1",
"created": "Tue, 22 Jul 2008 08:25:30 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Jul 2008 06:42:38 GMT"
},
{
"version": "v3",
"created": "Fri, 25 Jul 2008 01:47:23 GMT"
},
{
"version": "v4",
"created": "Tue, 29 Jul 2008 00:27:08 GMT"
}
] | 2009-03-21T00:00:00 |
[
[
"Li",
"An-Ping",
""
]
] |
new_dataset
| 0.999714 |
0903.2742
|
Gabriel Istrate
|
Gabriel Istrate
|
On Hadwiger's Number of a graph with partial information
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the possibility of proving upper bounds on Hadwiger's number
of a graph with partial information, mirroring several known upper bounds for
the chromatic number. For each such bound we determine whether the
corresponding bound for Hadwiger's number holds. Our results suggest that the
``locality'' of an inequality accounts for the existence of such an extension.
|
[
{
"version": "v1",
"created": "Mon, 16 Mar 2009 12:53:25 GMT"
}
] | 2009-03-17T00:00:00 |
[
[
"Istrate",
"Gabriel",
""
]
] |
new_dataset
| 0.956742 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.