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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
cs/0607095 | Hyundong Shin | Hyundong Shin, Moe Z. Win | Gallager's Exponent for MIMO Channels: A Reliability-Rate Tradeoff | Submitted to the IEEE Transactions on Communications | null | null | null | cs.IT math.IT | null | In this paper, we derive Gallager's random coding error exponent for
multiple-input multiple-output (MIMO) channels, assuming no channel-state
information (CSI) at the transmitter and perfect CSI at the receiver. This
measure gives insight into a fundamental tradeoff between the communication
reliability and information rate of MIMO channels, enabling to determine the
required codeword length to achieve a prescribed error probability at a given
rate below the channel capacity. We quantify the effects of the number of
antennas, channel coherence time, and spatial fading correlation on the MIMO
exponent. In addition, general formulae for the ergodic capacity and the cutoff
rate in the presence of spatial correlation are deduced from the exponent
expressions. These formulae are applicable to arbitrary structures of transmit
and receive correlation, encompassing all the previously known results as
special cases of our expressions.
| [
{
"version": "v1",
"created": "Thu, 20 Jul 2006 06:56:02 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Shin",
"Hyundong",
""
],
[
"Win",
"Moe Z.",
""
]
]
| new_dataset | 0.981929 |
cs/0607132 | Ludo M.G.M. Tolhuizen | R. Ahlswede, H. Aydinian, L.H. Khachatrian and L.M.G.M. Tolhuizen | On q-ary codes correcting all unidirectional errors of a limited
magnitude | 22 pages,no figures. Accepted for publication of Journal of Armenian
Academy of Sciences, special issue dedicated to Rom Varshamov | null | null | null | cs.IT math.IT | null | We consider codes over the alphabet Q={0,1,..,q-1}intended for the control of
unidirectional errors of level l. That is, the transmission channel is such
that the received word cannot contain both a component larger than the
transmitted one and a component smaller than the transmitted one. Moreover, the
absolute value of the difference between a transmitted component and its
received version is at most l.
We introduce and study q-ary codes capable of correcting all unidirectional
errors of level l. Lower and upper bounds for the maximal size of those codes
are presented.
We also study codes for this aim that are defined by a single equation on the
codeword coordinates(similar to the Varshamov-Tenengolts codes for correcting
binary asymmetric errors). We finally consider the problem of detecting all
unidirectional errors of level l.
| [
{
"version": "v1",
"created": "Thu, 27 Jul 2006 15:51:31 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Ahlswede",
"R.",
""
],
[
"Aydinian",
"H.",
""
],
[
"Khachatrian",
"L. H.",
""
],
[
"Tolhuizen",
"L. M. G. M.",
""
]
]
| new_dataset | 0.966036 |
cs/0609046 | Chih-Chun Wang | Chih-Chun Wang (1), Sanjeev R. Kulkarni (2), H. Vincent Poor (2) ((1)
Purdue University, (2) Princeton University) | Exhausting Error-Prone Patterns in LDPC Codes | submitted to IEEE Trans. Information Theory | null | null | null | cs.IT cs.DS math.IT | null | It is proved in this work that exhaustively determining bad patterns in
arbitrary, finite low-density parity-check (LDPC) codes, including stopping
sets for binary erasure channels (BECs) and trapping sets (also known as
near-codewords) for general memoryless symmetric channels, is an NP-complete
problem, and efficient algorithms are provided for codes of practical short
lengths n~=500. By exploiting the sparse connectivity of LDPC codes, the
stopping sets of size <=13 and the trapping sets of size <=11 can be
efficiently exhaustively determined for the first time, and the resulting
exhaustive list is of great importance for code analysis and finite code
optimization. The featured tree-based narrowing search distinguishes this
algorithm from existing ones for which inexhaustive methods are employed. One
important byproduct is a pair of upper bounds on the bit-error rate (BER) &
frame-error rate (FER) iterative decoding performance of arbitrary codes over
BECs that can be evaluated for any value of the erasure probability, including
both the waterfall and the error floor regions. The tightness of these upper
bounds and the exhaustion capability of the proposed algorithm are proved when
combining an optimal leaf-finding module with the tree-based search. These
upper bounds also provide a worst-case-performance guarantee which is crucial
to optimizing LDPC codes for extremely low error rate applications, e.g.,
optical/satellite communications. Extensive numerical experiments are conducted
that include both randomly and algebraically constructed LDPC codes, the
results of which demonstrate the superior efficiency of the exhaustion
algorithm and its significant value for finite length code optimization.
| [
{
"version": "v1",
"created": "Mon, 11 Sep 2006 00:50:16 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Wang",
"Chih-Chun",
""
],
[
"Kulkarni",
"Sanjeev R.",
""
],
[
"Poor",
"H. Vincent",
""
]
]
| new_dataset | 0.989569 |
cs/0609094 | Igal Sason | Gil Wiechman and Igal Sason | An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate
Block Lengths and Applications | To be presented in the 44th Allerton conference, 27-29 September
2006. The full paper version was submitted to the IEEE Trans. on Information
Theory, August 2006 (see http://www.ee.technion.ac.il/people/sason/ISP.pdf) | null | null | null | cs.IT math.IT | null | This paper derives an improved sphere-packing (ISP) bound targeting codes of
short to moderate block lengths. We first review the 1967 sphere-packing (SP67)
bound for discrete memoryless channels, and a recent improvement by Valembois
and Fossorier. These concepts are used for the derivation of a new lower bound
on the decoding error probability (referred to as the ISP bound) which is
uniformly tighter than the SP67 bound and its recent improved version. Under a
mild condition, the ISP bound is applicable to general memoryless channels, and
some of its applications are exemplified. Its tightness is studied by comparing
it with bounds on the ML decoding error probability. It is exemplified that the
ISP bound suggests an interesting alternative to the 1959 sphere-packing (SP59)
bound of Shannon for the Gaussian channel, especially for digital modulations
of high spectral efficiency.
| [
{
"version": "v1",
"created": "Sun, 17 Sep 2006 21:21:46 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Wiechman",
"Gil",
""
],
[
"Sason",
"Igal",
""
]
]
| new_dataset | 0.987459 |
cs/0610012 | N Rajesh Pillai | N Rajesh Pillai, Yogesh Kumar | On Shift Sequences for Interleaved Construction of Sequence Sets with
Low Correlation | Corrected typos. Added special case for v=2 for second problem | null | null | null | cs.IT math.IT | null | Construction of signal sets with low correlation property is of interest to
designers of CDMA systems. One of the preferred ways of constructing such sets
is the interleaved construction which uses two sequences a and b with 2-level
autocorrelation and a shift sequence e. The shift sequence has to satisfy
certain conditions for the resulting signal set to have low correlation
properties. This article shows that the conditions reported in literature are
too strong and gives a version which results in more number of shift sequences.
An open problem on the existence of shift sequences for attaining an
interleaved set with maximum correlation value bounded by v+2 is also taken up
and solved.
| [
{
"version": "v1",
"created": "Wed, 4 Oct 2006 05:07:42 GMT"
},
{
"version": "v2",
"created": "Thu, 21 Jun 2007 09:30:42 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Pillai",
"N Rajesh",
""
],
[
"Kumar",
"Yogesh",
""
]
]
| new_dataset | 0.997644 |
cs/0610151 | Anant Sahai | Anant Sahai | Anytime coding on the infinite bandwidth AWGN channel: A sequential
semi-orthogonal optimal code | 12 pages, 6 figures, submitted to IT Transactions | null | null | null | cs.IT math.IT | null | It is well known that orthogonal coding can be used to approach the Shannon
capacity of the power-constrained AWGN channel without a bandwidth constraint.
This correspondence describes a semi-orthogonal variation of pulse position
modulation that is sequential in nature -- bits can be ``streamed across''
without having to buffer up blocks of bits at the transmitter. ML decoding
results in an exponentially small probability of error as a function of
tolerated receiver delay and thus eventually a zero probability of error on
every transmitted bit. In the high-rate regime, a matching upper bound is given
on the delay error exponent. We close with some comments on the case with
feedback and the connections to the capacity per unit cost problem.
| [
{
"version": "v1",
"created": "Thu, 26 Oct 2006 10:01:38 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Sahai",
"Anant",
""
]
]
| new_dataset | 0.984387 |
cs/0611112 | Ali Pusane | Daniel J. Costello Jr., and G. David Forney Jr | Channel Coding: The Road to Channel Capacity | null | null | null | null | cs.IT math.IT | null | Starting from Shannon's celebrated 1948 channel coding theorem, we trace the
evolution of channel coding from Hamming codes to capacity-approaching codes.
We focus on the contributions that have led to the most significant
improvements in performance vs. complexity for practical applications,
particularly on the additive white Gaussian noise (AWGN) channel. We discuss
algebraic block codes, and why they did not prove to be the way to get to the
Shannon limit. We trace the antecedents of today's capacity-approaching codes:
convolutional codes, concatenated codes, and other probabilistic coding
schemes. Finally, we sketch some of the practical applications of these codes.
| [
{
"version": "v1",
"created": "Wed, 22 Nov 2006 01:10:58 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Costello",
"Daniel J.",
"Jr."
],
[
"Forney",
"G. David",
"Jr"
]
]
| new_dataset | 0.992035 |
cs/0611121 | Matthieu Bloch | Matthieu Bloch, Joao Barros, Miguel R. D. Rodrigues and Steven W.
McLaughlin | Wireless Information-Theoretic Security - Part II: Practical
Implementation | 25 pages, 11 figures, submitted to Special Issue of IEEE Trans. on
Info. Theory on Information Theoretic Security | null | null | null | cs.IT math.IT | null | In Part I of this two-part paper on confidential communication over wireless
channels, we studied the fundamental security limits of quasi-static fading
channels from the point of view of outage secrecy capacity with perfect and
imperfect channel state information. In Part II, we develop a practical secret
key agreement protocol for Gaussian and quasi-static fading wiretap channels.
The protocol uses a four-step procedure to secure communications: establish
common randomness via an opportunistic transmission, perform message
reconciliation, establish a common key via privacy amplification, and use of
the key. We introduce a new reconciliation procedure that uses multilevel
coding and optimized low density parity check codes which in some cases comes
close to achieving the secrecy capacity limits established in Part I. Finally,
we develop new metrics for assessing average secure key generation rates and
show that our protocol is effective in secure key renewal.
| [
{
"version": "v1",
"created": "Fri, 24 Nov 2006 04:54:32 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Bloch",
"Matthieu",
""
],
[
"Barros",
"Joao",
""
],
[
"Rodrigues",
"Miguel R. D.",
""
],
[
"McLaughlin",
"Steven W.",
""
]
]
| new_dataset | 0.967463 |
cs/0611129 | Neri Merhav | Neri Merhav | Shannon's secrecy system with informed receivers and its application to
systematic coding for wiretapped channels | null | null | null | null | cs.IT math.IT | null | Shannon's secrecy system is studied in a setting, where both the legitimate
decoder and the wiretapper have access to side information sequences correlated
to the source, but the wiretapper receives both the coded information and the
side information via channels that are more noisy than the respective channels
of the legitmate decoder, which in turn, also shares a secret key with the
encoder. A single--letter characterization is provided for the achievable
region in the space of five figures of merit: the equivocation at the
wiretapper, the key rate, the distortion of the source reconstruction at the
legitimate receiver, the bandwidth expansion factor of the coded channels, and
the average transmission cost (generalized power). Beyond the fact that this is
an extension of earlier studies, it also provides a framework for studying
fundamental performance limits of systematic codes in the presence of a wiretap
channel. The best achievable performance of systematic codes is then compared
to that of a general code in several respects, and a few examples are given.
| [
{
"version": "v1",
"created": "Sun, 26 Nov 2006 09:34:45 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Merhav",
"Neri",
""
]
]
| new_dataset | 0.978184 |
cs/0611156 | K Vinodh | Petros Elia, K. Vinodh, M. Anand and P. Vijay Kumar | D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative
Communication Protocols | 17 pages, 5 figures | null | null | null | cs.IT math.IT | null | We consider cooperative relay communication in a fading channel environment
under the Orthogonal Amplify and Forward (OAF) and Orthogonal and
Non-Orthogonal Selection Decode and Forward (OSDF and NSDF) protocols. For all
these protocols, we compute the Diversity-Multiplexing Gain Tradeoff (DMT). We
construct DMT optimal codes for the protocols which are sphere decodable and,
in certain cases, incur minimum possible delay. Our results establish that the
DMT of the OAF protocol is identical to the DMT of the Non-Orthogonal Amplify
and Forward (NAF) protocol. Two variants of the NSDF protocol are considered:
fixed-NSDF and variable-NSDF protocol. In the variable-NSDF protocol, the
fraction of time duration for which the source alone transmits is allowed to
vary with the rate of communication. Among the class of static
amplify-and-forward and decode-and-forward protocols, the variable-NSDF
protocol is shown to have the best known DMT for any number of relays apart
from the two-relay case. When there are two relays, the variable-NSDF protocol
is shown to improve on the DMT of the best previously-known protocol for higher
values of the multiplexing gain. Our results also establish that the fixed-NSDF
protocol has a better DMT than the NAF protocol for any number of relays.
Finally, we present a DMT optimal code construction for the NAF protocol.
| [
{
"version": "v1",
"created": "Thu, 30 Nov 2006 07:26:10 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Elia",
"Petros",
""
],
[
"Vinodh",
"K.",
""
],
[
"Anand",
"M.",
""
],
[
"Kumar",
"P. Vijay",
""
]
]
| new_dataset | 0.961402 |
cs/0612044 | Lifeng Lai | Lifeng Lai and Hesham El Gamal | The Relay-Eavesdropper Channel: Cooperation for Secrecy | 33 pages, submitted to IEEE Transactions on Information Theory | null | null | null | cs.IT math.IT | null | This paper establishes the utility of user cooperation in facilitating secure
wireless communications. In particular, the four-terminal relay-eavesdropper
channel is introduced and an outer-bound on the optimal rate-equivocation
region is derived. Several cooperation strategies are then devised and the
corresponding achievable rate-equivocation region are characterized. Of
particular interest is the novel Noise-Forwarding (NF) strategy, where the
relay node sends codewords independent of the source message to confuse the
eavesdropper. This strategy is used to illustrate the deaf helper phenomenon,
where the relay is able to facilitate secure communications while being totally
ignorant of the transmitted messages. Furthermore, NF is shown to increase the
secrecy capacity in the reversely degraded scenario, where the relay node fails
to offer performance gains in the classical setting. The gain offered by the
proposed cooperation strategies is then proved theoretically and validated
numerically in the additive White Gaussian Noise (AWGN) channel.
| [
{
"version": "v1",
"created": "Thu, 7 Dec 2006 17:15:14 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Lai",
"Lifeng",
""
],
[
"Gamal",
"Hesham El",
""
]
]
| new_dataset | 0.98813 |
cs/0701024 | Yingbin Liang | Yingbin Liang, H. Vincent Poor and Shlomo Shamai (Shitz) | Secure Communication over Fading Channels | Submitted to IEEE Transactions on Information Theory, Special Issue
on Information Theoretic Security, November 2006 | null | null | null | cs.IT cs.CR math.IT | null | The fading broadcast channel with confidential messages (BCC) is
investigated, where a source node has common information for two receivers
(receivers 1 and 2), and has confidential information intended only for
receiver 1. The confidential information needs to be kept as secret as possible
from receiver 2. The broadcast channel from the source node to receivers 1 and
2 is corrupted by multiplicative fading gain coefficients in addition to
additive Gaussian noise terms. The channel state information (CSI) is assumed
to be known at both the transmitter and the receivers. The parallel BCC with
independent subchannels is first studied, which serves as an
information-theoretic model for the fading BCC. The secrecy capacity region of
the parallel BCC is established. This result is then specialized to give the
secrecy capacity region of the parallel BCC with degraded subchannels. The
secrecy capacity region is then established for the parallel Gaussian BCC, and
the optimal source power allocations that achieve the boundary of the secrecy
capacity region are derived. In particular, the secrecy capacity region is
established for the basic Gaussian BCC. The secrecy capacity results are then
applied to study the fading BCC. Both the ergodic and outage performances are
studied.
| [
{
"version": "v1",
"created": "Thu, 4 Jan 2007 18:49:47 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Liang",
"Yingbin",
"",
"Shitz"
],
[
"Poor",
"H. Vincent",
"",
"Shitz"
],
[
"Shamai",
"Shlomo",
"",
"Shitz"
]
]
| new_dataset | 0.998377 |
cs/0701030 | Eric Chen | Eric Zhi Chen | New Constructions of a Family of 2-Generator Quasi-Cyclic Two-Weight
Codes and Related Codes | 4 pages, conference | null | null | null | cs.IT math.IT | null | Based on cyclic simplex codes, a new construction of a family of 2-generator
quasi-cyclic two-weight codes is given. New optimal binary quasi-cyclic [195,
8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary [195, 6, 126],
[208, 6, 135], [221, 6, 144] codes are thus obtained. Furthermre, binary
quasi-cyclic self-complementary codes are also constructed.
| [
{
"version": "v1",
"created": "Fri, 5 Jan 2007 13:39:54 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Chen",
"Eric Zhi",
""
]
]
| new_dataset | 0.990592 |
cs/0701055 | Leif Hanlen | Leif Hanlen, Thushara Abhayapala | Bounds on Space-Time-Frequency Dimensionality | accepted Australian Communication Theory Workshop | null | null | null | cs.IT math.IT | null | We bound the number of electromagnetic signals which may be observed over a
frequency range $2W$ for a time $T$ within a region of space enclosed by a
radius $R$. Our result implies that broadband fields in space cannot be
arbitrarily complex: there is a finite amount of information which may be
extracted from a region of space via electromagnetic radiation.
Three-dimensional space allows a trade-off between large carrier frequency
and bandwidth. We demonstrate applications in super-resolution and broadband
communication.
| [
{
"version": "v1",
"created": "Tue, 9 Jan 2007 00:01:24 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Hanlen",
"Leif",
""
],
[
"Abhayapala",
"Thushara",
""
]
]
| new_dataset | 0.984017 |
cs/0701060 | Andreas Klappenecker | Salah A. Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli | Duadic Group Algebra Codes | 5 pages | null | null | null | cs.IT math.IT quant-ph | null | Duadic group algebra codes are a generalization of quadratic residue codes.
This paper settles an open problem raised by Zhu concerning the existence of
duadic group algebra codes. These codes can be used to construct degenerate
quantum stabilizer codes that have the nice feature that many errors of small
weight do not need error correction; this fact is illustrated by an example.
| [
{
"version": "v1",
"created": "Tue, 9 Jan 2007 04:36:41 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Aly",
"Salah A.",
""
],
[
"Klappenecker",
"Andreas",
""
],
[
"Sarvepalli",
"Pradeep Kiran",
""
]
]
| new_dataset | 0.999149 |
cs/0701067 | G.Susinder Rajan | G. Susinder Rajan, Anshoo Tandon and B. Sundar Rajan | On Four-group ML Decodable Distributed Space Time Codes for Cooperative
Communication | To appear in Proceedings of WCNC 2007, Hong Kong, March 11-15, 2007.
5 pages, 1 Figure | null | null | null | cs.IT math.IT | null | A construction of a new family of distributed space time codes (DSTCs) having
full diversity and low Maximum Likelihood (ML) decoding complexity is provided
for the two phase based cooperative diversity protocols of Jing-Hassibi and the
recently proposed Generalized Non-orthogonal Amplify and Forward (GNAF)
protocol of Rajan et al. The salient feature of the proposed DSTCs is that they
satisfy the extra constraints imposed by the protocols and are also four-group
ML decodable which leads to significant reduction in ML decoding complexity
compared to all existing DSTC constructions. Moreover these codes have uniform
distribution of power among the relays as well as in time. Also, simulations
results indicate that these codes perform better in comparison with the only
known DSTC with the same rate and decoding complexity, namely the Coordinate
Interleaved Orthogonal Design (CIOD). Furthermore, they perform very close to
DSTCs from field extensions which have same rate but higher decoding
complexity.
| [
{
"version": "v1",
"created": "Tue, 9 Jan 2007 21:12:53 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Rajan",
"G. Susinder",
""
],
[
"Tandon",
"Anshoo",
""
],
[
"Rajan",
"B. Sundar",
""
]
]
| new_dataset | 0.994353 |
cs/0701068 | G.Susinder Rajan | G. Susinder Rajan and B. Sundar Rajan | Distributed Space-Time Codes for Cooperative Networks with Partial CSI | To appear in Proceedings of WCNC 2007, Hong Kong, March 11-15, 2007 | null | null | null | cs.IT math.IT | null | Design criteria and full-diversity Distributed Space Time Codes (DSTCs) for
the two phase transmission based cooperative diversity protocol of Jing-Hassibi
and the Generalized Nonorthogonal Amplify and Forward (GNAF) protocol are
reported, when the relay nodes are assumed to have knowledge of the phase
component of the source to relay channel gains. It is shown that this under
this partial channel state information (CSI), several well known space time
codes for the colocated MIMO (Multiple Input Multiple Output) channel become
amenable for use as DSTCs. In particular, the well known complex orthogonal
designs, generalized coordinate interleaved orthogonal designs (GCIODs) and
unitary weight single symbol decodable (UW-SSD) codes are shown to satisfy the
required design constraints for DSTCs. Exploiting the relaxed code design
constraints, we propose DSTCs obtained from Clifford Algebras which have low ML
decoding complexity.
| [
{
"version": "v1",
"created": "Tue, 9 Jan 2007 21:20:08 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Rajan",
"G. Susinder",
""
],
[
"Rajan",
"B. Sundar",
""
]
]
| new_dataset | 0.998791 |
cs/0701078 | Vignesh Sethuraman | Vignesh Sethuraman, Ligong Wang, Bruce Hajek, Amos Lapidoth | Low SNR Capacity of Fading Channels -- MIMO and Delay Spread | null | null | null | null | cs.IT math.IT | null | Discrete-time Rayleigh fading multiple-input multiple-output (MIMO) channels
are considered, with no channel state information at the transmitter and
receiver. The fading is assumed to be correlated in time and independent from
antenna to antenna. Peak and average transmit power constraints are imposed,
either on the sum over antennas, or on each individual antenna. In both cases,
an upper bound and an asymptotic lower bound, as the signal-to-noise ratio
approaches zero, on the channel capacity are presented. The limit of normalized
capacity is identified under the sum power constraints, and, for a subclass of
channels, for individual power constraints. These results carry over to a SISO
channel with delay spread (i.e. frequency selective fading).
| [
{
"version": "v1",
"created": "Thu, 11 Jan 2007 18:58:40 GMT"
},
{
"version": "v2",
"created": "Thu, 26 Apr 2007 06:27:50 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Sethuraman",
"Vignesh",
""
],
[
"Wang",
"Ligong",
""
],
[
"Hajek",
"Bruce",
""
],
[
"Lapidoth",
"Amos",
""
]
]
| new_dataset | 0.999121 |
cs/0701182 | Marat Burnashev V. | Marat Burnashev | Supplement to: Code Spectrum and Reliability Function: Binary Symmetric
Channel | to appear in Problems of Information Transmission, 2007, v. 43, no. 1 | null | null | null | cs.IT math.IT | null | A much simpler proof of Theorem 1 from M.Burnashev "Code spectrum and
reliability function: Binary symmetric channel" is presented.
| [
{
"version": "v1",
"created": "Sun, 28 Jan 2007 11:05:05 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Burnashev",
"Marat",
""
]
]
| new_dataset | 0.999823 |
cs/0702020 | Qinqin Yang | Qinqin Yang and Zhongping Qin | Construction of Minimal Tail-Biting Trellises for Codes over Finite
Abelian Groups | 11 pages, submitted to IEEE Transactions on Information Theory | null | null | null | cs.IT math.IT | null | A definition of atomic codeword for a group code is presented. Some
properties of atomic codewords of group codes are investigated. Using these
properties, it is shown that every minimal tail-biting trellis for a group code
over a finite abelian group can be constructed from its characteristic
generators, which extends the work of Koetter and Vardy who treated the case of
a linear code over a field. We also present an efficient algorithm for
constructing the minimal tail-biting trellis of a group code over a finite
abelian group, given a generator matrix.
| [
{
"version": "v1",
"created": "Mon, 5 Feb 2007 16:41:12 GMT"
},
{
"version": "v2",
"created": "Tue, 6 Feb 2007 03:43:53 GMT"
},
{
"version": "v3",
"created": "Thu, 17 May 2007 06:24:07 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Yang",
"Qinqin",
""
],
[
"Qin",
"Zhongping",
""
]
]
| new_dataset | 0.995279 |
cs/0702093 | Ashish Khisti | Ashish Khisti, Aslan Tchamkerten, Gregory Wornell | Secure Broadcasting | Submitted to IEEE Transactions on Information Theory, Special issue
on Information Theoretic Security | null | null | null | cs.IT math.IT | null | Wyner's wiretap channel is extended to parallel broadcast channels and fading
channels with multiple receivers. In the first part of the paper, we consider
the setup of parallel broadcast channels with one sender, multiple intended
receivers, and one eavesdropper. We study the situations where the sender
broadcasts either a common message or independent messages to the intended
receivers. We derive upper and lower bounds on the common-message-secrecy
capacity, which coincide when the users are reversely degraded. For the case of
independent messages we establish the secrecy sum-capacity when the users are
reversely degraded.
In the second part of the paper we apply our results to fading channels:
perfect channel state information of all intended receivers is known globally,
whereas the eavesdropper channel is known only to her. For the common message
case, a somewhat surprising result is proven: a positive rate can be achieved
independently of the number of intended receivers. For independent messages, an
opportunistic transmission scheme is presented that achieves the secrecy
sum-capacity in the limit of large number of receivers. Our results are stated
for a fast fading channel model. Extensions to the block fading model are also
discussed.
| [
{
"version": "v1",
"created": "Fri, 16 Feb 2007 16:41:17 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Khisti",
"Ashish",
""
],
[
"Tchamkerten",
"Aslan",
""
],
[
"Wornell",
"Gregory",
""
]
]
| new_dataset | 0.993543 |
cs/0702101 | Neri Merhav | Neri Merhav | An identity of Chernoff bounds with an interpretation in statistical
physics and applications in information theory | 29 pages, 1 figure. Submitted to IEEE Trans. on Information Theory | null | null | null | cs.IT math.IT | null | An identity between two versions of the Chernoff bound on the probability a
certain large deviations event, is established. This identity has an
interpretation in statistical physics, namely, an isothermal equilibrium of a
composite system that consists of multiple subsystems of particles. Several
information--theoretic application examples, where the analysis of this large
deviations probability naturally arises, are then described from the viewpoint
of this statistical mechanical interpretation. This results in several
relationships between information theory and statistical physics, which we
hope, the reader will find insightful.
| [
{
"version": "v1",
"created": "Sun, 18 Feb 2007 06:30:46 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Merhav",
"Neri",
""
]
]
| new_dataset | 0.951263 |
cs/0703057 | Ali Pezeshki | Ali Pezeshki, A. Robert Calderbank, William Moran, and Stephen D.
Howard | Doppler Resilient Waveforms with Perfect Autocorrelation | Submitted to IEEE Transactions on Information Theory, March 2007 | null | null | null | cs.IT math.IT | null | We describe a method of constructing a sequence of phase coded waveforms with
perfect autocorrelation in the presence of Doppler shift. The constituent
waveforms are Golay complementary pairs which have perfect autocorrelation at
zero Doppler but are sensitive to nonzero Doppler shifts. We extend this
construction to multiple dimensions, in particular to radar polarimetry, where
the two dimensions are realized by orthogonal polarizations. Here we determine
a sequence of two-by-two Alamouti matrices where the entries involve Golay
pairs and for which the sum of the matrix-valued ambiguity functions vanish at
small Doppler shifts. The Prouhet-Thue-Morse sequence plays a key role in the
construction of Doppler resilient sequences of Golay pairs.
| [
{
"version": "v1",
"created": "Mon, 12 Mar 2007 21:46:04 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Pezeshki",
"Ali",
""
],
[
"Calderbank",
"A. Robert",
""
],
[
"Moran",
"William",
""
],
[
"Howard",
"Stephen D.",
""
]
]
| new_dataset | 0.999468 |
cs/0703104 | Hajime Matsui | Hajime Matsui, Seiichi Mita | Encoding via Gr\"obner bases and discrete Fourier transforms for several
types of algebraic codes | 5 pages, 4 figures, To be presented at IEEE International Symposium
on Information Theory 2007 | null | null | null | cs.IT math.IT | null | We propose a novel encoding scheme for algebraic codes such as codes on
algebraic curves, multidimensional cyclic codes, and hyperbolic cascaded
Reed-Solomon codes and present numerical examples. We employ the recurrence
from the Gr\"obner basis of the locator ideal for a set of rational points and
the two-dimensional inverse discrete Fourier transform. We generalize the
functioning of the generator polynomial for Reed-Solomon codes and develop
systematic encoding for various algebraic codes.
| [
{
"version": "v1",
"created": "Thu, 22 Mar 2007 04:52:35 GMT"
},
{
"version": "v2",
"created": "Wed, 2 May 2007 12:25:27 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Matsui",
"Hajime",
""
],
[
"Mita",
"Seiichi",
""
]
]
| new_dataset | 0.997953 |
cs/0703141 | Mitsuru Hamada | Mitsuru Hamada | Constructive Conjugate Codes for Quantum Error Correction and
Cryptography | 10 pages, 1 figure. Ver.2: statement in Theorem 7.1 was revised to a
more general one, which the proof (unchanged except a couple of lines after
Eq.(11)) had really implied. A corollary to this theorem was added.
Annotative parts on achievable rates (mainly after the proof of Theorem 7.1)
were revised | null | null | null | cs.IT math.IT | null | A conjugate code pair is defined as a pair of linear codes either of which
contains the dual of the other. A conjugate code pair represents the essential
structure of the corresponding Calderbank-Shor-Steane (CSS) quantum
error-correcting code. It is known that conjugate code pairs are applicable to
quantum cryptography. In this work, a polynomial construction of conjugate code
pairs is presented. The constructed pairs achieve the highest known achievable
rate on additive channels, and are decodable with algorithms of polynomial
complexity.
| [
{
"version": "v1",
"created": "Wed, 28 Mar 2007 12:24:31 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Mar 2007 14:42:59 GMT"
}
]
| 2007-07-13T00:00:00 | [
[
"Hamada",
"Mitsuru",
""
]
]
| new_dataset | 0.999043 |
0707.1607 | Erik Schnetter | Erik Schnetter, Christian D. Ott, Gabrielle Allen, Peter Diener, Tom
Goodale, Thomas Radke, Edward Seidel, John Shalf | Cactus Framework: Black Holes to Gamma Ray Bursts | 16 pages, 4 figures. To appear in Petascale Computing: Algorithms and
Applications, Ed. D. Bader, CRC Press LLC (2007) | null | null | null | cs.DC | null | Gamma Ray Bursts (GRBs) are intense narrowly-beamed flashes of gamma-rays of
cosmological origin. They are among the most scientifically interesting
astrophysical systems, and the riddle concerning their central engines and
emission mechanisms is one of the most complex and challenging problems of
astrophysics today. In this article we outline our petascale approach to the
GRB problem and discuss the computational toolkits and numerical codes that are
currently in use and that will be scaled up to run on emerging petaflop scale
computing platforms in the near future.
Petascale computing will require additional ingredients over conventional
parallelism. We consider some of the challenges which will be caused by future
petascale architectures, and discuss our plans for the future development of
the Cactus framework and its applications to meet these challenges in order to
profit from these new architectures.
| [
{
"version": "v1",
"created": "Wed, 11 Jul 2007 13:01:50 GMT"
}
]
| 2007-07-12T00:00:00 | [
[
"Schnetter",
"Erik",
""
],
[
"Ott",
"Christian D.",
""
],
[
"Allen",
"Gabrielle",
""
],
[
"Diener",
"Peter",
""
],
[
"Goodale",
"Tom",
""
],
[
"Radke",
"Thomas",
""
],
[
"Seidel",
"Edward",
""
],
[
"Shalf",
"John",
""
]
]
| new_dataset | 0.987505 |
0707.1193 | Damien Chablat | Mazen Zein (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN) | Singular curves and cusp points in the joint space of 3-RPR parallel
manipulators | null | International Conference On Robotics And Automation (2006) 1-6 | null | null | cs.RO | null | This paper investigates the singular curves in two-dimensional slices of the
joint space of a family of planar parallel manipulators. It focuses on special
points, referred to as cusp points, which may appear on these curves. Cusp
points play an important role in the kinematic behavior of parallel
manipulators since they make possible a nonsingular change of assembly mode.
The purpose of this study is twofold. First, it reviews an important previous
work, which, to the authors' knowledge, has never been exploited yet. Second,
it determines the cusp points in any two-dimensional slice of the joint space.
First results show that the number of cusp points may vary from zero to eight.
This work finds applications in both design and trajectory planning.
| [
{
"version": "v1",
"created": "Mon, 9 Jul 2007 07:38:47 GMT"
}
]
| 2007-07-10T00:00:00 | [
[
"Zein",
"Mazen",
"",
"IRCCyN"
],
[
"Wenger",
"Philippe",
"",
"IRCCyN"
],
[
"Chablat",
"Damien",
"",
"IRCCyN"
]
]
| new_dataset | 0.965519 |
0707.0742 | Richard McClatchey | A. Ali, A. Anjum, T. Azim, J. Bunn, A. Ikram, R. McClatchey, H.
Newman, C. Steenberg, M. Thomas, I. Willers | Mobile Computing in Physics Analysis - An Indicator for eScience | 8 pages, 7 figures. Presented at the 3rd Int Conf on Mobile Computing
& Ubiquitous Networking (ICMU06. London October 2006 | null | null | null | cs.DC | null | This paper presents the design and implementation of a Grid-enabled physics
analysis environment for handheld and other resource-limited computing devices
as one example of the use of mobile devices in eScience. Handheld devices offer
great potential because they provide ubiquitous access to data and
round-the-clock connectivity over wireless links. Our solution aims to provide
users of handheld devices the capability to launch heavy computational tasks on
computational and data Grids, monitor the jobs status during execution, and
retrieve results after job completion. Users carry their jobs on their handheld
devices in the form of executables (and associated libraries). Users can
transparently view the status of their jobs and get back their outputs without
having to know where they are being executed. In this way, our system is able
to act as a high-throughput computing environment where devices ranging from
powerful desktop machines to small handhelds can employ the power of the Grid.
The results shown in this paper are readily applicable to the wider eScience
community.
| [
{
"version": "v1",
"created": "Thu, 5 Jul 2007 09:32:29 GMT"
}
]
| 2007-07-06T00:00:00 | [
[
"Ali",
"A.",
""
],
[
"Anjum",
"A.",
""
],
[
"Azim",
"T.",
""
],
[
"Bunn",
"J.",
""
],
[
"Ikram",
"A.",
""
],
[
"McClatchey",
"R.",
""
],
[
"Newman",
"H.",
""
],
[
"Steenberg",
"C.",
""
],
[
"Thomas",
"M.",
""
],
[
"Willers",
"I.",
""
]
]
| new_dataset | 0.997627 |
0707.0548 | Sebastien Verel | Michael Defoin Platel (I3S), Sebastien Verel (I3S), Manuel Clergue
(I3S), Philippe Collard (I3S) | From Royal Road to Epistatic Road for Variable Length Evolution
Algorithm | null | Lecture notes in computer science (Lect. notes comput. sci.) ISSN
0302-9743 (27/10/2003) 3-14 | null | null | cs.NE | null | Although there are some real world applications where the use of variable
length representation (VLR) in Evolutionary Algorithm is natural and suitable,
an academic framework is lacking for such representations. In this work we
propose a family of tunable fitness landscapes based on VLR of genotypes. The
fitness landscapes we propose possess a tunable degree of both neutrality and
epistasis; they are inspired, on the one hand by the Royal Road fitness
landscapes, and the other hand by the NK fitness landscapes. So these
landscapes offer a scale of continuity from Royal Road functions, with
neutrality and no epistasis, to landscapes with a large amount of epistasis and
no redundancy. To gain insight into these fitness landscapes, we first use
standard tools such as adaptive walks and correlation length. Second, we
evaluate the performances of evolutionary algorithms on these landscapes for
various values of the neutral and the epistatic parameters; the results allow
us to correlate the performances with the expected degrees of neutrality and
epistasis.
| [
{
"version": "v1",
"created": "Wed, 4 Jul 2007 06:57:52 GMT"
}
]
| 2007-07-05T00:00:00 | [
[
"Platel",
"Michael Defoin",
"",
"I3S"
],
[
"Verel",
"Sebastien",
"",
"I3S"
],
[
"Clergue",
"Manuel",
"",
"I3S"
],
[
"Collard",
"Philippe",
"",
"I3S"
]
]
| new_dataset | 0.985998 |
0707.0282 | Igor Razgon | Igor Razgon and Barry O'Sullivan | Directed Feedback Vertex Set is Fixed-Parameter Tractable | 14 pages | null | null | null | cs.DS cs.CC | null | We resolve positively a long standing open question regarding the
fixed-parameter tractability of the parameterized Directed Feedback Vertex Set
problem. In particular, we propose an algorithm which solves this problem in
$O(8^kk!*poly(n))$.
| [
{
"version": "v1",
"created": "Mon, 2 Jul 2007 17:56:53 GMT"
}
]
| 2007-07-03T00:00:00 | [
[
"Razgon",
"Igor",
""
],
[
"O'Sullivan",
"Barry",
""
]
]
| new_dataset | 0.997595 |
0706.4107 | Mihai Patrascu | Gianni Franceschini, S. Muthukrishnan and Mihai Patrascu | Radix Sorting With No Extra Space | Full version of paper accepted to ESA 2007. (17 pages) | null | null | null | cs.DS | null | It is well known that n integers in the range [1,n^c] can be sorted in O(n)
time in the RAM model using radix sorting. More generally, integers in any
range [1,U] can be sorted in O(n sqrt{loglog n}) time. However, these
algorithms use O(n) words of extra memory. Is this necessary?
We present a simple, stable, integer sorting algorithm for words of size
O(log n), which works in O(n) time and uses only O(1) words of extra memory on
a RAM model. This is the integer sorting case most useful in practice. We
extend this result with same bounds to the case when the keys are read-only,
which is of theoretical interest. Another interesting question is the case of
arbitrary c. Here we present a black-box transformation from any RAM sorting
algorithm to a sorting algorithm which uses only O(1) extra space and has the
same running time. This settles the complexity of in-place sorting in terms of
the complexity of sorting.
| [
{
"version": "v1",
"created": "Wed, 27 Jun 2007 22:04:40 GMT"
}
]
| 2007-06-29T00:00:00 | [
[
"Franceschini",
"Gianni",
""
],
[
"Muthukrishnan",
"S.",
""
],
[
"Patrascu",
"Mihai",
""
]
]
| new_dataset | 0.996318 |
0704.1068 | Leo Liberti | Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo
Liberti | Fast paths in large-scale dynamic road networks | 12 pages, 4 figures | null | null | null | cs.NI cs.DS | null | Efficiently computing fast paths in large scale dynamic road networks (where
dynamic traffic information is known over a part of the network) is a practical
problem faced by several traffic information service providers who wish to
offer a realistic fast path computation to GPS terminal enabled vehicles. The
heuristic solution method we propose is based on a highway hierarchy-based
shortest path algorithm for static large-scale networks; we maintain a static
highway hierarchy and perform each query on the dynamically evaluated network.
| [
{
"version": "v1",
"created": "Mon, 9 Apr 2007 07:04:19 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Jun 2007 18:17:35 GMT"
}
]
| 2007-06-27T00:00:00 | [
[
"Nannicini",
"Giacomo",
""
],
[
"Baptiste",
"Philippe",
""
],
[
"Barbier",
"Gilles",
""
],
[
"Krob",
"Daniel",
""
],
[
"Liberti",
"Leo",
""
]
]
| new_dataset | 0.993277 |
0706.3132 | Paulo Condado | Paulo A. Condado and Fernando G. Lobo | EasyVoice: Integrating voice synthesis with Skype | null | null | null | null | cs.CY cs.HC | null | This paper presents EasyVoice, a system that integrates voice synthesis with
Skype. EasyVoice allows a person with voice disabilities to talk with another
person located anywhere in the world, removing an important obstacle that
affect these people during a phone or VoIP-based conversation.
| [
{
"version": "v1",
"created": "Thu, 21 Jun 2007 12:04:40 GMT"
}
]
| 2007-06-22T00:00:00 | [
[
"Condado",
"Paulo A.",
""
],
[
"Lobo",
"Fernando G.",
""
]
]
| new_dataset | 0.978837 |
0706.2888 | James Harold Thomas | James Harold Thomas | Variations on Kak's Three Stage Quantum Cryptography Protocol | null | null | null | null | cs.CR | null | This paper introduces a variation on Kak's three-stage quanutm key
distribution protocol which allows for defence against the man in the middle
attack. In addition, we introduce a new protocol, which also offers similar
resiliance against such an attack.
| [
{
"version": "v1",
"created": "Tue, 19 Jun 2007 23:04:18 GMT"
}
]
| 2007-06-21T00:00:00 | [
[
"Thomas",
"James Harold",
""
]
]
| new_dataset | 0.998342 |
cs/0302030 | David Eppstein | David Eppstein | The traveling salesman problem for cubic graphs | 20 pages, 8 figures. A preliminary version of this paper appeared at
the 8th Worksh. Algorithms and Data Structures, LNCS 2748, Springer-Verlag,
2003, pp. 307-318. This version generalizes an algorithm from the previous
version, to generate all cycles instead of counting them. It also includes a
derandomized version of the degree-four algorithm and an implementation of
the cycle listing algorithm | J. Graph Algorithms and Applications 11(1):61-81, 2007 | null | null | cs.DS | null | We show how to find a Hamiltonian cycle in a graph of degree at most three
with n vertices, in time O(2^{n/3}) ~= 1.260^n and linear space. Our algorithm
can find the minimum weight Hamiltonian cycle (traveling salesman problem), in
the same time bound. We can also count or list all Hamiltonian cycles in a
degree three graph in time O(2^{3n/8}) ~= 1.297^n. We also solve the traveling
salesman problem in graphs of degree at most four, by randomized and
deterministic algorithms with runtime O((27/4)^{n/3}) ~= 1.890^n and
O((27/4+epsilon)^{n/3}) respectively. Our algorithms allow the input to specify
a set of forced edges which must be part of any generated cycle. Our cycle
listing algorithm shows that every degree three graph has O(2^{3n/8})
Hamiltonian cycles; we also exhibit a family of graphs with 2^{n/3} Hamiltonian
cycles per graph.
| [
{
"version": "v1",
"created": "Thu, 20 Feb 2003 06:36:35 GMT"
},
{
"version": "v2",
"created": "Mon, 19 Apr 2004 23:32:38 GMT"
}
]
| 2007-06-14T00:00:00 | [
[
"Eppstein",
"David",
""
]
]
| new_dataset | 0.998108 |
cs/0601030 | Johan Bollen | Johan Bollen, Marko A. Rodriguez and Herbert Van de Sompel | Journal Status | 16 pages | Scientometrics, volume 69, number 3, pp. 669-687, 2006 | 10.1007/s11192-006-0176-z | LA-UR-05-6466 | cs.DL cs.CY | null | The status of an actor in a social context is commonly defined in terms of
two factors: the total number of endorsements the actor receives from other
actors and the prestige of the endorsing actors. These two factors indicate the
distinction between popularity and expert appreciation of the actor,
respectively. We refer to the former as popularity and to the latter as
prestige. These notions of popularity and prestige also apply to the domain of
scholarly assessment. The ISI Impact Factor (ISI IF) is defined as the mean
number of citations a journal receives over a 2 year period. By merely counting
the amount of citations and disregarding the prestige of the citing journals,
the ISI IF is a metric of popularity, not of prestige. We demonstrate how a
weighted version of the popular PageRank algorithm can be used to obtain a
metric that reflects prestige. We contrast the rankings of journals according
to their ISI IF and their weighted PageRank, and we provide an analysis that
reveals both significant overlaps and differences. Furthermore, we introduce
the Y-factor which is a simple combination of both the ISI IF and the weighted
PageRank, and find that the resulting journal rankings correspond well to a
general understanding of journal status.
| [
{
"version": "v1",
"created": "Mon, 9 Jan 2006 16:56:01 GMT"
}
]
| 2007-06-13T00:00:00 | [
[
"Bollen",
"Johan",
""
],
[
"Rodriguez",
"Marko A.",
""
],
[
"Van de Sompel",
"Herbert",
""
]
]
| new_dataset | 0.998511 |
cs/0701199 | Stephane Norte | Stephane Norte and Fernando G. Lobo | A Virtual Logo Keyboard for People with Motor Disabilities | 11 pages, 6 figures | null | null | 200701 | cs.HC | null | In our society, people with motor impairments are oftentimes socially
excluded from their environment. This is unfortunate because every human being
should have the possibility to obtain the necessary conditions to live a normal
life. Although there is technology to assist people with motor impairments, few
systems are targeted for programming environments. We have created a system,
called Logo Keyboard, to assist people with motor disabilities to program with
the Logo programming language. With this special keyboard we can help more
people to get involved into computer programming and to develop projects in
different areas.
| [
{
"version": "v1",
"created": "Wed, 31 Jan 2007 16:36:43 GMT"
},
{
"version": "v2",
"created": "Thu, 24 May 2007 20:45:24 GMT"
}
]
| 2007-06-13T00:00:00 | [
[
"Norte",
"Stephane",
""
],
[
"Lobo",
"Fernando G.",
""
]
]
| new_dataset | 0.999198 |
0706.1290 | Sylviane Schwer | Sylviane R. Schwer (LIPN) | Temporal Reasoning without Transitive Tables | rapport interne | null | null | null | cs.AI | null | Representing and reasoning about qualitative temporal information is an
essential part of many artificial intelligence tasks. Lots of models have been
proposed in the litterature for representing such temporal information. All
derive from a point-based or an interval-based framework. One fundamental
reasoning task that arises in applications of these frameworks is given by the
following scheme: given possibly indefinite and incomplete knowledge of the
binary relationships between some temporal objects, find the consistent
scenarii between all these objects. All these models require transitive tables
-- or similarly inference rules-- for solving such tasks. We have defined an
alternative model, S-languages - to represent qualitative temporal information,
based on the only two relations of \emph{precedence} and \emph{simultaneity}.
In this paper, we show how this model enables to avoid transitive tables or
inference rules to handle this kind of problem.
| [
{
"version": "v1",
"created": "Sat, 9 Jun 2007 06:57:05 GMT"
}
]
| 2007-06-12T00:00:00 | [
[
"Schwer",
"Sylviane R.",
"",
"LIPN"
]
]
| new_dataset | 0.985514 |
0706.1118 | Samuel Mimram | Paul-Andr\'e Melli\`es (PPS), Samuel Mimram (PPS) | Asynchronous games: innocence without alternation | null | null | null | null | cs.LO | null | The notion of innocent strategy was introduced by Hyland and Ong in order to
capture the interactive behaviour of lambda-terms and PCF programs. An innocent
strategy is defined as an alternating strategy with partial memory, in which
the strategy plays according to its view. Extending the definition to
non-alternating strategies is problematic, because the traditional definition
of views is based on the hypothesis that Opponent and Proponent alternate
during the interaction. Here, we take advantage of the diagrammatic
reformulation of alternating innocence in asynchronous games, in order to
provide a tentative definition of innocence in non-alternating games. The task
is interesting, and far from easy. It requires the combination of true
concurrency and game semantics in a clean and organic way, clarifying the
relationship between asynchronous games and concurrent games in the sense of
Abramsky and Melli\`es. It also requires an interactive reformulation of the
usual acyclicity criterion of linear logic, as well as a directed variant, as a
scheduling criterion.
| [
{
"version": "v1",
"created": "Fri, 8 Jun 2007 06:56:31 GMT"
}
]
| 2007-06-11T00:00:00 | [
[
"Melliès",
"Paul-André",
"",
"PPS"
],
[
"Mimram",
"Samuel",
"",
"PPS"
]
]
| new_dataset | 0.994073 |
0706.0465 | Donald Sofge | D. A. Sofge | Virtual Sensor Based Fault Detection and Classification on a Plasma Etch
Reactor | 7 pages | D. Sofge, "Virtual Sensor Based Fault Detection and Classification
on a Plasma Etch Reactor," The 2nd Joint Mexico-US Int'l. Workshop on Neural
Networks and Neurocontrol (poster), 1997 | null | null | cs.AI cs.CV | null | The SEMATECH sponsored J-88-E project teaming Texas Instruments with
NeuroDyne (et al.) focused on Fault Detection and Classification (FDC) on a Lam
9600 aluminum plasma etch reactor, used in the process of semiconductor
fabrication. Fault classification was accomplished by implementing a series of
virtual sensor models which used data from real sensors (Lam Station sensors,
Optical Emission Spectroscopy, and RF Monitoring) to predict recipe setpoints
and wafer state characteristics. Fault detection and classification were
performed by comparing predicted recipe and wafer state values with expected
values. Models utilized include linear PLS, Polynomial PLS, and Neural Network
PLS. Prediction of recipe setpoints based upon sensor data provides a
capability for cross-checking that the machine is maintaining the desired
setpoints. Wafer state characteristics such as Line Width Reduction and
Remaining Oxide were estimated on-line using these same process sensors (Lam,
OES, RFM). Wafer-to-wafer measurement of these characteristics in a production
setting (where typically this information may be only sparsely available, if at
all, after batch processing runs with numerous wafers have been completed)
would provide important information to the operator that the process is or is
not producing wafers within acceptable bounds of product quality. Production
yield is increased, and correspondingly per unit cost is reduced, by providing
the operator with the opportunity to adjust the process or machine before
etching more wafers.
| [
{
"version": "v1",
"created": "Mon, 4 Jun 2007 15:55:27 GMT"
}
]
| 2007-06-05T00:00:00 | [
[
"Sofge",
"D. A.",
""
]
]
| new_dataset | 0.998209 |
0705.4415 | Cnrs : Umr 6057 Laboratoire Parole Et Langage | Carine Andr\'e (LPL), Alain Ghio (LPL), Christian Cav\'e (LPL),
Bernard Teston (LPL) | PERCEVAL: a Computer-Driven System for Experimentation on Auditory and
Visual Perception | null | Proceedings of International Congress of Phonetic Sciences (ICPhS)
(2003) 1421-1424 | null | 1557 | cs.SE | null | Since perception tests are highly time-consuming, there is a need to automate
as many operations as possible, such as stimulus generation, procedure control,
perception testing, and data analysis. The computer-driven system we are
presenting here meets these objectives. To achieve large flexibility, the tests
are controlled by scripts. The system's core software resembles that of a
lexical-syntactic analyzer, which reads and interprets script files sent to it.
The execution sequence (trial) is modified in accordance with the commands and
data received. This type of operation provides a great deal of flexibility and
supports a wide variety of tests such as auditory-lexical decision making,
phoneme monitoring, gating, phonetic categorization, word identification, voice
quality, etc. To achieve good performance, we were careful about timing
accuracy, which is the greatest problem in computerized perception tests.
| [
{
"version": "v1",
"created": "Wed, 30 May 2007 15:31:07 GMT"
}
]
| 2007-05-31T00:00:00 | [
[
"André",
"Carine",
"",
"LPL"
],
[
"Ghio",
"Alain",
"",
"LPL"
],
[
"Cavé",
"Christian",
"",
"LPL"
],
[
"Teston",
"Bernard",
"",
"LPL"
]
]
| new_dataset | 0.999601 |
0705.4171 | Eva Borbely | Eva Borbely | Grover search algorithm | null | null | null | null | cs.DS | null | A quantum algorithm is a set of instructions for a quantum computer, however,
unlike algorithms in classical computer science their results cannot be
guaranteed. A quantum system can undergo two types of operation, measurement
and quantum state transformation, operations themselves must be unitary
(reversible). Most quantum algorithms involve a series of quantum state
transformations followed by a measurement. Currently very few quantum
algorithms are known and no general design methodology exists for their
construction.
| [
{
"version": "v1",
"created": "Tue, 29 May 2007 09:42:46 GMT"
}
]
| 2007-05-30T00:00:00 | [
[
"Borbely",
"Eva",
""
]
]
| new_dataset | 0.979782 |
0705.3949 | Yeb Havinga | Yeb Havinga | Translating a first-order modal language to relational algebra | null | null | null | null | cs.LO cs.DB | null | This paper is about Kripke structures that are inside a relational database
and queried with a modal language. At first the modal language that is used is
introduced, followed by a definition of the database and relational algebra.
Based on these definitions two things are presented: a mapping from components
of the modal structure to a relational database schema and instance, and a
translation from queries in the modal language to relational algebra queries.
| [
{
"version": "v1",
"created": "Sun, 27 May 2007 12:36:58 GMT"
}
]
| 2007-05-29T00:00:00 | [
[
"Havinga",
"Yeb",
""
]
]
| new_dataset | 0.999669 |
0705.3616 | Andy Zaidman | Andy Zaidman, Bart Van Rompaey, Serge Demeyer, Arie van Deursen | On How Developers Test Open Source Software Systems | null | null | null | TUD-SERG-2007-012 | cs.SE | null | Engineering software systems is a multidisciplinary activity, whereby a
number of artifacts must be created - and maintained - synchronously. In this
paper we investigate whether production code and the accompanying tests
co-evolve by exploring a project's versioning system, code coverage reports and
size-metrics. Three open source case studies teach us that testing activities
usually start later on during the lifetime and are more "phased", although we
did not observe increasing testing activity before releases. Furthermore, we
note large differences in the levels of test coverage given the proportion of
test code.
| [
{
"version": "v1",
"created": "Thu, 24 May 2007 16:21:35 GMT"
}
]
| 2007-05-25T00:00:00 | [
[
"Zaidman",
"Andy",
""
],
[
"Van Rompaey",
"Bart",
""
],
[
"Demeyer",
"Serge",
""
],
[
"van Deursen",
"Arie",
""
]
]
| new_dataset | 0.982315 |
0704.0834 | Anatoly Rodionov | Anatoly Rodionov, Sergey Volkov | P-adic arithmetic coding | 29 pages | null | null | null | cs.DS | null | A new incremental algorithm for data compression is presented. For a sequence
of input symbols algorithm incrementally constructs a p-adic integer number as
an output. Decoding process starts with less significant part of a p-adic
integer and incrementally reconstructs a sequence of input symbols. Algorithm
is based on certain features of p-adic numbers and p-adic norm. p-adic coding
algorithm may be considered as of generalization a popular compression
technique - arithmetic coding algorithms. It is shown that for p = 2 the
algorithm works as integer variant of arithmetic coding; for a special class of
models it gives exactly the same codes as Huffman's algorithm, for another
special model and a specific alphabet it gives Golomb-Rice codes.
| [
{
"version": "v1",
"created": "Fri, 6 Apr 2007 02:30:42 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Rodionov",
"Anatoly",
""
],
[
"Volkov",
"Sergey",
""
]
]
| new_dataset | 0.968543 |
0704.1694 | Sergey Yekhanin | Kiran S. Kedlaya, Sergey Yekhanin | Locally Decodable Codes From Nice Subsets of Finite Fields and Prime
Factors of Mersenne Numbers | 18 pages | null | null | null | cs.CC math.NT | null | A k-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit
codeword C(x), such that one can probabilistically recover any bit x_i of the
message by querying only k bits of the codeword C(x), even after some constant
fraction of codeword bits has been corrupted. The major goal of LDC related
research is to establish the optimal trade-off between length and query
complexity of such codes.
Recently [Y] introduced a novel technique for constructing locally decodable
codes and vastly improved the upper bounds for code length. The technique is
based on Mersenne primes. In this paper we extend the work of [Y] and argue
that further progress via these methods is tied to progress on an old number
theory question regarding the size of the largest prime factors of Mersenne
numbers.
Specifically, we show that every Mersenne number m=2^t-1 that has a prime
factor p>m^\gamma yields a family of k(\gamma)-query locally decodable codes of
length Exp(n^{1/t}). Conversely, if for some fixed k and all \epsilon > 0 one
can use the technique of [Y] to obtain a family of k-query LDCs of length
Exp(n^\epsilon); then infinitely many Mersenne numbers have prime factors arger
than known currently.
| [
{
"version": "v1",
"created": "Fri, 13 Apr 2007 04:18:19 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kedlaya",
"Kiran S.",
""
],
[
"Yekhanin",
"Sergey",
""
]
]
| new_dataset | 0.992422 |
0704.2201 | Hassan Satori | H. Satori, M. Harti and N. Chenfour | Arabic Speech Recognition System using CMU-Sphinx4 | 5 pages, 3 figures and 2 tables, in French | null | null | null | cs.CL cs.AI | null | In this paper we present the creation of an Arabic version of Automated
Speech Recognition System (ASR). This system is based on the open source
Sphinx-4, from the Carnegie Mellon University. Which is a speech recognition
system based on discrete hidden Markov models (HMMs). We investigate the
changes that must be made to the model to adapt Arabic voice recognition.
Keywords: Speech recognition, Acoustic model, Arabic language, HMMs,
CMUSphinx-4, Artificial intelligence.
| [
{
"version": "v1",
"created": "Tue, 17 Apr 2007 17:04:26 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Satori",
"H.",
""
],
[
"Harti",
"M.",
""
],
[
"Chenfour",
"N.",
""
]
]
| new_dataset | 0.962378 |
0704.3268 | Koray Karahaliloglu | Koray Karahaliloglu | 2D Path Solutions from a Single Layer Excitable CNN Model | 24 pages, 9 figures | null | null | null | cs.RO cs.NE | null | An easily implementable path solution algorithm for 2D spatial problems,
based on excitable/programmable characteristics of a specific cellular
nonlinear network (CNN) model is presented and numerically investigated. The
network is a single layer bioinspired model which was also implemented in CMOS
technology. It exhibits excitable characteristics with regionally bistable
cells. The related response realizes propagations of trigger autowaves, where
the excitable mode can be globally preset and reset. It is shown that, obstacle
distributions in 2D space can also be directly mapped onto the coupled cell
array in the network. Combining these two features, the network model can serve
as the main block in a 2D path computing processor. The related algorithm and
configurations are numerically experimented with circuit level parameters and
performance estimations are also presented. The simplicity of the model also
allows alternative technology and device level implementation, which may become
critical in autonomous processor design of related micro or nanoscale robotic
applications.
| [
{
"version": "v1",
"created": "Tue, 24 Apr 2007 20:20:46 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Karahaliloglu",
"Koray",
""
]
]
| new_dataset | 0.998515 |
0704.3501 | Jerome Darmont | J\'er\^ome Darmont (ERIC), Fadila Bentayeb (ERIC), Omar Boussa\"id
(ERIC) | Conception d'un banc d'essais d\'ecisionnel | 20 pages | 20\`emes Journ\'ees Bases de Donn\'ees Avanc\'ees (BDA 04),
Montpellier (19/10/2004) 493-511 | null | null | cs.DB | null | We present in this paper a new benchmark for evaluating the performances of
data warehouses. Benchmarking is useful either to system users for comparing
the performances of different systems, or to system engineers for testing the
effect of various design choices. While the TPC (Transaction Processing
Performance Council) standard benchmarks address the first point, they are not
tuneable enough to address the second one. Our Data Warehouse Engineering
Benchmark (DWEB) allows to generate various ad-hoc synthetic data warehouses
and workloads. DWEB is fully parameterized. However, two levels of
parameterization keep it easy to tune. Since DWEB mainly meets engineering
benchmarking needs, it is complimentary to the TPC standard benchmarks, and not
a competitor. Finally, DWEB is implemented as a Java free software that can be
interfaced with most existing relational database management systems.
| [
{
"version": "v1",
"created": "Thu, 26 Apr 2007 09:13:04 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Darmont",
"Jérôme",
"",
"ERIC"
],
[
"Bentayeb",
"Fadila",
"",
"ERIC"
],
[
"Boussaïd",
"Omar",
"",
"ERIC"
]
]
| new_dataset | 0.991186 |
0704.3643 | Allison Woodruff | Allison Woodruff, Sally Augustin, and Brooke Foucault | Sabbath Day Home Automation: "It's Like Mixing Technology and Religion" | null | null | null | null | cs.HC | null | We present a qualitative study of 20 American Orthodox Jewish families' use
of home automation for religious purposes. These lead users offer insight into
real-life, long-term experience with home automation technologies. We discuss
how automation was seen by participants to contribute to spiritual experience
and how participants oriented to the use of automation as a religious custom.
We also discuss the relationship of home automation to family life. We draw
design implications for the broader population, including surrender of control
as a design resource, home technologies that support long-term goals and
lifestyle choices, and respite from technology.
| [
{
"version": "v1",
"created": "Fri, 27 Apr 2007 00:42:22 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Woodruff",
"Allison",
""
],
[
"Augustin",
"Sally",
""
],
[
"Foucault",
"Brooke",
""
]
]
| new_dataset | 0.99888 |
0704.3904 | Fabien Mathieu | Anh-Tuan Gai (INRIA Rocquencourt), Dmitry Lebedev (FT R&D), Fabien
Mathieu (FT R&D), Fabien De Montgolfier (LIAFA), Julien Reynier (LIENS),
Laurent Viennot (INRIA Rocquencourt) | Acyclic Preference Systems in P2P Networks | null | null | null | null | cs.DS cs.GT | null | In this work we study preference systems natural for the Peer-to-Peer
paradigm. Most of them fall in three categories: global, symmetric and
complementary. All these systems share an acyclicity property. As a
consequence, they admit a stable (or Pareto efficient) configuration, where no
participant can collaborate with better partners than their current ones. We
analyze the representation of the such preference systems and show that any
acyclic system can be represented with a symmetric mark matrix. This gives a
method to merge acyclic preference systems and retain the acyclicity. We also
consider such properties of the corresponding collaboration graph, as
clustering coefficient and diameter. In particular, studying the example of
preferences based on real latency measurements, we observe that its stable
configuration is a small-world graph.
| [
{
"version": "v1",
"created": "Mon, 30 Apr 2007 09:26:39 GMT"
},
{
"version": "v2",
"created": "Wed, 2 May 2007 13:07:31 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Gai",
"Anh-Tuan",
"",
"INRIA Rocquencourt"
],
[
"Lebedev",
"Dmitry",
"",
"FT R&D"
],
[
"Mathieu",
"Fabien",
"",
"FT R&D"
],
[
"De Montgolfier",
"Fabien",
"",
"LIAFA"
],
[
"Reynier",
"Julien",
"",
"LIENS"
],
[
"Viennot",
"Laurent",
"",
"INRIA Rocquencourt"
]
]
| new_dataset | 0.966566 |
0705.0197 | Tshilidzi Marwala | Tshilidzi Marwala, Unathi Mahola and Snehashish Chakraverty | Fault Classification in Cylinders Using Multilayer Perceptrons, Support
Vector Machines and Guassian Mixture Models | 10 pages, 2 figures, 4 tables | Computer Assisted Mechanics and Engineering Sciences, Vol. 14, No.
2, 2007. | null | null | cs.AI | null | Gaussian mixture models (GMM) and support vector machines (SVM) are
introduced to classify faults in a population of cylindrical shells. The
proposed procedures are tested on a population of 20 cylindrical shells and
their performance is compared to the procedure, which uses multi-layer
perceptrons (MLP). The modal properties extracted from vibration data are used
to train the GMM, SVM and MLP. It is observed that the GMM produces 98%, SVM
produces 94% classification accuracy while the MLP produces 88% classification
rates.
| [
{
"version": "v1",
"created": "Wed, 2 May 2007 03:13:28 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Marwala",
"Tshilidzi",
""
],
[
"Mahola",
"Unathi",
""
],
[
"Chakraverty",
"Snehashish",
""
]
]
| new_dataset | 0.974585 |
0705.0422 | Rapport De Recherche Inria | Omid Amini (INRIA Sophia Antipolis), Louis Esperet (LaBRI), Jan Van
Den Heuvel (LSE) | Frugal Colouring of Graphs | null | null | null | null | cs.DM cs.NI | null | A $k$-frugal colouring of a graph $G$ is a proper colouring of the vertices
of $G$ such that no colour appears more than $k$ times in the neighbourhood of
a vertex. This type of colouring was introduced by Hind, Molloy and Reed in
1997. In this paper, we study the frugal chromatic number of planar graphs,
planar graphs with large girth, and outerplanar graphs, and relate this
parameter with several well-studied colourings, such as colouring of the
square, cyclic colouring, and $L(p,q)$-labelling. We also study frugal
edge-colourings of multigraphs.
| [
{
"version": "v1",
"created": "Thu, 3 May 2007 08:52:00 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Amini",
"Omid",
"",
"INRIA Sophia Antipolis"
],
[
"Esperet",
"Louis",
"",
"LaBRI"
],
[
"Heuvel",
"Jan Van Den",
"",
"LSE"
]
]
| new_dataset | 0.999715 |
0705.0817 | Andrea Lo Pumo | Andrea Lo Pumo | Quantum Shortest Path Netsukuku | null | null | null | null | cs.NI | null | This document describes the QSPN, the routing discovery algorithm used by
Netsukuku. Through a deductive analysis the main proprieties of the QSPN are
shown. Moreover, a second version of the algorithm, is presented.
| [
{
"version": "v1",
"created": "Sun, 6 May 2007 20:05:44 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Pumo",
"Andrea Lo",
""
]
]
| new_dataset | 0.988694 |
0705.0819 | Andrea Lo Pumo | Andrea Lo Pumo | The Netsukuku network topology | null | null | null | null | cs.NI | null | In this document, we describe the fractal structure of the Netsukuku
topology. Moreover, we show how it is possible to use the QSPN v2 on the high
levels of the fractal.
| [
{
"version": "v1",
"created": "Sun, 6 May 2007 20:12:16 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Pumo",
"Andrea Lo",
""
]
]
| new_dataset | 0.984609 |
0705.0820 | Andrea Lo Pumo | Andrea Lo Pumo | ANDNA: the distributed hostname management system of Netsukuku | null | null | null | null | cs.NI | null | We present the Abnormal Netsukuku Domain Name Anarchy system. ANDNA is the
distributed, non hierarchical and decentralised system of hostname management
used in the Netsukuku network.
| [
{
"version": "v1",
"created": "Sun, 6 May 2007 20:19:51 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Pumo",
"Andrea Lo",
""
]
]
| new_dataset | 0.99785 |
0705.1217 | Damien Chablat | J\'erome Renotte (IRCCyN), Damien Chablat (IRCCyN), Jorge Angeles
(CIM) | The Design of a Novel Prismatic Drive for a Three-DOF
Parallel-Kinematics Machine | null | ASME Design Engineering Technical Conferences (2004) 1-10 | null | null | cs.RO | null | The design of a novel prismatic drive is reported in this paper. This
transmission is based on Slide-O-Cam, a cam mechanism with multiple rollers
mounted on a common translating follower. The design of Slide-O-Cam was
reported elsewhere. This drive thus provides pure-rolling motion, thereby
reducing the friction of rack-and-pinions and linear drives. Such properties
can be used to design new transmissions for parallel-kinematics machines. In
this paper, this transmission is optimized to replace ball-screws in
Orthoglide, a three-DOF parallel robot optimized for machining applications.
| [
{
"version": "v1",
"created": "Wed, 9 May 2007 07:27:45 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Renotte",
"Jérome",
"",
"IRCCyN"
],
[
"Chablat",
"Damien",
"",
"IRCCyN"
],
[
"Angeles",
"Jorge",
"",
"CIM"
]
]
| new_dataset | 0.982366 |
0705.1282 | Damien Chablat | Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN) | Design of a Three-Axis Isotropic Parallel Manipulator for Machining
Applications: The Orthoglide | null | Workshop on Fundamental Issues and Future Research Directions for
Parallel Mechanisms and Manipulators (2002) 1-9 | null | null | cs.RO | null | The orthoglide is a 3-DOF parallel mechanism designed at IRCCyN for machining
applications. It features three fixed parallel linear joints which are mounted
orthogonally and a mobile platform which moves in the Cartesian x-y-z space
with fixed orientation. The orthoglide has been designed as function of a
prescribed Cartesian workspace with prescribed kinetostatic performances. The
interesting features of the orthoglide are a regular Cartesian workspace shape,
uniform performances in all directions and good compactness. A small-scale
prototype of the orthoglide under development is presented at the end of this
paper.
| [
{
"version": "v1",
"created": "Wed, 9 May 2007 13:23:37 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Wenger",
"Philippe",
"",
"IRCCyN"
],
[
"Chablat",
"Damien",
"",
"IRCCyN"
]
]
| new_dataset | 0.997223 |
0705.1285 | Damien Chablat | Damien Chablat (IRCCyN), Fouad Bennis (IRCCyN), Bernard Hoessler,
Matthieu Guibert | P\'eriph\'eriques haptiques et simulation d'objets, de robots et de
mannequins dans un environnement de CAO-Robotique : eM-Virtual Desktop | null | Virtual Concept (2002) 51-56 | null | null | cs.RO | null | This paper presents the development of a new software in order to manage
objects, robots and mannequins in using the possibilities given by the haptic
feedback of the Phantom desktop devices. The haptic device provides 6
positional degree of freedom sensing but three degrees force feedback. This
software called eM-Virtual Desktop is integrated in the Tecnomatix's solution
called eM-Workplace. The eM-Workplace provides powerful solutions for planning
and designing of complex assembly facilities, lines and workplaces. In the
digital mockup context, the haptic interfaces can be used to reduce the
development cycle of products. Three different loops are used to manage the
graphic, the collision detection and the haptic feedback according to theirs
own frequencies. The developed software is currently tested in industrial
context by a European automotive constructor.
| [
{
"version": "v1",
"created": "Wed, 9 May 2007 13:26:46 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Chablat",
"Damien",
"",
"IRCCyN"
],
[
"Bennis",
"Fouad",
"",
"IRCCyN"
],
[
"Hoessler",
"Bernard",
""
],
[
"Guibert",
"Matthieu",
""
]
]
| new_dataset | 0.977989 |
0705.1394 | Damien Chablat | Anatoly Pashkevich (Robotic Laboratory), Damien Chablat (IRCCyN),
Philippe Wenger (IRCCyN) | The Orthoglide: Kinematics and Workspace Analysis | null | 9th International Symposium on Advances in Robot Kinematics (2004)
1-10 | null | null | cs.RO | null | The paper addresses kinematic and geometrical aspects of the Orthoglide, a
three-DOF parallel mechanism. This machine consists of three fixed linear
joints, which are mounted orthogonally, three identical legs and a mobile
platform, which moves in the Cartesian x-y-z space with fixed orientation. New
solutions to solve inverse/direct kinematics are proposed and a detailed
workspace analysis is performed taking into account specific joint limit
constraints.
| [
{
"version": "v1",
"created": "Thu, 10 May 2007 06:53:24 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Pashkevich",
"Anatoly",
"",
"Robotic Laboratory"
],
[
"Chablat",
"Damien",
"",
"IRCCyN"
],
[
"Wenger",
"Philippe",
"",
"IRCCyN"
]
]
| new_dataset | 0.96218 |
0705.1400 | Damien Chablat | Philippe Wenger (IRCCyN), Maher Baili (IRCCyN), Damien Chablat
(IRCCyN) | A Workspace based Classification of 3R Orthogonal Manipulators | null | 9th International Symposium on Advances in Robot Kinematics (2004)
1-10 | null | null | cs.RO | null | A classification of a family of 3-revolute (3R) positioning manipulators is
established. This classification is based on the topology of their workspace.
The workspace is characterized in a half-cross section by the singular curves
of the manipulator. The workspace topology is defined by the number of cusps
and nodes that appear on these singular curves. The design parameters space is
shown to be partitioned into nine subspaces of distinct workspace topologies.
Each separating surface is given as an explicit expression in the
DH-parameters.
| [
{
"version": "v1",
"created": "Thu, 10 May 2007 07:05:37 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Wenger",
"Philippe",
"",
"IRCCyN"
],
[
"Baili",
"Maher",
"",
"IRCCyN"
],
[
"Chablat",
"Damien",
"",
"IRCCyN"
]
]
| new_dataset | 0.988649 |
0705.1453 | Jerome Darmont | J\'er\^ome Darmont (ERIC), Fadila Bentayeb (ERIC), Omar Boussa\"id
(ERIC) | DWEB: A Data Warehouse Engineering Benchmark | null | LNCS, Vol. 3589 (08/2005) 85-94 | null | null | cs.DB | null | Data warehouse architectural choices and optimization techniques are critical
to decision support query performance. To facilitate these choices, the
performance of the designed data warehouse must be assessed. This is usually
done with the help of benchmarks, which can either help system users comparing
the performances of different systems, or help system engineers testing the
effect of various design choices. While the TPC standard decision support
benchmarks address the first point, they are not tuneable enough to address the
second one and fail to model different data warehouse schemas. By contrast, our
Data Warehouse Engineering Benchmark (DWEB) allows to generate various ad-hoc
synthetic data warehouses and workloads. DWEB is fully parameterized to fulfill
data warehouse design needs. However, two levels of parameterization keep it
relatively easy to tune. Finally, DWEB is implemented as a Java free software
that can be interfaced with most existing relational database management
systems. A sample usage of DWEB is also provided in this paper.
| [
{
"version": "v1",
"created": "Thu, 10 May 2007 12:23:35 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Darmont",
"Jérôme",
"",
"ERIC"
],
[
"Bentayeb",
"Fadila",
"",
"ERIC"
],
[
"Boussaïd",
"Omar",
"",
"ERIC"
]
]
| new_dataset | 0.999658 |
0705.1999 | Camilla Schwind | Camilla Schwind (LIF) | A first-order Temporal Logic for Actions | null | null | null | null | cs.AI cs.LO | null | We present a multi-modal action logic with first-order modalities, which
contain terms which can be unified with the terms inside the subsequent
formulas and which can be quantified. This makes it possible to handle
simultaneously time and states. We discuss applications of this language to
action theory where it is possible to express many temporal aspects of actions,
as for example, beginning, end, time points, delayed preconditions and results,
duration and many others. We present tableaux rules for a decidable fragment of
this logic.
| [
{
"version": "v1",
"created": "Mon, 14 May 2007 18:36:25 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Schwind",
"Camilla",
"",
"LIF"
]
]
| new_dataset | 0.999449 |
0705.2819 | Preetam Patil | Preetam Patil, Varsha Apte (Department of CSE, IIT-Bombay, India) | An Autonomous Distributed Admission Control Scheme for IEEE 802.11 DCF | Submitted to QShine'07 | null | null | null | cs.NI cs.PF | null | Admission control as a mechanism for providing QoS requires an accurate
description of the requested flow as well as already admitted flows. Since
802.11 WLAN capacity is shared between flows belonging to all stations,
admission control requires knowledge of all flows in the WLAN. Further,
estimation of the load-dependent WLAN capacity through analytical model
requires inputs about channel data rate, payload size and the number of
stations. These factors combined point to a centralized admission control
whereas for 802.11 DCF it is ideally performed in a distributed manner. The use
of measurements from the channel avoids explicit inputs about the state of the
channel described above. BUFFET, a model based measurement-assisted distributed
admission control scheme for DCF proposed in this paper relies on measurements
to derive model inputs and predict WLAN saturation, thereby maintaining average
delay within acceptable limits. Being measurement based, it adapts to a
combination of data rates and payload sizes, making it completely autonomous
and distributed. Performance analysis using OPNET simulations suggests that
BUFFET is able to ensure average delay under 7ms at a near-optimal throughput.
| [
{
"version": "v1",
"created": "Sat, 19 May 2007 13:54:25 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Patil",
"Preetam",
"",
"Department of CSE, IIT-Bombay, India"
],
[
"Apte",
"Varsha",
"",
"Department of CSE, IIT-Bombay, India"
]
]
| new_dataset | 0.985899 |
cs/0001001 | Alexander Y. Vlasov | Alexander Yu. Vlasov (FRC/IRH, St.-Petersburg, Russia) | Von Neumann Quantum Logic vs. Classical von Neumann Architecture? | 4 pages LaTeXe, two columns, 1 inline logo, submitted to III
International Conference on Soft Computing and Measurements SCM'2000 | null | null | null | cs.OH quant-ph | null | The name of John von Neumann is common both in quantum mechanics and computer
science. Are they really two absolutely unconnected areas? Many works devoted
to quantum computations and communications are serious argument to suggest
about existence of such a relation, but it is impossible to touch the new and
active theme in a short review. In the paper are described the structures and
models of linear algebra and just due to their generality it is possible to use
universal description of very different areas as quantum mechanics and theory
of Bayesian image analysis, associative memory, neural networks, fuzzy logic.
| [
{
"version": "v1",
"created": "Mon, 3 Jan 2000 14:25:11 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Vlasov",
"Alexander Yu.",
"",
"FRC/IRH, St.-Petersburg, Russia"
]
]
| new_dataset | 0.985471 |
cs/0001002 | Wlodek W. Zadrozny | Wlodek Zadrozny | Minimum Description Length and Compositionality | null | H.Bunt and R.Muskens(Eds.) "Computing Meaning" Vol.1. Kluwer 1999.
pp.113-128 | null | null | cs.CL cs.AI | null | We present a non-vacuous definition of compositionality. It is based on the
idea of combining the minimum description length principle with the original
definition of compositionality (that is, that the meaning of the whole is a
function of the meaning of the parts).
The new definition is intuitive and allows us to distinguish between
compositional and non-compositional semantics, and between idiomatic and
non-idiomatic expressions. It is not ad hoc, since it does not make any
references to non-intrinsic properties of meaning functions (like being a
polynomial). Moreover, it allows us to compare different meaning functions with
respect to how compositional they are. It bridges linguistic and corpus-based,
statistical approaches to natural language understanding.
| [
{
"version": "v1",
"created": "Tue, 4 Jan 2000 21:46:29 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Zadrozny",
"Wlodek",
""
]
]
| new_dataset | 0.993885 |
cs/0001019 | Joseph O'Rourke | Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke | PushPush is NP-hard in 2D | 18 pages, 13 figures, 1 table. Improves cs.CG/9911013 | null | null | Smith Technical Report 065 | cs.CG cs.DM | null | We prove that a particular pushing-blocks puzzle is intractable in 2D,
improving an earlier result that established intractability in 3D [OS99]. The
puzzle, inspired by the game *PushPush*, consists of unit square blocks on an
integer lattice. An agent may push blocks (but never pull them) in attempting
to move between given start and goal positions. In the PushPush version, the
agent can only push one block at a time, and moreover, each block, when pushed,
slides the maximal extent of its free range. We prove this version is NP-hard
in 2D by reduction from SAT.
| [
{
"version": "v1",
"created": "Mon, 24 Jan 2000 14:04:42 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Demaine",
"Erik D.",
""
],
[
"Demaine",
"Martin L.",
""
],
[
"O'Rourke",
"Joseph",
""
]
]
| new_dataset | 0.999804 |
cs/0001026 | Joseph Y. Halpern | Joseph Y. Halpern and Ron van der Meyden | A Logic for SDSI's Linked Local Name Spaces | To appear, Journal of Computer Security | null | null | null | cs.CR cs.LO | null | Abadi has introduced a logic to explicate the meaning of local names in SDSI,
the Simple Distributed Security Infrastructure proposed by Rivest and Lampson.
Abadi's logic does not correspond precisely to SDSI, however; it draws
conclusions about local names that do not follow from SDSI's name resolution
algorithm. Moreover, its semantics is somewhat unintuitive. This paper presents
the Logic of Local Name Containment, which does not suffer from these
deficiencies. It has a clear semantics and provides a tight characterization of
SDSI name resolution. The semantics is shown to be closely related to that of
logic programs, leading to an approach to the efficient implementation of
queries concerning local names. A complete axiomatization of the logic is also
provided.
| [
{
"version": "v1",
"created": "Fri, 28 Jan 2000 20:50:40 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Halpern",
"Joseph Y.",
""
],
[
"van der Meyden",
"Ron",
""
]
]
| new_dataset | 0.99954 |
cs/0002008 | Robbie Gates | R. Gates, P. Katis, N. Sabadini, R.F.C. Walters | On Automata with Boundary | 41 pages, 22 figures. Uses Paul Taylor's diagrams macros, see
http://www.ctan.org/tex-archive/macros/generic/diagrams/taylor/ | null | null | C/TR00-01 | cs.DC | null | We present a theory of automata with boundary for designing, modelling and
analysing distributed systems. Notions of behaviour, design and simulation
appropriate to the theory are defined. The problem of model checking for
deadlock detection is discussed, and an algorithm for state space reduction in
exhaustive search, based on the theory presented here, is described. Three
examples of the application of the theory are given, one in the course of the
development of the ideas and two as illustrative examples of the use of the
theory.
| [
{
"version": "v1",
"created": "Wed, 16 Feb 2000 02:45:39 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Gates",
"R.",
""
],
[
"Katis",
"P.",
""
],
[
"Sabadini",
"N.",
""
],
[
"Walters",
"R. F. C.",
""
]
]
| new_dataset | 0.989328 |
cs/0003001 | Erik T. Mueller | Erik T. Mueller | Making news understandable to computers | null | null | null | null | cs.IR | null | Computers and devices are largely unaware of events taking place in the
world. This could be changed if news were made available in a
computer-understandable form. In this paper we present XML documents called
NewsForms that represent the key points of 17 types of news events. We discuss
the benefits of computer-understandable news and present the NewsExtract
program for converting text news stories into NewsForms.
| [
{
"version": "v1",
"created": "Wed, 1 Mar 2000 18:11:08 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Mueller",
"Erik T.",
""
]
]
| new_dataset | 0.99876 |
cs/0003004 | Erik T. Mueller | Erik T. Mueller | A database and lexicon of scripts for ThoughtTreasure | null | null | null | null | cs.AI cs.CL | null | Since scripts were proposed in the 1970's as an inferencing mechanism for AI
and natural language processing programs, there have been few attempts to build
a database of scripts. This paper describes a database and lexicon of scripts
that has been added to the ThoughtTreasure commonsense platform. The database
provides the following information about scripts: sequence of events, roles,
props, entry conditions, results, goals, emotions, places, duration, frequency,
and cost. English and French words and phrases are linked to script concepts.
| [
{
"version": "v1",
"created": "Wed, 1 Mar 2000 18:07:02 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Mueller",
"Erik T.",
""
]
]
| new_dataset | 0.999297 |
cs/0003024 | Hans Tompits | James P. Delgrande, Torsten Schaub, Hans Tompits | A Compiler for Ordered Logic Programs | null | null | null | null | cs.AI | null | This paper describes a system, called PLP, for compiling ordered logic
programs into standard logic programs under the answer set semantics. In an
ordered logic program, rules are named by unique terms, and preferences among
rules are given by a set of dedicated atoms. An ordered logic program is
transformed into a second, regular, extended logic program wherein the
preferences are respected, in that the answer sets obtained in the transformed
theory correspond with the preferred answer sets of the original theory. Since
the result of the translation is an extended logic program, existing logic
programming systems can be used as underlying reasoning engine. In particular,
PLP is conceived as a front-end to the logic programming systems dlv and
smodels.
| [
{
"version": "v1",
"created": "Wed, 8 Mar 2000 10:15:51 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Delgrande",
"James P.",
""
],
[
"Schaub",
"Torsten",
""
],
[
"Tompits",
"Hans",
""
]
]
| new_dataset | 0.998908 |
cs/0003036 | Gerald Pfeifer | Thomas Eiter and Wolfgang Faber and Christoph Koch and Nicola Leone
and Gerald Pfeifer | DLV - A System for Declarative Problem Solving | 6 pages, 1 figure, 1 table | null | null | null | cs.AI cs.LO | null | DLV is an efficient logic programming and non-monotonic reasoning (LPNMR)
system with advanced knowledge representation mechanisms and interfaces to
classic relational database systems.
Its core language is disjunctive datalog (function-free disjunctive logic
programming) under the Answer Set Semantics with integrity constraints, both
default and strong (or explicit) negation, and queries. Integer arithmetics and
various built-in predicates are also supported.
In addition DLV has several frontends, namely brave and cautious reasoning,
abductive diagnosis, consistency-based diagnosis, a subset of SQL3, planning
with action languages, and logic programming with inheritance.
| [
{
"version": "v1",
"created": "Wed, 8 Mar 2000 18:17:33 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Eiter",
"Thomas",
""
],
[
"Faber",
"Wolfgang",
""
],
[
"Koch",
"Christoph",
""
],
[
"Leone",
"Nicola",
""
],
[
"Pfeifer",
"Gerald",
""
]
]
| new_dataset | 0.99921 |
cs/0003037 | Hans Tompits | Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran | QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks | null | null | null | null | cs.AI | null | In this paper, we outline the prototype of an automated inference tool,
called QUIP, which provides a uniform implementation for several nonmonotonic
reasoning formalisms. The theoretical basis of QUIP is derived from well-known
results about the computational complexity of nonmonotonic logics and exploits
a representation of the different reasoning tasks in terms of quantified
boolean formulae.
| [
{
"version": "v1",
"created": "Wed, 8 Mar 2000 17:18:08 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Egly",
"Uwe",
""
],
[
"Eiter",
"Thomas",
""
],
[
"Tompits",
"Hans",
""
],
[
"Woltran",
"Stefan",
""
]
]
| new_dataset | 0.997914 |
cs/0003039 | Ilkka Niemela | Maarit Hietalahti, Fabio Massacci, Ilkka Niemela | DES: a Challenge Problem for Nonmonotonic Reasoning Systems | 10 pages, 1 Postscript figure, uses aaai.sty and graphicx.sty | null | null | null | cs.AI | null | The US Data Encryption Standard, DES for short, is put forward as an
interesting benchmark problem for nonmonotonic reasoning systems because (i) it
provides a set of test cases of industrial relevance which shares features of
randomly generated problems and real-world problems, (ii) the representation of
DES using normal logic programs with the stable model semantics is simple and
easy to understand, and (iii) this subclass of logic programs can be seen as an
interesting special case for many other formalizations of nonmonotonic
reasoning. In this paper we present two encodings of DES as logic programs: a
direct one out of the standard specifications and an optimized one extending
the work of Massacci and Marraro. The computational properties of the encodings
are studied by using them for DES key search with the Smodels system as the
implementation of the stable model semantics. Results indicate that the
encodings and Smodels are quite competitive: they outperform state-of-the-art
SAT-checkers working with an optimized encoding of DES into SAT and are
comparable with a SAT-checker that is customized and tuned for the optimized
SAT encoding.
| [
{
"version": "v1",
"created": "Wed, 8 Mar 2000 21:49:57 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Hietalahti",
"Maarit",
""
],
[
"Massacci",
"Fabio",
""
],
[
"Niemela",
"Ilkka",
""
]
]
| new_dataset | 0.956979 |
cs/0003047 | Hans-Peter Stoerr | Steffen Hoelldobler and Hans-Peter Stoerr | BDD-based reasoning in the fluent calculus - first results | 9 pages; Workshop on Nonmonotonic Reasoning 2000 (NMR 2000) | null | null | null | cs.AI | null | The paper reports on first preliminary results and insights gained in a
project aiming at implementing the fluent calculus using methods and techniques
based on binary decision diagrams. After reporting on an initial experiment
showing promising results we discuss our findings concerning various techniques
and heuristics used to speed up the reasoning process.
| [
{
"version": "v1",
"created": "Thu, 9 Mar 2000 17:18:12 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Hoelldobler",
"Steffen",
""
],
[
"Stoerr",
"Hans-Peter",
""
]
]
| new_dataset | 0.972314 |
cs/0003048 | Pedro Cabalar | Pedro Cabalar, Manuel Cabarcos, Ramon P. Otero | PAL: Pertinence Action Language | 5 pages | null | null | null | cs.AI cs.LO | null | The current document contains a brief description of a system for Reasoning
about Actions and Change called PAL (Pertinence Action Language) which makes
use of several reasoning properties extracted from a Temporal Expert Systems
tool called Medtool.
| [
{
"version": "v1",
"created": "Thu, 9 Mar 2000 19:50:50 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Cabalar",
"Pedro",
""
],
[
"Cabarcos",
"Manuel",
""
],
[
"Otero",
"Ramon P.",
""
]
]
| new_dataset | 0.996054 |
cs/0003055 | Thorsten Brants | Thorsten Brants (Saarland University, Germany) | TnT - A Statistical Part-of-Speech Tagger | 8 pages | Proceedings of ANLP-2000, Seattle, WA | null | null | cs.CL | null | Trigrams'n'Tags (TnT) is an efficient statistical part-of-speech tagger.
Contrary to claims found elsewhere in the literature, we argue that a tagger
based on Markov models performs at least as well as other current approaches,
including the Maximum Entropy framework. A recent comparison has even shown
that TnT performs significantly better for the tested corpora. We describe the
basic model of TnT, the techniques used for smoothing and for handling unknown
words. Furthermore, we present evaluations on two corpora.
| [
{
"version": "v1",
"created": "Mon, 13 Mar 2000 09:55:08 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Brants",
"Thorsten",
"",
"Saarland University, Germany"
]
]
| new_dataset | 0.99772 |
cs/0003064 | null | Oleg Kiselyov | A network file system over HTTP: remote access and modification of files
and "files" | This present document combines a paper and a Freenix Track talk
presented at a 1999 USENIX Annual Technical Conference, June 6-11, 1999;
Monterey, CA, USA; 6 HTML files. The paper alone appeared in Proc. FREENIX
Track: 1999 USENIX Annual Technical Conference, June 6-11,1999; Monterey, CA,
USA, pp. 75-80 | null | null | null | cs.OS cs.NI | null | The goal of the present HTTPFS project is to enable access to remote files,
directories, and other containers through an HTTP pipe. HTTPFS system permits
retrieval, creation and modification of these resources as if they were regular
files and directories on a local filesystem. The remote host can be any UNIX or
Win9x/WinNT box that is capable of running a Perl CGI script and accessible
either directly or via a web proxy or a gateway. HTTPFS runs entirely in user
space.
The current implementation fully supports reading as well as creating,
writing, appending, and truncating of files on a remote HTTP host. HTTPFS
provides an isolation level for concurrent file access stronger than the one
mandated by POSIX file system semantics, closer to that of AFS. Both an API
with familiar open(), read(), write(), close(), etc. calls, and an interactive
interface, via the popular Midnight Commander file browser, are provided.
| [
{
"version": "v1",
"created": "Wed, 15 Mar 2000 19:20:53 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kiselyov",
"Oleg",
""
]
]
| new_dataset | 0.997725 |
cs/0004011 | Burkhard D. Steinmacher-Burow | Burkhard D. Steinmacher-Burow | Task Frames | null | null | null | null | cs.PL | null | Forty years ago Dijkstra introduced the current conventional execution of
routines. It places activation frames onto a stack. Each frame is the internal
state of an executing routine. The resulting application execution is not
easily helped by an external system. This presentation proposes an alternative
execution of routines. It places task frames onto the stack. A task frame is
the call of a routine to be executed. The feasibility of the alternative
execution is demonstrated by a crude implementation. As described elsewhere, an
application which executes in terms of tasks can be provided by an external
system with a transparent reliable, distributed, heterogeneous, adaptive,
dynamic, real-time, parallel, secure or other execution. By extending the crude
implementation, this presentation outlines a simple transparent parallel
execution.
| [
{
"version": "v1",
"created": "Wed, 19 Apr 2000 12:22:36 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Steinmacher-Burow",
"Burkhard D.",
""
]
]
| new_dataset | 0.974011 |
cs/0005002 | Jan Heering | Jan Heering | Application Software, Domain-Specific Languages, and Language Design
Assistants | To be presented at SSGRR 2000, L'Aquila, Italy | in Proceedings SSGRR 2000 International Conference on Advances in
Infrastructure for Electronic Business, Science, and Education on the
Internet | null | SEN-R0010 (CWI, Amsterdam) | cs.PL | null | While application software does the real work, domain-specific languages
(DSLs) are tools to help produce it efficiently, and language design assistants
in turn are meta-tools to help produce DSLs quickly. DSLs are already in wide
use (HTML for web pages, Excel macros for spreadsheet applications, VHDL for
hardware design, ...), but many more will be needed for both new as well as
existing application domains. Language design assistants to help develop them
currently exist only in the basic form of language development systems. After a
quick look at domain-specific languages, and especially their relationship to
application libraries, we survey existing language development systems and give
an outline of future language design assistants.
| [
{
"version": "v1",
"created": "Wed, 3 May 2000 13:34:15 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Heering",
"Jan",
""
]
]
| new_dataset | 0.997731 |
cs/0005008 | Krzysztof R. Apt | Krzysztof R. Apt | A Denotational Semantics for First-Order Logic | 17 pages. Invited talk at the Computational Logic Conference (CL
2000). To appear in Springer-Verlag Lecture Notes in Computer Science | null | null | null | cs.PL cs.AI | null | In Apt and Bezem [AB99] (see cs.LO/9811017) we provided a computational
interpretation of first-order formulas over arbitrary interpretations. Here we
complement this work by introducing a denotational semantics for first-order
logic. Additionally, by allowing an assignment of a non-ground term to a
variable we introduce in this framework logical variables.
The semantics combines a number of well-known ideas from the areas of
semantics of imperative programming languages and logic programming. In the
resulting computational view conjunction corresponds to sequential composition,
disjunction to ``don't know'' nondeterminism, existential quantification to
declaration of a local variable, and negation to the ``negation as finite
failure'' rule. The soundness result shows correctness of the semantics with
respect to the notion of truth. The proof resembles in some aspects the proof
of the soundness of the SLDNF-resolution.
| [
{
"version": "v1",
"created": "Mon, 8 May 2000 12:23:07 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Apt",
"Krzysztof R.",
""
]
]
| new_dataset | 0.990542 |
cs/0005009 | Stephan Tobies | Stephan Tobies | PSPACE Reasoning for Graded Modal Logics | null | Journal of Logic and Computation, Vol. 11 No. 1, pp 85-106 2001 | null | null | cs.LO cs.AI cs.CC cs.DS | null | We present a PSPACE algorithm that decides satisfiability of the graded modal
logic Gr(K_R)---a natural extension of propositional modal logic K_R by
counting expressions---which plays an important role in the area of knowledge
representation. The algorithm employs a tableaux approach and is the first
known algorithm which meets the lower bound for the complexity of the problem.
Thus, we exactly fix the complexity of the problem and refute an
ExpTime-hardness conjecture. We extend the results to the logic Gr(K_(R \cap
I)), which augments Gr(K_R) with inverse relations and intersection of
accessibility relations. This establishes a kind of ``theoretical benchmark''
that all algorithmic approaches can be measured against.
| [
{
"version": "v1",
"created": "Mon, 8 May 2000 14:51:58 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Tobies",
"Stephan",
""
]
]
| new_dataset | 0.995404 |
cs/0005012 | Stephan Tobies | Ian Horrocks and Stephan Tobies | Reasoning with Axioms: Theory and Pratice | This paper appeard in the Proceedings of KR'2000 | null | null | null | cs.LO cs.AI | null | When reasoning in description, modal or temporal logics it is often useful to
consider axioms representing universal truths in the domain of discourse.
Reasoning with respect to an arbitrary set of axioms is hard, even for
relatively inexpressive logics, and it is essential to deal with such axioms in
an efficient manner if implemented systems are to be effective in real
applications. This is particularly relevant to Description Logics, where
subsumption reasoning with respect to a terminology is a fundamental problem.
Two optimisation techniques that have proved to be particularly effective in
dealing with terminologies are lazy unfolding and absorption. In this paper we
seek to improve our theoretical understanding of these important techniques. We
define a formal framework that allows the techniques to be precisely described,
establish conditions under which they can be safely applied, and prove that,
provided these conditions are respected, subsumption testing algorithms will
still function correctly. These results are used to show that the procedures
used in the FaCT system are correct and, moreover, to show how efficiency can
be significantly improved, while still retaining the guarantee of correctness,
by relaxing the safety conditions for absorption.
| [
{
"version": "v1",
"created": "Tue, 9 May 2000 07:17:29 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Horrocks",
"Ian",
""
],
[
"Tobies",
"Stephan",
""
]
]
| new_dataset | 0.996842 |
cs/0005023 | Emanuele Panizzi | Alessandro Lonardo, Emanuele Panizzi and Benedetto Proietti | C++ programming language for an abstract massively parallel SIMD
architecture | 10 pages | null | null | null | cs.PL | null | The aim of this work is to define and implement an extended C++ language to
support the SIMD programming paradigm. The C++ programming language has been
extended to express all the potentiality of an abstract SIMD machine consisting
of a central Control Processor and a N-dimensional toroidal array of Numeric
Processors. Very few extensions have been added to the standard C++ with the
goal of minimising the effort for the programmer in learning a new language and
to keep very high the performance of the compiled code. The proposed language
has been implemented as a porting of the GNU C++ Compiler on a SIMD
supercomputer.
| [
{
"version": "v1",
"created": "Fri, 19 May 2000 10:19:51 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lonardo",
"Alessandro",
""
],
[
"Panizzi",
"Emanuele",
""
],
[
"Proietti",
"Benedetto",
""
]
]
| new_dataset | 0.997857 |
cs/0005026 | Igor Sobrado Delgado | Igor Sobrado (University of Oviedo) | A One-Time Pad based Cipher for Data Protection in Distributed
Environments | 19 pages, 8 PostScript figures (attached), uses ACM/LaTeX macros
esub2acm.{bst|cls} and pifont package | null | null | FFUOV-00/03 | cs.CR cs.DC cs.IR cs.NI | null | A one-time pad (OTP) based cipher to insure both data protection and
integrity when mobile code arrives to a remote host is presented. Data
protection is required when a mobile agent could retrieve confidential
information that would be encrypted in untrusted nodes of the network; in this
case, information management could not rely on carrying an encryption key. Data
integrity is a prerequisite because mobile code must be protected against
malicious hosts that, by counterfeiting or removing collected data, could cover
information to the server that has sent the agent. The algorithm described in
this article seems to be simple enough, so as to be easily implemented. This
scheme is based on a non-interactive protocol and allows a remote host to
change its own data on-the-fly and, at the same time, protecting information
against handling by other hosts.
| [
{
"version": "v1",
"created": "Wed, 24 May 2000 22:24:59 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Sobrado",
"Igor",
"",
"University of Oviedo"
]
]
| new_dataset | 0.992115 |
cs/0006019 | Frankie James | Manny Rayner, Beth Ann Hockey, Frankie James | A Compact Architecture for Dialogue Management Based on Scripts and
Meta-Outputs | null | Language Technology Joint Conference ANLP-NAACL 2000. 29 April - 4
May 2000, Seattle, WA | null | null | cs.CL | null | We describe an architecture for spoken dialogue interfaces to semi-autonomous
systems that transforms speech signals through successive representations of
linguistic, dialogue, and domain knowledge. Each step produces an output, and a
meta-output describing the transformation, with an executable program in a
simple scripting language as the final result. The output/meta-output
distinction permits perspicuous treatment of diverse tasks such as resolving
pronouns, correcting user misconceptions, and optimizing scripts.
| [
{
"version": "v1",
"created": "Fri, 9 Jun 2000 21:41:54 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Rayner",
"Manny",
""
],
[
"Hockey",
"Beth Ann",
""
],
[
"James",
"Frankie",
""
]
]
| new_dataset | 0.964139 |
cs/0007004 | Alejandro Zunino | Alejandro Zunino and Analia Amandi | Brainstorm/J: a Java Framework for Intelligent Agents | 15 pages. To be published in Proceedings of the Second Argentinian
Symposium on Artificial Intelligence (ASAI'2000 - 29th JAIIO). September
2000. Tandil, Buenos Aires, Argentina. See
http://www.exa.unicen.edu.ar/~azunino | null | null | null | cs.AI | null | Despite the effort of many researchers in the area of multi-agent systems
(MAS) for designing and programming agents, a few years ago the research
community began to take into account that common features among different MAS
exists. Based on these common features, several tools have tackled the problem
of agent development on specific application domains or specific types of
agents. As a consequence, their scope is restricted to a subset of the huge
application domain of MAS. In this paper we propose a generic infrastructure
for programming agents whose name is Brainstorm/J. The infrastructure has been
implemented as an object oriented framework. As a consequence, our approach
supports a broader scope of MAS applications than previous efforts, being
flexible and reusable.
| [
{
"version": "v1",
"created": "Tue, 4 Jul 2000 16:31:40 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Zunino",
"Alejandro",
""
],
[
"Amandi",
"Analia",
""
]
]
| new_dataset | 0.97574 |
cs/0007006 | Hans G. Kaper | Hans G. Kaper (1), Sever Tipei (2) and Jeff M. Wright (2) ((1) Argonne
National Laboratory, (2) University of Illinois at Urbana-Champaign) | DISCO: An object-oriented system for music composition and sound design | 4 pages, no figures; to be published in Proc. Int'l Computer Music
Conference 2000 (Berlin, August 2000) | null | null | null | cs.SD cs.DS cs.SE | null | This paper describes an object-oriented approach to music composition and
sound design. The approach unifies the processes of music making and instrument
building by using similar logic, objects, and procedures. The composition
modules use an abstract representation of musical data, which can be easily
mapped onto different synthesis languages or a traditionally notated score. An
abstract base class is used to derive classes on different time scales. Objects
can be related to act across time scales, as well as across an entire piece,
and relationships between similar objects can replicate traditional music
operations or introduce new ones. The DISCO (Digital Instrument for
Sonification and Composition) system is an open-ended work in progress.
| [
{
"version": "v1",
"created": "Wed, 5 Jul 2000 18:20:51 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Kaper",
"Hans G.",
""
],
[
"Tipei",
"Sever",
""
],
[
"Wright",
"Jeff M.",
""
]
]
| new_dataset | 0.955566 |
cs/0007009 | Jan Daciuk | Jan Daciuk, Stoyan Mihov, Bruce Watson, Richard Watson | Incremental construction of minimal acyclic finite-state automata | 14 pages, 7 figures | Computational Linguistics, Vol. 26, Number 1, March 2000 | null | null | cs.CL | null | In this paper, we describe a new method for constructing minimal,
deterministic, acyclic finite-state automata from a set of strings. Traditional
methods consist of two phases: the first to construct a trie, the second one to
minimize it. Our approach is to construct a minimal automaton in a single phase
by adding new strings one by one and minimizing the resulting automaton
on-the-fly. We present a general algorithm as well as a specialization that
relies upon the lexicographical ordering of the input strings.
| [
{
"version": "v1",
"created": "Thu, 6 Jul 2000 14:15:26 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Daciuk",
"Jan",
""
],
[
"Mihov",
"Stoyan",
""
],
[
"Watson",
"Bruce",
""
],
[
"Watson",
"Richard",
""
]
]
| new_dataset | 0.955825 |
cs/0007015 | Ted Herman | Ted Herman | Phase Clocks for Transient Fault Repair | 22 pages, LaTeX | null | null | TR99-08 | cs.DC | null | Phase clocks are synchronization tools that implement a form of logical time
in distributed systems. For systems tolerating transient faults by self-repair
of damaged data, phase clocks can enable reasoning about the progress of
distributed repair procedures. This paper presents a phase clock algorithm
suited to the model of transient memory faults in asynchronous systems with
read/write registers. The algorithm is self-stabilizing and guarantees accuracy
of phase clocks within O(k) time following an initial state that is k-faulty.
Composition theorems show how the algorithm can be used for the timing of
distributed procedures that repair system outputs.
| [
{
"version": "v1",
"created": "Mon, 10 Jul 2000 15:59:03 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Herman",
"Ted",
""
]
]
| new_dataset | 0.998633 |
cs/0007021 | Joseph O'Rourke | Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke | PushPush and Push-1 are NP-hard in 2D | 10 pages, 11 figures. Corrects an error in the conference version:
Proc. of the 12th Canadian Conference on Computational Geometry, August 2000,
pp. 211-219 | null | null | null | cs.CG cs.DM | null | We prove that two pushing-blocks puzzles are intractable in 2D. One of our
constructions improves an earlier result that established intractability in 3D
[OS99] for a puzzle inspired by the game PushPush. The second construction
answers a question we raised in [DDO00] for a variant we call Push-1. Both
puzzles consist of unit square blocks on an integer lattice; all blocks are
movable. An agent may push blocks (but never pull them) in attempting to move
between given start and goal positions. In the PushPush version, the agent can
only push one block at a time, and moreover when a block is pushed it slides
the maximal extent of its free range. In the Push-1 version, the agent can only
push one block one square at a time, the minimal extent---one square. Both
NP-hardness proofs are by reduction from SAT, and rely on a common
construction.
| [
{
"version": "v1",
"created": "Thu, 13 Jul 2000 17:34:58 GMT"
},
{
"version": "v2",
"created": "Sun, 3 Sep 2000 14:57:18 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Demaine",
"Erik D.",
""
],
[
"Demaine",
"Martin L.",
""
],
[
"O'Rourke",
"Joseph",
""
]
]
| new_dataset | 0.999748 |
cs/0007024 | Steven Bird | David Graff and Steven Bird | Many uses, many annotations for large speech corpora: Switchboard and
TDT as case studies | 7 pages, 2 figures | Proceedings of the Second International Conference on Language
Resources and Evaluation, pp. 427-433, Paris: European Language Resources
Association, 2000 | null | null | cs.CL | null | This paper discusses the challenges that arise when large speech corpora
receive an ever-broadening range of diverse and distinct annotations. Two case
studies of this process are presented: the Switchboard Corpus of telephone
conversations and the TDT2 corpus of broadcast news. Switchboard has undergone
two independent transcriptions and various types of additional annotation, all
carried out as separate projects that were dispersed both geographically and
chronologically. The TDT2 corpus has also received a variety of annotations,
but all directly created or managed by a core group. In both cases, issues
arise involving the propagation of repairs, consistency of references, and the
ability to integrate annotations having different formats and levels of detail.
We describe a general framework whereby these issues can be addressed
successfully.
| [
{
"version": "v1",
"created": "Thu, 13 Jul 2000 18:51:48 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Graff",
"David",
""
],
[
"Bird",
"Steven",
""
]
]
| new_dataset | 0.988511 |
cs/0007028 | Po-Han Lin | Po-Han Lin | Base Encryption: Dynamic algorithms, Keys, and Symbol Set | html page | null | null | null | cs.CR cs.CC | null | All the current modern encryption algorithms utilize fixed symbols for
plaintext and cyphertext. What I mean by fixed is that there is a set and
limited number of symbols to represent the characters, numbers, and
punctuations. In addition, they are usually the same (the plaintext symbols
have the same and equivalent counterpart in the cyphertext symbols). Almost all
the encryption algorithms rely on a predefined keyspace and length for the
encryption/decription keys, and it is usually fixed (number of bits). In
addition, the algorithms used by the encryptions are static. There is a
predefined number of operatiors, and a predefined order (loops included) of
operations. The algorithm stays the same, and the plaintext and cyphertext
along with the key are churned through this cypherblock.
Base Encryption does the opposite: It utilizes the novel concepts of base
conversion, symbol remapping, and dynamic algorithms (dynamic operators and
dynamic operations). Base Encryption solves the weakness in todays encryption
schemes, namely... Fixed symbols (base) Fixed keylengths Fixed algorithms
(fixed number of operations and operators)
Unique features... Immune from plain-text-attacks. Immune from
brute-force-attacks. Can utilize throwaway algorithms (as opposed to throw away
keys). Plug-And-Play engine (other cyphers can be augmentated to it)
| [
{
"version": "v1",
"created": "Tue, 18 Jul 2000 16:44:14 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Lin",
"Po-Han",
""
]
]
| new_dataset | 0.990036 |
cs/0007038 | Konstantinos Georgatos | Konstantinos Georgatos | Modal Logics for Topological Spaces | 25 pages, extened abstract of PHD Dissertation | null | null | null | cs.LO cs.AI | null | In this thesis we shall present two logical systems, MP and MP, for the
purpose of reasoning about knowledge and effort. These logical systems will be
interpreted in a spatial context and therefore, the abstract concepts of
knowledge and effort will be defined by concrete mathematical concepts.
| [
{
"version": "v1",
"created": "Wed, 26 Jul 2000 18:41:17 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Georgatos",
"Konstantinos",
""
]
]
| new_dataset | 0.992778 |
cs/0007043 | Suman Kumar Nath | Suman Kumar Nath, Rezaul Alam Chowdhury, M. Kaykobad | Min-Max Fine Heaps | 6 pages, pdf file | null | null | null | cs.DS | null | In this paper we present a new data structure for double ended priority
queue, called min-max fine heap, which combines the techniques used in fine
heap and traditional min-max heap. The standard operations on this proposed
structure are also presented, and their analysis indicates that the new
structure outperforms the traditional one.
| [
{
"version": "v1",
"created": "Mon, 31 Jul 2000 00:13:17 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Nath",
"Suman Kumar",
""
],
[
"Chowdhury",
"Rezaul Alam",
""
],
[
"Kaykobad",
"M.",
""
]
]
| new_dataset | 0.998654 |
cs/0008010 | Jeff Erickson | Oswin Aichholzer, Carmen Cortes, Erik D. Demaine, Vida Dujmovic, Jeff
Erickson, Henk Meijer, Mark Overmars, Belen Palop, Suneeta Ramaswami, and
Godfried T. Toussaint | Flipturning polygons | 26 pages, 32 figures, see also
http://www.uiuc.edu/~jeffe/pubs/flipturn.html | null | null | null | cs.CG cs.DM math.MG | null | A flipturn is an operation that transforms a nonconvex simple polygon into
another simple polygon, by rotating a concavity 180 degrees around the midpoint
of its bounding convex hull edge. Joss and Shannon proved in 1973 that a
sequence of flipturns eventually transforms any simple polygon into a convex
polygon. This paper describes several new results about such flipturn
sequences. We show that any orthogonal polygon is convexified after at most n-5
arbitrary flipturns, or at most 5(n-4)/6 well-chosen flipturns, improving the
previously best upper bound of (n-1)!/2. We also show that any simple polygon
can be convexified by at most n^2-4n+1 flipturns, generalizing earlier results
of Ahn et al. These bounds depend critically on how degenerate cases are
handled; we carefully explore several possibilities. We describe how to
maintain both a simple polygon and its convex hull in O(log^4 n) time per
flipturn, using a data structure of size O(n). We show that although flipturn
sequences for the same polygon can have very different lengths, the shape and
position of the final convex polygon is the same for all sequences and can be
computed in O(n log n) time. Finally, we demonstrate that finding the longest
convexifying flipturn sequence of a simple polygon is NP-hard.
| [
{
"version": "v1",
"created": "Wed, 16 Aug 2000 04:32:21 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Aichholzer",
"Oswin",
""
],
[
"Cortes",
"Carmen",
""
],
[
"Demaine",
"Erik D.",
""
],
[
"Dujmovic",
"Vida",
""
],
[
"Erickson",
"Jeff",
""
],
[
"Meijer",
"Henk",
""
],
[
"Overmars",
"Mark",
""
],
[
"Palop",
"Belen",
""
],
[
"Ramaswami",
"Suneeta",
""
],
[
"Toussaint",
"Godfried T.",
""
]
]
| new_dataset | 0.991275 |
cs/0008021 | Brian Roark | Mark Johnson and Brian Roark | Compact non-left-recursive grammars using the selective left-corner
transform and factoring | 7 pages, 5 tables, 2 figures | Proceedings of the 18th International Conference on Computational
Linguistics (COLING), 2000, pages 355-361 | null | null | cs.CL | null | The left-corner transform removes left-recursion from (probabilistic)
context-free grammars and unification grammars, permitting simple top-down
parsing techniques to be used. Unfortunately the grammars produced by the
standard left-corner transform are usually much larger than the original. The
selective left-corner transform described in this paper produces a transformed
grammar which simulates left-corner recognition of a user-specified set of the
original productions, and top-down recognition of the others. Combined with two
factorizations, it produces non-left-recursive grammars that are not much
larger than the original.
| [
{
"version": "v1",
"created": "Tue, 22 Aug 2000 15:16:22 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Johnson",
"Mark",
""
],
[
"Roark",
"Brian",
""
]
]
| new_dataset | 0.985142 |
cs/0008025 | David Eppstein | Erik D. Demaine, Martin L. Demaine, and David Eppstein | Phutball Endgames are Hard | 9 pages, 8 figures. Revised to include additional references on the
complexity of checkers | More Games of No Chance, MSRI Publications 42, 2002, pp. 351-360 | null | null | cs.CC cs.GT | null | We show that, in John Conway's board game Phutball (or Philosopher's
Football), it is NP-complete to determine whether the current player has a move
that immediately wins the game. In contrast, the similar problems of
determining whether there is an immediately winning move in checkers, or a move
that kings a man, are both solvable in polynomial time.
| [
{
"version": "v1",
"created": "Wed, 23 Aug 2000 21:56:15 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Jul 2001 18:31:46 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Demaine",
"Erik D.",
""
],
[
"Demaine",
"Martin L.",
""
],
[
"Eppstein",
"David",
""
]
]
| new_dataset | 0.999773 |
cs/0008031 | Masaki Murata | Masaki Murata, Kiyotaka Uchimoto, Qing Ma, Hitoshi Isahara | Bunsetsu Identification Using Category-Exclusive Rules | 7 pages. Computation and Language | COLING'2000, Saarbrucken, Germany, August, 2000 | null | null | cs.CL | null | This paper describes two new bunsetsu identification methods using supervised
learning. Since Japanese syntactic analysis is usually done after bunsetsu
identification, bunsetsu identification is important for analyzing Japanese
sentences. In experiments comparing the four previously available
machine-learning methods (decision tree, maximum-entropy method, example-based
approach and decision list) and two new methods using category-exclusive rules,
the new method using the category-exclusive rules with the highest similarity
performed best.
| [
{
"version": "v1",
"created": "Mon, 28 Aug 2000 08:17:18 GMT"
}
]
| 2007-05-23T00:00:00 | [
[
"Murata",
"Masaki",
""
],
[
"Uchimoto",
"Kiyotaka",
""
],
[
"Ma",
"Qing",
""
],
[
"Isahara",
"Hitoshi",
""
]
]
| new_dataset | 0.988348 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.