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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0802.3085
|
EDA Publishing Association
|
T. Akashi, Y. Yoshimura
|
Profile Control of a Borosilicate-Glass Groove Formed by Deep Reactive
Ion Etching
|
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)
|
10.1088/0960-1317/18/10/105004
| null |
cs.OH
| null |
Deep reactive ion etching (DRIE) of borosilicate glass and profile control of
an etched groove are reported. DRIE was carried out using an anodically bonded
silicon wafer as an etching mask. We controlled the groove profile, namely
improving its sidewall angle, by removing excessively thick polymer film
produced by carbonfluoride etching gases during DRIE. Two fabrication processes
were experimentally compared for effective removal of the film : DRIE with the
addition of argon to the etching gases and a novel combined process in which
DRIE and subsequent ultrasonic cleaning in DI water were alternately carried
out. Both processes improved the sidewall angle, and it reached 85o independent
of the mask-opening width. The results showed the processes can remove
excessive polymer film on sidewalls. Accordingly, the processes are an
effective way to control the groove profile of borosilicate glass.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2008 13:40:15 GMT"
}
] | 2009-11-13T00:00:00 |
[
[
"Akashi",
"T.",
""
],
[
"Yoshimura",
"Y.",
""
]
] |
new_dataset
| 0.967453 |
0901.2665
|
Eric Polizzi
|
Eric Polizzi
|
A Density Matrix-based Algorithm for Solving Eigenvalue Problems
|
7 pages, 3 figures
| null |
10.1103/PhysRevB.79.115112
| null |
cs.CE cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new numerical algorithm for solving the symmetric eigenvalue problem is
presented. The technique deviates fundamentally from the traditional Krylov
subspace iteration based techniques (Arnoldi and Lanczos algorithms) or other
Davidson-Jacobi techniques, and takes its inspiration from the contour
integration and density matrix representation in quantum mechanics. It will be
shown that this new algorithm - named FEAST - exhibits high efficiency,
robustness, accuracy and scalability on parallel architectures. Examples from
electronic structure calculations of Carbon nanotubes (CNT) are presented, and
numerical performances and capabilities are discussed.
|
[
{
"version": "v1",
"created": "Sat, 17 Jan 2009 23:36:23 GMT"
}
] | 2009-11-13T00:00:00 |
[
[
"Polizzi",
"Eric",
""
]
] |
new_dataset
| 0.977232 |
0911.2320
|
EPTCS
|
Paola Bonizzoni, Clelia De Felice, Rosalba Zizza
|
Circular Languages Generated by Complete Splicing Systems and Pure
Unitary Languages
| null |
EPTCS 9, 2009, pp. 22-31
|
10.4204/EPTCS.9.3
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Circular splicing systems are a formal model of a generative mechanism of
circular words, inspired by a recombinant behaviour of circular DNA. Some
unanswered questions are related to the computational power of such systems,
and finding a characterization of the class of circular languages generated by
circular splicing systems is still an open problem. In this paper we solve this
problem for complete systems, which are special finite circular splicing
systems. We show that a circular language L is generated by a complete system
if and only if the set Lin(L) of all words corresponding to L is a pure unitary
language generated by a set closed under the conjugacy relation. The class of
pure unitary languages was introduced by A. Ehrenfeucht, D. Haussler, G.
Rozenberg in 1983, as a subclass of the class of context-free languages,
together with a characterization of regular pure unitary languages by means of
a decidable property. As a direct consequence, we characterize (regular)
circular languages generated by complete systems. We can also decide whether
the language generated by a complete system is regular. Finally, we point out
that complete systems have the same computational power as finite simple
systems, an easy type of circular splicing system defined in the literature
from the very beginning, when only one rule is allowed. From our results on
complete systems, it follows that finite simple systems generate a class of
context-free languages containing non-regular languages, showing the
incorrectness of a longstanding result on simple systems.
|
[
{
"version": "v1",
"created": "Thu, 12 Nov 2009 08:40:12 GMT"
}
] | 2009-11-13T00:00:00 |
[
[
"Bonizzoni",
"Paola",
""
],
[
"De Felice",
"Clelia",
""
],
[
"Zizza",
"Rosalba",
""
]
] |
new_dataset
| 0.965938 |
0911.2364
|
Loet Leydesdorff
|
Wilfred Dolfsma, Loet Leydesdorff
|
Journals as constituents of scientific discourse: economic heterodoxy
| null |
Wilfred Dolfsma & Loet Leydesdorff, Journals as Constituents of
Scientific Discourse: Economic Heterodoxy, On the Horizon 16(4), 214-225,
2008
| null | null |
cs.DL physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Purpose: to provide a view and analysis of the immediate field of journals
which surround a number of key heterodox economics journals.
Design/methodology/approach: Using citation data from the Science and Social
Science Citation Index, the individual and collective networks of a number of
journals in this field are analyzed. Findings: The size and shape of the
citation networks of journals can differ substantially, even if in a broadly
similar category. Heterodox economics cannot (yet) be considered as an
integrated specialty: authors in several journals in heterodox economics cite
more from mainstream economics than from other heterodox journals. There are
also strong links with other disciplinary fields such as geography, development
studies, women studies, etc.
|
[
{
"version": "v1",
"created": "Thu, 12 Nov 2009 11:12:11 GMT"
}
] | 2009-11-13T00:00:00 |
[
[
"Dolfsma",
"Wilfred",
""
],
[
"Leydesdorff",
"Loet",
""
]
] |
new_dataset
| 0.997518 |
0911.2423
|
Matt Purkeypile
|
Matt Purkeypile
|
Cove: A Practical Quantum Computer Programming Framework
|
Doctoral dissertation, 272 pages
| null | null | null |
cs.PL quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While not yet in commercial existence, quantum computers have the ability to
solve certain classes of problems that are not efficiently solvable on existing
Turing Machine based (classical) computers. For quantum computers to be of use,
methods of programming them must exist. Proposals exist for programming quantum
computers, but all of the existing ones suffer from flaws that make them
impractical in commercial software development environments. Cove is a
framework for programming quantum computers that extends existing classical
languages to allow for quantum computation, thus providing a quantum computing
toolkit for commercial software developers. Since the target users of Cove are
commercial developers, it is an object oriented framework that can be used by
multiple languages and also places emphasis on complete documentation. The
focus of Cove is not so much on the software product, but on the fundamental
concepts that make quantum computing practical for common developers.
|
[
{
"version": "v1",
"created": "Thu, 12 Nov 2009 05:36:23 GMT"
}
] | 2009-11-13T00:00:00 |
[
[
"Purkeypile",
"Matt",
""
]
] |
new_dataset
| 0.999687 |
0911.2033
|
EPTCS
|
Tom\'a\v{s} Babiak, Vojt\v{e}ch \v{R}eh\'ak, Jan Strej\v{c}ek
|
Almost Linear B\"uchi Automata
| null |
EPTCS 8, 2009, pp. 16-25
|
10.4204/EPTCS.8.2
| null |
cs.FL cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new fragment of Linear temporal logic (LTL) called LIO and a
new class of Buechi automata (BA) called Almost linear Buechi automata (ALBA).
We provide effective translations between LIO and ALBA showing that the two
formalisms are expressively equivalent. While standard translations of LTL into
BA use some intermediate formalisms, the presented translation of LIO into ALBA
is direct. As we expect applications of ALBA in model checking, we compare the
expressiveness of ALBA with other classes of Buechi automata studied in this
context and we indicate possible applications.
|
[
{
"version": "v1",
"created": "Wed, 11 Nov 2009 00:48:28 GMT"
}
] | 2009-11-12T00:00:00 |
[
[
"Babiak",
"Tomáš",
""
],
[
"Řehák",
"Vojtěch",
""
],
[
"Strejček",
"Jan",
""
]
] |
new_dataset
| 0.987652 |
0901.2349
|
Eduardo G. Altmann
|
Eduardo G. Altmann, Janet B. Pierrehumbert, and Adilson E. Motter
|
Beyond word frequency: Bursts, lulls, and scaling in the temporal
distributions of words
| null |
PLoS ONE 4 (11): e7678 (2009)
|
10.1371/journal.pone.0007678
| null |
cs.CL cond-mat.dis-nn physics.data-an physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Background: Zipf's discovery that word frequency distributions obey a power
law established parallels between biological and physical processes, and
language, laying the groundwork for a complex systems perspective on human
communication. More recent research has also identified scaling regularities in
the dynamics underlying the successive occurrences of events, suggesting the
possibility of similar findings for language as well.
Methodology/Principal Findings: By considering frequent words in USENET
discussion groups and in disparate databases where the language has different
levels of formality, here we show that the distributions of distances between
successive occurrences of the same word display bursty deviations from a
Poisson process and are well characterized by a stretched exponential (Weibull)
scaling. The extent of this deviation depends strongly on semantic type -- a
measure of the logicality of each word -- and less strongly on frequency. We
develop a generative model of this behavior that fully determines the dynamics
of word usage.
Conclusions/Significance: Recurrence patterns of words are well described by
a stretched exponential distribution of recurrence times, an empirical scaling
that cannot be anticipated from Zipf's law. Because the use of words provides a
uniquely precise and powerful lens on human thought and activity, our findings
also have implications for other overt manifestations of collective human
dynamics.
|
[
{
"version": "v1",
"created": "Thu, 15 Jan 2009 21:12:12 GMT"
},
{
"version": "v2",
"created": "Wed, 11 Nov 2009 16:07:23 GMT"
}
] | 2009-11-11T00:00:00 |
[
[
"Altmann",
"Eduardo G.",
""
],
[
"Pierrehumbert",
"Janet B.",
""
],
[
"Motter",
"Adilson E.",
""
]
] |
new_dataset
| 0.972386 |
0911.1862
|
EPTCS
|
Luca Aceto (Reykjavik University), Anna Ingolfsdottir (Reykjavik
University), Joshua Sack (Reykjavik University)
|
Characteristic Formulae for Fixed-Point Semantics: A General Framework
| null |
EPTCS 8, 2009, pp. 1-15
|
10.4204/EPTCS.8.1
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The literature on concurrency theory offers a wealth of examples of
characteristic-formula constructions for various behavioural relations over
finite labelled transition systems and Kripke structures that are defined in
terms of fixed points of suitable functions. Such constructions and their
proofs of correctness have been developed independently, but have a common
underlying structure. This study provides a general view of characteristic
formulae that are expressed in terms of logics with a facility for the
recursive definition of formulae. It is shown how several examples of
characteristic-formula constructions from the literature can be recovered as
instances of the proposed general framework, and how the framework can be used
to yield novel constructions.
|
[
{
"version": "v1",
"created": "Tue, 10 Nov 2009 09:14:55 GMT"
}
] | 2009-11-11T00:00:00 |
[
[
"Aceto",
"Luca",
"",
"Reykjavik University"
],
[
"Ingolfsdottir",
"Anna",
"",
"Reykjavik\n University"
],
[
"Sack",
"Joshua",
"",
"Reykjavik University"
]
] |
new_dataset
| 0.976149 |
cs/0606025
|
Xiaowen Zhang
|
Xiaowen Zhang, Li Shu, Ke Tang
|
A Chaotic Cipher Mmohocc and Its Security Analysis
|
14 pages, 4 figures, 4 tables
| null |
10.1117/12.717682
| null |
cs.CR
| null |
In this paper we introduce a new chaotic stream cipher Mmohocc which utilizes
the fundamental chaos characteristics. The designs of the major components of
the cipher are given. Its cryptographic properties of period, auto- and
cross-correlations, and the mixture of Markov processes and spatiotemporal
effects are investigated. The cipher is resistant to the related-key-IV
attacks, Time/Memory/Data tradeoff attacks, algebraic attacks, and chosen-text
attacks. The keystreams successfully passed two batteries of statistical tests
and the encryption speed is comparable with RC4.
|
[
{
"version": "v1",
"created": "Tue, 6 Jun 2006 17:42:56 GMT"
}
] | 2009-11-11T00:00:00 |
[
[
"Zhang",
"Xiaowen",
""
],
[
"Shu",
"Li",
""
],
[
"Tang",
"Ke",
""
]
] |
new_dataset
| 0.999605 |
0906.2947
|
Stylianos Basagiannis
|
Stylianos Basagiannis, Panagiotis Katsaros and Andrew Pombortsis
|
Attacking an OT-Based Blind Signature Scheme
|
3 pages, 2 figures, sumbitted for evaluation, under the title
"Security Analysis of an OT-based blind signature scheme"
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we describe an attack against one of the
Oblivious-Transfer-based blind signatures scheme, proposed in [1]. An attacker
with a primitive capability of producing specific-range random numbers, while
exhibiting a partial MITM behavior, is able to corrupt the communication
between the protocol participants. The attack is quite efficient as it leads to
a protocol communication corruption and has a sound-minimal computational cost.
We propose a solution to fix the security flaw.
|
[
{
"version": "v1",
"created": "Tue, 16 Jun 2009 14:23:19 GMT"
},
{
"version": "v2",
"created": "Wed, 24 Jun 2009 12:02:35 GMT"
},
{
"version": "v3",
"created": "Wed, 1 Jul 2009 11:33:05 GMT"
},
{
"version": "v4",
"created": "Tue, 10 Nov 2009 14:24:14 GMT"
}
] | 2009-11-10T00:00:00 |
[
[
"Basagiannis",
"Stylianos",
""
],
[
"Katsaros",
"Panagiotis",
""
],
[
"Pombortsis",
"Andrew",
""
]
] |
new_dataset
| 0.998306 |
0911.1510
|
Gitanjali Bhutani
|
Gitanjali Bhutani
|
A Near-Optimal Scheme for TCP ACK Pacing to Maintain Throughput in
Wireless Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The advent of fourth generation technologies in wireless networks and the
rapid growth of 3G have heralded an era that will require researchers to find
reliable and easily implement-able solutions to the problem of poor TCP
performance in the wireless environment. Since a large part of the Internet is
TCP-based, solving this problem will be instrumental in determining if the move
from wired to wireless will be seamless or not. This paper proposes a scheme
that uses the base station's ability to predict the time at which the link may
be going down and to estimate the period for which the mobile would be
unreachable due to conditions like fading. By using cross-layer and ACK pacing
algorithms, the base station prevents the fixed host from timing out while
waiting for ACKs from the mobile. This in turn prevents TCP on the fixed host
from bringing down the throughput drastically due to temporary network
conditions, caused by mobility or the unreliability of wireless links.
Experimental results indicate a reasonable increase in throughput when the ACK
holding scheme is used.
|
[
{
"version": "v1",
"created": "Sun, 8 Nov 2009 10:38:18 GMT"
}
] | 2009-11-10T00:00:00 |
[
[
"Bhutani",
"Gitanjali",
""
]
] |
new_dataset
| 0.992929 |
0911.1707
|
Michel Nabaa
|
Michel Nabaa (LITIS), Cyrille Bertelle (LITIS), Antoine Dutot (LITIS),
Damien Olivier (LITIS), Pascal Mallet
|
A Dynamic Vulnerability Map to Assess the Risk of Road Network Traffic
Utilization
| null |
International Symposium on Risk Models and Applications, Ki\`ev :
Ukraine (2008)
| null | null |
cs.AI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Le Havre agglomeration (CODAH) includes 16 establishments classified Seveso
with high threshold. In the literature, we construct vulnerability maps to help
decision makers assess the risk. Such approaches remain static and do take into
account the population displacement in the estimation of the vulnerability. We
propose a decision making tool based on a dynamic vulnerability map to evaluate
the difficulty of evacuation in the different sectors of CODAH. We use a
Geographic Information system (GIS) to visualize the map which evolves with the
road traffic state through a detection of communities in large graphs
algorithm.
|
[
{
"version": "v1",
"created": "Mon, 9 Nov 2009 15:43:54 GMT"
}
] | 2009-11-10T00:00:00 |
[
[
"Nabaa",
"Michel",
"",
"LITIS"
],
[
"Bertelle",
"Cyrille",
"",
"LITIS"
],
[
"Dutot",
"Antoine",
"",
"LITIS"
],
[
"Olivier",
"Damien",
"",
"LITIS"
],
[
"Mallet",
"Pascal",
""
]
] |
new_dataset
| 0.970291 |
cs/0306066
|
Venicio Duic
|
Venicio Duic, Massimo Lamanna
|
The COMPASS Event Store in 2002
|
Talk from the 2003 conference: "Computing in High Energy and Nuclear
Physics" (CHEP03), La Jolla, Ca, USA, March 2003, 6 pages. PSN MOKT011
| null |
10.1109/TNS.2004.832645
| null |
cs.DB
| null |
COMPASS, the fixed-target experiment at CERN studying the structure of the
nucleon and spectroscopy, collected over 260 TB during summer 2002 run. All
these data, together with reconstructed events information, were put from the
beginning in a database infrastructure based on Objectivity/DB and on the
hierarchical storage manager CASTOR. The experience in the usage of the
database is reviewed and the evolution of the system outlined.
|
[
{
"version": "v1",
"created": "Fri, 13 Jun 2003 14:33:53 GMT"
}
] | 2009-11-10T00:00:00 |
[
[
"Duic",
"Venicio",
""
],
[
"Lamanna",
"Massimo",
""
]
] |
new_dataset
| 0.997726 |
cs/0404016
|
Tze Wei Tang
|
T.W. Tang, A. Allison and D. Abbott
|
Parrondo's games with chaotic switching
|
11 pages, 9 figures
| null |
10.1117/12.561307
| null |
cs.GT
| null |
This paper investigates the different effects of chaotic switching on
Parrondo's games, as compared to random and periodic switching. The rate of
winning of Parrondo's games with chaotic switching depends on coefficient(s)
defining the chaotic generator, initial conditions of the chaotic sequence and
the proportion of Game A played. Maximum rate of winning can be obtained with
all the above mentioned factors properly set, and this occurs when chaotic
switching approaches periodic behavior.
|
[
{
"version": "v1",
"created": "Wed, 7 Apr 2004 06:15:41 GMT"
}
] | 2009-11-10T00:00:00 |
[
[
"Tang",
"T. W.",
""
],
[
"Allison",
"A.",
""
],
[
"Abbott",
"D.",
""
]
] |
new_dataset
| 0.976698 |
cs/0407047
|
David N. Levin
|
David N. Levin (U.of Chicago)
|
Channel-Independent and Sensor-Independent Stimulus Representations
|
The results of a numerically simulated experiment, which illustrates
the proposed method, have been added to the version submitted on October 27,
2004. This paper has been accepted for publication in the Journal of Applied
Physics. For related papers, see http://www.geocities.com/dlevin2001/
| null |
10.1063/1.2128687
| null |
cs.CV cs.AI
| null |
This paper shows how a machine, which observes stimuli through an
uncharacterized, uncalibrated channel and sensor, can glean machine-independent
information (i.e., channel- and sensor-independent information) about the
stimuli. First, we demonstrate that a machine defines a specific coordinate
system on the stimulus state space, with the nature of that coordinate system
depending on the device's channel and sensor. Thus, machines with different
channels and sensors "see" the same stimulus trajectory through state space,
but in different machine-specific coordinate systems. For a large variety of
physical stimuli, statistical properties of that trajectory endow the stimulus
configuration space with differential geometric structure (a metric and
parallel transfer procedure), which can then be used to represent relative
stimulus configurations in a coordinate-system-independent manner (and,
therefore, in a channel- and sensor-independent manner). The resulting
description is an "inner" property of the stimulus time series in the sense
that it does not depend on extrinsic factors like the observer's choice of a
coordinate system in which the stimulus is viewed (i.e., the observer's choice
of channel and sensor). This methodology is illustrated with analytic examples
and with a numerically simulated experiment. In an intelligent sensory device,
this kind of representation "engine" could function as a "front-end" that
passes channel/sensor-independent stimulus representations to a pattern
recognition module. After a pattern recognizer has been trained in one of these
devices, it could be used without change in other devices having different
channels and sensors.
|
[
{
"version": "v1",
"created": "Mon, 19 Jul 2004 17:13:34 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Oct 2004 22:55:06 GMT"
},
{
"version": "v3",
"created": "Mon, 26 Sep 2005 22:35:45 GMT"
}
] | 2009-11-10T00:00:00 |
[
[
"Levin",
"David N.",
"",
"U.of Chicago"
]
] |
new_dataset
| 0.99921 |
0812.3404
|
Olivier Leveque
|
Olivier Leveque, Christophe Vignat, Melda Yuksel
|
Diversity-Multiplexing Tradeoff for the MIMO Static Half-Duplex Relay
|
19 pages, 2 figures, submitted to the IEEE Transactions on
Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we investigate the diversity-multiplexing tradeoff (DMT) of the
multiple-antenna (MIMO) static half-duplex relay channel. A general expression
is derived for the DMT upper bound, which can be achieved by a
compress-and-forward protocol at the relay, under certain assumptions. The DMT
expression is given as the solution of a minimization problem in general, and
an explicit expression is found when the relay channel is symmetric in terms of
number of antennas, i.e. the source and the destination have n antennas each,
and the relay has m antennas. It is observed that the static half-duplex DMT
matches the full-duplex DMT when the relay has a single antenna, and is
strictly below the full-duplex DMT when the relay has multiple antennas.
Besides, the derivation of the upper bound involves a new asymptotic study of
spherical integrals (that is, integrals with respect to the Haar measure on the
unitary group U(n)), which is a topic of mathematical interest in itself.
|
[
{
"version": "v1",
"created": "Wed, 17 Dec 2008 21:10:26 GMT"
},
{
"version": "v2",
"created": "Sun, 8 Nov 2009 22:48:30 GMT"
}
] | 2009-11-09T00:00:00 |
[
[
"Leveque",
"Olivier",
""
],
[
"Vignat",
"Christophe",
""
],
[
"Yuksel",
"Melda",
""
]
] |
new_dataset
| 0.99451 |
0911.1288
|
Hugues Genevois
|
Caroline Cance, Hugues Genevois, Dani\`ele Dubois
|
What is instrumentality in new digital msuical devices ? A contribution
from cognitive linguistics and psychology
|
11 pages
|
What is instrumentality in new digital musical devices ? A
contribution from cognitive linguistics and psychology, Paris : France (2009)
| null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As far as music is concerned, instruments have always been part of a cultural
?landscape? (on technical, expressive and symbolic levels). The present
contribution explores the changes brought about by the shift that occurred
during the 20th century, from mechanical to digital instruments (also named
?virtual instruments?). First and foremost, a short recall of some historical
steps of the technological developments that have renewed our relationship to
sound, music, and instruments will be presented. Second, an analysis of
different discourses and terminologies presently used in the domains of
musicology and computer music will account for the evolution of the notion of
instrumentality.
|
[
{
"version": "v1",
"created": "Fri, 6 Nov 2009 16:06:40 GMT"
}
] | 2009-11-09T00:00:00 |
[
[
"Cance",
"Caroline",
""
],
[
"Genevois",
"Hugues",
""
],
[
"Dubois",
"Danièle",
""
]
] |
new_dataset
| 0.994517 |
cs/0208013
|
Jim Gray
|
Alexander S. Szalay, Jim Gray, Jan vandenBerg
|
Petabyte Scale Data Mining: Dream or Reality?
|
originals at
http://research.microsoft.com/scripts/pubs/view.asp?TR_ID=MSR-TR-2002-84
|
SIPE Astronmy Telescopes and Instruments, 22-28 August 2002,
Waikoloa, Hawaii
|
10.1117/12.461427
|
MSR-TR-2002-84
|
cs.DB cs.CE
| null |
Science is becoming very data intensive1. Today's astronomy datasets with
tens of millions of galaxies already present substantial challenges for data
mining. In less than 10 years the catalogs are expected to grow to billions of
objects, and image archives will reach Petabytes. Imagine having a 100GB
database in 1996, when disk scanning speeds were 30MB/s, and database tools
were immature. Such a task today is trivial, almost manageable with a laptop.
We think that the issue of a PB database will be very similar in six years. In
this paper we scale our current experiments in data archiving and analysis on
the Sloan Digital Sky Survey2,3 data six years into the future. We analyze
these projections and look at the requirements of performing data mining on
such data sets. We conclude that the task scales rather well: we could do the
job today, although it would be expensive. There do not seem to be any
show-stoppers that would prevent us from storing and using a Petabyte dataset
six years from today.
|
[
{
"version": "v1",
"created": "Wed, 7 Aug 2002 22:49:56 GMT"
}
] | 2009-11-07T00:00:00 |
[
[
"Szalay",
"Alexander S.",
""
],
[
"Gray",
"Jim",
""
],
[
"vandenBerg",
"Jan",
""
]
] |
new_dataset
| 0.993376 |
0809.4822
|
Jean-Marie Vanherpe
|
Jean-Luc Fouquet (LIFO), Jean-Marie Vanherpe (LIFO)
|
On normal odd partitions in cubic graphs
| null |
Discussiones Mathematicae Graph Theory 29, 2 (2009) 293-312
| null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A normal partition of the edges of a cubic graph is a partition into trails
(no repeated edge) such that each vertex is the end vertex of exactly one trail
of the partition. We investigate this notion and give some results and
problems.
|
[
{
"version": "v1",
"created": "Sun, 28 Sep 2008 05:57:36 GMT"
}
] | 2009-11-06T00:00:00 |
[
[
"Fouquet",
"Jean-Luc",
"",
"LIFO"
],
[
"Vanherpe",
"Jean-Marie",
"",
"LIFO"
]
] |
new_dataset
| 0.976959 |
0911.1036
|
Lahatra Rakotondrainibe
|
Lahatra Rakotondrainibe (IETR), Yvan Kokar (IETR), Gheorghe Zaharia
(IETR), Gha\"is El Zein (IETR)
|
Syst\`eme de Communications Sans Fil Tr\`es Haut D\'ebit \`a 60 GHz
| null |
XXIIe Colloque Traitement du Signal et des Images (GRETSI '09),
Dijon : France (2009)
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the study and the realization at IETR of a high data rate
60 GHz wireless communications system. The system uses a simple single carrier
architecture. The receiver architecture is based on a differential demodulation
which minimizes the intersymbol interference (ISI) effect and a signal
processing unit composed of a joint frame and byte synchronization block and a
conventional RS (255, 239) decoder. The byte synchronization technique provides
a high preamble detection probability and a very small value of the false
detection probability. First measurement results show a good communication link
quality in line of sight environments with directional antennas.
|
[
{
"version": "v1",
"created": "Thu, 5 Nov 2009 14:11:57 GMT"
}
] | 2009-11-06T00:00:00 |
[
[
"Rakotondrainibe",
"Lahatra",
"",
"IETR"
],
[
"Kokar",
"Yvan",
"",
"IETR"
],
[
"Zaharia",
"Gheorghe",
"",
"IETR"
],
[
"Zein",
"Ghaïs El",
"",
"IETR"
]
] |
new_dataset
| 0.999467 |
0911.1082
|
Yan Zhu
|
Yan Zhu and Dongning Guo
|
Ergodic Fading One-sided Interference Channels without State Information
at Transmitters
|
Submitted to IEEE Transaction on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work studies the capacity region of a two-user ergodic interference
channel with fading, where only one of the users is subject to interference
from the other user, and the channel state information (CSI) is only available
at the receivers. A layered erasure model with one-sided interference and with
arbitrary fading statistics is studied first, whose capacity region is
completely determined as a polygon. Each dominant rate pair can be regarded as
the outcome of a trade-off between the rate gain of the interference-free user
and the rate loss of the other user due to interference. Using insights from
the layered erasure model, inner and outer bounds of the capacity region are
provided for the one-sided fading Gaussian interference channels. In
particular, the inner bound is achieved by artificially creating layers in the
signaling of the interference-free user. The outer bound is developed by
characterizing a similar trade-off as in the erasure model by taking a
"layered" view using the incremental channel approach. Furthermore, the gap
between the inner and outer bounds is no more than 12.772 bits per channel use
per user, regardless of the signal-to-noise ratios and fading statistics.
|
[
{
"version": "v1",
"created": "Thu, 5 Nov 2009 17:26:32 GMT"
}
] | 2009-11-06T00:00:00 |
[
[
"Zhu",
"Yan",
""
],
[
"Guo",
"Dongning",
""
]
] |
new_dataset
| 0.991357 |
0911.1112
|
Michael Nelson
|
Herbert Van de Sompel, Michael L. Nelson, Robert Sanderson, Lyudmila
L. Balakireva, Scott Ainsworth, Harihar Shankar
|
Memento: Time Travel for the Web
|
14 pages, 5 figures
| null | null | null |
cs.IR cs.DL
|
http://creativecommons.org/licenses/by/3.0/
|
The Web is ephemeral. Many resources have representations that change over
time, and many of those representations are lost forever. A lucky few manage to
reappear as archived resources that carry their own URIs. For example, some
content management systems maintain version pages that reflect a frozen prior
state of their changing resources. Archives recurrently crawl the web to obtain
the actual representation of resources, and subsequently make those available
via special-purpose archived resources. In both cases, the archival copies have
URIs that are protocol-wise disconnected from the URI of the resource of which
they represent a prior state. Indeed, the lack of temporal capabilities in the
most common Web protocol, HTTP, prevents getting to an archived resource on the
basis of the URI of its original. This turns accessing archived resources into
a significant discovery challenge for both human and software agents, which
typically involves following a multitude of links from the original to the
archival resource, or of searching archives for the original URI. This paper
proposes the protocol-based Memento solution to address this problem, and
describes a proof-of-concept experiment that includes major servers of archival
content, including Wikipedia and the Internet Archive. The Memento solution is
based on existing HTTP capabilities applied in a novel way to add the temporal
dimension. The result is a framework in which archived resources can seamlessly
be reached via the URI of their original: protocol-based time travel for the
Web.
|
[
{
"version": "v1",
"created": "Thu, 5 Nov 2009 20:52:22 GMT"
},
{
"version": "v2",
"created": "Fri, 6 Nov 2009 21:35:50 GMT"
}
] | 2009-11-06T00:00:00 |
[
[
"Van de Sompel",
"Herbert",
""
],
[
"Nelson",
"Michael L.",
""
],
[
"Sanderson",
"Robert",
""
],
[
"Balakireva",
"Lyudmila L.",
""
],
[
"Ainsworth",
"Scott",
""
],
[
"Shankar",
"Harihar",
""
]
] |
new_dataset
| 0.999442 |
0911.0727
|
Manik Lal Das
|
Animesh Agarwal, Vaibhav Shrimali, Manik Lal Das
|
GSM Security Using Identity-based Cryptography
|
10 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Current security model in Global System for Mobile Communications (GSM)
predominantly use symmetric key cryptography. The rapid advancement of Internet
technology facilitates online trading, banking, downloading, emailing using
resource-constrained handheld devices such as personal digital assistants and
cell phones. However, these applications require more security than the present
GSM supports. Consequently, a careful design of GSM security using both
symmetric and asymmetric key cryptography would make GSM security more
adaptable in security intensive applications. This paper presents a secure and
efficient protocol for GSM security using identity based cryptography. The
salient features of the proposed protocol are (i) authenticated key exchange;
(ii) mutual authentication amongst communicating entities; and (iii) user
anonymity. The security analysis of the protocol shows its strength against
some known threats observed in conventional GSM security.
|
[
{
"version": "v1",
"created": "Wed, 4 Nov 2009 04:18:44 GMT"
}
] | 2009-11-05T00:00:00 |
[
[
"Agarwal",
"Animesh",
""
],
[
"Shrimali",
"Vaibhav",
""
],
[
"Das",
"Manik Lal",
""
]
] |
new_dataset
| 0.996334 |
0911.0660
|
Ramy Gohary
|
Ramy H. Gohary and Timothy N. Davidson
|
The capacity region of a product of two unmatched Gaussian broadcast
channels with three particular messages and a common message
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers a Gaussian broadcast channel with two unmatched degraded
components, three particular messages, and a common message that is intended
for all three receivers. It is shown that for this channel superposition coding
and Gaussian signalling is sufficient to achieve every point in the capacity
region.
|
[
{
"version": "v1",
"created": "Tue, 3 Nov 2009 19:39:07 GMT"
}
] | 2009-11-04T00:00:00 |
[
[
"Gohary",
"Ramy H.",
""
],
[
"Davidson",
"Timothy N.",
""
]
] |
new_dataset
| 0.968938 |
0809.5204
|
Georg B\"ocherer
|
Georg B\"ocherer and Alexandre de Baynast
|
A Distributed MAC Protocol for Cooperation in Random Access Networks
|
5 pages, improved presentation compared to previous version v1
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
WLAN is one of the most successful applications of wireless communications in
daily life because of low cost and ease of deployment. The enabling technique
for this success is the use of random access schemes for the wireless channel.
Random access requires minimal coordination between the nodes, which
considerably reduces the cost of the infrastructure. Recently, cooperative
communication in wireless networks has been of increasing interest because it
promises higher rates and reliability. An additional MAC overhead is necessary
to coordinate the nodes to allow cooperation and this overhead can possibly
cancel out the cooperative benefits. In this work, a completely distributed
protocol is proposed that allows nodes in the network to cooperate via Two-Hop
and Decode-and-Forward for transmitting their data to a common gateway node. It
is shown that high throughput gains are obtained in terms of the individual
throughput that can be guaranteed to any node in the network. These results are
validated by Monte Carlo simulations.
|
[
{
"version": "v1",
"created": "Tue, 30 Sep 2008 14:17:05 GMT"
},
{
"version": "v2",
"created": "Tue, 3 Nov 2009 15:57:30 GMT"
}
] | 2009-11-03T00:00:00 |
[
[
"Böcherer",
"Georg",
""
],
[
"de Baynast",
"Alexandre",
""
]
] |
new_dataset
| 0.999146 |
0911.0399
|
Rdv Ijcsis
|
A.Essaouabi and F. Regragui, E.Ibnelhaj
|
A Wavelet-Based Digital Watermarking for Video
|
5 pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423,
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 6, No. 1, pp. 029-033, October 2009, USA
| null |
ISSN 1947 5500
|
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel video watermarking system operating in the three dimensional wavelet
transform is here presented. Specifically the video sequence is partitioned
into spatio temporal units and the single shots are projected onto the 3D
wavelet domain. First a grayscale watermark image is decomposed into a series
of bitplanes that are preprocessed with a random location matrix. After that
the preprocessed bitplanes are adaptively spread spectrum and added in 3D
wavelet coefficients of the video shot. Our video watermarking algorithm is
robust against the attacks of frame dropping, averaging and swapping.
Furthermore, it allows blind retrieval of embedded watermark which does not
need the original video and the watermark is perceptually invisible. The
algorithm design, evaluation, and experimentation of the proposed scheme are
described in this paper.
|
[
{
"version": "v1",
"created": "Mon, 2 Nov 2009 20:07:52 GMT"
}
] | 2009-11-03T00:00:00 |
[
[
"Essaouabi",
"A.",
""
],
[
"Regragui",
"F.",
""
],
[
"Ibnelhaj",
"E.",
""
]
] |
new_dataset
| 0.998777 |
0903.0548
|
Li Chia Choo
|
Li-Chia Choo and Kai-Kit Wong
|
On the 3-Receiver Broadcast Channel with Degraded Message Sets and
Confidential Messages
|
Revised version submiitted to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, bounds to the rate-equivocation region for the general
3-receiver broadcast channel (BC) with degraded message sets, are presented for
confidential messages to be kept secret from one of the receivers. This model
is more general than the 2-receiver BCs with confidential messages with an
external wiretapper, and the recently studied 3-receiver degraded BCs with
confidential messages, since in the model studied in this paper, the conditions
on the receivers are general and the wiretapper receives the common message.
Wyner's code partitioning combined with double-binning is used to show the
achievable rate tuples. Error probability analysis and equivocation calculation
are also provided. The secure coding scheme is sufficient to provide security
for the 3-receiver BC with 2 or 3 degraded message sets, for the scenarios: (i)
3 degraded message sets, where the first confidential message is sent to
receivers 1 and 2 and the second confidential message is sent to receiver 1,
(ii) 2 degraded message sets, where one confidential message is sent to
receiver 1, and (iii) 2 degraded message sets, where one confidential message
is sent to receivers 1 and 2. The proof for the outer bound is shown for the
cases where receiver 1 is more capable than the wiretap receiver 3, for the
first two scenarios. Under the condition that both receivers 1 and 2 are less
noisy than the wiretap receiver 3, the inner and outer bounds coincide, giving
the rate-equivocation region for (iii). In addition, a new outer bound for the
general 3-receiver BC with 3 degraded messages is obtained.
|
[
{
"version": "v1",
"created": "Tue, 3 Mar 2009 14:53:11 GMT"
},
{
"version": "v2",
"created": "Tue, 27 Oct 2009 16:10:28 GMT"
}
] | 2009-10-27T00:00:00 |
[
[
"Choo",
"Li-Chia",
""
],
[
"Wong",
"Kai-Kit",
""
]
] |
new_dataset
| 0.994159 |
0910.4854
|
Serguei Mokhov
|
Serguei A. Mokhov and Yingying She
|
Yet Another Pacman 3D Adventures
|
31 pages, 8 figures. A 2006 report, corresponding to the open source
project here: http://sourceforge.net/projects/yap3dad/
| null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This game is meant to be extension of the overly-beaten pacman-style game
(code-named "Yet Another Pacman 3D Adventures", or YAP3DAD) from the proposed
ideas and other projects with advance visual and computer graphics features,
including a-game-in-a-game approach. The project is an open-source project
published on SourceForge.net for possible future development and extension.
|
[
{
"version": "v1",
"created": "Mon, 26 Oct 2009 10:55:16 GMT"
}
] | 2009-10-27T00:00:00 |
[
[
"Mokhov",
"Serguei A.",
""
],
[
"She",
"Yingying",
""
]
] |
new_dataset
| 0.997638 |
0910.4500
|
Marco Volpe
|
Andrea Masini, Luca Vigan\`o, Marco Volpe
|
A History of Until
|
24 pages, full version of paper at Methods for Modalities 2009
(M4M-6)
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Until is a notoriously difficult temporal operator as it is both existential
and universal at the same time: A until B holds at the current time instant w
iff either B holds at w or there exists a time instant w' in the future at
which B holds and such that A holds in all the time instants between the
current one and w'. This "ambivalent" nature poses a significant challenge when
attempting to give deduction rules for until. In this paper, in contrast, we
make explicit this duality of until to provide well-behaved natural deduction
rules for linear-time logics by introducing a new temporal operator that allows
us to formalize the "history" of until, i.e., the "internal" universal
quantification over the time instants between the current one and w'. This
approach provides the basis for formalizing deduction systems for temporal
logics endowed with the until operator. For concreteness, we give here a
labeled natural deduction system for a linear-time logic endowed with the new
operator and show that, via a proper translation, such a system is also sound
and complete with respect to the linear temporal logic LTL with until.
|
[
{
"version": "v1",
"created": "Fri, 23 Oct 2009 15:31:57 GMT"
},
{
"version": "v2",
"created": "Sun, 25 Oct 2009 17:10:16 GMT"
}
] | 2009-10-26T00:00:00 |
[
[
"Masini",
"Andrea",
""
],
[
"Viganò",
"Luca",
""
],
[
"Volpe",
"Marco",
""
]
] |
new_dataset
| 0.974823 |
0910.4186
|
Hsien-Po Shiang
|
Hsien-Po Shiang, Mihaela van der Schaar
|
Media-TCP: A Quality-Centric TCP-Friendly Congestion Control for
Multimedia Transmission
|
15 pages, 8 figures, 4 tables, and 2 algorithms
| null | null | null |
cs.NI cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a quality-centric congestion control for multimedia
streaming over IP networks, which we refer to as media-TCP. Unlike existing
congestion control schemes that adapt a user's sending rate merely to the
network condition, our solution adapts the sending rate to both the network
condition and the application characteristics by explicitly considering the
distortion impacts, delay deadlines, and interdependencies of different video
packet classes. Hence, our media-aware solution is able to provide differential
services for transmitting various packet classes and thereby, further improves
the multimedia streaming quality. We model this problem using a Finite-Horizon
Markov Decision Process (FHMDP) and determine the optimal congestion control
policy that maximizes the long-term multimedia quality, while adhering to the
horizon- TCP-friendliness constraint, which ensures long-term fairness with
existing TCP applications. We show that the FHMDP problem can be decomposed
into multiple optimal stopping problems, which admit a low-complexity
threshold-based solution. Moreover, unlike existing congestion control
approaches, which focus on maintaining throughput-based fairness among users,
the proposed media-TCP aims to achieve quality-based fairness among multimedia
users. We also derive sufficient conditions for multiple multimedia users to
achieve quality-based fairness using media-TCP congestion control. Our
simulation results show that the proposed media-TCP achieves more than 3dB
improvement in terms of PSNR over the conventional TCP congestion control
approaches, with the largest improvements observed for real-time streaming
applications requiring stringent playback delays.
|
[
{
"version": "v1",
"created": "Wed, 21 Oct 2009 21:53:25 GMT"
}
] | 2009-10-23T00:00:00 |
[
[
"Shiang",
"Hsien-Po",
""
],
[
"van der Schaar",
"Mihaela",
""
]
] |
new_dataset
| 0.999494 |
0910.4342
|
Steve Kremer
|
Joshua D. Guttman (The MITRE Corporation and Worcester Polytechnic
Institute)
|
Fair Exchange in Strand Spaces
| null |
EPTCS 7, 2009, pp. 46-60
|
10.4204/EPTCS.7.4
| null |
cs.CR cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many cryptographic protocols are intended to coordinate state changes among
principals. Exchange protocols coordinate delivery of new values to the
participants, e.g. additions to the set of values they possess. An exchange
protocol is fair if it ensures that delivery of new values is balanced: If one
participant obtains a new possession via the protocol, then all other
participants will, too. Fair exchange requires progress assumptions, unlike
some other protocol properties. The strand space model is a framework for
design and verification of cryptographic protocols. A strand is a local
behavior of a single principal in a single session of a protocol. A bundle is a
partially ordered global execution built from protocol strands and adversary
activities. The strand space model needs two additions for fair exchange
protocols. First, we regard the state as a multiset of facts, and we allow
strands to cause changes in this state via multiset rewriting. Second, progress
assumptions stipulate that some channels are resilient-and guaranteed to
deliver messages-and some principals are assumed not to stop at certain
critical steps. This method leads to proofs of correctness that cleanly
separate protocol properties, such as authentication and confidentiality, from
invariants governing state evolution. G. Wang's recent fair exchange protocol
illustrates the approach.
|
[
{
"version": "v1",
"created": "Thu, 22 Oct 2009 17:13:44 GMT"
}
] | 2009-10-23T00:00:00 |
[
[
"Guttman",
"Joshua D.",
"",
"The MITRE Corporation and Worcester Polytechnic\n Institute"
]
] |
new_dataset
| 0.971935 |
0910.3811
|
Damien Chablat
|
Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), Stefan Staicu
|
Dynamics of the Orthoglide parallel robot
| null |
UPB Scientific Bulletin, Series D: Mechanical Engineering 71, 3
(2009) 3-16
| null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recursive matrix relations for kinematics and dynamics of the Orthoglide
parallel robot having three concurrent prismatic actuators are established in
this paper. These are arranged according to the Cartesian coordinate system
with fixed orientation, which means that the actuating directions are normal to
each other. Three identical legs connecting to the moving platform are located
on three planes being perpendicular to each other too. Knowing the position and
the translation motion of the platform, we develop the inverse kinematics
problem and determine the position, velocity and acceleration of each element
of the robot. Further, the principle of virtual work is used in the inverse
dynamic problem. Some matrix equations offer iterative expressions and graphs
for the input forces and the powers of the three actuators.
|
[
{
"version": "v1",
"created": "Tue, 20 Oct 2009 11:18:55 GMT"
}
] | 2009-10-21T00:00:00 |
[
[
"Chablat",
"Damien",
"",
"IRCCyN"
],
[
"Wenger",
"Philippe",
"",
"IRCCyN"
],
[
"Staicu",
"Stefan",
""
]
] |
new_dataset
| 0.964297 |
0710.0142
|
Marco Baldi
|
Marco Baldi
|
LDPC codes in the McEliece cryptosystem: attacks and countermeasures
|
NATO Advanced Research Workshop 2008: Enhancing Crypto-Primitives
with Techniques from Coding Theory
|
NATO Science for Peace and Security Series - D: Information and
Communication Security, vol. 23, pp. 160-174, IOS Press, 2009. Edited by Bart
Preneel, Stefan Dodunekov, Vincent Rijmen, Svetla Nikova. ISBN
978-1-60750-002-5
|
10.3233/978-1-60750-002-5-160
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The McEliece cryptosystem is a public-key cryptosystem based on coding theory
that has successfully resisted cryptanalysis for thirty years. The original
version, based on Goppa codes, is able to guarantee a high level of security,
and is faster than competing solutions, like RSA. Despite this, it has been
rarely considered in practical applications, due to two major drawbacks: i)
large size of the public key and ii) low transmission rate. Low-Density
Parity-Check (LDPC) codes are state-of-art forward error correcting codes that
permit to approach the Shannon limit while ensuring limited complexity.
Quasi-Cyclic (QC) LDPC codes are a particular class of LDPC codes, able to join
low complexity encoding of QC codes with high-performing and low-complexity
decoding of LDPC codes. In a previous work it has been proposed to adopt a
particular family of QC-LDPC codes in the McEliece cryptosystem to reduce the
key size and increase the transmission rate. Recently, however, new attacks
have been found that are able to exploit a flaw in the transformation from the
private key to the public one. Such attacks can be effectively countered by
changing the form of some constituent matrices, without altering the system
parameters. This work gives an overview of the QC-LDPC codes-based McEliece
cryptosystem and its cryptanalysis. Two recent versions are considered, and
their ability to counter all the currently known attacks is discussed. A third
version able to reach a higher security level is also proposed. Finally, it is
shown that the new QC-LDPC codes-based cryptosystem scales favorably with the
key length.
|
[
{
"version": "v1",
"created": "Sun, 30 Sep 2007 14:33:00 GMT"
},
{
"version": "v2",
"created": "Sun, 11 Jan 2009 11:53:29 GMT"
}
] | 2009-10-20T00:00:00 |
[
[
"Baldi",
"Marco",
""
]
] |
new_dataset
| 0.999036 |
0910.2961
|
Yan Zhu
|
Yan Zhu and Dongning Guo
|
Isotropic MIMO Interference Channels without CSIT: The Loss of Degrees
of Freedom
|
appears in Allerton 2009
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies two-user MIMO interference channel with isotropic fading.
We assume that users are equipped with arbitrary number of antennas and the
channel state information (CSI) is available at receivers only. An outer bound
is obtained for the degree of freedom region, which suggests the loss of
degrees of freedom due to the lack of CSI at transmitters under many
circumstances.
|
[
{
"version": "v1",
"created": "Thu, 15 Oct 2009 18:39:27 GMT"
}
] | 2009-10-16T00:00:00 |
[
[
"Zhu",
"Yan",
""
],
[
"Guo",
"Dongning",
""
]
] |
new_dataset
| 0.996881 |
0806.3284
|
Daniel M. Gordon
|
Daniel M. Gordon, Victor Miller and Peter Ostapenko
|
Optimal hash functions for approximate closest pairs on the n-cube
|
IEEE Transactions on Information Theory, to appear
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One way to find closest pairs in large datasets is to use hash functions. In
recent years locality-sensitive hash functions for various metrics have been
given: projecting an n-cube onto k bits is simple hash function that performs
well. In this paper we investigate alternatives to projection. For various
parameters hash functions given by complete decoding algorithms for codes work
better, and asymptotically random codes perform better than projection.
|
[
{
"version": "v1",
"created": "Fri, 20 Jun 2008 17:19:44 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Oct 2009 15:40:02 GMT"
}
] | 2009-10-15T00:00:00 |
[
[
"Gordon",
"Daniel M.",
""
],
[
"Miller",
"Victor",
""
],
[
"Ostapenko",
"Peter",
""
]
] |
new_dataset
| 0.997771 |
0910.2649
|
Chinmay Karande
|
Chinmay Karande
|
Polynomially Correlated Knapsack is NP-complete
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
0-1 Knapsack is a fundamental NP-complete problem. In this article we prove
that it remains NP-complete even when the weights of the objects in the packing
constraints and their values in the objective function satisfy specific
stringent conditions: the values are integral powers of the weights of the
objects.
|
[
{
"version": "v1",
"created": "Wed, 14 Oct 2009 15:43:40 GMT"
}
] | 2009-10-15T00:00:00 |
[
[
"Karande",
"Chinmay",
""
]
] |
new_dataset
| 0.993605 |
0910.1844
|
N Vunka Jungum
|
Pascal Fallavollita
|
3D/2D Registration of Mapping Catheter Images for Arrhythmia
Interventional Assistance
|
International Journal of Computer Science Issues, IJCSI, Volume 4,
Issue 2, pp10-19, September 2009
|
P. Fallavollita, " 3D/2D Registration of Mapping Catheter Images
for Arrhythmia Interventional Assistance", International Journal of Computer
Science Issues, IJCSI, Volume 4, Issue 2, pp10-19, September 2009"
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Radiofrequency (RF) catheter ablation has transformed treatment for
tachyarrhythmias and has become first-line therapy for some tachycardias. The
precise localization of the arrhythmogenic site and the positioning of the RF
catheter over that site are problematic: they can impair the efficiency of the
procedure and are time consuming (several hours). Electroanatomic mapping
technologies are available that enable the display of the cardiac chambers and
the relative position of ablation lesions. However, these are expensive and use
custom-made catheters. The proposed methodology makes use of standard catheters
and inexpensive technology in order to create a 3D volume of the heart chamber
affected by the arrhythmia. Further, we propose a novel method that uses a
priori 3D information of the mapping catheter in order to estimate the 3D
locations of multiple electrodes across single view C-arm images. The monoplane
algorithm is tested for feasibility on computer simulations and initial canine
data.
|
[
{
"version": "v1",
"created": "Fri, 9 Oct 2009 20:07:11 GMT"
}
] | 2009-10-13T00:00:00 |
[
[
"Fallavollita",
"Pascal",
""
]
] |
new_dataset
| 0.996323 |
0910.1857
|
N Vunka Jungum
|
Ahmad Shukri Mohd Noor and Md Yazid Md Saman
|
Distributed Object Medical Imaging Model
|
" International Journal of Computer Science Issues, IJCSI, Volume 4,
Issue 2, pp42-48, September 2009"
|
A.S.M. Noor and Y.Saman, "Distributed Object Medical Imaging
Model", International Journal of Computer Science Issues, IJCSI, Volume 4,
Issue 2, pp42-48, September 2009
| null | null |
cs.SE cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Digital medical informatics and images are commonly used in hospitals today,.
Because of the interrelatedness of the radiology department and other
departments, especially the intensive care unit and emergency department, the
transmission and sharing of medical images has become a critical issue. Our
research group has developed a Java-based Distributed Object Medical Imaging
Model(DOMIM) to facilitate the rapid development and deployment of medical
imaging applications in a distributed environment that can be shared and used
by related departments and mobile physiciansDOMIM is a unique suite of
multimedia telemedicine applications developed for the use by medical related
organizations. The applications support realtime patients' data, image files,
audio and video diagnosis annotation exchanges. The DOMIM enables joint
collaboration between radiologists and physicians while they are at distant
geographical locations. The DOMIM environment consists of heterogeneous,
autonomous, and legacy resources. The Common Object Request Broker Architecture
(CORBA), Java Database Connectivity (JDBC), and Java language provide the
capability to combine the DOMIM resources into an integrated, interoperable,
and scalable system. The underneath technology, including IDL ORB, Event
Service, IIOP JDBC/ODBC, legacy system wrapping and Java implementation are
explored. This paper explores a distributed collaborative CORBA/JDBC based
framework that will enhance medical information management requirements and
development. It encompasses a new paradigm for the delivery of health services
that requires process reengineering, cultural changes, as well as
organizational changes
|
[
{
"version": "v1",
"created": "Fri, 9 Oct 2009 20:42:48 GMT"
}
] | 2009-10-13T00:00:00 |
[
[
"Noor",
"Ahmad Shukri Mohd",
""
],
[
"Saman",
"Md Yazid Md",
""
]
] |
new_dataset
| 0.961296 |
0910.1922
|
Valentin Savin
|
Valentin Savin
|
Binary Linear-Time Erasure Decoding for Non-Binary LDPC codes
|
5 pages, ITW
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we first introduce the extended binary representation of
non-binary codes, which corresponds to a covering graph of the bipartite graph
associated with the non-binary code. Then we show that non-binary codewords
correspond to binary codewords of the extended representation that further
satisfy some simplex-constraint: that is, bits lying over the same symbol-node
of the non-binary graph must form a codeword of a simplex code. Applied to the
binary erasure channel, this description leads to a binary erasure decoding
algorithm of non-binary LDPC codes, whose complexity depends linearly on the
cardinality of the alphabet. We also give insights into the structure of
stopping sets for non-binary LDPC codes, and discuss several aspects related to
upper-layer FEC applications.
|
[
{
"version": "v1",
"created": "Sat, 10 Oct 2009 14:41:46 GMT"
}
] | 2009-10-13T00:00:00 |
[
[
"Savin",
"Valentin",
""
]
] |
new_dataset
| 0.999421 |
0910.1954
|
Sahand Haji Ali Ahmad
|
Sahand Haji Ali Ahmad, Mingyan Liu
|
Multi-channel Opportunistic Access: A Case of Restless Bandits with
Multiple Plays
|
8 pages, 0 figures, Forty-Seventh Annual Allerton Conference on
Communication, Control, and Computing, 2009
|
Proceedings of Forty-Seventh Annual Allerton Conference on
Communication, Control, and Computing, 2009
| null | null |
cs.IT cs.DM math.IT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers the following stochastic control problem that arises in
opportunistic spectrum access: a system consists of n channels (Gilbert-Elliot
channels)where the state (good or bad) of each channel evolves as independent
and identically distributed Markov processes. A user can select exactly k
channels to sense and access (based on the sensing result) in each time slot. A
reward is obtained whenever the user senses and accesses a good channel. The
objective is to design a channel selection policy that maximizes the expected
discounted total reward accrued over a finite or infinite horizon. In our
previous work we established the optimality of a greedy policy for the special
case of k = 1 (i.e., single channel access) under the condition that the
channel state transitions are positively correlated over time. In this paper we
show under the same condition the greedy policy is optimal for the general case
of k >= 1; the methodology introduced here is thus more general. This problem
may be viewed as a special case of the restless bandit problem, with multiple
plays. We discuss connections between the current problem and existing
literature on this class of problems.
|
[
{
"version": "v1",
"created": "Sat, 10 Oct 2009 22:36:48 GMT"
}
] | 2009-10-13T00:00:00 |
[
[
"Ahmad",
"Sahand Haji Ali",
""
],
[
"Liu",
"Mingyan",
""
]
] |
new_dataset
| 0.998575 |
0910.2154
|
Jocelyne Troccaz
|
J. Tonetti (CHU-Grenoble ortho-traumato), L. Vadcard (LSE), P. Girard
(IHPC), M. Dubois (LPS), P. Merloz (CHU-Grenoble ortho-traumato), Jocelyne
Troccaz (TIMC)
|
Assessment of a percutaneous iliosacral screw insertion simulator
| null |
Orthop Traumatol Surg Res (2009) epub ahead of print
|
10.1016/j.otsr.2009.07.005
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
BACKGROUND: Navigational simulator use for specialized training purposes is
rather uncommon in orthopaedic and trauma surgery. However, it reveals
providing a valuable tool to train orthopaedic surgeons and help them to plan
complex surgical procedures. PURPOSE: This work's objective was to assess
educational efficiency of a path simulator under fluoroscopic guidance applied
to sacroiliac joint percutaneous screw fixation. MATERIALS AND METHODS: We
evaluated 23 surgeons' accuracy inserting a guide-wire in a human cadaver
experiment, following a pre-established procedure. These medical trainees were
defined in three prospective respects: novice or skilled; with or without
theoretical knowledge; with or without surgical procedure familiarity. Analysed
criteria for each tested surgeon included the number of intraoperative X-rays
taken in order to achieve the surgical procedure as well as an iatrogenic index
reflecting the surgeon's ability to detect any hazardous trajectory at the time
of performing said procedure. RESULTS: An average number of 13 X-rays was
required for wire implantation by the G1 group. G2 group, assisted by the
simulator use, required an average of 10 X-rays. A substantial difference was
especially observed within the novice sub-group (N), with an average of 12.75
X-rays for the G1 category and an average of 8.5 X-rays for the G2 category. As
far as the iatrogenic index is concerned, we were unable to observe any
significant difference between the groups.
|
[
{
"version": "v1",
"created": "Mon, 12 Oct 2009 12:49:03 GMT"
}
] | 2009-10-13T00:00:00 |
[
[
"Tonetti",
"J.",
"",
"CHU-Grenoble ortho-traumato"
],
[
"Vadcard",
"L.",
"",
"LSE"
],
[
"Girard",
"P.",
"",
"IHPC"
],
[
"Dubois",
"M.",
"",
"LPS"
],
[
"Merloz",
"P.",
"",
"CHU-Grenoble ortho-traumato"
],
[
"Troccaz",
"Jocelyne",
"",
"TIMC"
]
] |
new_dataset
| 0.984796 |
0910.2173
|
Roua Youssef
|
Roua Youssef and Alexandre Graell i Amat
|
Distributed Turbo-Like Codes for Multi-User Cooperative Relay Networks
|
Submitted to ICC 2010
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a distributed turbo-like coding scheme for wireless networks
with relays is proposed. We consider a scenario where multiple sources
communicate with a single destination with the help of a relay. The proposed
scheme can be regarded as of the decode-and-forward type. The relay decodes the
information from the sources and it properly combines and re-encodes them to
generate some extra redundancy, which is transmitted to the destination. The
amount of redundancy generated by the relay can simply be adjusted according to
requirements in terms of performance, throughput and/or power. At the
destination, decoding of the information of all sources is performed jointly
exploiting the redundancy provided by the relay in an iterative fashion. The
overall communication network can be viewed as a serially concatenated code.
The proposed distributed scheme achieves significant performance gains with
respect to the non-cooperation system, even for a very large number of users.
Furthermore, it presents a high flexibility in terms of code rate, block length
and number of users.
|
[
{
"version": "v1",
"created": "Mon, 12 Oct 2009 14:50:50 GMT"
}
] | 2009-10-13T00:00:00 |
[
[
"Youssef",
"Roua",
""
],
[
"Amat",
"Alexandre Graell i",
""
]
] |
new_dataset
| 0.995923 |
0906.3036
|
Gilles Champenois
|
Gilles Champenois
|
Mnesors for automatic control
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mnesors are defined as elements of a semimodule over the min-plus integers.
This two-sorted structure is able to merge graduation properties of vectors and
idempotent properties of boolean numbers, which makes it appropriate for hybrid
systems. We apply it to the control of an inverted pendulum and design a full
logical controller, that is, without the usual algebra of real numbers.
|
[
{
"version": "v1",
"created": "Tue, 16 Jun 2009 22:05:57 GMT"
},
{
"version": "v2",
"created": "Thu, 8 Oct 2009 21:19:23 GMT"
}
] | 2009-10-09T00:00:00 |
[
[
"Champenois",
"Gilles",
""
]
] |
new_dataset
| 0.999434 |
0910.1484
|
Alain Lecomte
|
Alain Lecomte (INRIA Futurs, SFLTAMP), Myriam Quatrini (IML)
|
Ludics and its Applications to natural Language Semantics
| null |
Lecture Notes in Artificial Intelligence LNAI, 5514 (2009) pp
242--255
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Proofs, in Ludics, have an interpretation provided by their counter-proofs,
that is the objects they interact with. We follow the same idea by proposing
that sentence meanings are given by the counter-meanings they are opposed to in
a dialectical interaction. The conception is at the intersection of a
proof-theoretic and a game-theoretic accounts of semantics, but it enlarges
them by allowing to deal with possibly infinite processes.
|
[
{
"version": "v1",
"created": "Thu, 8 Oct 2009 12:21:22 GMT"
}
] | 2009-10-09T00:00:00 |
[
[
"Lecomte",
"Alain",
"",
"INRIA Futurs, SFLTAMP"
],
[
"Quatrini",
"Myriam",
"",
"IML"
]
] |
new_dataset
| 0.952265 |
0910.1528
|
Jeffrey Shallit
|
Thomas Ang, Jeffrey Shallit
|
Length of the Shortest Word in the Intersection of Regular Languages
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this note, we give a construction that provides a tight lower bound of
mn-1 for the length of the shortest word in the intersection of two regular
languages with state complexities m and n.
|
[
{
"version": "v1",
"created": "Thu, 8 Oct 2009 15:16:48 GMT"
}
] | 2009-10-09T00:00:00 |
[
[
"Ang",
"Thomas",
""
],
[
"Shallit",
"Jeffrey",
""
]
] |
new_dataset
| 0.999312 |
0910.1217
|
EPTCS
|
Bogdan Aman, Gabriel Ciobanu
|
Mutual Mobile Membranes with Timers
| null |
EPTCS 6, 2009, pp. 1-15
|
10.4204/EPTCS.6.1
| null |
cs.FL q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A feature of current membrane systems is the fact that objects and membranes
are persistent. However, this is not true in the real world. In fact, cells and
intracellular proteins have a well-defined lifetime. Inspired from these
biological facts, we define a model of systems of mobile membranes in which
each membrane and each object has a timer representing their lifetime. We show
that systems of mutual mobile membranes with and without timers have the same
computational power. An encoding of timed safe mobile ambients into systems of
mutual mobile membranes with timers offers a relationship between two
formalisms used in describing biological systems.
|
[
{
"version": "v1",
"created": "Wed, 7 Oct 2009 11:15:13 GMT"
}
] | 2009-10-08T00:00:00 |
[
[
"Aman",
"Bogdan",
""
],
[
"Ciobanu",
"Gabriel",
""
]
] |
new_dataset
| 0.999492 |
0910.1255
|
Yves Deville
|
Marie Pelleau, Pascal Van Hentenryck, Charlotte Truchet
|
Sonet Network Design Problems
| null |
EPTCS 5, 2009, pp. 81-95
|
10.4204/EPTCS.5.7
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a new method and a constraint-based objective function to
solve two problems related to the design of optical telecommunication networks,
namely the Synchronous Optical Network Ring Assignment Problem (SRAP) and the
Intra-ring Synchronous Optical Network Design Problem (IDP). These network
topology problems can be represented as a graph partitioning with capacity
constraints as shown in previous works. We present here a new objective
function and a new local search algorithm to solve these problems. Experiments
conducted in Comet allow us to compare our method to previous ones and show
that we obtain better results.
|
[
{
"version": "v1",
"created": "Wed, 7 Oct 2009 13:22:22 GMT"
}
] | 2009-10-08T00:00:00 |
[
[
"Pelleau",
"Marie",
""
],
[
"Van Hentenryck",
"Pascal",
""
],
[
"Truchet",
"Charlotte",
""
]
] |
new_dataset
| 0.981627 |
0910.1273
|
Fabien Moutarde
|
Taoufik Bdiri (CAOR), Fabien Moutarde (CAOR), Nicolas Bourdis (CAOR),
Bruno Steux (CAOR)
|
Adaboost with "Keypoint Presence Features" for Real-Time Vehicle Visual
Detection
| null |
16th World Congress on Intelligent Transport Systems (ITSwc'2009),
Su\`ede (2009)
| null | null |
cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present promising results for real-time vehicle visual detection, obtained
with adaBoost using new original ?keypoints presence features?. These
weak-classifiers produce a boolean response based on presence or absence in the
tested image of a ?keypoint? (~ a SURF interest point) with a descriptor
sufficiently similar (i.e. within a given distance) to a reference descriptor
characterizing the feature. A first experiment was conducted on a public image
dataset containing lateral-viewed cars, yielding 95% recall with 95% precision
on test set. Moreover, analysis of the positions of adaBoost-selected keypoints
show that they correspond to a specific part of the object category (such as
?wheel? or ?side skirt?) and thus have a ?semantic? meaning.
|
[
{
"version": "v1",
"created": "Wed, 7 Oct 2009 14:26:01 GMT"
}
] | 2009-10-08T00:00:00 |
[
[
"Bdiri",
"Taoufik",
"",
"CAOR"
],
[
"Moutarde",
"Fabien",
"",
"CAOR"
],
[
"Bourdis",
"Nicolas",
"",
"CAOR"
],
[
"Steux",
"Bruno",
"",
"CAOR"
]
] |
new_dataset
| 0.995819 |
0910.1295
|
Fabien Moutarde
|
Fabien Moutarde (CAOR), Alexandre Bargeton (CAOR), Anne Herbin, Lowik
Chanussot
|
Modular Traffic Sign Recognition applied to on-vehicle real-time visual
detection of American and European speed limit signs
| null |
14th World congress on Intelligent Transportation Systems
(ITS'2007), Beijing : China (2007)
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new modular traffic signs recognition system, successfully
applied to both American and European speed limit signs. Our sign detection
step is based only on shape-detection (rectangles or circles). This enables it
to work on grayscale images, contrary to most European competitors, which eases
robustness to illumination conditions (notably night operation). Speed sign
candidates are classified (or rejected) by segmenting potential digits inside
them (which is rather original and has several advantages), and then applying a
neural digit recognition. The global detection rate is ~90% for both (standard)
U.S. and E.U. speed signs, with a misclassification rate <1%, and no validated
false alarm in >150 minutes of video. The system processes in real-time ~20
frames/s on a standard high-end laptop.
|
[
{
"version": "v1",
"created": "Wed, 7 Oct 2009 15:43:01 GMT"
}
] | 2009-10-08T00:00:00 |
[
[
"Moutarde",
"Fabien",
"",
"CAOR"
],
[
"Bargeton",
"Alexandre",
"",
"CAOR"
],
[
"Herbin",
"Anne",
""
],
[
"Chanussot",
"Lowik",
""
]
] |
new_dataset
| 0.99595 |
0910.0887
|
Jamshid Abouei
|
Jamshid Abouei, Konstantinos N. Plataniotis, Subbarayan Pasupathy
|
Green Modulation in Proactive Wireless Sensor Networks
|
submitted to IEEE Transactions on Wireless Communications (25 pages)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to unique characteristics of sensor nodes, choosing energy-efficient
modulation scheme with low-complexity implementation (refereed to as green
modulation) is a critical factor in the physical layer of Wireless Sensor
Networks (WSNs). This paper presents (to the best of our knowledge) the first
in-depth analysis of energy efficiency of various modulation schemes using
realistic models in IEEE 802.15.4 standard and present state-of-the art
technology, to find the best scheme in a proactive WSN over Rayleigh and Rician
flat-fading channel models with path-loss. For this purpose, we describe the
system model according to a pre-determined time-based process in practical
sensor nodes. The present analysis also includes the effect of bandwidth and
active mode duration on energy efficiency of popular modulation designs in the
pass-band and Ultra-WideBand (UWB) categories. Experimental results show that
among various pass-band and UWB modulation schemes, Non-Coherent M-ary
Frequency Shift Keying (NC-MFSK) with small order of $M$ and On-Off Keying
(OOK) have significant energy saving compared to other schemes for short range
scenarios, and could be considered as realistic candidates in WSNs. In
addition, NC-MFSK and OOK have the advantage of less complexity and cost in
implementation than the other schemes.
|
[
{
"version": "v1",
"created": "Mon, 5 Oct 2009 23:35:39 GMT"
}
] | 2009-10-07T00:00:00 |
[
[
"Abouei",
"Jamshid",
""
],
[
"Plataniotis",
"Konstantinos N.",
""
],
[
"Pasupathy",
"Subbarayan",
""
]
] |
new_dataset
| 0.980282 |
0910.1028
|
Ernie Cohen
|
Ernie Cohen
|
Weak Kleene Algebra is Sound and (Possibly) Complete for Simulation
|
12 pages, 9 references
| null | null | null |
cs.LO cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that the axioms of Weak Kleene Algebra (WKA) are sound and complete
for the theory of regular expressions modulo simulation equivalence, assuming
their completeness for monodic trees (as conjectured by Takai and Furusawa).
|
[
{
"version": "v1",
"created": "Tue, 6 Oct 2009 14:45:15 GMT"
}
] | 2009-10-07T00:00:00 |
[
[
"Cohen",
"Ernie",
""
]
] |
new_dataset
| 0.950972 |
0711.3926
|
Anand Sarwate
|
Anand D. Sarwate and Michael Gastpar
|
Rateless codes for AVC models
|
14 pages, double column, extended version of paper to appear in the
IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The arbitrarily varying channel (AVC) is a channel model whose state is
selected maliciously by an adversary. Fixed-blocklength coding assumes a
worst-case bound on the adversary's capabilities, which leads to pessimistic
results. This paper defines a variable-length perspective on this problem, for
which achievable rates are shown that depend on the realized actions of the
adversary. Specifically, rateless codes are constructed which require a limited
amount of common randomness. These codes are constructed for two kinds of AVC
models. In the first the channel state cannot depend on the channel input, and
in the second it can. As a byproduct, the randomized coding capacity of the AVC
with state depending on the transmitted codeword is found and shown to be
achievable with a small amount of common randomness. The results for this model
are proved using a randomized strategy based on list decoding.
|
[
{
"version": "v1",
"created": "Sun, 25 Nov 2007 22:39:24 GMT"
},
{
"version": "v2",
"created": "Tue, 10 Mar 2009 02:23:18 GMT"
},
{
"version": "v3",
"created": "Sun, 2 Aug 2009 23:17:22 GMT"
},
{
"version": "v4",
"created": "Mon, 5 Oct 2009 22:59:51 GMT"
}
] | 2009-10-06T00:00:00 |
[
[
"Sarwate",
"Anand D.",
""
],
[
"Gastpar",
"Michael",
""
]
] |
new_dataset
| 0.992685 |
0909.2517
|
Sk Sarif Hassan s
|
Pabitra Pal Choudhury, Sk. Sarif Hassan, Sudhakar Sahoo, Soubhik
Chakraborty
|
On the Interesting World of Fractals and Their Applications to Music
|
This paper tell about music fractals. It is delivered at FRMS-2009
| null | null | null |
cs.OH
|
http://creativecommons.org/licenses/publicdomain/
|
In this paper we have defined one function that has been used to construct
different fractals having fractal dimensions between 1.58 and 2. Also, we tried
to calculate the amount of increment of fractal dimension in accordance with
the base of the number systems. Further, interestingly enough, these very
fractals could be a frame of lyrics for the musicians, as we know that the
fractal dimension of music is around 1.65 and varies between a high of 1.68 and
a low of 1.60. Further, at the end we conjecture that the switching from one
music fractal to another is nothing but enhancing a constant amount fractal
dimension which might be equivalent to a kind of different sets of musical
notes in various orientations.
|
[
{
"version": "v1",
"created": "Mon, 14 Sep 2009 11:07:50 GMT"
},
{
"version": "v2",
"created": "Tue, 6 Oct 2009 06:34:25 GMT"
}
] | 2009-10-06T00:00:00 |
[
[
"Choudhury",
"Pabitra Pal",
""
],
[
"Hassan",
"Sk. Sarif",
""
],
[
"Sahoo",
"Sudhakar",
""
],
[
"Chakraborty",
"Soubhik",
""
]
] |
new_dataset
| 0.99796 |
0910.0750
|
Adrien Richard
|
Adrien Richard
|
Local negative circuits and fixed points in Boolean networks
|
19 pages
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To each Boolean function F from {0,1}^n to itself and each point x in
{0,1}^n, we associate the signed directed graph G_F(x) of order n that contains
a positive (resp. negative) arc from j to i if the partial derivative of f_i
with respect of x_j is positive (resp. negative) at point x. We then focus on
the following open problem: Is the absence of a negative circuit in G_F(x) for
all x in {0,1}^n a sufficient condition for F to have at least one fixed point?
As main result, we settle this problem under the additional condition that, for
all x in {0,1}^n, the out-degree of each vertex of G_F(x) is at most one.
|
[
{
"version": "v1",
"created": "Mon, 5 Oct 2009 12:38:34 GMT"
}
] | 2009-10-06T00:00:00 |
[
[
"Richard",
"Adrien",
""
]
] |
new_dataset
| 0.982279 |
0812.3893
|
Darren Strash
|
Michael T. Goodrich and Darren Strash
|
Succinct Greedy Geometric Routing in the Euclidean Plane
|
19 pages, 5 figures. To appear at 20th International Symposium on
Algorithms and Computation (ISAAC 2009)
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In greedy geometric routing, messages are passed in a network embedded in a
metric space according to the greedy strategy of always forwarding messages to
nodes that are closer to the destination. We show that greedy geometric routing
schemes exist for the Euclidean metric in R^2, for 3-connected planar graphs,
with coordinates that can be represented succinctly, that is, with O(log n)
bits, where n is the number of vertices in the graph. Moreover, our embedding
strategy introduces a coordinate system for R^2 that supports distance
comparisons using our succinct coordinates. Thus, our scheme can be used to
significantly reduce bandwidth, space, and header size over other recently
discovered greedy geometric routing implementations for R^2.
|
[
{
"version": "v1",
"created": "Fri, 19 Dec 2008 20:42:33 GMT"
},
{
"version": "v2",
"created": "Wed, 29 Apr 2009 21:57:33 GMT"
},
{
"version": "v3",
"created": "Fri, 2 Oct 2009 19:05:10 GMT"
}
] | 2009-10-02T00:00:00 |
[
[
"Goodrich",
"Michael T.",
""
],
[
"Strash",
"Darren",
""
]
] |
new_dataset
| 0.983402 |
0906.2995
|
Manfred Kufleitner
|
Volker Diekert, Manfred Kufleitner
|
Fragments of first-order logic over infinite words
|
Conference version presented at 26th International Symposium on
Theoretical Aspects of Computer Science, STACS 2009
| null | null | null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give topological and algebraic characterizations as well as language
theoretic descriptions of the following subclasses of first-order logic FO[<]
for omega-languages: Sigma_2, FO^2, the intersection of FO^2 and Sigma_2, and
Delta_2 (and by duality Pi_2 and the intersection of FO^2 and Pi_2). These
descriptions extend the respective results for finite words. In particular, we
relate the above fragments to language classes of certain (unambiguous)
polynomials. An immediate consequence is the decidability of the membership
problem of these classes, but this was shown before by Wilke and Bojanczyk and
is therefore not our main focus. The paper is about the interplay of algebraic,
topological, and language theoretic properties.
|
[
{
"version": "v1",
"created": "Tue, 16 Jun 2009 18:43:43 GMT"
},
{
"version": "v2",
"created": "Fri, 2 Oct 2009 20:52:31 GMT"
}
] | 2009-10-02T00:00:00 |
[
[
"Diekert",
"Volker",
""
],
[
"Kufleitner",
"Manfred",
""
]
] |
new_dataset
| 0.989361 |
0909.5479
|
EPTCS
|
Evangelos Markakis (Athens University of Economics and Business),
Ioannis Milis (Athens University of Economics and Business)
|
Proceedings Fourth Athens Colloquium on Algorithms and Complexity
| null |
EPTCS 4, 2009
|
10.4204/EPTCS.4
| null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
ACAC 2009 is organized by the Athens University of Economics and Business
(AUEB) and it is the fourth in a series of meetings that aim to bring together
researchers working on all areas of the theory of algorithms and computational
complexity. These meetings are expected to serve as a lively forum for
presenting results that are in a preliminary stage or have been recently
presented in some major conference. For the first time this year all submitted
papers were reviewed and ACAC also offered to the authors the choice of
publishing their contribution (provided it has not been published anywhere else
before) with the post-proceedings of EPTCS (Electronic Proceedings in
Theoretical Computer Science).
|
[
{
"version": "v1",
"created": "Wed, 30 Sep 2009 02:05:28 GMT"
}
] | 2009-10-01T00:00:00 |
[
[
"Markakis",
"Evangelos",
"",
"Athens University of Economics and Business"
],
[
"Milis",
"Ioannis",
"",
"Athens University of Economics and Business"
]
] |
new_dataset
| 0.973612 |
0902.0926
|
Yassine Ariba
|
Yassine Ariba (LAAS), Fr\'ed\'eric Gouaisbaut (LAAS), Sandy Rahme
(LAAS), Yann Labit (LAAS)
|
Robust control tools for traffic monitoring in TCP/AQM networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Several studies have considered control theory tools for traffic control in
communication networks, as for example the congestion control issue in IP
(Internet Protocol) routers. In this paper, we propose to design a linear
observer for time-delay systems to address the traffic monitoring issue in
TCP/AQM (Transmission Control Protocol/Active Queue Management) networks. Due
to several propagation delays and the queueing delay, the set TCP/AQM is
modeled as a multiple delayed system of a particular form. Hence, appropriate
robust control tools as quadratic separation are adopted to construct a delay
dependent observer for TCP flows estimation. Note that, the developed mechanism
enables also the anomaly detection issue for a class of DoS (Denial of Service)
attacks. At last, simulations via the network simulator NS-2 and an emulation
experiment validate the proposed methodology.
|
[
{
"version": "v1",
"created": "Thu, 5 Feb 2009 15:33:02 GMT"
}
] | 2009-09-30T00:00:00 |
[
[
"Ariba",
"Yassine",
"",
"LAAS"
],
[
"Gouaisbaut",
"Frédéric",
"",
"LAAS"
],
[
"Rahme",
"Sandy",
"",
"LAAS"
],
[
"Labit",
"Yann",
"",
"LAAS"
]
] |
new_dataset
| 0.995929 |
0902.3286
|
Arunkumar Subramanian
|
Arunkumar Subramanian, Steven W. McLaughlin
|
MDS codes on the erasure-erasure wiretap channel
|
Submitted to the 2009 IEEE International Symposium on Information
Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers the problem of perfectly secure communication on a
modified version of Wyner's wiretap channel II where both the main and
wiretapper's channels have some erasures. A secret message is to be encoded
into $n$ channel symbols and transmitted. The main channel is such that the
legitimate receiver receives the transmitted codeword with exactly $n - \nu$
erasures, where the positions of the erasures are random. Additionally, an
eavesdropper (wire-tapper) is able to observe the transmitted codeword with $n
- \mu$ erasures in a similar fashion. This paper studies the maximum achievable
information rate with perfect secrecy on this channel and gives a coding scheme
using nested codes that achieves the secrecy capacity.
|
[
{
"version": "v1",
"created": "Thu, 19 Feb 2009 02:28:23 GMT"
}
] | 2009-09-30T00:00:00 |
[
[
"Subramanian",
"Arunkumar",
""
],
[
"McLaughlin",
"Steven W.",
""
]
] |
new_dataset
| 0.996042 |
0904.1889
|
Stevan Harnad
|
Stevan Harnad
|
First Person Singular
|
6 pages
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Brian Rotman argues that (one) "mind" and (one) "god" are only conceivable,
literally, because of (alphabetic) literacy, which allowed us to designate each
of these ghosts as an incorporeal, speaker-independent "I" (or, in the case of
infinity, a notional agent that goes on counting forever). I argue that to have
a mind is to have the capacity to feel. No one can be sure which organisms
feel, hence have minds, but it seems likely that one-celled organisms and
plants do not, whereas animals do. So minds originated before humans and before
language --hence, a fortiori, before writing, whether alphabetic or
ideographic.
|
[
{
"version": "v1",
"created": "Sun, 12 Apr 2009 23:13:13 GMT"
}
] | 2009-09-30T00:00:00 |
[
[
"Harnad",
"Stevan",
""
]
] |
new_dataset
| 0.999314 |
0907.2139
|
Mai-Anh Phan
|
Mai-Anh Phan, J\"org Huschke
|
Adaptive Point-to-Multipoint Transmission for Multimedia Broadcast
Multicast Services in LTE
|
6 pages, 7 figures
| null | null | null |
cs.NI cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates point-to-multipoint (PTM) transmission supporting
adaptive modulation and coding (AMC) as well as retransmissions based on
incremental redundancy. In contrast to the classical PTM transmission which was
introduced by the Multimedia Broadcast Multicast Service (MBMS), the
adaptiveness requires user individual feedback channels that allow the
receivers to report their radio conditions and send positive or negative
acknowledgments (ACK/NACK) for a Layer 1 transport block to the eNodeB. In this
work, an adaptive PTM scheme based on feedback from multiple users is presented
and evaluated. Furthermore, a simple NACK-oriented feedback mechanism is
introduced to relieve the feedback channel that is used in the uplink. Finally,
the performance of different single-cell MBMS transmission modes is evaluated
by dynamic radio network simulations. It is shown that adaptive PTM
transmission outperforms the conventional MBMS configurations in terms of radio
resource consumption and user satisfaction rate.
|
[
{
"version": "v1",
"created": "Mon, 13 Jul 2009 11:21:23 GMT"
}
] | 2009-09-30T00:00:00 |
[
[
"Phan",
"Mai-Anh",
""
],
[
"Huschke",
"Jörg",
""
]
] |
new_dataset
| 0.989 |
0907.4364
|
Miao Song
|
Miao Song
|
Dynamic Deformation of Uniform Elastic Two-Layer Objects
|
96 pages, 46 pages; master's thesis; August 2007; also available at
http://clues.concordia.ca/record=b2343207~S0
| null | null | null |
cs.GR
|
http://creativecommons.org/licenses/by/3.0/
|
This thesis presents a two-layer uniform facet elastic object for real-time
simulation based on physics modeling method. It describes the elastic object
procedural modeling algorithm with particle system from the simplest
one-dimensional object, to more complex two-dimensional and three-dimensional
objects.
The double-layered elastic object consists of inner and outer elastic mass
spring surfaces and compressible internal pressure. The density of the inner
layer can be set different from the density of the outer layer; the motion of
the inner layer can be opposite to the motion of the outer layer. These special
features, which cannot be achieved by a single layered object, result in
improved imitation of a soft body, such as tissue's liquidity non-uniform
deformation. The construction of the double-layered elastic object is closer to
the real tissue's physical structure.
The inertial behavior of the elastic object is well illustrated in
environments with gravity and collisions with walls, ceiling, and floor. The
collision detection is defined by elastic collision penalty method and the
motion of the object is guided by the Ordinary Differential Equation
computation.
Users can interact with the modeled objects, deform them, and observe the
response to their action in real time.
|
[
{
"version": "v1",
"created": "Fri, 24 Jul 2009 19:13:02 GMT"
},
{
"version": "v2",
"created": "Sat, 25 Jul 2009 22:54:29 GMT"
}
] | 2009-09-30T00:00:00 |
[
[
"Song",
"Miao",
""
]
] |
new_dataset
| 0.998702 |
0801.1784
|
Sergei Vyshenski
|
S. V. Vyshenski, P. V. Grigoriev, Yu. Yu. Dubenskaya
|
Ideal synchronizer for marked pairs in fork-join network
|
18 pages, 3 figures, in Russian, typos fixed
| null | null | null |
cs.DM
| null |
We introduce a new functional element (synchronizer for marked pairs) meant
to join results of parallel processing in two-branch fork-join queueing
network. Approximations for distribution of sojourn time at the synchronizer
are derived along with a validity domain. 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 mean sojourn time at a real
synchronizer node 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.
|
[
{
"version": "v1",
"created": "Fri, 11 Jan 2008 16:00:59 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Jan 2008 20:57:32 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Vyshenski",
"S. V.",
""
],
[
"Grigoriev",
"P. V.",
""
],
[
"Dubenskaya",
"Yu. Yu.",
""
]
] |
new_dataset
| 0.996557 |
0808.3563
|
Stevan Harnad
|
Stevan Harnad
|
What It Feels Like To Hear Voices: Fond Memories of Julian Jaynes
|
16 pages
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Julian Jaynes's profound humanitarian convictions not only prevented him from
going to war, but would have prevented him from ever kicking a dog. Yet
according to his theory, not only are language-less dogs unconscious, but so
too were the speaking/hearing Greeks in the Bicameral Era, when they heard
gods' voices telling them what to do rather than thinking for themselves. I
argue that to be conscious is to be able to feel, and that all mammals (and
probably lower vertebrates and invertebrates too) feel, hence are conscious.
Julian Jaynes's brilliant analysis of our concepts of consciousness
nevertheless keeps inspiring ever more inquiry and insights into the age-old
mind/body problem and its relation to cognition and language.
|
[
{
"version": "v1",
"created": "Tue, 26 Aug 2008 18:17:44 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Harnad",
"Stevan",
""
]
] |
new_dataset
| 0.981036 |
0809.5023
|
Alexandre Proutiere A
|
Charles Bordenave, David McDonald, Alexandre Proutiere
|
Asymptotic stability region of slotted-Aloha
|
16 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We analyze the stability of standard, buffered, slotted-Aloha systems.
Specifically, we consider a set of $N$ users, each equipped with an infinite
buffer. Packets arrive into user $i$'s buffer according to some stationary
ergodic Markovian process of intensity $\lambda_i$. At the beginning of each
slot, if user $i$ has packets in its buffer, it attempts to transmit a packet
with fixed probability $p_i$ over a shared resource / channel. The transmission
is successful only when no other user attempts to use the channel. The
stability of such systems has been open since their very first analysis in 1979
by Tsybakov and Mikhailov. In this paper, we propose an approximate stability
condition, that is provably exact when the number of users $N$ grows large. We
provide theoretical evidence and numerical experiments to explain why the
proposed approximate stability condition is extremely accurate even for systems
with a restricted number of users (even two or three). We finally extend the
results to the case of more efficient CSMA systems.
|
[
{
"version": "v1",
"created": "Mon, 29 Sep 2008 18:34:47 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Bordenave",
"Charles",
""
],
[
"McDonald",
"David",
""
],
[
"Proutiere",
"Alexandre",
""
]
] |
new_dataset
| 0.989187 |
0810.1105
|
Anantha Raman Krishnan
|
Shashi Kiran Chilappagari, Anantha Raman Krishnan, Bane Vasic, Michael
W. Marcellin
|
Low-Density Parity-Check Codes Which Can Correct Three Errors Under
Iterative Decoding
|
25 pages. 11 Figures. Part of the work was presented at the
Information Theory Workshop (ITW), May 5-9 2008, Porto, Portugal. submitted
to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we give necessary and sufficient conditions for low-density
parity-check (LDPC) codes with column-weight three to correct three errors when
decoded using hard-decision message-passing decoding. Additionally, we give
necessary and sufficient conditions for column-weight-four codes to correct
three errors in four iterations of hard-decision message-passing decoding. We
then give a construction technique which results in codes satisfying these
conditions. We also provide numerical assessment of code performance via
simulation results.
|
[
{
"version": "v1",
"created": "Tue, 7 Oct 2008 06:22:16 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Chilappagari",
"Shashi Kiran",
""
],
[
"Krishnan",
"Anantha Raman",
""
],
[
"Vasic",
"Bane",
""
],
[
"Marcellin",
"Michael W.",
""
]
] |
new_dataset
| 0.990583 |
0909.4858
|
R Doomun
|
S. Rathi, K. Thanuskodi
|
A Secure and Fault tolerant framework for Mobile IPv6 based networks
|
10 pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423,
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information Security
Vol. 5, No. 1, pp. 46-55, 2009
| null |
ISSN 1947 5500
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile IPv6 will be an integral part of the next generation Internet
protocol. The importance of mobility in the Internet gets keep on increasing.
Current specification of Mobile IPv6 does not provide proper support for
reliability in the mobile network and there are other problems associated with
it. In this paper, we propose Virtual Private Network (VPN) based Home Agent
Reliability Protocol (VHAHA) as a complete system architecture and extension to
Mobile IPv6 that supports reliability and offers solutions to the security
problems that are found in Mobile IP registration part. The key features of
this protocol over other protocols are: better survivability, transparent
failure detection and recovery, reduced complexity of the system and workload,
secure data transfer and improved overall performance.
|
[
{
"version": "v1",
"created": "Sat, 26 Sep 2009 11:24:59 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Rathi",
"S.",
""
],
[
"Thanuskodi",
"K.",
""
]
] |
new_dataset
| 0.998819 |
0909.5012
|
Anthony Scemama
|
Anthony Scemama
|
IRPF90: a programming environment for high performance computing
|
18 pages, 14 figures
| null | null | null |
cs.SE cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
IRPF90 is a Fortran programming environment which helps the development of
large Fortran codes. In Fortran programs, the programmer has to focus on the
order of the instructions: before using a variable, the programmer has to be
sure that it has already been computed in all possible situations. For large
codes, it is common source of error. In IRPF90 most of the order of
instructions is handled by the pre-processor, and an automatic mechanism
guarantees that every entity is built before being used. This mechanism relies
on the {needs/needed by} relations between the entities, which are built
automatically. Codes written with IRPF90 execute often faster than Fortran
programs, are faster to write and easier to maintain.
|
[
{
"version": "v1",
"created": "Mon, 28 Sep 2009 16:46:45 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Scemama",
"Anthony",
""
]
] |
new_dataset
| 0.999805 |
0909.5091
|
Stefano Zacchiroli
|
Ralf Treinen (PPS), Stefano Zacchiroli (PPS)
|
Expressing advanced user preferences in component installation
| null |
IWOCE 2009: 1st international workshop on Open component
ecosystems, Amsterdam : Netherlands (2009)
|
10.1145/1595800.1595806
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
State of the art component-based software collections - such as FOSS
distributions - are made of up to dozens of thousands components, with complex
inter-dependencies and conflicts. Given a particular installation of such a
system, each request to alter the set of installed components has potentially
(too) many satisfying answers. We present an architecture that allows to
express advanced user preferences about package selection in FOSS
distributions. The architecture is composed by a distribution-independent
format for describing available and installed packages called CUDF (Common
Upgradeability Description Format), and a foundational language called MooML to
specify optimization criteria. We present the syntax and semantics of CUDF and
MooML, and discuss the partial evaluation mechanism of MooML which allows to
gain efficiency in package dependency solvers.
|
[
{
"version": "v1",
"created": "Mon, 28 Sep 2009 13:31:17 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Treinen",
"Ralf",
"",
"PPS"
],
[
"Zacchiroli",
"Stefano",
"",
"PPS"
]
] |
new_dataset
| 0.959982 |
cs/0210008
|
Christoph Durr
|
Christoph Durr, Ivan Rapaport, Guillaume Theyssier
|
Cellular automata and communication complexity
| null | null | null | null |
cs.CC
| null |
The model of cellular automata is fascinating because very simple local rules
can generate complex global behaviors. The relationship between local and
global function is subject of many studies. We tackle this question by using
results on communication complexity theory and, as a by-product, we provide
(yet another) classification of cellular automata.
|
[
{
"version": "v1",
"created": "Fri, 11 Oct 2002 16:29:19 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Durr",
"Christoph",
""
],
[
"Rapaport",
"Ivan",
""
],
[
"Theyssier",
"Guillaume",
""
]
] |
new_dataset
| 0.99905 |
cs/0306001
|
Michael Thomas
|
Conrad D. Steenberg and Eric Aslakson, Julian J. Bunn, Harvey B.
Newman, Michael Thomas, Frank van Lingen
|
Clarens Client and Server Applications
|
Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 4 pages, LaTeX, no figures, PSN
TUCT005
| null | null | null |
cs.DC
| null |
Several applications have been implemented with access via the Clarens web
service infrastructure, including virtual organization management, JetMET
physics data analysis using relational databases, and Storage Resource Broker
(SRB) access. This functionality is accessible transparently from Python
scripts, the Root analysis framework and from Java applications and browser
applets.
|
[
{
"version": "v1",
"created": "Fri, 30 May 2003 20:25:50 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Jul 2003 20:22:55 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Steenberg",
"Conrad D.",
""
],
[
"Aslakson",
"Eric",
""
],
[
"Bunn",
"Julian J.",
""
],
[
"Newman",
"Harvey B.",
""
],
[
"Thomas",
"Michael",
""
],
[
"van Lingen",
"Frank",
""
]
] |
new_dataset
| 0.998922 |
cs/0306002
|
Michael Thomas
|
Conrad D. Steenberg and Eric Aslakson, Julian J. Bunn, Harvey B.
Newman, Michael Thomas, Frank van Lingen
|
The Clarens web services architecture
|
Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 6 pages, LaTeX, 4 figures, PSN
MONT008
| null | null | null |
cs.DC
| null |
Clarens is a uniquely flexible web services infrastructure providing a
unified access protocol to a diverse set of functions useful to the HEP
community. It uses the standard HTTP protocol combined with application layer,
certificate based authentication to provide single sign-on to individuals,
organizations and hosts, with fine-grained access control to services, files
and virtual organization (VO) management. This contribution describes the
server functionality, while client applications are described in a subsequent
talk.
|
[
{
"version": "v1",
"created": "Fri, 30 May 2003 20:34:05 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Jul 2003 20:28:29 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Steenberg",
"Conrad D.",
""
],
[
"Aslakson",
"Eric",
""
],
[
"Bunn",
"Julian J.",
""
],
[
"Newman",
"Harvey B.",
""
],
[
"Thomas",
"Michael",
""
],
[
"van Lingen",
"Frank",
""
]
] |
new_dataset
| 0.999769 |
cs/0306014
|
Wellisch
|
J.P. Wellisch, C. Williams, and S. Ashby (CERN, Geneve, Switzerland)
|
SCRAM: Software configuration and management for the LHC Computing Grid
project
|
Computing in High Energy and Nuclear Physics, La Jolla, California,
March 24-28, 2003 1 tar file
| null | null | null |
cs.OH
| null |
Recently SCRAM (Software Configuration And Management) has been adopted by
the applications area of the LHC computing grid project as baseline
configuration management and build support infrastructure tool.
SCRAM is a software engineering tool, that supports the configuration
management and management processes for software development. It resolves the
issues of configuration definition, assembly break-down, build, project
organization, run-time environment, installation, distribution, deployment, and
source code distribution. It was designed with a focus on supporting a
distributed, multi-project development work-model.
We will describe the underlying technology, and the solutions SCRAM offers to
the above software engineering processes, while taking a users view of the
system under configuration management.
|
[
{
"version": "v1",
"created": "Mon, 2 Jun 2003 12:01:18 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Wellisch",
"J. P.",
"",
"CERN, Geneve, Switzerland"
],
[
"Williams",
"C.",
"",
"CERN, Geneve, Switzerland"
],
[
"Ashby",
"S.",
"",
"CERN, Geneve, Switzerland"
]
] |
new_dataset
| 0.99958 |
cs/0307029
|
Andreas de Vries
|
Andreas de Vries
|
The ray attack, an inefficient trial to break RSA cryptosystems
|
18 pages, 4 figures
| null | null | null |
cs.CR
| null |
The basic properties of RSA cryptosystems and some classical attacks on them
are described. Derived from geometric properties of the Euler functions, the
Euler function rays, a new ansatz to attack RSA cryptosystems is presented. A
resulting, albeit inefficient, algorithm is given. It essentially consists of a
loop with starting value determined by the Euler function ray and with step
width given by a function $\omega_e(n)$ being a multiple of the order
$\mathrm{ord}_n(e)$, where $e$ denotes the public key exponent and $n$ the RSA
modulus. For $n=pq$ and an estimate $r<\sqrt{pq}$ for the smaller prime factor
$p$, the running time is given by $T(e,n,r) = O((r-p)\ln e \ln n \ln r).$
|
[
{
"version": "v1",
"created": "Fri, 11 Jul 2003 14:47:27 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"de Vries",
"Andreas",
""
]
] |
new_dataset
| 0.997409 |
cs/0311025
|
Judith Beumer
|
K. Keahey, V. Welch, S. Lang, B. Liu, and S. Meder
|
Fine-Grained Authorization for Job Execution in the Grid: Design and
Implementation
|
13 pages, 2 figures
| null | null |
Preprint ANL/MCS-P1094-0903
|
cs.CR cs.DC
| null |
In this paper we describe our work on enabling fine-grained authorization for
resource usage and management. We address the need of virtual organizations to
enforce their own polices in addition to those of the resource owners, in
regard to both resource consumption and job management. To implement this
design, we propose changes and extensions to the Globus Toolkit's version 2
resource management mechanism. We describe the prototype and the policy
language that we designed to express fine-grained policies, and we present an
analysis of our solution.
|
[
{
"version": "v1",
"created": "Thu, 20 Nov 2003 15:02:13 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Keahey",
"K.",
""
],
[
"Welch",
"V.",
""
],
[
"Lang",
"S.",
""
],
[
"Liu",
"B.",
""
],
[
"Meder",
"S.",
""
]
] |
new_dataset
| 0.99831 |
cs/0404043
|
Neil J. Gunther
|
Neil J. Gunther
|
Benchmarking Blunders and Things That Go Bump in the Night
|
Invited presentation at the Workshop On Software Performance and
Reliability (WOPR2) Menlo Park, California, April 15-17 2004
| null | null | null |
cs.PF cs.SE
| null |
Benchmarking; by which I mean any computer system that is driven by a
controlled workload, is the ultimate in performance testing and simulation.
Aside from being a form of institutionalized cheating, it also offer countless
opportunities for systematic mistakes in the way the workloads are applied and
the resulting measurements interpreted. Right test, wrong conclusion is a
ubiquitous mistake that happens because test engineers tend to treat data as
divine. Such reverence is not only misplaced, it's also a sure ticket to
production hell when the application finally goes live. I demonstrate how such
mistakes can be avoided by means of two war stories that are real WOPRs. (a)
How to resolve benchmark flaws over the psychic hotline and (b) How benchmarks
can go flat with too much Java juice. In each case I present simple performance
models and show how they can be applied to correctly assess benchmark data.
|
[
{
"version": "v1",
"created": "Wed, 21 Apr 2004 20:07:07 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Gunther",
"Neil J.",
""
]
] |
new_dataset
| 0.985851 |
cs/0410013
|
Alex Vinokur
|
Alex Vinokur
|
Fibonacci connection between Huffman codes and Wythoff array
|
12 pages, 9 tables
| null | null | null |
cs.DM cs.DS math.CO math.NT
| null |
Fibonacci connection between non-decreasing sequences of positive integers
producing maximum height Huffman trees and the Wythoff array has been proved.
|
[
{
"version": "v1",
"created": "Wed, 6 Oct 2004 11:44:02 GMT"
},
{
"version": "v2",
"created": "Sat, 8 Oct 2005 07:50:59 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Vinokur",
"Alex",
""
]
] |
new_dataset
| 0.990372 |
cs/0411047
|
Ercan Erturk
|
E. Erturk and T.C. Corke and C. Gokcol
|
Numerical Solutions of 2-D Steady Incompressible Driven Cavity Flow at
High Reynolds Numbers
| null |
International Journal for Numerical Methods in Fluids 2005, Vol
48, pp 747-774
|
10.1002/fld.953
| null |
cs.NA math.NA physics.comp-ph physics.flu-dyn
| null |
Numerical calculations of the 2-D steady incompressible driven cavity flow
are presented. The Navier-Stokes equations in streamfunction and vorticity
formulation are solved numerically using a fine uniform grid mesh of 601x601.
The steady driven cavity solutions are computed for Re<21,000 with a maximum
absolute residuals of the governing equations that were less than 10-10. A new
quaternary vortex at the bottom left corner and a new tertiary vortex at the
top left corner of the cavity are observed in the flow field as the Reynolds
number increases. Detailed results are presented and comparisons are made with
benchmark solutions found in the literature.
|
[
{
"version": "v1",
"created": "Mon, 15 Nov 2004 23:38:00 GMT"
},
{
"version": "v2",
"created": "Thu, 6 Jan 2005 11:52:37 GMT"
},
{
"version": "v3",
"created": "Sat, 4 Jun 2005 09:12:04 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Erturk",
"E.",
""
],
[
"Corke",
"T. C.",
""
],
[
"Gokcol",
"C.",
""
]
] |
new_dataset
| 0.989284 |
cs/0411049
|
Ercan Erturk
|
E. Erturk and C. Gokcol
|
Fourth Order Compact Formulation of Navier-Stokes Equations and Driven
Cavity Flow at High Reynolds Numbers
| null |
International Journal for Numerical Methods in Fluids 2006, Vol
50, pp 421-436
|
10.1002/fld.1061
| null |
cs.NA math.NA physics.comp-ph physics.flu-dyn
| null |
A new fourth order compact formulation for the steady 2-D incompressible
Navier-Stokes equations is presented. The formulation is in the same form of
the Navier-Stokes equations such that any numerical method that solve the
Navier-Stokes equations can also be applied to this fourth order compact
formulation. In particular in this work the formulation is solved with an
efficient numerical method that requires the solution of tridiagonal systems
using a fine grid mesh of 601x601. Using this formulation, the steady 2-D
incompressible flow in a driven cavity is solved up to Reynolds number of
20,000 with fourth order spatial accuracy. Detailed solutions are presented.
|
[
{
"version": "v1",
"created": "Mon, 15 Nov 2004 23:52:25 GMT"
},
{
"version": "v2",
"created": "Thu, 22 Dec 2005 07:49:17 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Erturk",
"E.",
""
],
[
"Gokcol",
"C.",
""
]
] |
new_dataset
| 0.999617 |
cs/0411069
|
Gang Peng
|
Gang Peng
|
CDN: Content Distribution Network
|
26 pages
| null | null | null |
cs.NI cs.IR
| null |
Internet evolves and operates largely without a central coordination, the
lack of which was and is critically important to the rapid growth and evolution
of Internet. However, the lack of management in turn makes it very difficult to
guarantee proper performance and to deal systematically with performance
problems. Meanwhile, the available network bandwidth and server capacity
continue to be overwhelmed by the skyrocketing Internet utilization and the
accelerating growth of bandwidth intensive content. As a result, Internet
service quality perceived by customers is largely unpredictable and
unsatisfactory. Content Distribution Network (CDN) is an effective approach to
improve Internet service quality. CDN replicates the content from the place of
origin to the replica servers scattered over the Internet and serves a request
from a replica server close to where the request originates. In this paper, we
first give an overview about CDN. We then present the critical issues involved
in designing and implementing an effective CDN and survey the approaches
proposed in literature to address these problems. An example of CDN is
described to show how a real commercial CDN operates. After this, we present a
scheme that provides fast service location for peer-to-peer systems, a special
type of CDN with no infrastructure support. We conclude with a brief projection
about CDN.
|
[
{
"version": "v1",
"created": "Thu, 18 Nov 2004 23:16:08 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Peng",
"Gang",
""
]
] |
new_dataset
| 0.985912 |
cs/0411085
|
Didier Donsez
|
Herve Duchesne (OBASCO Irisa), Christophe Augier (OBASCO Irisa),
Richard Urunuela (OBASCO Irisa)
|
Deploiement d'ordonnanceurs de processus specifiques dans un systeme
d'exploitation generaliste
| null |
DECOR04 (2004) 193-198
| null | null |
cs.NI
| null |
Bossa is a framework to develop new processes schedulers in commodity
operating systems. Although Bossa enables fine-grained management of the
processor through new scheduling policies, deploying an application with its
own scheduler raises some problems. In this paper we study the problems caused
when deploying an application and its scheduler and to adresse these, we
propose to establish Quality of Service contracts and mechanisms to reconfigure
the scheduler hierarchy.
|
[
{
"version": "v1",
"created": "Wed, 24 Nov 2004 10:31:48 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Duchesne",
"Herve",
"",
"OBASCO Irisa"
],
[
"Augier",
"Christophe",
"",
"OBASCO Irisa"
],
[
"Urunuela",
"Richard",
"",
"OBASCO Irisa"
]
] |
new_dataset
| 0.962136 |
cs/0412044
|
Riccardo Pucella
|
Karthikeyan Bhargavan, Cedric Fournet, Andrew D. Gordon, Riccardo
Pucella
|
TulaFale: A Security Tool for Web Services
|
26 pages, 4 figures. Appears in Proceedings of the 2nd International
Symposium on Formal Methods for Components and Objects (FMCS'03), LNCS 3188,
pp. 197-222
| null | null | null |
cs.CR
| null |
Web services security specifications are typically expressed as a mixture of
XML schemas, example messages, and narrative explanations. We propose a new
specification language for writing complementary machine-checkable descriptions
of SOAP-based security protocols and their properties. Our TulaFale language is
based on the pi calculus (for writing collections of SOAP processors running in
parallel), plus XML syntax (to express SOAP messaging), logical predicates (to
construct and filter SOAP messages), and correspondence assertions (to specify
authentication goals of protocols). Our implementation compiles TulaFale into
the applied pi calculus, and then runs Blanchet's resolution-based protocol
verifier. Hence, we can automatically verify authentication properties of SOAP
protocols.
|
[
{
"version": "v1",
"created": "Fri, 10 Dec 2004 21:18:48 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Bhargavan",
"Karthikeyan",
""
],
[
"Fournet",
"Cedric",
""
],
[
"Gordon",
"Andrew D.",
""
],
[
"Pucella",
"Riccardo",
""
]
] |
new_dataset
| 0.999653 |
cs/0502069
|
Sandor P. Fekete
|
Alexander Kroeller, Sandor P. Fekete, Carsten Buschmann, Stefan
Fischer and Dennis Pfisterer
|
Koordinatenfreies Lokationsbewusstsein (Localization without
Coordinates)
|
German, 15 pages, 6 figures, Latex, to appear in Information
Technology
| null | null | null |
cs.DC
| null |
Localization is one of the fundamental issues in sensor networks. It is
almost always assumed that it must be solved by assigning coordinates to the
nodes. This article discusses positioning algorithms from a theoretical,
practical and simulative point of view, and identifies difficulties and
limitations. Ideas for more abstract means of location awareness are presented
and the resulting possible improvements for applications are shown. Nodes with
certain topological or environmental properties are clustered, and the
neighborhood structure of the clusters is modeled as a graph. Eines der
fundamentalen Probleme in Sensornetzwerken besteht darin, ein Bewusstsein fuer
die Position eines Knotens im Netz zu entwickeln. Dabei wird fast immer davon
ausgegangen, dass dies durch die Zuweisung von Koordinaten zu erfolgen hat. In
diesem Artikel wird auf theoretischer, praktischer und simulativer Ebene ein
kritischer Blick auf entsprechende Verfahren geworfen, und es werden Grenzen
aufgezeigt. Es wird ein Ansatz vorgestellt, mit dem in der Zukunft eine
abstrakte Form von Lokationsbewusstsein etabliert werden kann, und es wird
gezeigt, wie Anwendungen dadurch verbessert werden koennen. Er basiert auf
einer graphenbasierten Modellierung des Netzes: Knoten mit bestimmten
topologischen oder Umwelteigenschaften werden zu Clustern zusammengefasst, und
Clusternachbarschaften dann als Graphen modelliert.
|
[
{
"version": "v1",
"created": "Tue, 15 Feb 2005 16:35:13 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Kroeller",
"Alexander",
""
],
[
"Fekete",
"Sandor P.",
""
],
[
"Buschmann",
"Carsten",
""
],
[
"Fischer",
"Stefan",
""
],
[
"Pfisterer",
"Dennis",
""
]
] |
new_dataset
| 0.997962 |
cs/0508058
|
Herve Jegou
|
Herve Jegou and Christine Guillemot
|
Entropy coding with Variable Length Re-writing Systems
|
6 pages, To appear in the proceedings of the 2005 IEEE International
Symposium on Information Theory, Adelaide, Australia, September 4-9, 2005
| null | null | null |
cs.IT math.IT
| null |
This paper describes a new set of block source codes well suited for data
compression. These codes are defined by sets of productions rules of the form
a.l->b, where a in A represents a value from the source alphabet A and l, b are
-small- sequences of bits. These codes naturally encompass other Variable
Length Codes (VLCs) such as Huffman codes. It is shown that these codes may
have a similar or even a shorter mean description length than Huffman codes for
the same encoding and decoding complexity. A first code design method allowing
to preserve the lexicographic order in the bit domain is described. The
corresponding codes have the same mean description length (mdl) as Huffman
codes from which they are constructed. Therefore, they outperform from a
compression point of view the Hu-Tucker codes designed to offer the
lexicographic property in the bit domain. A second construction method allows
to obtain codes such that the marginal bit probability converges to 0.5 as the
sequence length increases and this is achieved even if the probability
distribution function is not known by the encoder.
|
[
{
"version": "v1",
"created": "Thu, 11 Aug 2005 15:41:19 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Jegou",
"Herve",
""
],
[
"Guillemot",
"Christine",
""
]
] |
new_dataset
| 0.997951 |
cs/0508096
|
Styrmir Sigurjonsson
|
Styrmir Sigurjonsson and Young-Han Kim
|
On Multiple User Channels with Causal State Information at the
Transmitters
| null | null | null | null |
cs.IT math.IT
| null |
We extend Shannon's result on the capacity of channels with state information
to multiple user channels. More specifically, we characterize the capacity
(region) of degraded broadcast channels and physically degraded relay channels
where the channel state information is causally available at the transmitters.
We also obtain inner and outer bounds on the capacity region for multiple
access channels with causal state information at the transmitters.
|
[
{
"version": "v1",
"created": "Mon, 22 Aug 2005 21:36:02 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Sigurjonsson",
"Styrmir",
""
],
[
"Kim",
"Young-Han",
""
]
] |
new_dataset
| 0.991036 |
cs/0604063
|
Yi Hong Dr
|
Yi Hong, Emanuele Viterbo, and Jean-Claude Belfiore
|
Golden Space-Time Trellis Coded Modulation
|
33 pages, 13 figures
| null | null | null |
cs.IT math.IT
| null |
In this paper, we present a concatenated coding scheme for a high rate
$2\times 2$ multiple-input multiple-output (MIMO) system over slow fading
channels. The inner code is the Golden code \cite{Golden05} and the outer code
is a trellis code. Set partitioning of the Golden code is designed specifically
to increase the minimum determinant. The branches of the outer trellis code are
labeled with these partitions. Viterbi algorithm is applied for trellis
decoding. In order to compute the branch metrics a lattice sphere decoder is
used. The general framework for code optimization is given. The performance of
the proposed concatenated scheme is evaluated by simulation. It is shown that
the proposed scheme achieves significant performance gains over uncoded Golden
code.
|
[
{
"version": "v1",
"created": "Sun, 16 Apr 2006 09:08:41 GMT"
},
{
"version": "v2",
"created": "Tue, 23 May 2006 09:53:20 GMT"
},
{
"version": "v3",
"created": "Thu, 11 Jan 2007 00:33:19 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Hong",
"Yi",
""
],
[
"Viterbo",
"Emanuele",
""
],
[
"Belfiore",
"Jean-Claude",
""
]
] |
new_dataset
| 0.979549 |
cs/0703150
|
Steven G. Johnson
|
Xuancheng Shao and Steven G. Johnson
|
Type-II/III DCT/DST algorithms with reduced number of arithmetic
operations
|
9 pages
|
Signal Processing vol. 88, issue 6, p. 1553-1564 (2008)
|
10.1016/j.sigpro.2008.01.004
| null |
cs.NA cs.DS cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present algorithms for the discrete cosine transform (DCT) and discrete
sine transform (DST), of types II and III, that achieve a lower count of real
multiplications and additions than previously published algorithms, without
sacrificing numerical accuracy. Asymptotically, the operation count is reduced
from ~ 2N log_2 N to ~ (17/9) N log_2 N for a power-of-two transform size N.
Furthermore, we show that a further N multiplications may be saved by a certain
rescaling of the inputs or outputs, generalizing a well-known technique for N=8
by Arai et al. These results are derived by considering the DCT to be a special
case of a DFT of length 4N, with certain symmetries, and then pruning redundant
operations from a recent improved fast Fourier transform algorithm (based on a
recursive rescaling of the conjugate-pair split radix algorithm). The improved
algorithms for DCT-III, DST-II, and DST-III follow immediately from the
improved count for the DCT-II.
|
[
{
"version": "v1",
"created": "Fri, 30 Mar 2007 00:53:48 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Jan 2009 19:05:59 GMT"
}
] | 2009-09-29T00:00:00 |
[
[
"Shao",
"Xuancheng",
""
],
[
"Johnson",
"Steven G.",
""
]
] |
new_dataset
| 0.982018 |
cs/0005033
|
Emanuele Panizzi
|
Emanuele Panizzi, Bernardo Pastorelli
|
Multimethods and separate static typechecking in a language with
C++-like object model
|
15 pages, 18 figures
| null | null |
UAQ DIE R.99-33
|
cs.PL
| null |
The goal of this paper is the description and analysis of multimethod
implementation in a new object-oriented, class-based programming language
called OOLANG. The implementation of the multimethod typecheck and selection,
deeply analyzed in the paper, is performed in two phases in order to allow
static typechecking and separate compilation of modules. The first phase is
performed at compile time, while the second is executed at link time and does
not require the modules' source code. OOLANG has syntax similar to C++; the
main differences are the absence of pointers and the realization of
polymorphism through subsumption. It adopts the C++ object model and supports
multiple inheritance as well as virtual base classes. For this reason, it has
been necessary to define techniques for realigning argument and return value
addresses when performing multimethod invocations.
|
[
{
"version": "v1",
"created": "Wed, 31 May 2000 07:54:30 GMT"
}
] | 2009-09-25T00:00:00 |
[
[
"Panizzi",
"Emanuele",
""
],
[
"Pastorelli",
"Bernardo",
""
]
] |
new_dataset
| 0.997642 |
cs/0009011
|
Masaki Murata
|
Masaki Murata
|
Anaphora Resolution in Japanese Sentences Using Surface Expressions and
Examples
|
156 pages. Doctoral thesis in Kyoto University, December 1996,
supervised by M. Nagao
| null | null | null |
cs.CL
| null |
Anaphora resolution is one of the major problems in natural language
processing. It is also one of the important tasks in machine translation and
man/machine dialogue. We solve the problem by using surface expressions and
examples. Surface expressions are the words in sentences which provide clues
for anaphora resolution. Examples are linguistic data which are actually used
in conversations and texts. The method using surface expressions and examples
is a practical method. This thesis handles almost all kinds of anaphora: i. The
referential property and number of a noun phrase ii. Noun phrase direct
anaphora iii. Noun phrase indirect anaphora iv. Pronoun anaphora v. Verb phrase
ellipsis
|
[
{
"version": "v1",
"created": "Tue, 19 Sep 2000 00:44:47 GMT"
}
] | 2009-09-25T00:00:00 |
[
[
"Murata",
"Masaki",
""
]
] |
new_dataset
| 0.999649 |
cs/0012001
|
Ted Herman
|
Ted Herman, Toshimitsu Masuzawa
|
Available and Stabilizing 2-3 Trees
|
22 pages, 5 figures
| null | null |
University of Iowa Department of Computer Science TR 00-04
|
cs.DC cs.DS
| null |
Transient faults corrupt the content and organization of data structures. A
recovery technique dealing with such faults is stabilization, which guarantees,
following some number of operations on the data structure, that content of the
data structure is legitimate. Another notion of fault tolerance is
availability, which is the property that operations continue to be applied
during the period of recovery after a fault, and successful updates are not
lost while the data structure stabilizes to a legitimate state. The available,
stabilizing 2-3 tree supports find, insert, and delete operations, each with
O(lg n) complexity when the tree's state is legitimate and contains n items.
For an illegitimate state, these operations have O(lg K) complexity where K is
the maximum capacity of the tree. Within O(t) operations, the state of the tree
is guaranteed to be legitimate, where t is the number of nodes accessible via
some path from the tree's root at the initial state. This paper resolves, for
the first time, issues of dynamic allocation and pointer organization in a
stabilizing data structure.
|
[
{
"version": "v1",
"created": "Fri, 1 Dec 2000 15:55:50 GMT"
}
] | 2009-09-25T00:00:00 |
[
[
"Herman",
"Ted",
""
],
[
"Masuzawa",
"Toshimitsu",
""
]
] |
new_dataset
| 0.976617 |
cs/0103010
|
Masaki Murata
|
Masaki Murata, Kiyotaka Uchimoto, Qing Ma, and Hitoshi Isahara
|
Magical Number Seven Plus or Minus Two: Syntactic Structure Recognition
in Japanese and English Sentences
|
9 pages. Computation and Language. This paper is included in the book
entitled by "Computational Linguistics and Intelligent Text Processing,
Second International Conference, CICLing 2001, Mexico City, February 2001
Proceedings", Alexander Gelbukh (Ed.), Springer Publisher, ISSN 0302-9743,
ISBN 3-540-41687-0
|
CICLing'2001, Mexico City, February 2001
| null | null |
cs.CL
| null |
George A. Miller said that human beings have only seven chunks in short-term
memory, plus or minus two. We counted the number of bunsetsus (phrases) whose
modifiees are undetermined in each step of an analysis of the dependency
structure of Japanese sentences, and which therefore must be stored in
short-term memory. The number was roughly less than nine, the upper bound of
seven plus or minus two. We also obtained similar results with English
sentences under the assumption that human beings recognize a series of words,
such as a noun phrase (NP), as a unit. This indicates that if we assume that
the human cognitive units in Japanese and English are bunsetsu and NP
respectively, analysis will support Miller's $7 \pm 2$ theory.
|
[
{
"version": "v1",
"created": "Mon, 12 Mar 2001 08:23:19 GMT"
}
] | 2009-09-25T00:00:00 |
[
[
"Murata",
"Masaki",
""
],
[
"Uchimoto",
"Kiyotaka",
""
],
[
"Ma",
"Qing",
""
],
[
"Isahara",
"Hitoshi",
""
]
] |
new_dataset
| 0.998226 |
cs/0103012
|
Masaki Murata
|
Masaki Murata, Kyoko Kanzaki, Kiyotaka Uchimoto, Qing Ma, and Hitoshi
Isahara
|
Meaning Sort - Three examples: dictionary construction, tagged corpus
construction, and information presentation system
|
14 pages. Computation and Language. This paper is included in the
book entitled by "Computational Linguistics and Intelligent Text Processing,
Second International Conference", Springer Publisher
|
CICLing'2001, Mexico City, February 2001
| null | null |
cs.CL
| null |
It is often useful to sort words into an order that reflects relations among
their meanings as obtained by using a thesaurus. In this paper, we introduce a
method of arranging words semantically by using several types of `{\sf is-a}'
thesauri and a multi-dimensional thesaurus. We also describe three major
applications where a meaning sort is useful and show the effectiveness of a
meaning sort. Since there is no doubt that a word list in meaning-order is
easier to use than a word list in some random order, a meaning sort, which can
easily produce a word list in meaning-order, must be useful and effective.
|
[
{
"version": "v1",
"created": "Mon, 12 Mar 2001 08:43:11 GMT"
}
] | 2009-09-25T00:00:00 |
[
[
"Murata",
"Masaki",
""
],
[
"Kanzaki",
"Kyoko",
""
],
[
"Uchimoto",
"Kiyotaka",
""
],
[
"Ma",
"Qing",
""
],
[
"Isahara",
"Hitoshi",
""
]
] |
new_dataset
| 0.974024 |
cs/0109045
|
Zixiang Tan
|
Zixiang Alex Tan
|
Product Cycle, Wintelism, and Cross-national Production Networks (CPN)
for Developing Countries-- China's Telecom Manufacturing Industry as A Case
|
18 pages 5 figures
| null | null |
TPRC-2001-059
|
cs.CY
| null |
Focusing on the telecom manufacturing industry in China, this paper contends
that the existing literature needs to be expanded in order to explain the
Chinese case. First, product cycle theory could be applied to explain
multinational corporations' strategies of importing and localizing their
products in China in order to take advantage of lower labor costs and often
more significantly to break barriers to the Chinese market. Second, there are
no significant indicators pointing to local multinational subsidiaries and
indigenous manufacturers serving as a substantial part of the cross-national
production networks in the global telecom industry yet, although there are some
signs of potential development. Third, the success of "Wintelism" and the
maturity of cross-national production networks in the global market have had
significant impacts on China's indigenous industry.
|
[
{
"version": "v1",
"created": "Sat, 22 Sep 2001 03:49:23 GMT"
}
] | 2009-09-25T00:00:00 |
[
[
"Tan",
"Zixiang Alex",
""
]
] |
new_dataset
| 0.982283 |
cs/9402101
| null |
C. X. Ling
|
Learning the Past Tense of English Verbs: The Symbolic Pattern
Associator vs. Connectionist Models
|
See http://www.jair.org/ for an online appendix and other files
accompanying this article
|
Journal of Artificial Intelligence Research, Vol 1, (1994),
209-229
| null | null |
cs.AI
| null |
Learning the past tense of English verbs - a seemingly minor aspect of
language acquisition - has generated heated debates since 1986, and has become
a landmark task for testing the adequacy of cognitive modeling. Several
artificial neural networks (ANNs) have been implemented, and a challenge for
better symbolic models has been posed. In this paper, we present a
general-purpose Symbolic Pattern Associator (SPA) based upon the decision-tree
learning algorithm ID3. We conduct extensive head-to-head comparisons on the
generalization ability between ANN models and the SPA under different
representations. We conclude that the SPA generalizes the past tense of unseen
verbs better than ANN models by a wide margin, and we offer insights as to why
this should be the case. We also discuss a new default strategy for
decision-tree learning algorithms.
|
[
{
"version": "v1",
"created": "Tue, 1 Feb 1994 00:00:00 GMT"
}
] | 2009-09-25T00:00:00 |
[
[
"Ling",
"C. X.",
""
]
] |
new_dataset
| 0.963081 |
cs/9812023
|
Soumyadeep Paul
|
Soumyadeep Paul, Sudipta N. Sinha and Amitabha Mukerjee
|
Virtual Kathakali : Gesture Driven Metamorphosis
|
Proceedings of International Conference on Knowledge Based Computer
Systems, Mumbai, India, Dec '98. 12 pages, 19 figures
| null | null | null |
cs.HC
| null |
Training in motor skills such as athletics, dance, or gymnastics is not
possible today except in the direct presence of the coach/instructor. This
paper describes a computer vision based gesture recognition system which is
used to metamorphose the user into a Virtual person, e.g. as a Kathakali
dancer, which is graphically recreated at a near or diatant location. Thus this
can be seen by an off-site coach using low-bandwidth joint-motion data which
permits real time animation. The metamorphosis involves altering the appearance
and identity of the user and also creating a specific environment possibly in
interaction with other virtual creatures.
A robust vision module is used to identify the user, based on very simple
binary image processing in real time which also manages to resolve
self-occlusion, correct for clothing/colour and other variations among users.
Gestures are identified by locating key points at the shoulder, elbow and wrist
joint, which are then recreated in an articulated humanoid model, which in this
instance, representes a Kathakali dancer in elaborate traditional dress. Unlike
glove based or other and movement tracking systems, this application requires
the user to wear no hardwire devices and is aimed at making gesture tracking
simpler, cheaper, and more user friendly.
|
[
{
"version": "v1",
"created": "Tue, 29 Dec 1998 16:50:27 GMT"
}
] | 2009-09-25T00:00:00 |
[
[
"Paul",
"Soumyadeep",
""
],
[
"Sinha",
"Sudipta N.",
""
],
[
"Mukerjee",
"Amitabha",
""
]
] |
new_dataset
| 0.999274 |
cs/9902018
|
Ee-Peng Lim
|
Yong Lin, Jian Xu, Ee-Peng Lim, Wee-Keong Ng
|
ZBroker: A Query Routing Broker for Z39.50 Databases
|
10 pages, 8 figures
| null | null | null |
cs.DL cs.DB
| null |
A query routing broker is a software agent that determines from a large set
of accessing information sources the ones most relevant to a user's information
need. As the number of information sources on the Internet increases
dramatically, future users will have to rely on query routing brokers to decide
a small number of information sources to query without incurring too much query
processing overheads. In this paper, we describe a query routing broker known
as ZBroker developed for bibliographic database servers that support the Z39.50
protocol. ZBroker samples the content of each bibliographic database by using
training queries and their results, and summarizes the bibliographic database
content into a knowledge base. We present the design and implementation of
ZBroker and describe its Web-based user interface.
|
[
{
"version": "v1",
"created": "Tue, 9 Feb 1999 03:50:24 GMT"
}
] | 2009-09-25T00:00:00 |
[
[
"Lin",
"Yong",
""
],
[
"Xu",
"Jian",
""
],
[
"Lim",
"Ee-Peng",
""
],
[
"Ng",
"Wee-Keong",
""
]
] |
new_dataset
| 0.998993 |
cs/9905006
|
Stephen F. Bush
|
Stephen F. Bush
|
The Design and Analysis of Virtual Network Configuration for a Wireless
Mobile ATM Network
|
PhD Thesis
| null | null | null |
cs.NI
| null |
This research concentrates on the design and analysis of an algorithm
referred to as Virtual Network Configuration (VNC) which uses predicted future
states of a system for faster network configuration and management. VNC is
applied to the configuration of a wireless mobile ATM network. VNC is built on
techniques from parallel discrete event simulation merged with constraints from
real-time systems and applied to mobile ATM configuration and handoff.
Configuration in a mobile network is a dynamic and continuous process.
Factors such as load, distance, capacity and topology are all constantly
changing in a mobile environment. The VNC algorithm anticipates configuration
changes and speeds the reconfiguration process by pre-computing and caching
results. VNC propagates local prediction results throughout the VNC enhanced
system. The Global Positioning System is an enabling technology for the use of
VNC in mobile networks because it provides location information and accurate
time for each node.
This research has resulted in well defined structures for the encapsulation
of physical processes within Logical Processes and a generic library for
enhancing a system with VNC. Enhancing an existing system with VNC is straight
forward assuming the existing physical processes do not have side effects. The
benefit of prediction is gained at the cost of additional traffic and
processing. This research includes an analysis of VNC and suggestions for
optimization of the VNC algorithm and its parameters.
|
[
{
"version": "v1",
"created": "Tue, 11 May 1999 20:05:36 GMT"
}
] | 2009-09-25T00:00:00 |
[
[
"Bush",
"Stephen F.",
""
]
] |
new_dataset
| 0.999533 |
cs/9912006
|
Masaki Murata
|
M. Murata, M. Nagao (Kyoto University)
|
Resolution of Verb Ellipsis in Japanese Sentence using Surface
Expressions and Examples
|
6 pages, 0 figures. Computation and Language
|
Natural Language Processing Pacific Rim Symposium 1997 (NLPRS'97),
Cape Panwa Hotel, Phuket, Thailand, December 2-4, 1997 p75-80
| null | null |
cs.CL
| null |
Verbs are sometimes omitted in Japanese sentences. It is necessary to recover
omitted verbs for purposes of language understanding, machine translation, and
conversational processing. This paper describes a practical way to recover
omitted verbs by using surface expressions and examples. We experimented the
resolution of verb ellipses by using this information, and obtained a recall
rate of 73% and a precision rate of 66% on test sentences.
|
[
{
"version": "v1",
"created": "Mon, 13 Dec 1999 05:19:46 GMT"
}
] | 2009-09-25T00:00:00 |
[
[
"Murata",
"M.",
"",
"Kyoto University"
],
[
"Nagao",
"M.",
"",
"Kyoto University"
]
] |
new_dataset
| 0.998949 |
cs/0611162
|
Kai-Uwe Schmidt
|
Kai-Uwe Schmidt
|
Quaternary Constant-Amplitude Codes for Multicode CDMA
|
This is the revised journal version
|
IEEE Trans. Inf. Theory, vol. 55, no. 4, pp. 1824-1832, April 2009
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A constant-amplitude code is a code that reduces the peak-to-average power
ratio (PAPR) in multicode code-division multiple access (MC-CDMA) systems to
the favorable value 1. In this paper quaternary constant-amplitude codes (codes
over Z_4) of length 2^m with error-correction capabilities are studied. These
codes exist for every positive integer m, while binary constant-amplitude codes
cannot exist if m is odd. Every word of such a code corresponds to a function
from the binary m-tuples to Z_4 having the bent property, i.e., its Fourier
transform has magnitudes 2^{m/2}. Several constructions of such functions are
presented, which are exploited in connection with algebraic codes over Z_4 (in
particular quaternary Reed-Muller, Kerdock, and Delsarte-Goethals codes) to
construct families of quaternary constant-amplitude codes. Mappings from binary
to quaternary constant-amplitude codes are presented as well.
|
[
{
"version": "v1",
"created": "Thu, 30 Nov 2006 11:18:51 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Sep 2009 18:04:41 GMT"
}
] | 2009-09-24T00:00:00 |
[
[
"Schmidt",
"Kai-Uwe",
""
]
] |
new_dataset
| 0.999899 |
0909.3146
|
Fr\'ed\'erique Oggier
|
Frederique Oggier and Hanane Fathi
|
An Authentication Code against Pollution Attacks in Network Coding
| null | null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Systems exploiting network coding to increase their throughput suffer greatly
from pollution attacks which consist of injecting malicious packets in the
network. The pollution attacks are amplified by the network coding process,
resulting in a greater damage than under traditional routing. In this paper, we
address this issue by designing an unconditionally secure authentication code
suitable for multicast network coding. The proposed scheme is robust against
pollution attacks from outsiders, as well as coalitions of malicious insiders.
Intermediate nodes can verify the integrity and origin of the packets received
without having to decode, and thus detect and discard the malicious messages
in-transit that fail the verification. This way, the pollution is canceled out
before reaching the destinations. We analyze the performance of the scheme in
terms of both multicast throughput and goodput, and show the goodput gains. We
also discuss applications to file distribution.
|
[
{
"version": "v1",
"created": "Thu, 17 Sep 2009 06:05:44 GMT"
}
] | 2009-09-18T00:00:00 |
[
[
"Oggier",
"Frederique",
""
],
[
"Fathi",
"Hanane",
""
]
] |
new_dataset
| 0.980111 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.