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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0804.3881
|
Icius Committee
|
Widyawardana Adiprawita, Adang Suwandi Ahmad, and Jaka Semibiring
|
Automated Flight Test and System Identification for Rotary Wing Small
Aerial Platform using Frequency Responses Analysis
|
Uploaded by ICIUS2007 Conference Organizer on behalf of the
author(s). 7 pages, 15 figures
|
Proceedings of the International Conference on Intelligent
Unmanned System (ICIUS 2007), Bali, Indonesia, October 24-25, 2007, Paper No.
ICIUS2007-A009
| null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes an autopilot system that can be used to control the small
scale rotorcraft during the flight test for linear-frequency-domain system
identification. The input frequency swept is generated automatically as part of
the autopilot control command. Therefore the bandwidth coverage and consistency
of the frequency swept is guaranteed to produce high quality data for system
identification. Beside that we can set the safety parameter during the flight
test (maximum roll or pitch value, minimum altitude, etc) so the safety of the
whole flight test is guaranteed. This autopilot for automated flight test will
be tested using hardware in the loop simulator for hover flight condition.
|
[
{
"version": "v1",
"created": "Thu, 24 Apr 2008 10:07:34 GMT"
}
] | 2008-04-25T00:00:00 |
[
[
"Adiprawita",
"Widyawardana",
""
],
[
"Ahmad",
"Adang Suwandi",
""
],
[
"Semibiring",
"Jaka",
""
]
] |
new_dataset
| 0.994409 |
0804.3507
|
Diego Ruano
|
Fernando Hernando, Diego Ruano
|
Sixteen New Linear Codes With Plotkin Sum
|
Submitted to IEEE Trans. Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sixteen new linear codes are presented: three of them improve the lower
bounds on the minimum distance for a linear code and the rest are an explicit
construction of unknown codes attaining the lower bounds on the minimum
distance. They are constructed using the Plotkin sum of two linear codes, also
called $(u|u+v)$ construction. The computations have been achieved using an
exhaustiv search.
|
[
{
"version": "v1",
"created": "Tue, 22 Apr 2008 11:51:22 GMT"
}
] | 2008-04-23T00:00:00 |
[
[
"Hernando",
"Fernando",
""
],
[
"Ruano",
"Diego",
""
]
] |
new_dataset
| 0.997298 |
0804.3259
|
Rui Zhang
|
Rui Zhang, Mehdi Mohseni, and John M. Cioffi
|
On Multiuser Power Region of Fading Multiple-Access Channel with
Multiple Antennas
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is concerned with the fading MIMO-MAC with multiple receive
antennas at the base station (BS) and multiple transmit antennas at each mobile
terminal (MT). Two multiple-access techniques are considered for scheduling
transmissions from each MT to the BS at the same frequency, which are
space-division multiple-access (SDMA) and time-division multiple-access (TDMA).
For SDMA, all MTs transmit simultaneously to the BS and their individual
signals are resolved at the BS via multiple receive antennas while for TDMA,
each MT transmits independently to the BS during mutually orthogonal time
slots. It is assumed that the channel-state information (CSI) of the fading
channel from each MT to the BS is unknown at each MT transmitter, but is
perfectly known at the BS receiver. Thereby, the BS can acquire the long-term
channel-distribution information (CDI) for each MT. This paper extends the
well-known transmit-covariance feedback scheme for the point-to-point fading
MIMO channel to the fading MIMO-MAC, whereby the BS jointly optimizes the
transmit signal covariance matrices for all MTs based on their CDI, and then
sends each transmit covariance matrix back to the corresponding MT via a
feedback channel. The main goal of this paper is to characterize the so-called
multiuser power region under the multiuser transmit-covariance feedback scheme
for both SDMA and TDMA. The power region is defined as the constitution of all
user transmit power-tuples that can achieve reliable transmissions for a given
set of user target rates. Simulation results show that SDMA can achieve
substantial power savings over TDMA for the fading MIMO-MAC. Moreover, this
paper demonstrates the usefulness of the multiuser power region for maintaining
proportionally-fair power consumption among the MTs.
|
[
{
"version": "v1",
"created": "Mon, 21 Apr 2008 10:13:39 GMT"
}
] | 2008-04-22T00:00:00 |
[
[
"Zhang",
"Rui",
""
],
[
"Mohseni",
"Mehdi",
""
],
[
"Cioffi",
"John M.",
""
]
] |
new_dataset
| 0.996833 |
0706.4161
|
Maurice Margenstern
|
Maurice Margenstern
|
The Domino Problem of the Hyperbolic Plane Is Undecidable
|
18 pages, This is a synthesis of previous deposits
|
The Bulletin of EATCS, 93(Oct.), (2007), 220-237
| null | null |
cs.CG cs.DM
| null |
In this paper, we prove that the general tiling problem of the hyperbolic
plane is undecidable by proving a slightly stronger version using only a
regular polygon as the basic shape of the tiles. The problem was raised by a
paper of Raphael Robinson in 1971, in his famous simplified proof that the
general tiling problem is undecidable for the Euclidean plane, initially proved
by Robert Berger in 1966.
|
[
{
"version": "v1",
"created": "Thu, 28 Jun 2007 09:16:19 GMT"
}
] | 2008-04-19T00:00:00 |
[
[
"Margenstern",
"Maurice",
""
]
] |
new_dataset
| 0.978616 |
0801.1300
|
Igor Razgon
|
Igor Razgon and Barry O'Sullivan
|
Almost 2-SAT is Fixed-Parameter Tractable
|
This new version fixes the bug found by Somnath Sikdar in the proof
of Claim 8. In the repaired version the modification of the Almost 2-SAT
problem called 2-SLASAT is no longer needed and only the modification called
2-ASLASAT remains relevant. Hence the whole manuscript is updated so that the
2-SLASAT problem is not mentioned there anymore
| null | null | null |
cs.DS cs.CG cs.LO
| null |
We consider the following problem. Given a 2-CNF formula, is it possible to
remove at most $k$ clauses so that the resulting 2-CNF formula is satisfiable?
This problem is known to different research communities in Theoretical Computer
Science under the names 'Almost 2-SAT', 'All-but-$k$ 2-SAT', '2-CNF deletion',
'2-SAT deletion'. The status of fixed-parameter tractability of this problem is
a long-standing open question in the area of Parameterized Complexity. We
resolve this open question by proposing an algorithm which solves this problem
in $O(15^k*k*m^3)$ and thus we show that this problem is fixed-parameter
tractable.
|
[
{
"version": "v1",
"created": "Tue, 8 Jan 2008 19:04:14 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Jan 2008 19:24:05 GMT"
},
{
"version": "v3",
"created": "Mon, 18 Feb 2008 15:14:49 GMT"
},
{
"version": "v4",
"created": "Fri, 18 Apr 2008 14:07:04 GMT"
}
] | 2008-04-18T00:00:00 |
[
[
"Razgon",
"Igor",
""
],
[
"O'Sullivan",
"Barry",
""
]
] |
new_dataset
| 0.959686 |
0804.2699
|
Dennis Huo
|
Ian Christopher, Dennis Huo, and Bryan Jacobs
|
A Critique of a Polynomial-time SAT Solver Devised by Sergey Gubin
| null | null | null | null |
cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper refutes the validity of the polynomial-time algorithm for solving
satisfiability proposed by Sergey Gubin. Gubin introduces the algorithm using
3-SAT and eventually expands it to accept a broad range of forms of the Boolean
satisfiability problem. Because 3-SAT is NP-complete, the algorithm would have
implied P = NP, had it been correct. Additionally, this paper refutes the
correctness of his polynomial-time reduction of SAT to 2-SAT.
|
[
{
"version": "v1",
"created": "Wed, 16 Apr 2008 23:00:51 GMT"
}
] | 2008-04-18T00:00:00 |
[
[
"Christopher",
"Ian",
""
],
[
"Huo",
"Dennis",
""
],
[
"Jacobs",
"Bryan",
""
]
] |
new_dataset
| 0.960405 |
0708.2309
|
Dmitri Krioukov
|
Dmitri Krioukov, kc claffy, Kevin Fall, Arthur Brady
|
On Compact Routing for the Internet
|
This is a significantly revised, journal version of cs/0508021
|
ACM SIGCOMM Computer Communication Review (CCR), v.37, n.3,
p.41-52, 2007
|
10.1145/1273445.1273450
| null |
cs.NI
| null |
While there exist compact routing schemes designed for grids, trees, and
Internet-like topologies that offer routing tables of sizes that scale
logarithmically with the network size, we demonstrate in this paper that in
view of recent results in compact routing research, such logarithmic scaling on
Internet-like topologies is fundamentally impossible in the presence of
topology dynamics or topology-independent (flat) addressing. We use analytic
arguments to show that the number of routing control messages per topology
change cannot scale better than linearly on Internet-like topologies. We also
employ simulations to confirm that logarithmic routing table size scaling gets
broken by topology-independent addressing, a cornerstone of popular
locator-identifier split proposals aiming at improving routing scaling in the
presence of network topology dynamics or host mobility. These pessimistic
findings lead us to the conclusion that a fundamental re-examination of
assumptions behind routing models and abstractions is needed in order to find a
routing architecture that would be able to scale ``indefinitely.''
|
[
{
"version": "v1",
"created": "Fri, 17 Aug 2007 02:37:20 GMT"
}
] | 2008-04-16T00:00:00 |
[
[
"Krioukov",
"Dmitri",
""
],
[
"claffy",
"kc",
""
],
[
"Fall",
"Kevin",
""
],
[
"Brady",
"Arthur",
""
]
] |
new_dataset
| 0.999529 |
0804.2058
|
Zhang Shengli
|
Zhang Shengli, Soung chang Liew and Lu Lu
|
Physical Layer Network Coding Over Finite And Infinite Fields
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Direct application of network coding at the physical layer - physical layer
network coding (PNC) - is a promising technique for two-way relay wireless
networks. In a two-way relay network, relay nodes are used to relay two-way
information flows between pairs of end nodes. This paper proposes a precise
definition for PNC. Specifically, in PNC, a relay node does not decode the
source information from the two ends separately, but rather directly maps the
combined signals received simultaneously to a signal to be relayed. Based on
this definition, PNC can be further sub-classed into two categories - PNCF (PNC
over finite field) and PNCI (PNC over infinite field) - according to whether
the network-code field (or groups, rings) adopted is finite or infinite. For
each of PNCF and PNCI, we consider two specific estimation techniques for
dealing with noise in the mapping process. The performance of the four schemes
is investigated by means of analysis and simulation, assuming symbol-level
synchronization only.
|
[
{
"version": "v1",
"created": "Sun, 13 Apr 2008 11:43:24 GMT"
}
] | 2008-04-15T00:00:00 |
[
[
"Shengli",
"Zhang",
""
],
[
"Liew",
"Soung chang",
""
],
[
"Lu",
"Lu",
""
]
] |
new_dataset
| 0.998778 |
0802.3437
|
Yuri Borissov Ph.D.
|
Yuri L. Borissov
|
On Cusick-Cheon's Conjecture About Balanced Boolean Functions in the
Cosets of the Binary Reed-Muller Code
|
3 pages, Submitted to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is proved an amplification of Cusick-Cheon's conjecture on balanced
Boolean functions in the cosets of the binary Reed-Muller code RM(k,m) of order
k and length 2^m, in the cases where k = 1 or k >= (m-1)/2.
|
[
{
"version": "v1",
"created": "Sat, 23 Feb 2008 11:08:06 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Apr 2008 09:17:12 GMT"
}
] | 2008-04-14T00:00:00 |
[
[
"Borissov",
"Yuri L.",
""
]
] |
new_dataset
| 0.99964 |
cs/0601009
|
Tobias Koch
|
Tobias Koch, Amos Lapidoth
|
Gaussian Fading is the Worst Fading
|
Presented at the IEEE International Symposium on Information Theory
(ISIT) 2006; replaced with version that appears in the proceedings
| null | null | null |
cs.IT math.IT
| null |
The capacity of peak-power limited, single-antenna, non-coherent, flat-fading
channels with memory is considered. The emphasis is on the capacity pre-log,
i.e., on the limiting ratio of channel capacity to the logarithm of the
signal-to-noise ratio (SNR), as the SNR tends to infinity. It is shown that,
among all stationary and ergodic fading processes of a given spectral
distribution function whose law has no mass point at zero, the Gaussian process
gives rise to the smallest pre-log.
|
[
{
"version": "v1",
"created": "Thu, 5 Jan 2006 18:47:49 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Apr 2008 12:33:46 GMT"
}
] | 2008-04-14T00:00:00 |
[
[
"Koch",
"Tobias",
""
],
[
"Lapidoth",
"Amos",
""
]
] |
new_dataset
| 0.976731 |
cs/0510070
|
Desmond Lun
|
Desmond S. Lun, Muriel Medard, Ralf Koetter, Michelle Effros
|
On Coding for Reliable Communication over Packet Networks
|
33 pages, 6 figures; revised appendix
|
Physical Communication, vol. 1, no. 1, pp. 3-20, March 2008.
|
10.1016/j.phycom.2008.01.006
| null |
cs.IT cs.NI math.IT
| null |
We present a capacity-achieving coding scheme for unicast or multicast over
lossy packet networks. In the scheme, intermediate nodes perform additional
coding yet do not decode nor even wait for a block of packets before sending
out coded packets. Rather, whenever they have a transmission opportunity, they
send out coded packets formed from random linear combinations of previously
received packets. All coding and decoding operations have polynomial
complexity.
We show that the scheme is capacity-achieving as long as packets received on
a link arrive according to a process that has an average rate. Thus, packet
losses on a link may exhibit correlation in time or with losses on other links.
In the special case of Poisson traffic with i.i.d. losses, we give error
exponents that quantify the rate of decay of the probability of error with
coding delay. Our analysis of the scheme shows that it is not only
capacity-achieving, but that the propagation of packets carrying "innovative"
information follows the propagation of jobs through a queueing network, and
therefore fluid flow models yield good approximations. We consider networks
with both lossy point-to-point and broadcast links, allowing us to model both
wireline and wireless packet networks.
|
[
{
"version": "v1",
"created": "Sun, 23 Oct 2005 22:42:43 GMT"
},
{
"version": "v2",
"created": "Tue, 2 May 2006 14:27:13 GMT"
},
{
"version": "v3",
"created": "Tue, 2 Jan 2007 22:20:04 GMT"
}
] | 2008-04-11T00:00:00 |
[
[
"Lun",
"Desmond S.",
""
],
[
"Medard",
"Muriel",
""
],
[
"Koetter",
"Ralf",
""
],
[
"Effros",
"Michelle",
""
]
] |
new_dataset
| 0.995887 |
0804.1490
|
Jean-Claude Belfiore
|
Maya Badr and Jean-Claude Belfiore
|
Distributed Space-Time Block Codes for the MIMO Multiple Access Channel
|
5 pages, 6 figures, accepted to ISIT 2008
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, the Multiple transmit antennas Multiple Access Channel is
considered. A construction of a family of distributed space-time codes for this
channel is proposed. No Channel Side Information at the transmitters is assumed
and users are not allowed to cooperate together. It is shown that the proposed
code achieves the Diversity Multiplexing Tradeoff of the channel. As an
example, we consider the two-user MIMO-MAC channel. Simulation results show the
significant gain offered by the new coding scheme compared to an orthogonal
transmission scheme, e.g. time sharing.
|
[
{
"version": "v1",
"created": "Wed, 9 Apr 2008 14:13:28 GMT"
}
] | 2008-04-10T00:00:00 |
[
[
"Badr",
"Maya",
""
],
[
"Belfiore",
"Jean-Claude",
""
]
] |
new_dataset
| 0.999392 |
0804.1493
|
Jean-Claude Belfiore
|
Maya Badr and Jean-Claude Belfiore
|
Distributed Space Time Codes for the Amplify-and-Forward Multiple-Access
Relay Channel
|
5 pages, 7 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we present a construction of a family of space-time block codes
for a Multi-Access Amplify-and- Forward Relay channel with two users and a
single half-duplex relay. It is assumed that there is no Channel Side
Information at the transmitters and that they are not allowed to cooperate
together. Using the Diversity Multiplexing Tradeoff as a tool to evaluate the
performance, we prove that the proposed scheme is optimal in some sense.
Moreover, we provide numerical results which show that the new scheme
outperforms the orthogonal transmission scheme, e. g. time sharing and offers a
significant gain.
|
[
{
"version": "v1",
"created": "Wed, 9 Apr 2008 14:34:41 GMT"
}
] | 2008-04-10T00:00:00 |
[
[
"Badr",
"Maya",
""
],
[
"Belfiore",
"Jean-Claude",
""
]
] |
new_dataset
| 0.999702 |
0804.0980
|
Ananthanarayanan Chockalingam
|
K. Vishnu Vardhan, Saif K. Mohammed, A. Chockalingam, and B. Sundar
Rajan
|
Large MIMO Detection: A Low-Complexity Detector at High Spectral
Efficiencies
|
Parts of this paper appeared in IEEE JSAC Special Issue on Multiuser
Detection in Advanced Communication Systems and Networks, vol. 26, no. 3, pp.
473-485, April 2008, and accepted in IEEE ICC'2008
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider large MIMO systems, where by `{\em large}' we mean number of
transmit and receive antennas of the order of tens to hundreds. Such large MIMO
systems will be of immense interest because of the very high spectral
efficiencies possible in such systems. We present a low-complexity detector
which achieves uncoded near-exponential diversity performance for hundreds of
antennas (i.e., achieves near SISO AWGN performance in a large MIMO fading
environment) with an average per-bit complexity of just $O(N_tN_r)$, where
$N_t$ and $N_r$ denote the number of transmit and receive antennas,
respectively. With an outer turbo code, the proposed detector achieves good
coded bit error performance as well. For example, in a 600 transmit and 600
receive antennas V-BLAST system with a high spectral efficiency of 200 bps/Hz
(using BPSK and rate-1/3 turbo code), our simulation results show that the
proposed detector performs close to within about 4.6 dB from theoretical
capacity. We also adopt the proposed detector for the low-complexity decoding
of high-rate non-orthogonal space-time block codes (STBC) from division
algebras (DA). For example, we have decoded the $16\times 16$ full-rate
non-orthogonal STBC from DA using the proposed detector and show that it
performs close to within about 5.5 dB of the capacity using 4-QAM and rate-3/4
turbo code at a spectral efficiency of 24 bps/Hz. The practical feasibility of
the proposed high-performance low-complexity detector could potentially trigger
wide interest in the implementation of large MIMO systems. In large MC-CDMA
systems with hundreds of users, the proposed detector is shown to achieve near
single-user performance at an average per-bit complexity linear in number of
users, which is quite appealing for its use in practical CDMA systems.
|
[
{
"version": "v1",
"created": "Mon, 7 Apr 2008 08:50:23 GMT"
}
] | 2008-04-08T00:00:00 |
[
[
"Vardhan",
"K. Vishnu",
""
],
[
"Mohammed",
"Saif K.",
""
],
[
"Chockalingam",
"A.",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.992658 |
0804.0986
|
Sebastien Collette
|
Zachary Abel, David Charlton, Sebastien Collette, Erik D. Demaine,
Martin L. Demaine, Stefan Langerman, Joseph O'Rourke, Val Pinciu and Godfried
Toussaint
|
Cauchy's Arm Lemma on a Growing Sphere
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a variant of Cauchy's Lemma, proving that when a convex chain on
one sphere is redrawn (with the same lengths and angles) on a larger sphere,
the distance between its endpoints increases. The main focus of this work is a
comparison of three alternate proofs, to show the links between Toponogov's
Comparison Theorem, Legendre's Theorem and Cauchy's Arm Lemma.
|
[
{
"version": "v1",
"created": "Mon, 7 Apr 2008 08:49:47 GMT"
}
] | 2008-04-08T00:00:00 |
[
[
"Abel",
"Zachary",
""
],
[
"Charlton",
"David",
""
],
[
"Collette",
"Sebastien",
""
],
[
"Demaine",
"Erik D.",
""
],
[
"Demaine",
"Martin L.",
""
],
[
"Langerman",
"Stefan",
""
],
[
"O'Rourke",
"Joseph",
""
],
[
"Pinciu",
"Val",
""
],
[
"Toussaint",
"Godfried",
""
]
] |
new_dataset
| 0.999372 |
0804.0659
|
Boris Skoric
|
Boris Skoric
|
Steganography from weak cryptography
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a problem setting which we call ``the freedom fighters'
problem''. It subtly differs from the prisoners' problem. We propose a
steganographic method that allows Alice and Bob to fool Wendy the warden in
this setting. Their messages are hidden in encryption keys. The recipient has
no prior knowledge of these keys, and has to cryptanalyze ciphertexts in order
to recover them. We show an example of the protocol and give a partial security
analysis.
|
[
{
"version": "v1",
"created": "Fri, 4 Apr 2008 07:50:44 GMT"
}
] | 2008-04-07T00:00:00 |
[
[
"Skoric",
"Boris",
""
]
] |
new_dataset
| 0.952369 |
0802.4325
|
Mirela Damian
|
Mirela Damian
|
A Simple Yao-Yao-Based Spanner of Bounded Degree
|
7 pages, 5 figures
| null | null | null |
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is a standing open question to decide whether the Yao-Yao structure for
unit disk graphs (UDGs) is a length spanner of not. This question is highly
relevant to the topology control problem for wireless ad hoc networks. In this
paper we make progress towards resolving this question by showing that the
Yao-Yao structure is a length spanner for UDGs of bounded aspect ratio. We also
propose a new local algorithm, called Yao-Sparse-Sink, based on the Yao-Sink
method introduced by Li, Wan, Wang and Frieder, that computes a (1+e)-spanner
of bounded degree for a given UDG and for given e > 0. The Yao-Sparse-Sink
method enables an efficient local computation of sparse sink trees. Finally, we
show that all these structures for UDGs -- Yao, Yao-Yao, Yao-Sink and
Yao-Sparse-Sink -- have arbitrarily large weight.
|
[
{
"version": "v1",
"created": "Fri, 29 Feb 2008 14:39:59 GMT"
},
{
"version": "v2",
"created": "Fri, 4 Apr 2008 14:40:40 GMT"
}
] | 2008-04-04T00:00:00 |
[
[
"Damian",
"Mirela",
""
]
] |
new_dataset
| 0.997432 |
0804.0539
|
Valentin Savin
|
Ghassan M. Kraidy, Valentin Savin
|
Irregular turbo code design for the binary erasure channel
|
6 pages, submitted Turbo-Symposium 2008
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, the design of irregular turbo codes for the binary erasure
channel is investigated. An analytic expression of the erasure probability of
punctured recursive systematic convolutional codes is derived. This exact
expression will be used to track the density evolution of turbo codes over the
erasure channel, that will allow for the design of capacity-approaching
irregular turbo codes. Next, we propose a graph-optimal interleaver for
irregular turbo codes. Simulation results for different coding rates is shown
at the end.
|
[
{
"version": "v1",
"created": "Thu, 3 Apr 2008 12:31:08 GMT"
}
] | 2008-04-04T00:00:00 |
[
[
"Kraidy",
"Ghassan M.",
""
],
[
"Savin",
"Valentin",
""
]
] |
new_dataset
| 0.997364 |
cs/0610027
|
Ranko Lazic
|
Stephane Demri and Ranko Lazic
|
LTL with the Freeze Quantifier and Register Automata
|
29 pages
| null | null | null |
cs.LO cs.CC
| null |
A data word is a sequence of pairs of a letter from a finite alphabet and an
element from an infinite set, where the latter can only be compared for
equality. To reason about data words, linear temporal logic is extended by the
freeze quantifier, which stores the element at the current word position into a
register, for equality comparisons deeper in the formula. By translations from
the logic to alternating automata with registers and then to faulty counter
automata whose counters may erroneously increase at any time, and from faulty
and error-free counter automata to the logic, we obtain a complete complexity
table for logical fragments defined by varying the set of temporal operators
and the number of registers. In particular, the logic with future-time
operators and 1 register is decidable but not primitive recursive over finite
data words. Adding past-time operators or 1 more register, or switching to
infinite data words, cause undecidability.
|
[
{
"version": "v1",
"created": "Thu, 5 Oct 2006 15:47:22 GMT"
},
{
"version": "v2",
"created": "Wed, 13 Feb 2008 17:52:00 GMT"
},
{
"version": "v3",
"created": "Thu, 3 Apr 2008 16:31:15 GMT"
}
] | 2008-04-03T00:00:00 |
[
[
"Demri",
"Stephane",
""
],
[
"Lazic",
"Ranko",
""
]
] |
new_dataset
| 0.999884 |
0804.0074
|
Jaap-Henk Hoepman
|
Jaap-Henk Hoepman
|
Private Handshakes
| null |
n F. Stajano, editor, 4th Eur. Symp. on Security and Privacy in Ad
hoc and Sensor Networks, LNCS 4572, pages 31-42, Cambridge, UK, June 2-3 2007
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Private handshaking allows pairs of users to determine which (secret) groups
they are both a member of. Group membership is kept secret to everybody else.
Private handshaking is a more private form of secret handshaking, because it
does not allow the group administrator to trace users. We extend the original
definition of a handshaking protocol to allow and test for membership of
multiple groups simultaneously. We present simple and efficient protocols for
both the single group and multiple group membership case.
Private handshaking is a useful tool for mutual authentication, demanded by
many pervasive applications (including RFID) for privacy. Our implementations
are efficient enough to support such usually resource constrained scenarios.
|
[
{
"version": "v1",
"created": "Tue, 1 Apr 2008 06:01:53 GMT"
}
] | 2008-04-02T00:00:00 |
[
[
"Hoepman",
"Jaap-Henk",
""
]
] |
new_dataset
| 0.99038 |
cs/0608068
|
Ke Liu
|
Ke Liu, Nael Abu-Ghazaleh
|
The Aligned-Coordinated Geographical Routing for Multihop Wireless
Networks
| null |
ijsnet 2008
| null | null |
cs.NI cs.DC
| null |
The stateless, low overhead and distributed nature of the Geographic routing
protocols attract a lot of research attentions recently. Since the geographic
routing would face void problems, leading to complementary routing such as
perimeter routing which degrades the performance of geographic routing, most
research works are focus on optimizing this complementary part of geographic
routing to improve it. The greedy forwarding part of geographic routing
provides an optimal routing performance in terms of path stretch. If the
geographic routing could adapt the greedy forwarding more, its performance
would be enhanced much more than to optimize the complementary routing such as
perimeter routings. Our work is the first time to do so. The aligned physical
coordinate is used to do the greedy forwarding routing decision which would
lead more greedy forwarding. We evaluate our design to most geographic routing
protocols, showing it helps much and maintain the stateless nature of
geographic routing.
|
[
{
"version": "v1",
"created": "Wed, 16 Aug 2006 17:06:37 GMT"
}
] | 2008-03-28T00:00:00 |
[
[
"Liu",
"Ke",
""
],
[
"Abu-Ghazaleh",
"Nael",
""
]
] |
new_dataset
| 0.99826 |
cs/0608069
|
Ke Liu
|
Ke Liu, Nael Abu-Ghazaleh, Kyoung-Don Kang
|
JiTS: Just-in-Time Scheduling for Real-Time Sensor Data Dissemination
| null |
PerCom 2006
| null | null |
cs.NI cs.DC cs.PF
| null |
We consider the problem of real-time data dissemination in wireless sensor
networks, in which data are associated with deadlines and it is desired for
data to reach the sink(s) by their deadlines. To this end, existing real-time
data dissemination work have developed packet scheduling schemes that
prioritize packets according to their deadlines. In this paper, we first
demonstrate that not only the scheduling discipline but also the routing
protocol has a significant impact on the success of real-time sensor data
dissemination. We show that the shortest path routing using the minimum number
of hops leads to considerably better performance than Geographical Forwarding,
which has often been used in existing real-time data dissemination work. We
also observe that packet prioritization by itself is not enough for real-time
data dissemination, since many high priority packets may simultaneously contend
for network resources, deteriorating the network performance. Instead,
real-time packets could be judiciously delayed to avoid severe contention as
long as their deadlines can be met. Based on this observation, we propose a
Just-in-Time Scheduling (JiTS) algorithm for scheduling data transmissions to
alleviate the shortcomings of the existing solutions. We explore several
policies for non-uniformly delaying data at different intermediate nodes to
account for the higher expected contention as the packet gets closer to the
sink(s). By an extensive simulation study, we demonstrate that JiTS can
significantly improve the deadline miss ratio and packet drop ratio compared to
existing approaches in various situations. Notably, JiTS improves the
performance requiring neither lower layer support nor synchronization among the
sensor nodes.
|
[
{
"version": "v1",
"created": "Wed, 16 Aug 2006 17:21:40 GMT"
}
] | 2008-03-28T00:00:00 |
[
[
"Liu",
"Ke",
""
],
[
"Abu-Ghazaleh",
"Nael",
""
],
[
"Kang",
"Kyoung-Don",
""
]
] |
new_dataset
| 0.957781 |
0803.3658
|
Yeow Meng Chee
|
Yeow Meng Chee, Son Hoang Dau, Alan C. H. Ling, and San Ling
|
The Sizes of Optimal q-Ary Codes of Weight Three and Distance Four: A
Complete Solution
|
5 pages
|
IEEE Transactions on Information Theory, vol. 54, no. 3, pp.
1291-1295, 2008
|
10.1109/TIT.2007.915885
| null |
cs.IT cs.DM math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This correspondence introduces two new constructive techniques to complete
the determination of the sizes of optimal q-ary codes of constant weight three
and distance four.
|
[
{
"version": "v1",
"created": "Wed, 26 Mar 2008 02:33:51 GMT"
}
] | 2008-03-27T00:00:00 |
[
[
"Chee",
"Yeow Meng",
""
],
[
"Dau",
"Son Hoang",
""
],
[
"Ling",
"Alan C. H.",
""
],
[
"Ling",
"San",
""
]
] |
new_dataset
| 0.999603 |
0803.3670
|
Mathew Francis
|
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
|
On the cubicity of AT-free graphs and circular-arc graphs
|
9 pages, 0 figures
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A unit cube in $k$ dimensions ($k$-cube) is defined as the the Cartesian
product $R_1\times R_2\times...\times R_k$ where $R_i$(for $1\leq i\leq k$) is
a closed interval of the form $[a_i,a_i+1]$ on the real line. A graph $G$ on
$n$ nodes is said to be representable as the intersection of $k$-cubes (cube
representation in $k$ dimensions) if each vertex of $G$ can be mapped to a
$k$-cube such that two vertices are adjacent in $G$ if and only if their
corresponding $k$-cubes have a non-empty intersection. The \emph{cubicity} of
$G$ denoted as $\cubi(G)$ is the minimum $k$ for which $G$ can be represented
as the intersection of $k$-cubes.
We give an $O(bw\cdot n)$ algorithm to compute the cube representation of a
general graph $G$ in $bw+1$ dimensions given a bandwidth ordering of the
vertices of $G$, where $bw$ is the \emph{bandwidth} of $G$. As a consequence,
we get $O(\Delta)$ upper bounds on the cubicity of many well-known graph
classes such as AT-free graphs, circular-arc graphs and co-comparability graphs
which have $O(\Delta)$ bandwidth. Thus we have: 1) $\cubi(G)\leq 3\Delta-1$, if
$G$ is an AT-free graph. 2) $\cubi(G)\leq 2\Delta+1$, if $G$ is a circular-arc
graph. 3) $\cubi(G)\leq 2\Delta$, if $G$ is a co-comparability graph. Also for
these graph classes, there are constant factor approximation algorithms for
bandwidth computation that generate orderings of vertices with $O(\Delta)$
width. We can thus generate the cube representation of such graphs in
$O(\Delta)$ dimensions in polynomial time.
|
[
{
"version": "v1",
"created": "Wed, 26 Mar 2008 07:11:20 GMT"
}
] | 2008-03-27T00:00:00 |
[
[
"Chandran",
"L. Sunil",
""
],
[
"Francis",
"Mathew C.",
""
],
[
"Sivadasan",
"Naveen",
""
]
] |
new_dataset
| 0.984884 |
0803.3435
|
Tomas Rokicki
|
Tomas Rokicki
|
Twenty-Five Moves Suffice for Rubik's Cube
| null | null | null | null |
cs.SC cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
How many moves does it take to solve Rubik's Cube? Positions are known that
require 20 moves, and it has already been shown that there are no positions
that require 27 or more moves; this is a surprisingly large gap. This paper
describes a program that is able to find solutions of length 20 or less at a
rate of more than 16 million positions a second. We use this program, along
with some new ideas and incremental improvements in other techniques, to show
that there is no position that requires 26 moves.
|
[
{
"version": "v1",
"created": "Mon, 24 Mar 2008 19:37:09 GMT"
}
] | 2008-03-25T00:00:00 |
[
[
"Rokicki",
"Tomas",
""
]
] |
new_dataset
| 0.979445 |
0708.2804
|
Yi Hong Dr
|
Ezio Biglieri, Yi Hong, Emanuele Viterbo
|
On Fast-Decodable Space-Time Block Codes
|
submitted to IEEE trans IT
| null | null | null |
cs.IT math.IT
| null |
We focus on full-rate, fast-decodable space-time block codes (STBCs) for 2x2
and 4x2 multiple-input multiple-output (MIMO) transmission. We first derive
conditions for reduced-complexity maximum-likelihood decoding, and apply them
to a unified analysis of two families of 2x2 STBCs that were recently proposed.
In particular, we describe a reduced-complexity sphere decoding algorithm
suitable for QAM signal constellations. Next, we derive a novel
reduced-complexity 4x2 STBC, and show that it outperforms all previously known
codes with certain constellations.
|
[
{
"version": "v1",
"created": "Tue, 21 Aug 2007 10:57:59 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Mar 2008 14:58:25 GMT"
}
] | 2008-03-18T00:00:00 |
[
[
"Biglieri",
"Ezio",
""
],
[
"Hong",
"Yi",
""
],
[
"Viterbo",
"Emanuele",
""
]
] |
new_dataset
| 0.994747 |
0803.0845
|
Evain Laurent
|
Laurent Evain
|
Knapsack cryptosystems built on NP-hard instance
|
20 pages
| null | null | null |
cs.CR cs.CC cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We construct three public key knapsack cryptosystems. Standard knapsack
cryptosystems hide easy instances of the knapsack problem and have been broken.
The systems considered in the article face this problem: They hide a random
(possibly hard) instance of the knapsack problem. We provide both complexity
results (size of the key, time needed to encypher/decypher...) and experimental
results. Security results are given for the second cryptosystem (the fastest
one and the one with the shortest key). Probabilistic polynomial reductions
show that finding the private key is as difficult as factorizing a product of
two primes. We also consider heuristic attacks. First, the density of the
cryptosystem can be chosen arbitrarily close to one, discarding low density
attacks. Finally, we consider explicit heuristic attacks based on the LLL
algorithm and we prove that with respect to these attacks, the public key is as
secure as a random key.
|
[
{
"version": "v1",
"created": "Thu, 6 Mar 2008 12:20:35 GMT"
}
] | 2008-03-17T00:00:00 |
[
[
"Evain",
"Laurent",
""
]
] |
new_dataset
| 0.995377 |
0803.1716
|
Lokman Meho
|
Lokman I. Meho and Yvonne Rogers
|
Citation Counting, Citation Ranking, and h-Index of Human-Computer
Interaction Researchers: A Comparison between Scopus and Web of Science
|
35 pages, 9 tables, 3 figures, accepted for publication in the
Journal of the American Society for Information Science and Technology
| null | null | null |
cs.HC cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This study examines the differences between Scopus and Web of Science in the
citation counting, citation ranking, and h-index of 22 top human-computer
interaction (HCI) researchers from EQUATOR--a large British Interdisciplinary
Research Collaboration project. Results indicate that Scopus provides
significantly more coverage of HCI literature than Web of Science, primarily
due to coverage of relevant ACM and IEEE peer-reviewed conference proceedings.
No significant differences exist between the two databases if citations in
journals only are compared. Although broader coverage of the literature does
not significantly alter the relative citation ranking of individual
researchers, Scopus helps distinguish between the researchers in a more nuanced
fashion than Web of Science in both citation counting and h-index. Scopus also
generates significantly different maps of citation networks of individual
scholars than those generated by Web of Science. The study also presents a
comparison of h-index scores based on Google Scholar with those based on the
union of Scopus and Web of Science. The study concludes that Scopus can be used
as a sole data source for citation-based research and evaluation in HCI,
especially if citations in conference proceedings are sought and that h scores
should be manually calculated instead of relying on system calculations.
|
[
{
"version": "v1",
"created": "Wed, 12 Mar 2008 08:09:19 GMT"
}
] | 2008-03-13T00:00:00 |
[
[
"Meho",
"Lokman I.",
""
],
[
"Rogers",
"Yvonne",
""
]
] |
new_dataset
| 0.977116 |
0803.1751
|
Grenville Croll
|
John Nash, Andy Adler, Neil Smith
|
TellTable Spreadsheet Audit: from Technical Possibility to Operating
Prototype
|
11 pages
|
Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2004
45-55ISBN 1 902724 94 1
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
At the 2003 EuSpRIG meeting, we presented a framework and software
infrastructure to generate and analyse an audit trail for a spreadsheet file.
This report describes the results of a pilot implementation of this software
(now called TellTable; see www.telltable.com), along with developments in the
server infrastructure and availability, extensions to other "Office Suite"
files, integration of the audit tool into the server interface, and related
developments, licensing and reports. We continue to seek collaborators and
partners in what is primarily an open-source project with some shared-source
components.
|
[
{
"version": "v1",
"created": "Wed, 12 Mar 2008 11:36:41 GMT"
}
] | 2008-03-13T00:00:00 |
[
[
"Nash",
"John",
""
],
[
"Adler",
"Andy",
""
],
[
"Smith",
"Neil",
""
]
] |
new_dataset
| 0.971687 |
0803.1807
|
Valentin Savin
|
Ghassan M. Kraidy and Valentin Savin
|
Minimum-Delay Decoding of Turbo-Codes for Upper-Layer FEC
|
5 pages, submitted SPAWC08
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we investigate the decoding of parallel turbo codes over the
binary erasure channel suited for upper-layer error correction. The proposed
algorithm performs on-the-fly decoding, i.e. it starts decoding as soon as the
first symbols are received. This algorithm compares with the iterative decoding
of codes defined on graphs, in that it propagates in the trellises of the turbo
code by removing transitions in the same way edges are removed in a bipartite
graph under message-passing decoding. Performance comparison with LDPC codes
for different coding rates is shown.
|
[
{
"version": "v1",
"created": "Wed, 12 Mar 2008 16:22:28 GMT"
}
] | 2008-03-13T00:00:00 |
[
[
"Kraidy",
"Ghassan M.",
""
],
[
"Savin",
"Valentin",
""
]
] |
new_dataset
| 0.994578 |
0706.3523
|
Olivier Finkel
|
Dominique Lecomte (UMR 7586), Olivier Finkel (LIP)
|
There Exist some Omega-Powers of Any Borel Rank
|
To appear in the Proceedings of the 16th EACSL Annual Conference on
Computer Science and Logic, CSL 2007, Lausanne, Switzerland, September 11-15,
2007, Lecture Notes in Computer Science, (c) Springer, 2007
|
Dans Proceedings of the 16th EACSL Annual Conference on Computer
Science and Logic, CSL 2007, - 16th EACSL Annual Conference on Computer
Science and Logic, CSL 2007, September 11-15, 2007, Lausanne : Suisse
| null | null |
cs.LO cs.CC math.LO
| null |
Omega-powers of finitary languages are languages of infinite words
(omega-languages) in the form V^omega, where V is a finitary language over a
finite alphabet X. They appear very naturally in the characterizaton of regular
or context-free omega-languages. Since the set of infinite words over a finite
alphabet X can be equipped with the usual Cantor topology, the question of the
topological complexity of omega-powers of finitary languages naturally arises
and has been posed by Niwinski (1990), Simonnet (1992) and Staiger (1997). It
has been recently proved that for each integer n > 0, there exist some
omega-powers of context free languages which are Pi^0_n-complete Borel sets,
that there exists a context free language L such that L^omega is analytic but
not Borel, and that there exists a finitary language V such that V^omega is a
Borel set of infinite rank. But it was still unknown which could be the
possible infinite Borel ranks of omega-powers. We fill this gap here, proving
the following very surprising result which shows that omega-powers exhibit a
great topological complexity: for each non-null countable ordinal alpha, there
exist some Sigma^0_alpha-complete omega-powers, and some Pi^0_alpha-complete
omega-powers.
|
[
{
"version": "v1",
"created": "Mon, 25 Jun 2007 16:03:36 GMT"
}
] | 2008-03-12T00:00:00 |
[
[
"Lecomte",
"Dominique",
"",
"UMR 7586"
],
[
"Finkel",
"Olivier",
"",
"LIP"
]
] |
new_dataset
| 0.999189 |
0803.1500
|
Dean Krafft
|
Dean B. Krafft, Aaron Birkland, Ellen J. Cramer
|
NCore: Architecture and Implementation of a Flexible, Collaborative
Digital Library
|
11 pages, to appear in JCDL 2008
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
NCore is an open source architecture and software platform for creating
flexible, collaborative digital libraries. NCore was developed by the National
Science Digital Library (NSDL) project, and it serves as the central technical
infrastructure for NSDL. NCore consists of a central Fedora-based digital
repository, a specific data model, an API, and a set of backend services and
frontend tools that create a new model for collaborative, contributory digital
libraries. This paper describes NCore, presents and analyzes its architecture,
tools and services; and reports on the experience of NSDL in building and
operating a major digital library on it over the past year and the experience
of the Digital Library for Earth Systems Education in porting their existing
digital library and tools to the NCore platform.
|
[
{
"version": "v1",
"created": "Mon, 10 Mar 2008 21:06:31 GMT"
}
] | 2008-03-12T00:00:00 |
[
[
"Krafft",
"Dean B.",
""
],
[
"Birkland",
"Aaron",
""
],
[
"Cramer",
"Ellen J.",
""
]
] |
new_dataset
| 0.992503 |
0803.1217
|
Li Chen
|
Li Chen
|
Hsiao-Code Check Matrices and Recursively Balanced Matrices
|
8 pages
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The key step of generating the well-known Hsiao code is to construct a
{0,1}-check-matrix in which each column contains the same odd-number of 1's and
each row contains the same number of 1's or differs at most by one for the
number of 1's. We also require that no two columns are identical in the matrix.
The author solved this problem in 1986 by introducing a type of recursively
balanced matrices. However, since the paper was published in Chinese, the
solution for such an important problem was not known by international
researchers in coding theory. In this note, we focus on how to practically
generate the check matrix of Hsiao codes. We have modified the original
algorithm to be more efficient and effective. We have also corrected an error
in algorithm analysis presented in the earlier paper. The result shows that the
algorithm attained optimum in average cases if a divide-and-conquer technique
must be involved in the algorithm.
|
[
{
"version": "v1",
"created": "Sat, 8 Mar 2008 06:00:03 GMT"
}
] | 2008-03-11T00:00:00 |
[
[
"Chen",
"Li",
""
]
] |
new_dataset
| 0.998946 |
0710.0871
|
Grenville Croll
|
Grenville J. Croll, Raymond J. Butler
|
Spreadsheets in Clinical Medicine
|
10 Pages including references
|
Proc. European Spreadsheet Risks Int. Grp. 2006 7-16
| null | null |
cs.CY
| null |
There is overwhelming evidence that the continued and widespread use of
untested spreadsheets in business gives rise to regular, significant and
unexpected financial losses. Whilst this is worrying, it is perhaps a
relatively minor concern compared with the risks arising from the use of poorly
constructed and/or untested spreadsheets in medicine, a practice that is
already occurring. This article is intended as a warning that the use of poorly
constructed and/or untested spreadsheets in clinical medicine cannot be
tolerated. It supports this warning by reporting on potentially serious
weaknesses found while testing a limited number of publicly available clinical
spreadsheets.
|
[
{
"version": "v1",
"created": "Wed, 3 Oct 2007 19:23:55 GMT"
}
] | 2008-03-10T00:00:00 |
[
[
"Croll",
"Grenville J.",
""
],
[
"Butler",
"Raymond J.",
""
]
] |
new_dataset
| 0.991678 |
0803.0011
|
Grenville Croll
|
Keith Bishop
|
Qtier-Rapor: Managing Spreadsheet Systems & Improving Corporate
Performance, Compliance and Governance
|
12 Pages, 6 Colour Figures
|
Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2006 33-44
ISBN:1-905617-08-9
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Much of what EuSpRIG discusses is concerned with the integrity of individual
spreadsheets. In businesses, interlocking spreadsheets are regularly used to
fill functional gaps in core administrative systems. The growth and deployment
of such integrated spreadsheet SYSTEMS raises the scale of issues to a whole
new level. The correct management of spreadsheet systems is necessary to ensure
that the business achieves its goals of improved performance and good corporate
governance, within the constraints of legislative compliance - poor management
will deliver the opposite. This paper is an anatomy of the real-life issues of
the commercial use of spreadsheets in business, and demonstrates how
Qtier-Rapor has been used to instil best practice in the use of integrated
commercial spreadsheet systems.
|
[
{
"version": "v1",
"created": "Fri, 29 Feb 2008 21:39:29 GMT"
}
] | 2008-03-10T00:00:00 |
[
[
"Bishop",
"Keith",
""
]
] |
new_dataset
| 0.998353 |
0803.0015
|
Grenville Croll
|
Simon Murphy
|
EuSpRIG 2006 Commercial Spreadsheet Review
|
8 Pages, 9 Colour Diagrams
|
Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2006 45-52
ISBN:1-905617-08-9
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This management summary provides an outline of a commercial spreadsheet
review process. The aim of this process is to ensure remedial or enhancement
work can safely be undertaken on a spreadsheet with a commercially acceptable
level of risk of introducing new errors.
|
[
{
"version": "v1",
"created": "Fri, 29 Feb 2008 21:49:18 GMT"
}
] | 2008-03-10T00:00:00 |
[
[
"Murphy",
"Simon",
""
]
] |
new_dataset
| 0.978586 |
0803.1096
|
Valentin Savin
|
Valentin Savin
|
Algebraic-geometric codes from vector bundles and their decoding
|
5 pages, submitted to ISIT08
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Algebraic-geometric codes can be constructed by evaluating a certain set of
functions on a set of distinct rational points of an algebraic curve. The set
of functions that are evaluated is the linear space of a given divisor or,
equivalently, the set of section of a given line bundle. Using arbitrary rank
vector bundles on algebraic curves, we propose a natural generalization of the
above construction. Our codes can also be seen as interleaved versions of
classical algebraic-geometric codes. We show that the algorithm of Brown,
Minder and Shokrollahi can be extended to this new class of codes and it
corrects any number of errors up to $t^{*} - g/2$, where $t^{*}$ is the
designed correction capacity of the code and $g$ is the curve genus.
|
[
{
"version": "v1",
"created": "Fri, 7 Mar 2008 14:14:10 GMT"
}
] | 2008-03-10T00:00:00 |
[
[
"Savin",
"Valentin",
""
]
] |
new_dataset
| 0.996859 |
0711.0557
|
Takao Inoue
|
Takao Inoue and Robert W. Heath Jr
|
Kerdock Codes for Limited Feedback Precoded MIMO Systems
|
A correction is made in Eq.(22), first matrix S0
| null | null | null |
cs.IT math.IT
| null |
A codebook based limited feedback strategy is a practical way to obtain
partial channel state information at the transmitter in a precoded
multiple-input multiple-output (MIMO) wireless system. Conventional codebook
designs use Grassmannian packing, equiangular frames, vector quantization, or
Fourier based constructions. While the capacity and error rate performance of
conventional codebook constructions have been extensively investigated,
constructing these codebooks is notoriously difficult relying on techniques
such as nonlinear search or iterative algorithms. Further, the resulting
codebooks may not have a systematic structure to facilitate storage of the
codebook and low search complexity. In this paper, we propose a new systematic
codebook design based on Kerdock codes and mutually unbiased bases. The
proposed Kerdock codebook consists of multiple mutually unbiased unitary bases
matrices with quaternary entries and the identity matrix. We propose to derive
the beamforming and precoding codebooks from this base codebook, eliminating
the requirement to store multiple codebooks. The propose structure requires
little memory to store and, as we show, the quaternary structure facilitates
codeword search. We derive the chordal distance for two antenna and four
antenna codebooks, showing that the proposed codebooks compare favorably with
prior designs. Monte Carlo simulations are used to compare achievable rates and
error rates for different codebooks sizes.
|
[
{
"version": "v1",
"created": "Mon, 5 Nov 2007 01:28:35 GMT"
},
{
"version": "v2",
"created": "Fri, 7 Mar 2008 14:35:36 GMT"
}
] | 2008-03-07T00:00:00 |
[
[
"Inoue",
"Takao",
""
],
[
"Heath",
"Robert W.",
"Jr"
]
] |
new_dataset
| 0.999654 |
0803.0632
|
Alexandros Dimakis
|
Alexandros G. Dimakis, P. Brighten Godfrey, Yunnan Wu, Martin J.
Wainwright, Kannan Ramchandran
|
Network Coding for Distributed Storage Systems
| null | null | null |
EECS 14546
|
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed storage systems provide reliable access to data through
redundancy spread over individually unreliable nodes. Application scenarios
include data centers, peer-to-peer storage systems, and storage in wireless
networks. Storing data using an erasure code, in fragments spread across nodes,
requires less redundancy than simple replication for the same level of
reliability. However, since fragments must be periodically replaced as nodes
fail, a key question is how to generate encoded fragments in a distributed way
while transferring as little data as possible across the network.
For an erasure coded system, a common practice to repair from a node failure
is for a new node to download subsets of data stored at a number of surviving
nodes, reconstruct a lost coded block using the downloaded data, and store it
at the new node. We show that this procedure is sub-optimal. We introduce the
notion of regenerating codes, which allow a new node to download
\emph{functions} of the stored data from the surviving nodes. We show that
regenerating codes can significantly reduce the repair bandwidth. Further, we
show that there is a fundamental tradeoff between storage and repair bandwidth
which we theoretically characterize using flow arguments on an appropriately
constructed graph. By invoking constructive results in network coding, we
introduce regenerating codes that can achieve any point in this optimal
tradeoff.
|
[
{
"version": "v1",
"created": "Wed, 5 Mar 2008 11:05:08 GMT"
}
] | 2008-03-06T00:00:00 |
[
[
"Dimakis",
"Alexandros G.",
""
],
[
"Godfrey",
"P. Brighten",
""
],
[
"Wu",
"Yunnan",
""
],
[
"Wainwright",
"Martin J.",
""
],
[
"Ramchandran",
"Kannan",
""
]
] |
new_dataset
| 0.976779 |
0802.4057
|
Andrea Masini
|
Andrea Masini, Luca Vigan\`o, Margherita Zorzi
|
A Qualitative Modal Representation of Quantum Register Transformations
| null | null | null | null |
cs.LO
| null |
We introduce two modal natural deduction systems that are suitable to
represent and reason about transformations of quantum registers in an abstract,
qualitative, way. Quantum registers represent quantum systems, and can be
viewed as the structure of quantum data for quantum operations. Our systems
provide a modal framework for reasoning about operations on quantum registers
(unitary transformations and measurements), in terms of possible worlds (as
abstractions of quantum registers) and accessibility relations between these
worlds. We give a Kripke--style semantics that formally describes quantum
register transformations and prove the soundness and completeness of our
systems with respect to this semantics.
|
[
{
"version": "v1",
"created": "Wed, 27 Feb 2008 17:43:23 GMT"
},
{
"version": "v2",
"created": "Wed, 5 Mar 2008 11:10:41 GMT"
}
] | 2008-03-05T00:00:00 |
[
[
"Masini",
"Andrea",
""
],
[
"Viganò",
"Luca",
""
],
[
"Zorzi",
"Margherita",
""
]
] |
new_dataset
| 0.999807 |
cs/0607118
|
Naohi Eguchi
|
Toshiyasu Arai and Naohi Eguchi
|
A new function algebra of EXPTIME functions by safe nested recursion
| null | null | null | null |
cs.CC
| null |
Bellantoni and Cook have given a function-algebra characterization of the
polynomial-time computable functions via an unbounded recursion scheme which is
called safe recursion. Inspired by their work, we characterize the
exponential-time computable functions with the use of a safe variant of nested
recursion.
|
[
{
"version": "v1",
"created": "Thu, 27 Jul 2006 06:34:53 GMT"
},
{
"version": "v2",
"created": "Wed, 5 Mar 2008 11:55:07 GMT"
}
] | 2008-03-05T00:00:00 |
[
[
"Arai",
"Toshiyasu",
""
],
[
"Eguchi",
"Naohi",
""
]
] |
new_dataset
| 0.988974 |
0803.0053
|
M Sabu THAMPI
|
Sabu M. Thampi, K. Chandra Sekaran
|
Mobile Agents for Content-Based WWW Distributed Image Retrieval
| null | null | null | null |
cs.DC cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
At present, the de-facto standard for providing contents in the Internet is
the World Wide Web. A technology, which is now emerging on the Web, is
Content-Based Image Retrieval (CBIR). CBIR applies methods and algorithms from
computer science to analyse and index images based on their visual content.
Mobile agents push the flexibility of distributed systems to their limits since
not only computations are dynamically distributed but also the code that
performs them. The current commercial applet-based methodologies for accessing
image database systems offer limited flexibility, scalability and robustness.
In this paper the author proposes a new framework for content-based WWW
distributed image retrieval based on Java-based mobile agents. The
implementation of the framework shows that its performance is comparable to,
and in some cases outperforms, the current approach.
|
[
{
"version": "v1",
"created": "Sat, 1 Mar 2008 08:27:59 GMT"
}
] | 2008-03-04T00:00:00 |
[
[
"Thampi",
"Sabu M.",
""
],
[
"Sekaran",
"K. Chandra",
""
]
] |
new_dataset
| 0.99147 |
0803.0197
|
Radu Arsinte
|
Radu Arsinte, Attila Ferencz, Costin Miron
|
DSP Based System for Real time Voice Synthesis Applications Development
|
4 pages, 3 figures, SPECOM' 96 Conference
|
Proceedings of SPECOM' 96 Conference, 1996, St. Petersburg, Russia
| null | null |
cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes an experimental system designed for development of real
time voice synthesis applications. The system is composed from a DSP
coprocessor card, equipped with an TMS320C25 or TMS320C50 chip, voice
acquisition module (ADDA2),host computer (IBM-PC compatible), software specific
tools.
|
[
{
"version": "v1",
"created": "Mon, 3 Mar 2008 09:04:46 GMT"
}
] | 2008-03-04T00:00:00 |
[
[
"Arsinte",
"Radu",
""
],
[
"Ferencz",
"Attila",
""
],
[
"Miron",
"Costin",
""
]
] |
new_dataset
| 0.991885 |
0803.0241
|
Ariel Daliot
|
Ariel Daliot, Danny Dolev, and Hanna Parnas
|
Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker
Networks
|
This is the full and revised version. A previous (obsolete) version
appeared as TR2003-1, The Hebrew University of Jerusalem, 2003
|
In Proceedings of the Sixth Symposium on Self-Stabilizing Systems
(SSS'03), San Francisco, June 2003. See also LNCS 2704
| null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define the ``Pulse Synchronization'' problem that requires nodes to
achieve tight synchronization of regular pulse events, in the settings of
distributed computing systems. Pulse-coupled synchronization is a phenomenon
displayed by a large variety of biological systems, typically overcoming a high
level of noise. Inspired by such biological models, a robust and
self-stabilizing Byzantine pulse synchronization algorithm for distributed
computer systems is presented. The algorithm attains near optimal
synchronization tightness while tolerating up to a third of the nodes
exhibiting Byzantine behavior concurrently. Pulse synchronization has been
previously shown to be a powerful building block for designing algorithms in
this severe fault model. We have previously shown how to stabilize general
Byzantine algorithms, using pulse synchronization. To the best of our knowledge
there is no other scheme to do this without the use of synchronized pulses.
|
[
{
"version": "v1",
"created": "Mon, 3 Mar 2008 13:46:45 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Mar 2008 18:07:32 GMT"
}
] | 2008-03-04T00:00:00 |
[
[
"Daliot",
"Ariel",
""
],
[
"Dolev",
"Danny",
""
],
[
"Parnas",
"Hanna",
""
]
] |
new_dataset
| 0.99463 |
0803.0316
|
Sandor P. Fekete
|
Erik D. Demaine, Martin L. Demaine, Sandor P. Fekete, Mashhood
Ishaque, Eynat Rafalin, Robert T. Schweller and Diane Souvaine
|
Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues
|
22 pages, 15 figures, 1table, PDFLatex; conference version in
Proceedings of the 13th International Meeting on DNA Computing (DNA13), 2007,
pp. 46-55, full version to appear in Natural Computing
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce staged self-assembly of Wang tiles, where tiles can be added
dynamically in sequence and where intermediate constructions can be stored for
later mixing. This model and its various constraints and performance measures
are motivated by a practical nanofabrication scenario through protein-based
bioengineering. Staging allows us to break through the traditional lower bounds
in tile self-assembly by encoding the shape in the staging algorithm instead of
the tiles. All of our results are based on the practical assumption that only a
constant number of glues, and thus only a constant number of tiles, can be
engineered, as each new glue type requires significant biochemical research and
experiments. Under this assumption, traditional tile self-assembly cannot even
manufacture an n*n square; in contrast, we show how staged assembly enables
manufacture of arbitrary orthogonal shapes in a variety of precise formulations
of the model.
|
[
{
"version": "v1",
"created": "Mon, 3 Mar 2008 20:20:52 GMT"
}
] | 2008-03-04T00:00:00 |
[
[
"Demaine",
"Erik D.",
""
],
[
"Demaine",
"Martin L.",
""
],
[
"Fekete",
"Sandor P.",
""
],
[
"Ishaque",
"Mashhood",
""
],
[
"Rafalin",
"Eynat",
""
],
[
"Schweller",
"Robert T.",
""
],
[
"Souvaine",
"Diane",
""
]
] |
new_dataset
| 0.997732 |
0802.4131
|
Sudhakar Sahoo
|
Birendra Kumar Nayak (1), Sudhakar Sahoo (2)
|
Language of Boolean functions its Grammar and Machine
|
5 pages, two tables, presented in Orissa Mathematical Society
Conference, January, 2008
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper an algorithm is designed which generates in-equivalent Boolean
functions of any number of variables from the four Boolean functions of single
variable. The grammar for such set of Boolean function is provided. The Turing
Machine that accepts such set is constructed.
|
[
{
"version": "v1",
"created": "Thu, 28 Feb 2008 06:21:49 GMT"
}
] | 2008-02-29T00:00:00 |
[
[
"Nayak",
"Birendra Kumar",
""
],
[
"Sahoo",
"Sudhakar",
""
]
] |
new_dataset
| 0.992117 |
0802.3974
|
Vladimir Lapshin A
|
Vladimir Lapshin
|
Syntax diagrams as a formalism for representation of syntactic relations
of formal languages
|
10 pages
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The new approach to representation of syntax of formal languages-- a
formalism of syntax diagrams is offered. Syntax diagrams look a convenient
language for the description of syntactic relations in the languages having
nonlinear representation of texts, for example, for representation of syntax
lows of the language of structural chemical formulas. The formalism of
neighbourhood grammar is used to describe the set of correct syntax constructs.
The neighbourhood the grammar consists of a set of families of
"neighbourhoods"-- the diagrams defined for each symbol of the language's
alphabet. The syntax diagram is correct if each symbol is included into this
diagram together with some neighbourhood. In other words, correct diagrams are
needed to be covered by elements of the neighbourhood grammar. Thus, the
grammar of formal language can be represented as system of the covers defined
for each correct syntax diagram.
|
[
{
"version": "v1",
"created": "Wed, 27 Feb 2008 08:59:58 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Feb 2008 09:28:59 GMT"
}
] | 2008-02-28T00:00:00 |
[
[
"Lapshin",
"Vladimir",
""
]
] |
new_dataset
| 0.99817 |
0802.4079
|
Salah A. Aly
|
Salah A. Aly
|
Families of LDPC Codes Derived from Nonprimitive BCH Codes and
Cyclotomic Cosets
|
Private comments are welcome
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Low-density parity check (LDPC) codes are an important class of codes with
many applications. Two algebraic methods for constructing regular LDPC codes
are derived -- one based on nonprimitive narrow-sense BCH codes and the other
directly based on cyclotomic cosets. The constructed codes have high rates and
are free of cycles of length four; consequently, they can be decoded using
standard iterative decoding algorithms. The exact dimension and bounds for the
minimum distance and stopping distance are derived. These constructed codes can
be used to derive quantum error-correcting codes.
|
[
{
"version": "v1",
"created": "Wed, 27 Feb 2008 20:44:41 GMT"
}
] | 2008-02-28T00:00:00 |
[
[
"Aly",
"Salah A.",
""
]
] |
new_dataset
| 0.99864 |
0802.3419
|
N. Prasanth Anthapadmanabhan
|
N. Prasanth Anthapadmanabhan and Alexander Barg
|
Randomized Frameproof Codes: Fingerprinting Plus Validation Minus
Tracing
|
5 pages, To appear in the Proceedings of Conference on Information
Sciences and Systems (CISS), Princeton, NJ, Mar 2008
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose randomized frameproof codes for content protection, which arise by
studying a variation of the Boneh-Shaw fingerprinting problem. In the modified
system, whenever a user tries to access his fingerprinted copy, the fingerprint
is submitted to a validation algorithm to verify that it is indeed permissible
before the content can be executed. We show an improvement in the achievable
rates compared to deterministic frameproof codes and traditional fingerprinting
codes.
For coalitions of an arbitrary fixed size, we construct randomized frameproof
codes which have an $O(n^2)$ complexity validation algorithm and probability of
error $\exp(-\Omega(n)),$ where $n$ denotes the length of the fingerprints.
Finally, we present a connection between linear frameproof codes and minimal
vectors for size-2 coalitions.
|
[
{
"version": "v1",
"created": "Sat, 23 Feb 2008 03:16:19 GMT"
}
] | 2008-02-26T00:00:00 |
[
[
"Anthapadmanabhan",
"N. Prasanth",
""
],
[
"Barg",
"Alexander",
""
]
] |
new_dataset
| 0.996163 |
0802.3490
|
Ying Jun Zhang Ph.D.
|
Jing Ma and Ying Jun Zhang
|
On capacity of wireless ad hoc networks with MIMO MMSE receivers
| null | null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Widely adopted at home, business places, and hot spots, wireless ad-hoc
networks are expected to provide broadband services parallel to their wired
counterparts in near future. To address this need, MIMO techniques, which are
capable of offering several-fold increase in capacity, hold significant
promise. Most previous work on capacity analysis of ad-hoc networks is based on
an implicit assumption that each node has only one antenna. Core to the
analysis therein is the characterization of a geometric area, referred to as
the exclusion region, which quantizes the amount of spatial resource occupied
by a link. When multiple antennas are deployed at each node, however, multiple
links can transmit in the vicinity of each other simultaneously, as
interference can now be suppressed by spatial signal processing. As such, a
link no longer exclusively occupies a geometric area, making the concept of
"exclusion region" not applicable any more. In this paper, we investigate
link-layer throughput capacity of MIMO ad-hoc networks. In contrast to previous
work, the amount of spatial resource occupied by each link is characterized by
the actual interference it imposes on other links. To calculate the link-layer
capacity, we first derive the probability distribution of post-detection SINR
at a receiver. The result is then used to calculate the number of active links
and the corresponding data rates that can be sustained within an area. Our
analysis will serve as a guideline for the design of medium access protocols
for MIMO ad-hoc networks. To the best of knowledge, this paper is the first
attempt to characterize the capacity of MIMO ad-hoc networks by considering the
actual PHY-layer signal and interference model.
|
[
{
"version": "v1",
"created": "Sun, 24 Feb 2008 05:00:21 GMT"
}
] | 2008-02-26T00:00:00 |
[
[
"Ma",
"Jing",
""
],
[
"Zhang",
"Ying Jun",
""
]
] |
new_dataset
| 0.997662 |
0802.3038
|
EDA Publishing Association
|
Fei Duan, Jiwei Jiao, Yucai Wang, Ying Zhang, Binwei Mi, Jinpeng Li,
Jian Zhu, Yuelin Wang
|
A Novel X-Axis Tuning Fork Gyroscope with "8 Vertical Springs-Proofmass"
Structure on (111)-Silicon
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
A novel x-axis tuning fork MEMS gyroscope with "8 vertical springs-proofmass"
structure for Coriolis effect detection is presented. Compared with the common
single-plane springs, the 8 vertical springs, symmetrically located at the top
and bottom sides, more stably suspend the large thick proofmass featuring large
capacitance variation and low mechanical noise. A bulk-micromachining
technology is applied to obtain the large proofmass and twins-like dual beams.
During the fabrication process, the dimensions of the 8 vertical springs are
precisely confined by thermal oxide protected limit trenches (LTs) sidewalls
and the extreme slowly etched (111)-planes; therefore a small mismatch of less
than 30 Hz is achieved before tuning. Initial test shows a sensitivity of
0.15mV/(deg/s) and rate resolution around 0.1deg/s under atmosphere pressure.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:10:45 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Duan",
"Fei",
""
],
[
"Jiao",
"Jiwei",
""
],
[
"Wang",
"Yucai",
""
],
[
"Zhang",
"Ying",
""
],
[
"Mi",
"Binwei",
""
],
[
"Li",
"Jinpeng",
""
],
[
"Zhu",
"Jian",
""
],
[
"Wang",
"Yuelin",
""
]
] |
new_dataset
| 0.999732 |
0802.3040
|
EDA Publishing Association
|
D. Grogg, Nicoleta Diana Badila-Ciressan, Adrian Mihai Ionescu
|
Fabrication of MEMS Resonators in Thin SOI
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
A simple and fast process for micro-electromechanical (MEM) resonators with
deep sub-micron transduction gaps in thin SOI is presented in this paper. Thin
SOI wafers are important for advanced CMOS technology and thus are evaluated as
resonator substrates for future co-integration with CMOS circuitry on a single
chip. As the transduction capacitance scales with the resonator thickness, it
is important to fabricate deep sub-micron trenches in order to achieve a good
capacitive coupling. Through the combination of conventional UV-lithography and
focused ion beam (FIB) milling the process needs only two lithography steps,
enabling therefore a way for fast prototyping of MEM-resonators. Different FIB
parameters and etching parameters are compared in this paper and their effect
on the process are reported.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:12:11 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Grogg",
"D.",
""
],
[
"Badila-Ciressan",
"Nicoleta Diana",
""
],
[
"Ionescu",
"Adrian Mihai",
""
]
] |
new_dataset
| 0.996043 |
0802.3041
|
EDA Publishing Association
|
Veronika Tim\'ar-Horv\'ath, L\'aszl\'o Juh\'asz, Andr\'as
Vass-V\'arnai, Gergely Perlaky
|
Usage of Porous Al2O3 Layers for RH Sensing
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
At the Department of Electron Devices a cheap, more or less CMOS process
compatible capacitive type RH sensor has been developed. Capacitive sensors are
based on dielectric property changes of thin films upon water vapour uptake
which depends on the surrounding media's relative humidity content. Because of
the immense surface-to-volume ratio and the abundant void fraction, very high
sensitivities can be obtained with porous ceramics. One of the ceramics to be
used is porous Al2O3, obtained by electrochemical oxidation of aluminium under
anodic bias. The average pore sizes are between 6...9 nm. In our paper we
intend to demonstrate images representing the influence of the technological
parameters on the porous structure and the device sensitivity.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:12:21 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Timár-Horváth",
"Veronika",
""
],
[
"Juhász",
"László",
""
],
[
"Vass-Várnai",
"András",
""
],
[
"Perlaky",
"Gergely",
""
]
] |
new_dataset
| 0.997694 |
0802.3043
|
EDA Publishing Association
|
Jyh-Cheng Yu, Huang-Yao Lin
|
Liquid Density Sensing Using Resonant Flexural Plate Wave Device with
Sol-Gel PZT Thin Films
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
This paper presents the design, fabrication and preliminary experimental
results of a flexure plate wave (FPW) resonator using sol-gel derived lead
zirconate titanates (PZT) thin films. The resonator adopts a two-port structure
with reflecting grates on the composite membrane of PZT and SiNx. The design of
the reflecting grate is derived from a SAW resonator model using COM theory to
produce a sharp resonant peak. The comparison between the mass and the
viscosity effects from the theoretical expression illustrates the applications
and the constraints of the proposed device in liquid sensing. Multiple coatings
of sol-gel derived PZT films are adopted because of the cost advantage and the
high electromechanical coupling effect over other piezoelectric films. The
fabrication issues of the proposed material structure are addressed.
Theoretical estimations of the mass and the viscosity effects are compared with
the experimental results. The resonant frequency has a good linear correlation
with the density of low viscosity liquids, which demonstrate the feasibility of
the proposed device.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:13:48 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Yu",
"Jyh-Cheng",
""
],
[
"Lin",
"Huang-Yao",
""
]
] |
new_dataset
| 0.999139 |
0802.3047
|
EDA Publishing Association
|
C. Saha, T. O'Donnell, J. Godsell, L. Carlioz, N. Wang, P. Mccloskey,
S. Beeby, J. Tudor, Russel Torah
|
Step-up converter for electromagnetic vibrational energy scavenger
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
This paper introduces a voltage multiplier (VM) circuit which can step up a
minimum voltage of 150 mV (peak). The operation and characteristics of this
converter circuit are described. The voltage multiplier circuit is also tested
with micro and macro scale electromagnetic vibrational generators and the
effect of the VM on the optimum load conditions of the electromagnetic
generator is presented. The measured results show that 85% efficiency can be
achieved from this VM circuit at a power level of 18 ?W.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:16:59 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Saha",
"C.",
""
],
[
"O'Donnell",
"T.",
""
],
[
"Godsell",
"J.",
""
],
[
"Carlioz",
"L.",
""
],
[
"Wang",
"N.",
""
],
[
"Mccloskey",
"P.",
""
],
[
"Beeby",
"S.",
""
],
[
"Tudor",
"J.",
""
],
[
"Torah",
"Russel",
""
]
] |
new_dataset
| 0.996521 |
0802.3050
|
EDA Publishing Association
|
J.-C. Crebier (G2ELab), Y. Lembeye (G2ELab), H. Raisigel (G2ELab), O.
Deleage (G2ELab), J. Delamare (G2ELab), O. Cugat (G2ELab)
|
High Efficiency 3-Phase Cmos Rectifier with Step Up and Regulated
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
This paper presents several design issues related to the monolithic
integration of a 3-phase AC to DC low voltage, low power rectifier for 3-phase
micro source electrical conditioning. Reduced input voltage operation (down to
1V), high efficiency, and output voltage regulations are implemented, based on
commercially available CMOS technology. Global design and system issues are
detailed. The management of start-up sequences under self supplied conditions
as well as output voltage regulations are specifically addressed. Simulation
results, practical implementation and validation are presented. They are based
on the association of three micro elements : a 3-phase micro-generator, a stand
alone 3-phase AC to DC integrated rectifier, and an output voltage conditioner
based on a commercially available IC.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:18:23 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Crebier",
"J. -C.",
"",
"G2ELab"
],
[
"Lembeye",
"Y.",
"",
"G2ELab"
],
[
"Raisigel",
"H.",
"",
"G2ELab"
],
[
"Deleage",
"O.",
"",
"G2ELab"
],
[
"Delamare",
"J.",
"",
"G2ELab"
],
[
"Cugat",
"O.",
"",
"G2ELab"
]
] |
new_dataset
| 0.992595 |
0802.3053
|
EDA Publishing Association
|
D. Szente-Varga, D. Horvath, M. Rencz
|
Ni-MH battery modelling for ambient intelligence applications
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
Mobile devices, like sensor networks and MEMS actuators use mobile power
supplies to ensure energy for their operation. These are mostly batteries. The
lifetime of the devices depends on the power consumption and on the quality and
capacitance of the battery. Though the integrated circuits and their power
consumption improve continually, their clock frequency also increases with the
time, and the resultant power consumption seems not to vary, or slightly
increase. On the other hand, the properties of batteries are developing much
slower, necessitating the optimization of their usage on system level.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:19:51 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Szente-Varga",
"D.",
""
],
[
"Horvath",
"D.",
""
],
[
"Rencz",
"M.",
""
]
] |
new_dataset
| 0.998808 |
0802.3056
|
EDA Publishing Association
|
T.-H. Lin, H. Yang, Ruey Fang Shyu, C.-K. Chao
|
New Horizontal Frustum Optical Waveguide Fabrication Using UV Proximity
Printing
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
This paper presents a novel method to fabricate the horizontal frustum
structure as a planar optical waveguide by using the proximity printing
technique. A horizontal frustum optical waveguide with a both lateral and
vertical taper structure was produced. The orthogonal and inclined masks with
the diffraction effect were employed in lithography process. This method can
precisely control each horizontal frustum optical waveguide geometric profile
in the fabrication process. The horizontal frustum optical waveguide and its
array with the same inclined angle were generated. The beam propagation
simulation software (BPM_CAD) was used to modeling the optical performance. The
simulation results reveal that the mode profile matched into horizontal frustum
optical waveguide and fiber from the laser diode. The optical loss of
horizontal hemi-frustum structure of optical waveguides was less than 0.2dB.
The horizontal hemifrustum waveguide will be used for fiber coupling on boards
for further optical communication systems.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:21:31 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Lin",
"T. -H.",
""
],
[
"Yang",
"H.",
""
],
[
"Shyu",
"Ruey Fang",
""
],
[
"Chao",
"C. -K.",
""
]
] |
new_dataset
| 0.998999 |
0802.3060
|
EDA Publishing Association
|
T. Sterken, Geert Altena, P. Fiorini, R. Puers
|
Characterisation of an Electrostatic Vibration Harvester
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
Harvesting energy from ambient vibration is proposed as an alternative to
storage based power supplies for autonomous systems. The system presented
converts the mechanical energy of a vibration into electrical energy by means
of a variable capacitor, which is polarized by an electret. A lumped element
model is used to study the generator and design a prototype. The device has
been micromachined in silicon, based on a two-wafer process. The prototype was
successfully tested, both using an external polarization source and an
electret.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:23:04 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Sterken",
"T.",
""
],
[
"Altena",
"Geert",
""
],
[
"Fiorini",
"P.",
""
],
[
"Puers",
"R.",
""
]
] |
new_dataset
| 0.989541 |
0802.3062
|
EDA Publishing Association
|
P. Bruschi, V. Nurra
|
An Integrated Circuit Compatible Compact Package for Thermal Gas
Flowmeters
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
An original packaging method suitable for integrated thermal mass flow
sensors is presented. The method consists in the application of a plastic
transparent adapter to the chip surface. The adapter is sealed to the chip
surface by means of a thermal procedure. By this approach it is possible to
selectively convey the fluid flow to reduced chip areas, avoiding contact with
the pads. Fabrication and testing of a very compact flow sensor is described.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:23:39 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Bruschi",
"P.",
""
],
[
"Nurra",
"V.",
""
]
] |
new_dataset
| 0.999438 |
0802.3063
|
EDA Publishing Association
|
A.M. Paracha (ESYCOM-Esiee), Ph. Basset (ESYCOM-Esiee), F. Marty
(ESYCOM-Esiee), A. Vaisman Chasin (ESYCOM-Esiee), P. Poulichet
(ESYCOM-Esiee), T. Bourouina (ESYCOM-Esiee)
|
A High Power Density Electrostatic Vibration-to-Electric Energy
Converter Based On An In-Plane Overlap Plate (IPOP) Mechanism
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
In this paper, design, fabrication and characterization issues of a bulk
silicon-based, vibration powered, electric energy generator are addressed. The
converter is based on an In-Plane Overlap Plate (IPOP) configuration [1].
Measurements have shown that with a theoretically lossless electronics and a
starting voltage of 5 V, power density of 58 $\mu$W/cm3 is achievable at the
resonance frequency of 290 Hz. It can be further improved by reducing the
parasitic capacitance, which can be achieved by silicon etching, but a
considerable mass is lost. In [2], it is shown that 19% of mass reduction
improves power density from 12.95 $\mu$W/cm3 to 59 $\mu$W/cm3. Hence an
enhancement in fabrication process is proposed, which is termed as Backside
DRIE. It helps in increasing power density without loosing an important
quantity of mass. Simulations have shown that 2.5% of mass removal improves
power density up to 76.71 $\mu$W/cm3. Initial simulation results and problems
of associated electronics are also discussed.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:24:47 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Paracha",
"A. M.",
"",
"ESYCOM-Esiee"
],
[
"Basset",
"Ph.",
"",
"ESYCOM-Esiee"
],
[
"Marty",
"F.",
"",
"ESYCOM-Esiee"
],
[
"Chasin",
"A. Vaisman",
"",
"ESYCOM-Esiee"
],
[
"Poulichet",
"P.",
"",
"ESYCOM-Esiee"
],
[
"Bourouina",
"T.",
"",
"ESYCOM-Esiee"
]
] |
new_dataset
| 0.998928 |
0802.3065
|
EDA Publishing Association
|
J. Jakovenko, M. Husak, T. Lalinskytfh, M. Drzik, G. Vanko
|
Design and Modeling of Micromechanical GaAs based Hot Plate for Gas
Sensors
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
For modern Gas sensors, high sensitivity and low power are expected. This
paper discusses design, simulation and fabrication of new Micromachined Thermal
Converters (MTCs) based on GaAs developed for Gas sensors. Metal oxide gas
sensors generally work in high temperature mode that is required for chemical
reactions to be performed between molecules of the specified gas and the
surface of sensing material. There is a low power consumption required to
obtain the operation temperatures in the range of 200 to 500 oC. High thermal
isolation of these devices solves consumption problem and can be made by
designing of free standing micromechanical hot plates. Mechanical stability and
a fast thermal response are especially significant parameters that can not be
neglected. These characteristics can be achieved with new concept of GaAs
thermal converter.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:25:46 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Jakovenko",
"J.",
""
],
[
"Husak",
"M.",
""
],
[
"Lalinskytfh",
"T.",
""
],
[
"Drzik",
"M.",
""
],
[
"Vanko",
"G.",
""
]
] |
new_dataset
| 0.957965 |
0802.3070
|
EDA Publishing Association
|
H.K. Ma, B.R. Hou, H.Y. Wu, C.Y. Lin, J.J. Gao, M.C. Kou
|
Development and Application of a Diaphragm Micro-Pump with Piezoelectric
Device
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
In this study, a new type of thin, compact, and light weighed diaphragm
micro-pump has been successfully developed to actuate the liquid by the
vibration of a diaphragm. The micro-diaphragm pump with two valves is
fabricated in an aluminum case by using highly accurate CNC machine, and the
cross-section dimension is 5mm x 8mm. Both valves and diaphragm are
manufactured from PDMS. The amplitude of vibration by a piezoelectric device
produces an oscillating flow which may change the chamber volume by changing
the curvature of a diaphragm. Several experimental set-ups for performance test
in a single micro-diaphragm pump, isothermal flow open system, and a closed
liquid cooling system is designed and implemented. The performance of one-side
actuating micro-diaphragm pump is affected by the design of check valves,
diaphragm, piezoelectric device, chamber volume, input voltage and frequency.
The measured maximum flow rate of present design is 72 ml/min at zero total
pump head in the range of operation frequency 70-180 Hz.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:28:46 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Ma",
"H. K.",
""
],
[
"Hou",
"B. R.",
""
],
[
"Wu",
"H. Y.",
""
],
[
"Lin",
"C. Y.",
""
],
[
"Gao",
"J. J.",
""
],
[
"Kou",
"M. C.",
""
]
] |
new_dataset
| 0.976527 |
0802.3074
|
EDA Publishing Association
|
G.-J. Wang, K.-H. Ho, C.-C. Hsueh
|
Biodegradable Polylactic Acid (PLA) Microstructures for Scaffold
Applications
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
In this research, we present a simple and cost effective soft lithographic
process to fabricate PLA scaffolds for tissue engineering. In which, the
negative photoresist JSR THB-120N was spun on a glass subtract followed by
conventional UV lithographic processes to fabricate the master to cast the PDMS
elastomeric mold. A thin poly(vinyl alcohol) (PVA) layer was used as a mode
release such that the PLA scaffold can be easily peeled off. The PLA precursor
solution was then cast onto the PDMS mold to form the PLA microstructures.
After evaporating the solvent, the PLA microstructures can be easily peeled off
from the PDMS mold. Experimental results show that the desired microvessels
scaffold can be successfully transferred to the biodegradable polymer PLA.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:32:51 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Wang",
"G. -J.",
""
],
[
"Ho",
"K. -H.",
""
],
[
"Hsueh",
"C. -C.",
""
]
] |
new_dataset
| 0.997113 |
0802.3078
|
EDA Publishing Association
|
S. Soulimane (LETI), F. Casset (LETI), F. Chapuis (LETI), P.-L.
Charvet (LETI), M. a\"id (LETI)
|
Tuneable Capacitor based on dual picks profile of the sacrificial layer
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
In this paper, we present a novel dual gap tuneable capacitor process based
on the profile of the sacrificial layer. This profile involves a tri-layer
photo-resist process with only one mask level. This realization is based on a
special profile of the sacrificial layer designed by two picks. The mechanism
of the sacrificial layer realisation is dependent on resist thickness, resist
formulation (viscosity, type of polymer and/or solvent, additives...), design
of the patterned layer (size or width) and the conditions under which this
layer is prepared: thermal treatment, etch back processes... In this
communication we demonstrate influence of the later parameters and discuss how
a dual pick profile was achieved.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:35:51 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Soulimane",
"S.",
"",
"LETI"
],
[
"Casset",
"F.",
"",
"LETI"
],
[
"Chapuis",
"F.",
"",
"LETI"
],
[
"Charvet",
"P. -L.",
"",
"LETI"
],
[
"aïd",
"M.",
"",
"LETI"
]
] |
new_dataset
| 0.998277 |
0802.3081
|
EDA Publishing Association
|
Z. Jian, Y. Yuanwei, Z. Yong, Chen Chen, J. Shixing
|
A High-Q Microwave MEMS Resonator
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
A High-Q microwave (K band) MEMS resonator is presented, which empolys
substrate integrated waveguide (SIW) and micromachined via-hole arrays by ICP
process. Nonradiation dielectric waveguide (NRD) is formed by metal filled
via-hole arrays and grounded planes. The three dimensional (3D) high
resistivity silicon substrate filled cavity resonator is fed by current probes
using CPW line. This monolithic resonator results in low cost, high performance
and easy integration with planar cicuits. The measured quality factor is beyond
180 and the resonance frequency is 21GHz.It shows a good agreement with the
simulation results. The chip size is only 4.7mm x 4.6mm x 0.5mm. Finally, as an
example of applications, a filter using two SIW resonators is designed.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:38:12 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Jian",
"Z.",
""
],
[
"Yuanwei",
"Y.",
""
],
[
"Yong",
"Z.",
""
],
[
"Chen",
"Chen",
""
],
[
"Shixing",
"J.",
""
]
] |
new_dataset
| 0.999111 |
0802.3088
|
EDA Publishing Association
|
M. Bedani, F. Carozza, R. Gaddi, A. Gnudi, B. Margesin, F. Giacomozzi
|
A Reconfigurable Impedance Matching Network Employing RF-MEMS Switches
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
We propose the design of a reconfigurable impedance matching network for the
lower RF frequency band, based on a developed RF-MEMS technology. The circuit
is composed of RF-MEMS ohmic relays, metal-insulator-metal (MIM) capacitors and
suspended spiral inductors, all integrated on a high resistivity Silicon
substrate. The presented circuit is well-suited for all applications requiring
adaptive impedance matching between two in principle unknown cascaded
RF-circuits. The fabrication and testing of a monolithic integrated prototype
in RF-MEMS technology from ITC-irst is currently underway.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:42:02 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Bedani",
"M.",
""
],
[
"Carozza",
"F.",
""
],
[
"Gaddi",
"R.",
""
],
[
"Gnudi",
"A.",
""
],
[
"Margesin",
"B.",
""
],
[
"Giacomozzi",
"F.",
""
]
] |
new_dataset
| 0.995018 |
0802.3092
|
EDA Publishing Association
|
R. Levy (ONERA - Mfe), A. Dupret (ONERA - Mfe), H. Mathias (ONERA -
Mfe), J.-P. Gilles (ONERA - Mfe), F. Parrain (ONERA - Mfe), B. Eisenbeis
(IEF), S. Megherbi (IEF)
|
Noise and thermal stability of vibrating micro-gyrometers preamplifiers
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
The preamplifier is a critical component of gyrometer's electronics. Indeed
the resolution of the sensor is limited by its signal to noise ratio, and the
gyrometer's thermal stability is limited by its gain drift. In this paper, five
different kinds of preamplifiers are presented and compared. Finally, the
design of an integrated preamplifier is shown in order to increase the gain
stability while reducing its noise and size.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:42:54 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Levy",
"R.",
"",
"ONERA - Mfe"
],
[
"Dupret",
"A.",
"",
"ONERA - Mfe"
],
[
"Mathias",
"H.",
"",
"ONERA -\n Mfe"
],
[
"Gilles",
"J. -P.",
"",
"ONERA - Mfe"
],
[
"Parrain",
"F.",
"",
"ONERA - Mfe"
],
[
"Eisenbeis",
"B.",
"",
"IEF"
],
[
"Megherbi",
"S.",
"",
"IEF"
]
] |
new_dataset
| 0.987867 |
0802.3093
|
EDA Publishing Association
|
N. Abel\'e, D. Grogg, C. Hibert, F. Casset (LETI), P. Ancey (LETI), A.
Ionescu
|
0-level Vacuum Packaging RT Process for MEMS Resonators
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
A new Room Temperature (RT) 0-level vacuum package is demonstrated in this
work, using amorphous silicon (aSi) as sacrificial layer and SiO2 as structural
layer. The process is compatible with most of MEMS resonators and Resonant
Suspended-Gate MOSFET [1] fabrication processes. This paper presents a study on
the influence of releasing hole dimensions on the releasing time and hole
clogging. It discusses mass production compatibility in terms of packaging
stress during back-end plastic injection process. The packaging is done at room
temperature making it fully compatible with IC-processed wafers and avoiding
any subsequent degradation of the active devices.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:43:06 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Abelé",
"N.",
"",
"LETI"
],
[
"Grogg",
"D.",
"",
"LETI"
],
[
"Hibert",
"C.",
"",
"LETI"
],
[
"Casset",
"F.",
"",
"LETI"
],
[
"Ancey",
"P.",
"",
"LETI"
],
[
"Ionescu",
"A.",
""
]
] |
new_dataset
| 0.995713 |
0802.3099
|
EDA Publishing Association
|
E. Pajot-Augy (NOPA)
|
Nanobiosensors based on individual olfactory receptors
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
In the SPOT-NOSED European project, nanoscale sensing elements bearing
olfactory receptors and grafted onto functionalized gold substrates are used as
odorant detectors to develop a new concept of nanobioelectronic nose, through
sensitive impedancemetric measurement of single receptor conformational change
upon ligand binding, with a better specificity and lower detection threshold
than traditional physical sensors.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:44:35 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Pajot-Augy",
"E.",
"",
"NOPA"
]
] |
new_dataset
| 0.998639 |
0802.3104
|
EDA Publishing Association
|
M.C. Hsieh, D.K. Jair, Y.K. Fang, C.S. Lin
|
Design and Fabrication of the Suspended High-Q Spiral Inductors with
X-Beams
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)
| null | null |
cs.OH
| null |
In this paper, deep sub-micron CMOS process compatible high Q on chip spiral
inductors with air gap structure were designed and fabricated. In the design
the electromagnetic were used for electrical-characteristics and maximum
mechanical strength, respectively. The copper wires were capped with
electroless Ni plating to prevent the copper from oxidizing. A Si3N4/ SiO2
X-beam was designed to increase the mechanical strength of the inductor in air
gap. The enhancement of maximum mechanical strength of a spiral inductor with
X-beams is more than 4500 times. Among these structures, the measured maximum
quality factor (Q) of the suspending inductor and frequency at maximum Q are
improved from 5.2 and 1.6GHz of conventional spiral inductor to 7.3 and 2.1
GHz, respectively.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:45:51 GMT"
}
] | 2008-02-22T00:00:00 |
[
[
"Hsieh",
"M. C.",
""
],
[
"Jair",
"D. K.",
""
],
[
"Fang",
"Y. K.",
""
],
[
"Lin",
"C. S.",
""
]
] |
new_dataset
| 0.991957 |
0802.2845
|
Pascal Weil
|
Eric Colin De Verdi\`ere (LIENS), Alexander Schrijver (CWI)
|
Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs
| null |
Dans Proceedings of the 25th Annual Symposium on the Theoretical
Aspects of Computer Science - STACS 2008, Bordeaux : France (2008)
| null | null |
cs.DS math.CO
| null |
Let $G$ be a directed planar graph of complexity $n$, each arc having a
nonnegative length. Let $s$ and $t$ be two distinct faces of $G$; let
$s_1,...,s_k$ be vertices incident with $s$; let $t_1,...,t_k$ be vertices
incident with $t$. We give an algorithm to compute $k$ pairwise vertex-disjoint
paths connecting the pairs $(s_i,t_i)$ in $G$, with minimal total length, in
$O(kn\log n)$ time.
|
[
{
"version": "v1",
"created": "Wed, 20 Feb 2008 14:20:48 GMT"
}
] | 2008-02-21T00:00:00 |
[
[
"De Verdière",
"Eric Colin",
"",
"LIENS"
],
[
"Schrijver",
"Alexander",
"",
"CWI"
]
] |
new_dataset
| 0.995331 |
cs/0211004
|
Wolfgang Faber
|
Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg
Gottlob, Simona Perri, Francesco Scarcello
|
The DLV System for Knowledge Representation and Reasoning
|
56 pages, 9 figures, 6 tables
|
ACM Transactions on Computational Logic 7(3):499-562, 2006
|
10.1145/1149114.1149117
| null |
cs.AI cs.LO cs.PL
| null |
This paper presents the DLV system, which is widely considered the
state-of-the-art implementation of disjunctive logic programming, and addresses
several aspects. As for problem solving, we provide a formal definition of its
kernel language, function-free disjunctive logic programs (also known as
disjunctive datalog), extended by weak constraints, which are a powerful tool
to express optimization problems. We then illustrate the usage of DLV as a tool
for knowledge representation and reasoning, describing a new declarative
programming methodology which allows one to encode complex problems (up to
$\Delta^P_3$-complete problems) in a declarative fashion. On the foundational
side, we provide a detailed analysis of the computational complexity of the
language of DLV, and by deriving new complexity results we chart a complete
picture of the complexity of this language and important fragments thereof.
Furthermore, we illustrate the general architecture of the DLV system which
has been influenced by these results. As for applications, we overview
application front-ends which have been developed on top of DLV to solve
specific knowledge representation tasks, and we briefly describe the main
international projects investigating the potential of the system for industrial
exploitation. Finally, we report about thorough experimentation and
benchmarking, which has been carried out to assess the efficiency of the
system. The experimental results confirm the solidity of DLV and highlight its
potential for emerging application areas like knowledge management and
information integration.
|
[
{
"version": "v1",
"created": "Mon, 4 Nov 2002 15:18:04 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Aug 2003 22:22:39 GMT"
},
{
"version": "v3",
"created": "Wed, 10 Sep 2003 18:01:29 GMT"
}
] | 2008-02-21T00:00:00 |
[
[
"Leone",
"Nicola",
""
],
[
"Pfeifer",
"Gerald",
""
],
[
"Faber",
"Wolfgang",
""
],
[
"Eiter",
"Thomas",
""
],
[
"Gottlob",
"Georg",
""
],
[
"Perri",
"Simona",
""
],
[
"Scarcello",
"Francesco",
""
]
] |
new_dataset
| 0.999248 |
0802.2528
|
Nitish Korula
|
Chandra Chekuri, Nitish Korula
|
Min-Cost 2-Connected Subgraphs With k Terminals
|
18 pages, 3 figures
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the k-2VC problem, we are given an undirected graph G with edge costs and
an integer k; the goal is to find a minimum-cost 2-vertex-connected subgraph of
G containing at least k vertices. A slightly more general version is obtained
if the input also specifies a subset S \subseteq V of terminals and the goal is
to find a subgraph containing at least k terminals. Closely related to the
k-2VC problem, and in fact a special case of it, is the k-2EC problem, in which
the goal is to find a minimum-cost 2-edge-connected subgraph containing k
vertices. The k-2EC problem was introduced by Lau et al., who also gave a
poly-logarithmic approximation for it. No previous approximation algorithm was
known for the more general k-2VC problem. We describe an O(\log n \log k)
approximation for the k-2VC problem.
|
[
{
"version": "v1",
"created": "Mon, 18 Feb 2008 18:34:28 GMT"
}
] | 2008-02-19T00:00:00 |
[
[
"Chekuri",
"Chandra",
""
],
[
"Korula",
"Nitish",
""
]
] |
new_dataset
| 0.999622 |
0802.1790
|
Silvano Di Zenzo
|
Silvano Di Zenzo
|
SAT Has No Wizards
|
19 pages
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An (encoded) decision problem is a pair (E, F) where E=words that encode
instances of the problem, F=words to be accepted. We use "strings" in a
technical sense. With an NP problem (E, F) we associate the "logogram" of F
relative to E, which conveys structural information on E, F, and how F is
embedded in E. The kernel Ker(P) of a program P that solves (E, F) consists of
those strings in the logogram that are used by P. There are relations between
Ker(P) and the complexity of P. We develop an application to SAT that relies
upon a property of internal independence of SAT. We show that SAT cannot have
in its logogram strings serving as collective certificates. As consequence, all
programs that solve SAT have same kernel.
|
[
{
"version": "v1",
"created": "Wed, 13 Feb 2008 14:43:40 GMT"
}
] | 2008-02-14T00:00:00 |
[
[
"Di Zenzo",
"Silvano",
""
]
] |
new_dataset
| 0.984839 |
0802.1699
|
Prajakta Nimbhorkar
|
Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar
|
Longest paths in Planar DAGs in Unambiguous Logspace
| null | null | null | null |
cs.CC
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
We show via two different algorithms that finding the length of the longest
path in planar directed acyclic graph (DAG) is in unambiguous logspace UL, and
also in the complement class co-UL. The result extends to toroidal DAGs as
well.
|
[
{
"version": "v1",
"created": "Tue, 12 Feb 2008 20:08:39 GMT"
}
] | 2008-02-13T00:00:00 |
[
[
"Limaye",
"Nutan",
""
],
[
"Mahajan",
"Meena",
""
],
[
"Nimbhorkar",
"Prajakta",
""
]
] |
new_dataset
| 0.972964 |
0802.1393
|
Clement Jonquet
|
Cl\'ement Jonquet (LIRMM), Stefano A. Cerri (LIRMM)
|
Les Agents comme des interpr\'eteurs Scheme : Sp\'ecification dynamique
par la communication
| null |
Dans 14\`eme Congr\`es Francophone AFRIF-AFIA de Reconnaissance
des Formes et Intelligence Artificielle - RFIA'04, Toulouse : France (2004)
| null | null |
cs.MA cs.AI
| null |
We proposed in previous papers an extension and an implementation of the
STROBE model, which regards the Agents as Scheme interpreters. These Agents are
able to interpret messages in a dedicated environment including an interpreter
that learns from the current conversation therefore representing evolving
meta-level Agent's knowledge. When the Agent's interpreter is a
nondeterministic one, the dialogues may consist of subsequent refinements of
specifications in the form of constraint sets. The paper presents a worked out
example of dynamic service generation - such as necessary on Grids - by
exploiting STROBE Agents equipped with a nondeterministic interpreter. It shows
how enabling dynamic specification of a problem. Then it illustrates how these
principles could be effective for other applications. Details of the
implementation are not provided here, but are available.
|
[
{
"version": "v1",
"created": "Mon, 11 Feb 2008 08:55:46 GMT"
}
] | 2008-02-12T00:00:00 |
[
[
"Jonquet",
"Clément",
"",
"LIRMM"
],
[
"Cerri",
"Stefano A.",
"",
"LIRMM"
]
] |
new_dataset
| 0.994284 |
0801.4746
|
W Saba
|
Walid S. Saba
|
Concerning Olga, the Beautiful Little Street Dancer (Adjectives as
Higher-Order Polymorphic Functions)
|
6 pages
| null | null | null |
cs.CL cs.LO
| null |
In this paper we suggest a typed compositional seman-tics for nominal
compounds of the form [Adj Noun] that models adjectives as higher-order
polymorphic functions, and where types are assumed to represent concepts in an
ontology that reflects our commonsense view of the world and the way we talk
about it in or-dinary language. In addition to [Adj Noun] compounds our
proposal seems also to suggest a plausible explana-tion for well known
adjective ordering restrictions.
|
[
{
"version": "v1",
"created": "Wed, 30 Jan 2008 19:40:45 GMT"
},
{
"version": "v2",
"created": "Thu, 31 Jan 2008 17:10:22 GMT"
},
{
"version": "v3",
"created": "Fri, 1 Feb 2008 01:34:55 GMT"
},
{
"version": "v4",
"created": "Mon, 4 Feb 2008 22:36:04 GMT"
},
{
"version": "v5",
"created": "Sun, 10 Feb 2008 08:26:02 GMT"
}
] | 2008-02-10T00:00:00 |
[
[
"Saba",
"Walid S.",
""
]
] |
new_dataset
| 0.998182 |
0802.0835
|
Rossano Venturini
|
Paolo Ferragina, Igor Nitto and Rossano Venturini
|
Bit-Optimal Lempel-Ziv compression
| null | null | null | null |
cs.DS cs.IT math.IT
| null |
One of the most famous and investigated lossless data-compression scheme is
the one introduced by Lempel and Ziv about 40 years ago. This compression
scheme is known as "dictionary-based compression" and consists of squeezing an
input string by replacing some of its substrings with (shorter) codewords which
are actually pointers to a dictionary of phrases built as the string is
processed. Surprisingly enough, although many fundamental results are nowadays
known about upper bounds on the speed and effectiveness of this compression
process and references therein), ``we are not aware of any parsing scheme that
achieves optimality when the LZ77-dictionary is in use under any constraint on
the codewords other than being of equal length'' [N. Rajpoot and C. Sahinalp.
Handbook of Lossless Data Compression, chapter Dictionary-based data
compression. Academic Press, 2002. pag. 159]. Here optimality means to achieve
the minimum number of bits in compressing each individual input string, without
any assumption on its generating source. In this paper we provide the first
LZ-based compressor which computes the bit-optimal parsing of any input string
in efficient time and optimal space, for a general class of variable-length
codeword encodings which encompasses most of the ones typically used in data
compression and in the design of search engines and compressed indexes.
|
[
{
"version": "v1",
"created": "Wed, 6 Feb 2008 16:31:54 GMT"
}
] | 2008-02-07T00:00:00 |
[
[
"Ferragina",
"Paolo",
""
],
[
"Nitto",
"Igor",
""
],
[
"Venturini",
"Rossano",
""
]
] |
new_dataset
| 0.983121 |
cs/0702060
|
Gwenael Richomme
|
Gw\'ena\"el Richomme (LaRIA)
|
A local balance property of episturmian words
| null | null | null |
LaRIA-LRR-2007-02
|
cs.DM
| null |
We prove that episturmian words and Arnoux-Rauzy sequences can be
characterized using a local balance property. We also give a new
characterization of epistandard words and show that the set of finite words
that are not factors of an episturmian word is not context-free.
|
[
{
"version": "v1",
"created": "Sat, 10 Feb 2007 09:48:42 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Feb 2008 08:30:05 GMT"
}
] | 2008-02-07T00:00:00 |
[
[
"Richomme",
"Gwénaël",
"",
"LaRIA"
]
] |
new_dataset
| 0.99579 |
0802.0552
|
Vincent Gramoli
|
Vincent Gramoli (INRIA Futurs), Michel Raynal (IRISA)
|
Timed Quorum System for Large-Scale and Dynamic Environments
| null |
Dans 11th International Conference On Principles Of Distributed
Systems 4878 (2007) 429--442
| null | null |
cs.DC cs.NI
| null |
This paper presents Timed Quorum System (TQS), a new quorum system especially
suited for large-scale and dynamic systems. TQS requires that two quorums
intersect with high probability if they are used in the same small period of
time. It proposed an algorithm that implements TQS and that verifies
probabilistic atomicity: a consistency criterion that requires each operation
to respect atomicity with high probability. This TQS implementation has quorum
of size O(\sqrt{nD}) and expected access time of O(log \sqrt{nD}) message
delays, where n measures the size of the system and D is a required parameter
to handle dynamism.
|
[
{
"version": "v1",
"created": "Tue, 5 Feb 2008 07:09:08 GMT"
}
] | 2008-02-06T00:00:00 |
[
[
"Gramoli",
"Vincent",
"",
"INRIA Futurs"
],
[
"Raynal",
"Michel",
"",
"IRISA"
]
] |
new_dataset
| 0.997481 |
0802.0580
|
Frans Willems
|
Frans M.J. Willems
|
Rotated and Scaled Alamouti Coding
|
Submitted to ISIT 2008
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Repetition-based retransmission is used in Alamouti-modulation [1998] for
$2\times 2$ MIMO systems. We propose to use instead of ordinary repetition
so-called "scaled repetition" together with rotation. It is shown that the
rotated and scaled Alamouti code has a hard-decision performance which is only
slightly worse than that of the Golden code [2005], the best known $2\times 2$
space-time code. Decoding the Golden code requires an exhaustive search over
all codewords, while our rotated and scaled Alamouti code can be decoded with
an acceptable complexity however.
|
[
{
"version": "v1",
"created": "Tue, 5 Feb 2008 10:12:48 GMT"
}
] | 2008-02-06T00:00:00 |
[
[
"Willems",
"Frans M. J.",
""
]
] |
new_dataset
| 0.996916 |
cs/0609146
|
Karunakaran Murali Krishnan
|
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran and Priti Shankar
|
A Combinatorial Family of Near Regular LDPC Codes
|
5 pages 3 figures
|
ISIT 2007
| null | null |
cs.IT math.IT
| null |
An elementary combinatorial Tanner graph construction for a family of
near-regular low density parity check codes achieving high girth is presented.
The construction allows flexibility in the choice of design parameters like
rate, average degree, girth and block length of the code and yields an
asymptotic family. The complexity of constructing codes in the family grows
only quadratically with the block length.
|
[
{
"version": "v1",
"created": "Tue, 26 Sep 2006 17:20:43 GMT"
}
] | 2008-02-06T00:00:00 |
[
[
"Krishnan",
"K. Murali",
""
],
[
"Singh",
"Rajdeep",
""
],
[
"Chandran",
"L. Sunil",
""
],
[
"Shankar",
"Priti",
""
]
] |
new_dataset
| 0.996422 |
0802.0487
|
Marius Zimand
|
Cristian Calude, Marius Zimand
|
Algorithmically independent sequences
| null | null | null | null |
cs.IT cs.SE math.AG math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two objects are independent if they do not affect each other. Independence is
well-understood in classical information theory, but less in algorithmic
information theory. Working in the framework of algorithmic information theory,
the paper proposes two types of independence for arbitrary infinite binary
sequences and studies their properties. Our two proposed notions of
independence have some of the intuitive properties that one naturally expects.
For example, for every sequence $x$, the set of sequences that are independent
(in the weaker of the two senses) with $x$ has measure one. For both notions of
independence we investigate to what extent pairs of independent sequences, can
be effectively constructed via Turing reductions (from one or more input
sequences). In this respect, we prove several impossibility results. For
example, it is shown that there is no effective way of producing from an
arbitrary sequence with positive constructive Hausdorff dimension two sequences
that are independent (even in the weaker type of independence) and have
super-logarithmic complexity. Finally, a few conjectures and open questions are
discussed.
|
[
{
"version": "v1",
"created": "Mon, 4 Feb 2008 20:32:07 GMT"
}
] | 2008-02-05T00:00:00 |
[
[
"Calude",
"Cristian",
""
],
[
"Zimand",
"Marius",
""
]
] |
new_dataset
| 0.962861 |
cs/9301107
| null |
Lawrence C. Paulson
|
A Formulation of the Simple Theory of Types (for Isabelle)
| null |
published in P. Martin-L\"of & G. Mints (editors), COLOG-88:
International Conf. in Computer Logic (Springer LNCS 417, 1990), 246-274
| null | null |
cs.LO
| null |
Simple type theory is formulated for use with the generic theorem prover
Isabelle. This requires explicit type inference rules. There are function,
product, and subset types, which may be empty. Descriptions (the eta-operator)
introduce the Axiom of Choice. Higher-order logic is obtained through
reflection between formulae and terms of type bool. Recursive types and
functions can be formally constructed. Isabelle proof procedures are described.
The logic appears suitable for general mathematics as well as computational
problems.
|
[
{
"version": "v1",
"created": "Tue, 31 Oct 2000 00:00:00 GMT"
}
] | 2008-02-03T00:00:00 |
[
[
"Paulson",
"Lawrence C.",
""
]
] |
new_dataset
| 0.971175 |
cs/9301115
|
Maggie McLoughlin
|
Donald E. Knuth
|
Context-free multilanguages
|
Abstract added by Greg Kuperberg
|
Theoretical Studies in Computer Science, Ginsburg Festschrift
| null |
Knuth migration 11/2004 1991
|
cs.DS
| null |
This article is a sketch of ideas that were once intended to appear in the
author's famous series, "The Art of Computer Programming". He generalizes the
notion of a context-free language from a set to a multiset of words over an
alphabet. The idea is to keep track of the number of ways to parse a string.
For example, "fruit flies like a banana" can famously be parsed in two ways;
analogous examples in the setting of programming languages may yet be important
in the future.
The treatment is informal but essentially rigorous.
|
[
{
"version": "v1",
"created": "Sun, 1 Dec 1991 00:00:00 GMT"
}
] | 2008-02-03T00:00:00 |
[
[
"Knuth",
"Donald E.",
""
]
] |
new_dataset
| 0.995414 |
0801.4423
|
Manas Tungare
|
Manas Tungare, Manuel Perez-Quinones
|
It's Not What You Have, But How You Use It: Compromises in Mobile Device
Use
| null | null | null | null |
cs.HC
| null |
As users begin to use many more devices for personal information management
(PIM) than just the traditional desktop computer, it is essential for HCI
researchers to understand how these devices are being used in the wild and
their roles in users' information environments. We conducted a study of 220
knowledge workers about their devices, the activities they performed on each,
and the groups of devices used together. Our findings indicate that several
devices are often used in groups; integrated multi-function portable devices
have begun to replace single-function devices for communication (e.g. email and
IM). Users use certain features opportunistically because they happen to be
carrying a multi-function device with them. The use of multiple devices and
multi-function devices is fraught with compromises as users must choose and
make trade-offs among various factors.
|
[
{
"version": "v1",
"created": "Tue, 29 Jan 2008 04:42:26 GMT"
}
] | 2008-01-30T00:00:00 |
[
[
"Tungare",
"Manas",
""
],
[
"Perez-Quinones",
"Manuel",
""
]
] |
new_dataset
| 0.992797 |
0801.4355
|
Jocelyne Troccaz
|
Jean-Jacques Banihachemi (TIMC), Eric Boidard (TIMC), Jean-Luc Bosson
(TIMC, CHU-Grenoble CIC), Luc Bressollette, Ivan Bricault (TIMC, CHU-Grenoble
radio), Philippe Cinquin (TIMC), Gilbert Ferretti (CHU-Grenoble radio), Maud
Marchal (TIMC), Thomas Martinelli (CHU-Grenoble radio), Alexandre
Moreau-Gaudry (CHU-Grenoble CIC), Franck Pelissier, Christian Roux, Dominique
Saragaglia, Pierre Thorel, Jocelyne Troccaz (TIMC), Adriana Vilchis (TIMC)
|
TER: A Robot for Remote Ultrasonic Examination: Experimental Evaluations
| null |
Telesurgery, Springer Verlag (Ed.) (2008) 91-99
| null | null |
cs.OH cs.RO
| null |
This chapter:
o Motivates the clinical use of robotic tele-echography
o Introduces the TER system
o Describes technical and clinical evaluations performed with TER
|
[
{
"version": "v1",
"created": "Mon, 28 Jan 2008 18:39:41 GMT"
}
] | 2008-01-29T00:00:00 |
[
[
"Banihachemi",
"Jean-Jacques",
"",
"TIMC"
],
[
"Boidard",
"Eric",
"",
"TIMC"
],
[
"Bosson",
"Jean-Luc",
"",
"TIMC, CHU-Grenoble CIC"
],
[
"Bressollette",
"Luc",
"",
"TIMC, CHU-Grenoble\n radio"
],
[
"Bricault",
"Ivan",
"",
"TIMC, CHU-Grenoble\n radio"
],
[
"Cinquin",
"Philippe",
"",
"TIMC"
],
[
"Ferretti",
"Gilbert",
"",
"CHU-Grenoble radio"
],
[
"Marchal",
"Maud",
"",
"TIMC"
],
[
"Martinelli",
"Thomas",
"",
"CHU-Grenoble radio"
],
[
"Moreau-Gaudry",
"Alexandre",
"",
"CHU-Grenoble CIC"
],
[
"Pelissier",
"Franck",
"",
"TIMC"
],
[
"Roux",
"Christian",
"",
"TIMC"
],
[
"Saragaglia",
"Dominique",
"",
"TIMC"
],
[
"Thorel",
"Pierre",
"",
"TIMC"
],
[
"Troccaz",
"Jocelyne",
"",
"TIMC"
],
[
"Vilchis",
"Adriana",
"",
"TIMC"
]
] |
new_dataset
| 0.988531 |
0709.3692
|
Ming-xue Liao
|
Ming-xue Liao, Zhi-hua Fan
|
Deadlock Detection in Basic Models of MPI Synchronization Communication
Programs
|
accepted by Acta Electronica Sinica (in Chinese)
| null | null | null |
cs.DC
| null |
A model of MPI synchronization communication programs is presented and its
three basic simplified models are also defined. A series of theorems and
methods for deciding whether deadlocks will occur among the three models are
given and proved strictly. These theories and methods for simple models'
deadlock detection are the necessary base for real MPI program deadlock
detection. The methods are based on a static analysis through programs and with
runtime detection in necessary cases and they are able to determine before
compiling whether it will be deadlocked for two of the three basic models. For
another model, some deadlock cases can be found before compiling and others at
runtime. Our theorems can be used to prove the correctness of currently popular
MPI program deadlock detection algorithms. Our methods may decrease codes that
those algorithms need to change to MPI source or profiling interface and may
detects deadlocks ahead of program execution, thus the overheads can be reduced
greatly.
|
[
{
"version": "v1",
"created": "Mon, 24 Sep 2007 06:02:29 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Jan 2008 08:07:23 GMT"
}
] | 2008-01-28T00:00:00 |
[
[
"Liao",
"Ming-xue",
""
],
[
"Fan",
"Zhi-hua",
""
]
] |
new_dataset
| 0.962205 |
0801.3908
|
Jakob Vo{\ss}
|
Jakob Voss
|
Encoding changing country codes for the Semantic Web with ISO 3166 and
SKOS
|
Accepted to appear in the proceedings of the 2nd International Con-
ference on Metadata and Semantics Research (MTSR 2007)
| null | null | null |
cs.IR
| null |
This paper shows how authority files can be encoded for the Semantic Web with
the Simple Knowledge Organisation System (SKOS). In particular the application
of SKOS for encoding the structure, management, and utilization of country
codes as defined in ISO 3166 is demonstrated. The proposed encoding gives a use
case for SKOS that includes features that have only been discussed little so
far, such as multiple notations, nested concept schemes, changes by versioning.
|
[
{
"version": "v1",
"created": "Fri, 25 Jan 2008 10:40:27 GMT"
}
] | 2008-01-28T00:00:00 |
[
[
"Voss",
"Jakob",
""
]
] |
new_dataset
| 0.996486 |
0801.3930
|
Jaap-Henk Hoepman
|
Jaap-Henk Hoepman, Engelbert Hubbers, Bart Jacobs, Martijn Oostdijk,
Ronny Wichers Schreur
|
Crossing Borders: Security and Privacy Issues of the European e-Passport
| null |
1st Int. Workshop on Security, LNCS 4266, pages 152-167, Kyoto,
Japan, October 23-24 2006
| null | null |
cs.CR cs.CY
| null |
The first generation of European e-passports will be issued in 2006. We
discuss how borders are crossed regarding the security and privacy erosion of
the proposed schemes, and show which borders need to be crossed to improve the
security and the privacy protection of the next generation of e-passports. In
particular we discuss attacks on Basic Access Control due to the low entropy of
the data from which the access keys are derived, we sketch the European
proposals for Extended Access Control and the weaknesses in that scheme, and
show how fundamentally different design decisions can make e-passports more
secure.
|
[
{
"version": "v1",
"created": "Fri, 25 Jan 2008 12:17:52 GMT"
}
] | 2008-01-28T00:00:00 |
[
[
"Hoepman",
"Jaap-Henk",
""
],
[
"Hubbers",
"Engelbert",
""
],
[
"Jacobs",
"Bart",
""
],
[
"Oostdijk",
"Martijn",
""
],
[
"Schreur",
"Ronny Wichers",
""
]
] |
new_dataset
| 0.998983 |
0801.0931
|
Ryuhei Mori
|
Ryuhei Mori, Kenta Kasai, Tomoharu Shibuya, and Kohichi Sakaniwa
|
The Asymptotic Bit Error Probability of LDPC Codes for the Binary
Erasure Channel with Finite Iteration Number
|
5 pages, 6 figures, correcting errors in Theorem 1 and poor English
| null | null | null |
cs.IT math.IT
| null |
We consider communication over the binary erasure channel (BEC) using
low-density parity-check (LDPC) code and belief propagation (BP) decoding. The
bit error probability for infinite block length is known by density evolution
and it is well known that a difference between the bit error probability at
finite iteration number for finite block length $n$ and for infinite block
length is asymptotically $\alpha/n$, where $\alpha$ is a specific constant
depending on the degree distribution, the iteration number and the erasure
probability. Our main result is to derive an efficient algorithm for
calculating $\alpha$ for regular ensembles. The approximation using $\alpha$ is
accurate for $(2,r)$-regular ensembles even in small block length.
|
[
{
"version": "v1",
"created": "Mon, 7 Jan 2008 09:40:41 GMT"
},
{
"version": "v2",
"created": "Wed, 23 Jan 2008 12:37:13 GMT"
}
] | 2008-01-23T00:00:00 |
[
[
"Mori",
"Ryuhei",
""
],
[
"Kasai",
"Kenta",
""
],
[
"Shibuya",
"Tomoharu",
""
],
[
"Sakaniwa",
"Kohichi",
""
]
] |
new_dataset
| 0.996024 |
0706.3848
|
Vlady Ravelomanana
|
Jean Cardinal (ULB), Vlady Ravelomanana (LIPN), Mario Valencia-Pabon
(LIPN)
|
Minimum Sum Edge Colorings of Multicycles
| null | null | null | null |
cs.DM
| null |
In the minimum sum edge coloring problem, we aim to assign natural numbers to
edges of a graph, so that adjacent edges receive different numbers, and the sum
of the numbers assigned to the edges is minimum. The {\em chromatic edge
strength} of a graph is the minimum number of colors required in a minimum sum
edge coloring of this graph. We study the case of multicycles, defined as
cycles with parallel edges, and give a closed-form expression for the chromatic
edge strength of a multicycle, thereby extending a theorem due to Berge. It is
shown that the minimum sum can be achieved with a number of colors equal to the
chromatic index. We also propose simple algorithms for finding a minimum sum
edge coloring of a multicycle. Finally, these results are generalized to a
large family of minimum cost coloring problems.
|
[
{
"version": "v1",
"created": "Tue, 26 Jun 2007 14:43:15 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Jan 2008 13:36:41 GMT"
}
] | 2008-01-22T00:00:00 |
[
[
"Cardinal",
"Jean",
"",
"ULB"
],
[
"Ravelomanana",
"Vlady",
"",
"LIPN"
],
[
"Valencia-Pabon",
"Mario",
"",
"LIPN"
]
] |
new_dataset
| 0.969624 |
0801.3024
|
Josep Rif\`a
|
J. Pujol, J. Rif\'a, F. I. Solov'eva
|
Construction of Z4-linear Reed-Muller codes
|
Paper submitted to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
| null |
New quaternary Plotkin constructions are given and are used to obtain new
families of quaternary codes. The parameters of the obtained codes, such as the
length, the dimension and the minimum distance are studied. Using these
constructions new families of quaternary Reed-Muller codes are built with the
peculiarity that after using the Gray map the obtained Z4-linear codes have the
same parameters and fundamental properties as the codes in the usual binary
linear Reed-Muller family. To make more evident the duality relationships in
the constructed families the concept of Kronecker inner product is introduced.
|
[
{
"version": "v1",
"created": "Sat, 19 Jan 2008 10:14:40 GMT"
}
] | 2008-01-22T00:00:00 |
[
[
"Pujol",
"J.",
""
],
[
"Rifá",
"J.",
""
],
[
"Solov'eva",
"F. I.",
""
]
] |
new_dataset
| 0.999255 |
0801.1362
|
An-Ping Li
|
An-Ping Li
|
A new key exchange cryptosystem
|
A revision
| null | null | null |
cs.CR
| null |
In this paper, we will present a new key exchange cryptosystem based on
linear algebra, which take less operations but weaker in security than
Diffie-Hellman's one.
|
[
{
"version": "v1",
"created": "Wed, 9 Jan 2008 11:16:25 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Jan 2008 01:34:15 GMT"
},
{
"version": "v3",
"created": "Sun, 20 Jan 2008 07:15:00 GMT"
}
] | 2008-01-20T00:00:00 |
[
[
"Li",
"An-Ping",
""
]
] |
new_dataset
| 0.997324 |
0801.2175
|
Johannes Gro{\ss}e
|
Johannes Gro{\ss}e
|
MathPSfrag 2: Convenient LaTeX Labels in Mathematica
|
9 pages, package can be found at
http://wwwth.mppmu.mpg.de/members/jgrosse/mathpsfrag/
| null | null | null |
cs.GR
| null |
This article introduces the next version of MathPSfrag. MathPSfrag is a
Mathematica package that during export automatically replaces all expressions
in a plot by corresponding LaTeX commands. The new version can also produce
LaTeX independent images; e.g., PDF files for inclusion in pdfLaTeX. Moreover
from these files a preview is generated and shown within Mathematica.
|
[
{
"version": "v1",
"created": "Tue, 15 Jan 2008 18:34:44 GMT"
}
] | 2008-01-16T00:00:00 |
[
[
"Große",
"Johannes",
""
]
] |
new_dataset
| 0.998084 |
0801.2092
|
Sergei Vyshenski
|
S. V. Vyshenski, P. V. Grigoriev, Yu. Yu. Dubenskaya
|
Model for synchronizer of marked pairs in fork-join network
|
15 pages, 3 figures, in Russian
| null | null | null |
cs.DM
| null |
We introduce a model for synchronizer of marked pairs, which is a node for
joining results of parallel processing in two-branch fork-join queueing
network. A distribution for number of jobs in the synchronizer is obtained.
Calculations are performed assuming that: arrivals to the network form a
Poisson process, each branch operates like an M/M/N queueing system. It is
shown that a mean quantity of jobs in the synchronizer is bounded below by the
value, defined by parameters of the network (which contains the synchronizer)
and does not depend upon performance and particular properties of the
synchronizer. A domain of network parameters is found, where the flow of jobs
departing from the synchronizer does not manifest a statistically significant
difference from the Poisson type, despite the correlation between job flows
from both branches of the fork-join network.
|
[
{
"version": "v1",
"created": "Mon, 14 Jan 2008 15:34:18 GMT"
}
] | 2008-01-15T00:00:00 |
[
[
"Vyshenski",
"S. V.",
""
],
[
"Grigoriev",
"P. V.",
""
],
[
"Dubenskaya",
"Yu. Yu.",
""
]
] |
new_dataset
| 0.954717 |
cs/0610114
|
Hans-Rudolf Thomann
|
Hans-Rudolf Thomann
|
Instant Computing - A New Computation Paradigm
|
Final version, 34 pages. Theorem 3 generalized and strengthened.
Review results implemented. Typos corrected
| null | null | null |
cs.CC cs.CR quant-ph
| null |
Voltage peaks on a conventional computer's power lines allow for the
well-known dangerous DPA attacks. We show that measurement of a quantum
computer's transient state during a computational step reveals information
about a complete computation of arbitrary length, which can be extracted by
repeated probing, if the computer is suitably programmed. Instant computing, as
we name this mode of operation, recognizes for any total or partial recursive
function arguments lying in the domain of definition and yields their function
value with arbitrary small error probability in probabilistic linear time. This
implies recognition of (not necessarily recursively enumerable) complements of
recursively enumerable sets and the solution of the halting problem. Future
quantum computers are shown to be likely to allow for instant computing, and
some consequences are pointed out.
|
[
{
"version": "v1",
"created": "Thu, 19 Oct 2006 14:11:38 GMT"
},
{
"version": "v2",
"created": "Fri, 11 Jan 2008 09:14:29 GMT"
},
{
"version": "v3",
"created": "Sat, 12 Jan 2008 11:12:40 GMT"
}
] | 2008-01-12T00:00:00 |
[
[
"Thomann",
"Hans-Rudolf",
""
]
] |
new_dataset
| 0.951874 |
0711.1016
|
Florian Widmann
|
Pietro Abate, Rajeev Gor\'e and Florian Widmann
|
An On-the-fly Tableau-based Decision Procedure for PDL-Satisfiability
|
26 pages, longer version of article in Methods for Modalities 2007;
improved readability of proofs
| null | null | null |
cs.LO
| null |
We present a tableau-based algorithm for deciding satisfiability for
propositional dynamic logic (PDL) which builds a finite rooted tree with
ancestor loops and passes extra information from children to parents to
separate good loops from bad loops during backtracking. It is easy to
implement, with potential for parallelisation, because it constructs a
pseudo-model ``on the fly'' by exploring each tableau branch independently. But
its worst-case behaviour is 2EXPTIME rather than EXPTIME. A prototype
implementation in the TWB (http://twb.rsise.anu.edu.au) is available.
|
[
{
"version": "v1",
"created": "Wed, 7 Nov 2007 06:11:13 GMT"
},
{
"version": "v2",
"created": "Tue, 8 Jan 2008 05:23:26 GMT"
}
] | 2008-01-08T00:00:00 |
[
[
"Abate",
"Pietro",
""
],
[
"Goré",
"Rajeev",
""
],
[
"Widmann",
"Florian",
""
]
] |
new_dataset
| 0.998589 |
0801.0949
|
Jad Saklawi
|
Paul C. Attie
|
On the Refinement of Liveness Properties of Distributed Systems
|
54 pages, 12 figures
| null | null | null |
cs.LO
| null |
We present a new approach for reasoning about liveness properties of
distributed systems, represented as automata. Our approach is based on
simulation relations, and requires reasoning only over finite execution
fragments. Current simulation-relation based methods for reasoning about
liveness properties of automata require reasoning over entire executions, since
they involve a proof obligation of the form: if a concrete and abstract
execution ``correspond'' via the simulation, and the concrete execution is
live, then so is the abstract execution.
Our contribution consists of (1) a formalism for defining liveness
properties, (2) a proof method for liveness properties based on that formalism,
and (3) two expressive completeness results: firstly, our formalism can express
any liveness property which satisfies a natural ``robustness'' condition, and
secondly, our formalism can express any liveness property at all, provided that
history variables can be used
|
[
{
"version": "v1",
"created": "Mon, 7 Jan 2008 11:55:03 GMT"
}
] | 2008-01-08T00:00:00 |
[
[
"Attie",
"Paul C.",
""
]
] |
new_dataset
| 0.969569 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.