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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0801.0337
|
Brian Whitworth
|
Brian Whitworth
|
The Physical World as a Virtual Reality
|
The argument that virtual reality information simulations may be
relevant to modern physics theory is a little outside the mainstream, but
even people in Physics now consider this possibility, e.g. Svozil
| null | null |
CDMTCS0316
|
cs.OH
| null |
This paper explores the idea that the universe is a virtual reality created
by information processing, and relates this strange idea to the findings of
modern physics about the physical world. The virtual reality concept is
familiar to us from online worlds, but our world as a virtual reality is
usually a subject for science fiction rather than science. Yet logically the
world could be an information simulation running on a multi-dimensional
space-time screen. Indeed, if the essence of the universe is information,
matter, charge, energy and movement could be aspects of information, and the
many conservation laws could be a single law of information conservation. If
the universe were a virtual reality, its creation at the big bang would no
longer be paradoxical, as every virtual system must be booted up. It is
suggested that whether the world is an objective reality or a virtual reality
is a matter for science to resolve. Modern information science can suggest how
core physical properties like space, time, light, matter and movement could
derive from information processing. Such an approach could reconcile relativity
and quantum theories, with the former being how information processing creates
space-time, and the latter how it creates energy and matter.
|
[
{
"version": "v1",
"created": "Wed, 2 Jan 2008 05:04:27 GMT"
},
{
"version": "v2",
"created": "Sat, 5 Jan 2008 08:00:28 GMT"
}
] | 2008-01-05T00:00:00 |
[
[
"Whitworth",
"Brian",
""
]
] |
new_dataset
| 0.998565 |
0801.0092
|
Kerry Soileau
|
Kerry Michael Soileau
|
Nash bargaining with a nondeterministic threat
|
Added solution algorithm
| null | null | null |
cs.GT
| null |
We consider bargaining problems which involve two participants, with a
nonempty closed, bounded convex bargaining set of points in the real plane
representing all realizable bargains. We also assume that there is no definite
threat or disagreement point which will provide the default bargain if the
players cannot agree on some point in the bargaining set. However, there is a
nondeterministic threat: if the players fail to agree on a bargain, one of them
will be chosen at random with equal probability, and that chosen player will
select any realizable bargain as the solution, subject to a reasonable
restriction.
|
[
{
"version": "v1",
"created": "Sat, 29 Dec 2007 21:39:31 GMT"
},
{
"version": "v2",
"created": "Fri, 4 Jan 2008 00:58:21 GMT"
}
] | 2008-01-04T00:00:00 |
[
[
"Soileau",
"Kerry Michael",
""
]
] |
new_dataset
| 0.989799 |
0801.0535
|
Olivier Finkel
|
Olivier Finkel (ELM)
|
An omega-Power of a Finitary Language Which is a Borel Set of Infinite
Rank
| null |
Fundamenta Informaticae 62 (3-4) (2004) 333-342
| null | null |
cs.LO math.LO
| null |
Omega-powers of finitary languages are omega languages in the form V^omega,
where V is a finitary language over a finite alphabet X. Since the set of
infinite words over X can be equipped with the usual Cantor topology, the
question of the topological complexity of omega-powers naturally arises and has
been raised by Niwinski, by Simonnet, and by Staiger. It has been recently
proved that for each integer n > 0, there exist some omega-powers of context
free languages which are Pi^0_n-complete Borel sets, and that there exists a
context free language L such that L^omega is analytic but not Borel. But the
question was still open whether there exists a finitary language V such that
V^omega is a Borel set of infinite rank. We answer this question in this paper,
giving an example of a finitary language whose omega-power is Borel of infinite
rank.
|
[
{
"version": "v1",
"created": "Thu, 3 Jan 2008 14:49:23 GMT"
}
] | 2008-01-04T00:00:00 |
[
[
"Finkel",
"Olivier",
"",
"ELM"
]
] |
new_dataset
| 0.998716 |
0801.0575
|
Manik Lal Das
|
Manik Lal Das
|
A Flexible and Secure Remote Systems Authentication Scheme Using Smart
Cards
| null |
Published in the Transactions on Electronics, Computer and
Communication, 1(2):78-82, 2006
| null | null |
cs.CR
| null |
The paper presents an authentication scheme for remote systems using smart
card. The scheme prevents the scenario of many logged in users with the same
login identity, and does not require password/verifier table to validate the
users' login request. The scheme provides a user-friendly password change
option, and withstands the replay, impersonation, stolen-verifier, guessing,
and denial-of-service attacks.
|
[
{
"version": "v1",
"created": "Thu, 3 Jan 2008 18:21:35 GMT"
}
] | 2008-01-04T00:00:00 |
[
[
"Das",
"Manik Lal",
""
]
] |
new_dataset
| 0.995884 |
0801.0581
|
Zouheir Rezki Mr.
|
Z. Rezki, David Haccoun and Fran\c{c}ois Gagnon
|
Capacity of The Discrete-Time Non-Coherent Memoryless Rayleigh Fading
Channels at Low SNR
|
26 pages, 5 figues, submitted to IEEE Trans. on Information Theory,
Septembre 2007
| null | null | null |
cs.IT math.IT
| null |
The capacity of a discrete-time memoryless channel, in which successive
symbols fade independently, and where the channel state information (CSI) is
neither available at the transmitter nor at the receiver, is considered at low
SNR. We derive a closed form expression of the optimal capacity-achieving input
distribution at low signal-to-noise ratio (SNR) and give the exact capacity of
a non-coherent channel at low SNR. The derived relations allow to better
understanding the capacity of non-coherent channels at low SNR and bring an
analytical answer to the peculiar behavior of the optimal input distribution
observed in a previous work by Abou Faycal, Trott and Shamai. Then, we compute
the non-coherence penalty and give a more precise characterization of the
sub-linear term in SNR. Finally, in order to better understand how the optimal
input varies with SNR, upper and lower bounds on the capacity-achieving input
are given.
|
[
{
"version": "v1",
"created": "Thu, 3 Jan 2008 19:37:47 GMT"
}
] | 2008-01-04T00:00:00 |
[
[
"Rezki",
"Z.",
""
],
[
"Haccoun",
"David",
""
],
[
"Gagnon",
"François",
""
]
] |
new_dataset
| 0.997174 |
0801.0102
|
Michael Baer
|
Michael B. Baer
|
Reserved-Length Prefix Coding
|
5 pages, submitted to ISIT 2008
| null | null | null |
cs.IT cs.DS math.IT
| null |
Huffman coding finds an optimal prefix code for a given probability mass
function. Consider situations in which one wishes to find an optimal code with
the restriction that all codewords have lengths that lie in a user-specified
set of lengths (or, equivalently, no codewords have lengths that lie in a
complementary set). This paper introduces a polynomial-time dynamic programming
algorithm that finds optimal codes for this reserved-length prefix coding
problem. This has applications to quickly encoding and decoding lossless codes.
In addition, one modification of the approach solves any quasiarithmetic prefix
coding problem, while another finds optimal codes restricted to the set of
codes with g codeword lengths for user-specified g (e.g., g=2).
|
[
{
"version": "v1",
"created": "Sun, 30 Dec 2007 00:14:24 GMT"
}
] | 2008-01-03T00:00:00 |
[
[
"Baer",
"Michael B.",
""
]
] |
new_dataset
| 0.999784 |
0712.4341
|
Yongming Li
|
Yongming Li
|
Finite Automata Based on Quantum Logic and Their Determinization
| null | null | null | null |
cs.LO
| null |
We give the quantum subset construction of orthomodular lattice-valued finite
automata, then we show the equivalence between orthomodular lattice-valued
finite automata, orthomodular lattice-valued deterministic finite automata and
orthomodular lattice-valued finite automata with empty string-moves. Based on
these equivalences, we study the algebraic operations on orthomodular
lattice-valued regular languages, then we establish Kleene theorem in the frame
of quantum logic.
|
[
{
"version": "v1",
"created": "Fri, 28 Dec 2007 11:48:44 GMT"
}
] | 2007-12-31T00:00:00 |
[
[
"Li",
"Yongming",
""
]
] |
new_dataset
| 0.998292 |
0712.4215
|
Sahbi Sidhom
|
Bel G. Raggad (PU - Seidenberg School of CS & IS), Sahbi Sidhom
(LORIA)
|
Cyberspace security: How to develop a security strategy
| null |
Dans V. International conference Cyberspace 2007 (2007)
| null | null |
cs.OH
| null |
Despite all visible dividers, the Internet is getting us closer and closer,
but with a great price. Our security is the price. The international community
is fully aware of the urgent need to secure the cyberspace as you see the
multiplication of security standards and national schemes interpreting them
beyond borders: ISO 15408, ISO 17799, and ISO 27001. Even though some
countries, including the Security Big Six (SB6), are equipped with their
security books and may feel relatively safe; this remains a wrong sense of
security as long as they share their networks with entities of less security.
The standards impose security best practices and system specifications for the
development of information security management systems. Partners beyond borders
have to be secure as this is only possible if all entities connected to the
partnership remain secure. Unfortunately, there is no way to verify the
continuous security of partners without periodic security auditing and
certification, and members who do not comply should be barred from the
partnership. This concept also applies to the cyber space or the electronic
society. In order to clean our society from cyber crimes and cyber terrorism we
need to impose strict security policies and enforce them in a cooperative
manner. The paper discusses a country's effort in the development of a national
security strategy given its security economic intelligence position, its
security readiness, and its adverse exposure.
|
[
{
"version": "v1",
"created": "Thu, 27 Dec 2007 11:05:51 GMT"
}
] | 2007-12-28T00:00:00 |
[
[
"Raggad",
"Bel G.",
"",
"PU - Seidenberg School of CS & IS"
],
[
"Sidhom",
"Sahbi",
"",
"LORIA"
]
] |
new_dataset
| 0.954408 |
0712.3830
|
Tom Schrijvers
|
Tom Schrijvers, Bart Demoen, David S. Warren
|
TCHR: a framework for tabled CLP
|
Accepted for publication in Theory and Practice of Logic Programming
| null | null | null |
cs.PL
| null |
Tabled Constraint Logic Programming is a powerful execution mechanism for
dealing with Constraint Logic Programming without worrying about fixpoint
computation. Various applications, e.g in the fields of program analysis and
model checking, have been proposed. Unfortunately, a high-level system for
developing new applications is lacking, and programmers are forced to resort to
complicated ad hoc solutions.
This papers presents TCHR, a high-level framework for tabled Constraint Logic
Programming. It integrates in a light-weight manner Constraint Handling Rules
(CHR), a high-level language for constraint solvers, with tabled Logic
Programming. The framework is easily instantiated with new application-specific
constraint domains. Various high-level operations can be instantiated to
control performance. In particular, we propose a novel, generalized technique
for compacting answer sets.
|
[
{
"version": "v1",
"created": "Wed, 26 Dec 2007 15:28:16 GMT"
}
] | 2007-12-27T00:00:00 |
[
[
"Schrijvers",
"Tom",
""
],
[
"Demoen",
"Bart",
""
],
[
"Warren",
"David S.",
""
]
] |
new_dataset
| 0.999192 |
0712.3299
|
Jocelyne Troccaz
|
Jocelyne Troccaz (TIMC)
|
Computer- and robot-assisted urological surgery
| null |
Progr\`es en urologie : journal de l'Association fran\c{c}aise
d'urologie et de la Soci\'et\'e fran\c{c}aise d'urologie 16, 2 (2006) 112-20
| null | null |
cs.OH cs.RO
| null |
The author reviews the computer and robotic tools available to urologists to
help in diagnosis and technical procedures. The first part concerns the
contribution of robotics and presents several systems at various stages of
development (laboratory prototypes, systems under validation or marketed
systems). The second part describes image fusion tools and navigation systems
currently under development or evaluation. Several studies on computerized
simulation of urological procedures are also presented.
|
[
{
"version": "v1",
"created": "Wed, 19 Dec 2007 22:09:18 GMT"
}
] | 2007-12-21T00:00:00 |
[
[
"Troccaz",
"Jocelyne",
"",
"TIMC"
]
] |
new_dataset
| 0.992124 |
0712.3128
|
Bob Diertens
|
Bob Diertens
|
Software (Re-)Engineering with PSF III: an IDE for PSF
| null | null | null |
prg0708
|
cs.SE
| null |
We describe the design of an integrated development environment (IDE) for
PSF. In the software engineering process we used process algebra in the form of
PSF for the specification of the architecture of the IDE. This specification is
refined to a PSF specification of the IDE system as a ToolBus application, by
applying vertical and horizontal implementation techniques. We implemented the
various tools as specified and connected them with a ToolBus script extracted
from the system specification.
|
[
{
"version": "v1",
"created": "Wed, 19 Dec 2007 09:46:23 GMT"
}
] | 2007-12-20T00:00:00 |
[
[
"Diertens",
"Bob",
""
]
] |
new_dataset
| 0.997579 |
0712.0811
|
Radim Ba\v{c}a Ing.
|
R.Baca, V.Snasel, J.Platos, M.Kratky, E.El-Qawasmeh
|
The Fast Fibonacci Decompression Algorithm
| null | null | null | null |
cs.PF cs.OH
| null |
Data compression has been widely applied in many data processing areas.
Compression methods use variable-size codes with the shorter codes assigned to
symbols or groups of symbols that appear in the data frequently. Fibonacci
coding, as a representative of these codes, is used for compressing small
numbers. Time consumption of a decompression algorithm is not usually as
important as the time of a compression algorithm. However, efficiency of the
decompression may be a critical issue in some cases. For example, a real-time
compression of tree data structures follows this issue. Tree's pages are
decompressed during every reading from a secondary storage into the main
memory. In this case, the efficiency of a decompression algorithm is extremely
important. We have developed a Fast Fibonacci decompression for this purpose.
Our approach is up to $3.5\times$ faster than the original implementation.
|
[
{
"version": "v1",
"created": "Wed, 5 Dec 2007 19:55:16 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Dec 2007 08:05:54 GMT"
}
] | 2007-12-19T00:00:00 |
[
[
"Baca",
"R.",
""
],
[
"Snasel",
"V.",
""
],
[
"Platos",
"J.",
""
],
[
"Kratky",
"M.",
""
],
[
"El-Qawasmeh",
"E.",
""
]
] |
new_dataset
| 0.977665 |
0712.1803
|
Jerome Galtier
|
Jerome Galtier (INRIA Sophia Antipolis)
|
Tournament MAC with Constant Size Congestion Window for WLAN
| null | null | null | null |
cs.NI
| null |
In the context of radio distributed networks, we present a generalized
approach for the Medium Access Control (MAC) with fixed congestion window. Our
protocol is quite simple to analyze and can be used in a lot of different
situations. We give mathematical evidence showing that our performance is
tight, in the sense that no protocol with fixed congestion window can do
better. We also place ourselves in the WiFi/WiMAX framework, and show
experimental results enlightening collision reduction of 14% to 21% compared to
the best known other methods. We show channel capacity improvement, and
fairness considerations.
|
[
{
"version": "v1",
"created": "Tue, 11 Dec 2007 19:43:44 GMT"
},
{
"version": "v2",
"created": "Thu, 13 Dec 2007 09:59:55 GMT"
},
{
"version": "v3",
"created": "Wed, 19 Dec 2007 11:54:52 GMT"
}
] | 2007-12-19T00:00:00 |
[
[
"Galtier",
"Jerome",
"",
"INRIA Sophia Antipolis"
]
] |
new_dataset
| 0.994959 |
cs/0412103
|
Shujun Li Dr.
|
Chengqing Li, Shujun Li, Dan Zhang and Guanrong Chen
|
Chosen-Plaintext Cryptanalysis of a Clipped-Neural-Network-Based Chaotic
Cipher
|
LNCS style, 7 pages, 1 figure (6 sub-figures)
|
Lecture Notes in Computer Science, vol. 3497, pp. 630-636, 2005
|
10.1007/11427445_103
| null |
cs.CR cs.NE nlin.CD
| null |
In ISNN'04, a novel symmetric cipher was proposed, by combining a chaotic
signal and a clipped neural network (CNN) for encryption. The present paper
analyzes the security of this chaotic cipher against chosen-plaintext attacks,
and points out that this cipher can be broken by a chosen-plaintext attack.
Experimental analyses are given to support the feasibility of the proposed
attack.
|
[
{
"version": "v1",
"created": "Thu, 23 Dec 2004 10:33:18 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Sep 2005 10:59:20 GMT"
},
{
"version": "v3",
"created": "Wed, 19 Dec 2007 11:27:09 GMT"
}
] | 2007-12-19T00:00:00 |
[
[
"Li",
"Chengqing",
""
],
[
"Li",
"Shujun",
""
],
[
"Zhang",
"Dan",
""
],
[
"Chen",
"Guanrong",
""
]
] |
new_dataset
| 0.996692 |
0712.2552
|
Yeow Meng Chee
|
Yeow Meng Chee, Alan C. H. Ling, San Ling, and Hao Shen
|
The PBD-Closure of Constant-Composition Codes
|
8 pages
|
IEEE Transactions on Information Theory, vol. 53, No. 8, August
2007, pp. 2685-2692
|
10.1109/TIT.2007.901175
| null |
cs.IT cs.DM math.CO math.IT
| null |
We show an interesting PBD-closure result for the set of lengths of
constant-composition codes whose distance and size meet certain conditions. A
consequence of this PBD-closure result is that the size of optimal
constant-composition codes can be determined for infinite families of parameter
sets from just a single example of an optimal code. As an application, the size
of several infinite families of optimal constant-composition codes are derived.
In particular, the problem of determining the size of optimal
constant-composition codes having distance four and weight three is solved for
all lengths sufficiently large. This problem was previously unresolved for odd
lengths, except for lengths seven and eleven.
|
[
{
"version": "v1",
"created": "Sun, 16 Dec 2007 01:02:12 GMT"
}
] | 2007-12-18T00:00:00 |
[
[
"Chee",
"Yeow Meng",
""
],
[
"Ling",
"Alan C. H.",
""
],
[
"Ling",
"San",
""
],
[
"Shen",
"Hao",
""
]
] |
new_dataset
| 0.99938 |
0712.2605
|
Grenville Croll
|
Grenville J. Croll
|
Some A Priori Torah Decryption Principles
|
11 Pages. Presented at the 2nd conference of the Int. Torah Codes
Society, Jerusalem, Israel, 5th June 2000
|
Proc. ANPA Cambridge, UK, 2007
| null | null |
cs.CR
| null |
The author proposes, a priori, a simple set of principles that can be
developed into a range of algorithms by which means the Torah might be decoded.
It is assumed that the Torah is some form of transposition cipher with the
unusual property that the plain text of the Torah may also be the cipher text
of one or more other documents written in Biblical Hebrew. The decryption
principles are based upon the use of Equidistant Letter Sequences (ELS) and the
notions of Message Length, Dimensionality, Euclidean Dimension, Topology, Read
Direction, Skip Distance and offset. The principles can be applied recursively
and define numerous large subsets of the 304,807! theoretically possible
permutations of the characters of the Torah.
|
[
{
"version": "v1",
"created": "Mon, 17 Dec 2007 00:56:32 GMT"
}
] | 2007-12-18T00:00:00 |
[
[
"Croll",
"Grenville J.",
""
]
] |
new_dataset
| 0.996898 |
0712.2630
|
Juan J. Merelo Pr.
|
Nestor Zorzano, Daniel Merino, J.L.J. Laredo, J.P. Sevilla, Pablo
Garcia, J.J. Merelo
|
Evolving XSLT stylesheets
|
First draft, preparing for WCCI 2008
| null | null | null |
cs.NE cs.PL
| null |
This paper introduces a procedure based on genetic programming to evolve XSLT
programs (usually called stylesheets or logicsheets). XSLT is a general
purpose, document-oriented functional language, generally used to transform XML
documents (or, in general, solve any problem that can be coded as an XML
document). The proposed solution uses a tree representation for the stylesheets
as well as diverse specific operators in order to obtain, in the studied cases
and a reasonable time, a XSLT stylesheet that performs the transformation.
Several types of representation have been compared, resulting in different
performance and degree of success.
|
[
{
"version": "v1",
"created": "Mon, 17 Dec 2007 19:59:42 GMT"
}
] | 2007-12-18T00:00:00 |
[
[
"Zorzano",
"Nestor",
""
],
[
"Merino",
"Daniel",
""
],
[
"Laredo",
"J. L. J.",
""
],
[
"Sevilla",
"J. P.",
""
],
[
"Garcia",
"Pablo",
""
],
[
"Merelo",
"J. J.",
""
]
] |
new_dataset
| 0.979875 |
0712.2661
|
Gregory Gutin
|
P. Balister, S. Gerke, G. Gutin, A. Johnstone, J. Reddington, E.
Scott, A. Soleimanfallah, A. Yeo
|
Algorithms for Generating Convex Sets in Acyclic Digraphs
| null | null | null | null |
cs.DM cs.DS
| null |
A set $X$ of vertices of an acyclic digraph $D$ is convex if $X\neq
\emptyset$ and there is no directed path between vertices of $X$ which contains
a vertex not in $X$. A set $X$ is connected if $X\neq \emptyset$ and the
underlying undirected graph of the subgraph of $D$ induced by $X$ is connected.
Connected convex sets and convex sets of acyclic digraphs are of interest in
the area of modern embedded processor technology. We construct an algorithm
$\cal A$ for enumeration of all connected convex sets of an acyclic digraph $D$
of order $n$. The time complexity of $\cal A$ is $O(n\cdot cc(D))$, where
$cc(D)$ is the number of connected convex sets in $D$. We also give an optimal
algorithm for enumeration of all (not just connected) convex sets of an acyclic
digraph $D$ of order $n$. In computational experiments we demonstrate that our
algorithms outperform the best algorithms in the literature.
Using the same approach as for $\cal A$, we design an algorithm for
generating all connected sets of a connected undirected graph $G$. The
complexity of the algorithm is $O(n\cdot c(G)),$ where $n$ is the order of $G$
and $c(G)$ is the number of connected sets of $G.$ The previously reported
algorithm for connected set enumeration is of running time $O(mn\cdot c(G))$,
where $m$ is the number of edges in $G.$
|
[
{
"version": "v1",
"created": "Mon, 17 Dec 2007 09:18:57 GMT"
}
] | 2007-12-18T00:00:00 |
[
[
"Balister",
"P.",
""
],
[
"Gerke",
"S.",
""
],
[
"Gutin",
"G.",
""
],
[
"Johnstone",
"A.",
""
],
[
"Reddington",
"J.",
""
],
[
"Scott",
"E.",
""
],
[
"Soleimanfallah",
"A.",
""
],
[
"Yeo",
"A.",
""
]
] |
new_dataset
| 0.95362 |
0712.2678
|
Gregory Gutin
|
P. Balister, S. Gerke, G. Gutin
|
Convex sets in acyclic digraphs
| null | null | null | null |
cs.DM
| null |
A non-empty set $X$ of vertices of an acyclic digraph is called connected if
the underlying undirected graph induced by $X$ is connected and it is called
convex if no two vertices of $X$ are connected by a directed path in which some
vertices are not in $X$. The set of convex sets (connected convex sets) of an
acyclic digraph $D$ is denoted by $\sco(D)$ ($\scc(D)$) and its size by
$\co(D)$ ($\cc(D)$). Gutin, Johnstone, Reddington, Scott, Soleimanfallah, and
Yeo (Proc. ACiD'07) conjectured that the sum of the sizes of all (connected)
convex sets in $D$ equals $\Theta(n \cdot \co(D))$ ($\Theta(n \cdot \cc(D))$)
where $n$ is the order of $D$.
In this paper we exhibit a family of connected acyclic digraphs with
$\sum_{C\in \sco(D)}|C| = o(n\cdot \co(D))$ and $\sum_{C\in \scc(D)}|C| =
o(n\cdot \cc(D))$. We also show that the number of connected convex sets of
order $k$ in any connected acyclic digraph of order $n$ is at least $n-k+1$.
This is a strengthening of a theorem by Gutin and Yeo.
|
[
{
"version": "v1",
"created": "Mon, 17 Dec 2007 10:52:47 GMT"
}
] | 2007-12-18T00:00:00 |
[
[
"Balister",
"P.",
""
],
[
"Gerke",
"S.",
""
],
[
"Gutin",
"G.",
""
]
] |
new_dataset
| 0.996081 |
0712.2255
|
Ian T Foster
|
Ian Foster
|
Human-Machine Symbiosis, 50 Years On
| null | null | null | null |
cs.DC cs.CE cs.HC
| null |
Licklider advocated in 1960 the construction of computers capable of working
symbiotically with humans to address problems not easily addressed by humans
working alone. Since that time, many of the advances that he envisioned have
been achieved, yet the time spent by human problem solvers in mundane
activities remains large. I propose here four areas in which improved tools can
further advance the goal of enhancing human intellect: services, provenance,
knowledge communities, and automation of problem-solving protocols.
|
[
{
"version": "v1",
"created": "Thu, 13 Dec 2007 23:00:37 GMT"
}
] | 2007-12-17T00:00:00 |
[
[
"Foster",
"Ian",
""
]
] |
new_dataset
| 0.983526 |
0712.1875
|
Michel Fliess
|
Michel Fliess (INRIA Futurs)
|
Critique du rapport signal \`a bruit en th\'eorie de l'information -- A
critical appraisal of the signal to noise ratio in information theory
| null | null | null | null |
cs.IT math.IT math.LO math.PR math.RA quant-ph
| null |
The signal to noise ratio, which plays such an important role in information
theory, is shown to become pointless in digital communications where - symbols
are modulating carriers, which are solutions of linear differential equations
with polynomial coefficients, - demodulations is achieved thanks to new
algebraic estimation techniques. Operational calculus, differential algebra and
nonstandard analysis are the main mathematical tools.
|
[
{
"version": "v1",
"created": "Wed, 12 Dec 2007 07:20:54 GMT"
}
] | 2007-12-13T00:00:00 |
[
[
"Fliess",
"Michel",
"",
"INRIA Futurs"
]
] |
new_dataset
| 0.99872 |
0712.1167
|
Felipe Fran\c{c}a
|
Leandro A. J. Marzulo, Felipe M. G. Fran\c{c}a and V\'itor Santos
Costa
|
Transactional WaveCache: Towards Speculative and Out-of-Order DataFlow
Execution of Memory Operations
|
Submitted to ACM International Conference on Computing Frontiers
2008, http://www.computingfrontiers.org/, 20 pages
| null | null | null |
cs.AR cs.DC
| null |
The WaveScalar is the first DataFlow Architecture that can efficiently
provide the sequential memory semantics required by imperative languages. This
work presents an alternative memory ordering mechanism for this architecture,
the Transaction WaveCache. Our mechanism maintains the execution order of
memory operations within blocks of code, called Waves, but adds the ability to
speculatively execute, out-of-order, operations from different waves. This
ordering mechanism is inspired by progress in supporting Transactional
Memories. Waves are considered as atomic regions and executed as nested
transactions. If a wave has finished the execution of all its memory
operations, as soon as the previous waves are committed, it can be committed.
If a hazard is detected in a speculative Wave, all the following Waves
(children) are aborted and re-executed. We evaluate the WaveCache on a set
artificial benchmarks. If the benchmark does not access memory often, we could
achieve speedups of around 90%. Speedups of 33.1% and 24% were observed on more
memory intensive applications, and slowdowns up to 16% arise if memory
bandwidth is a bottleneck. For an application full of WAW, WAR and RAW hazards,
a speedup of 139.7% was verified.
|
[
{
"version": "v1",
"created": "Fri, 7 Dec 2007 15:59:37 GMT"
}
] | 2007-12-10T00:00:00 |
[
[
"Marzulo",
"Leandro A. J.",
""
],
[
"França",
"Felipe M. G.",
""
],
[
"Costa",
"Vítor Santos",
""
]
] |
new_dataset
| 0.980448 |
0709.4497
|
Fedor Manin
|
Fedor Manin
|
The complexity of nonrepetitive edge coloring of graphs
| null | null | null | null |
cs.CC cs.DM
| null |
A squarefree word is a sequence $w$ of symbols such that there are no strings
$x, y$, and $z$ for which $w=xyyz$. A nonrepetitive coloring of a graph is an
edge coloring in which the sequence of colors along any open path is
squarefree. We show that determining whether a graph $G$ has a nonrepetitive
$k$-coloring is $\Sigma_2^p$-complete. When we restrict to paths of lengths at
most $n$, the problem becomes NP-complete for fixed $n$.
|
[
{
"version": "v1",
"created": "Thu, 27 Sep 2007 20:56:42 GMT"
},
{
"version": "v2",
"created": "Thu, 6 Dec 2007 22:05:37 GMT"
}
] | 2007-12-07T00:00:00 |
[
[
"Manin",
"Fedor",
""
]
] |
new_dataset
| 0.987261 |
0712.0554
|
Mathieu Couture
|
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat
Morin, Michiel Smid
|
Spanners of Complete $k$-Partite Geometric Graphs
| null | null | null | null |
cs.CG
| null |
We address the following problem: Given a complete $k$-partite geometric
graph $K$ whose vertex set is a set of $n$ points in $\mathbb{R}^d$, compute a
spanner of $K$ that has a ``small'' stretch factor and ``few'' edges. We
present two algorithms for this problem. The first algorithm computes a
$(5+\epsilon)$-spanner of $K$ with O(n) edges in $O(n \log n)$ time. The second
algorithm computes a $(3+\epsilon)$-spanner of $K$ with $O(n \log n)$ edges in
$O(n \log n)$ time. The latter result is optimal: We show that for any $2 \leq
k \leq n - \Theta(\sqrt{n \log n})$, spanners with $O(n \log n)$ edges and
stretch factor less than 3 do not exist for all complete $k$-partite geometric
graphs.
|
[
{
"version": "v1",
"created": "Tue, 4 Dec 2007 16:14:07 GMT"
}
] | 2007-12-05T00:00:00 |
[
[
"Bose",
"Prosenjit",
""
],
[
"Carmi",
"Paz",
""
],
[
"Couture",
"Mathieu",
""
],
[
"Maheshwari",
"Anil",
""
],
[
"Morin",
"Pat",
""
],
[
"Smid",
"Michiel",
""
]
] |
new_dataset
| 0.996795 |
0712.0139
|
Tetsuo Kurosaki
|
Tetsuo Kurosaki
|
Direct definition of a ternary infinite square-free sequence
|
9 pages, 1 figures, to appear in Information Processing Letters
| null |
10.1016/j.ipl.2007.11.012
| null |
cs.DM
| null |
We propose a new ternary infinite (even full-infinite) square-free sequence.
The sequence is defined both by an iterative method and by a direct definition.
Both definitions are analogous to those of the Thue-Morse sequence. The direct
definition is given by a deterministic finite automaton with output. In short,
the sequence is automatic.
|
[
{
"version": "v1",
"created": "Sun, 2 Dec 2007 13:25:01 GMT"
}
] | 2007-12-04T00:00:00 |
[
[
"Kurosaki",
"Tetsuo",
""
]
] |
new_dataset
| 0.999101 |
cs/0506011
|
Peter Sin
|
Peter Sin and Qing Xiang
|
On the dimensions of certain LDPC codes based on q-regular bipartite
graphs
|
3 pages corrected typos: in inequality (2) changed a minus sign to
plus v3.corrected 2 typos in Lemma 3.5 and added Journal-ref
|
IEEE Trans. Information Theory, 52 (8), (2006), 3735-3737
| null | null |
cs.IT cs.DM math.IT
| null |
An explicit construction of a family of binary LDPC codes called LU(3,q),
where q is a power of a prime, was recently given. A conjecture was made for
the dimensions of these codes when q is odd. The conjecture is proved in this
note. The proof involves the geometry of a 4-dimensional symplectic vector
space and the action of the symplectic group and its subgroups.
|
[
{
"version": "v1",
"created": "Sun, 5 Jun 2005 11:44:10 GMT"
},
{
"version": "v2",
"created": "Wed, 14 Sep 2005 03:21:42 GMT"
},
{
"version": "v3",
"created": "Tue, 4 Dec 2007 19:32:30 GMT"
}
] | 2007-12-04T00:00:00 |
[
[
"Sin",
"Peter",
""
],
[
"Xiang",
"Qing",
""
]
] |
new_dataset
| 0.999661 |
0711.3274
|
EDA Publishing Association
|
M.-A. Polosky, E.-J. Garcia
|
Microsystem Product Development
|
Submitted on behalf of TIMA Editions
(http://irevues.inist.fr/tima-editions)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)
| null | null |
cs.OH
| null |
Over the last decade the successful design and fabrication of complex MEMS
(MicroElectroMechanical Systems), optical circuits and ASICs have been
demonstrated. Packaging and integration processes have lagged behind MEMS
research but are rapidly maturing. As packaging processes evolve, a new
challenge presents itself, microsystem product development. Product development
entails the maturation of the design and all the processes needed to
successfully produce a product. Elements such as tooling design, fixtures,
gages, testers, inspection, work instructions, process planning, etc., are
often overlooked as MEMS engineers concentrate on design, fabrication and
packaging processes. Thorough, up-front planning of product development efforts
is crucial to the success of any project.
|
[
{
"version": "v1",
"created": "Wed, 21 Nov 2007 08:18:26 GMT"
}
] | 2007-11-29T00:00:00 |
[
[
"Polosky",
"M. -A.",
""
],
[
"Garcia",
"E. -J.",
""
]
] |
new_dataset
| 0.95765 |
0711.3284
|
EDA Publishing Association
|
Tsung-Hung Lin, Hsiharng Yang, Ching-Kong Chao
|
Concave Microlens Array Mold Fabrication in Photoresist Using UV
Proximity Printing
|
Submitted on behalf of TIMA Editions
(http://irevues.inist.fr/tima-editions)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)
| null | null |
cs.OH
| null |
This paper presents a simple and effective method to fabricate a
polydimethyl-siloxane (PDMS) microlens array with a high fill factor, which
utilizes the UV proximity printing and photoresist replication methods. The
concave microlens array mold was made using a printing gap in lithography
process, which utilizes optical diffraction of UV light to deflect away from
the aperture edges and produces a certain exposure in the photoresist material
outside the aperture edges. This method can precisely control the geometric
profile of concave microlens array. The experimental results showed that the
concave micro-lens array in photoresist could be formed automatically when the
printing gap ranged from 240 micron to 720 micron. High fill factor microlens
array can be produced, when the control pitch distance between the adjacent
apertures of the concave microlens array was decreased to the aperture size.
|
[
{
"version": "v1",
"created": "Wed, 21 Nov 2007 09:21:50 GMT"
}
] | 2007-11-29T00:00:00 |
[
[
"Lin",
"Tsung-Hung",
""
],
[
"Yang",
"Hsiharng",
""
],
[
"Chao",
"Ching-Kong",
""
]
] |
new_dataset
| 0.959388 |
0711.3292
|
EDA Publishing Association
|
X.-C. Shan, Z.-F. Wang, R. Maeda, Y.F. Sun, M. Wu, J.S. Hua
|
A Silicon-Based Micro Gas Turbine Engine for Power Generation
|
Submitted on behalf of TIMA Editions
(http://irevues.inist.fr/tima-editions)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)
| null | null |
cs.OH
| null |
This paper reports on our research in developing a micro power generation
system based on gas turbine engine and piezoelectric converter. The micro gas
turbine engine consists of a micro combustor, a turbine and a centrifugal
compressor. Comprehensive simulation has been implemented to optimal the
component design. We have successfully demonstrated a silicon-based micro
combustor, which consists of seven layers of silicon structures. A
hairpin-shaped design is applied to the fuel/air recirculation channel. The
micro combustor can sustain a stable combustion with an exit temperature as
high as 1600 K. We have also successfully developed a micro turbine device,
which is equipped with enhanced micro air-bearings and driven by compressed
air. A rotation speed of 15,000 rpm has been demonstrated during lab test. In
this paper, we will introduce our research results major in the development of
micro combustor and micro turbine test device.
|
[
{
"version": "v1",
"created": "Wed, 21 Nov 2007 09:37:07 GMT"
}
] | 2007-11-29T00:00:00 |
[
[
"Shan",
"X. -C.",
""
],
[
"Wang",
"Z. -F.",
""
],
[
"Maeda",
"R.",
""
],
[
"Sun",
"Y. F.",
""
],
[
"Wu",
"M.",
""
],
[
"Hua",
"J. S.",
""
]
] |
new_dataset
| 0.982991 |
0711.3304
|
EDA Publishing Association
|
Gou-Jen Wang, Yi-Chin Lin, Gwo-Sen Lin
|
A Novel Contact Resistance Model of Anisotropic Conductive Film for FPD
Packaging
|
Submitted on behalf of TIMA Editions
(http://irevues.inist.fr/tima-editions)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)
| null | null |
cs.OH
| null |
In this research, a novel contact resistance model for the flat panel display
(FPD) packaging based on the within layer parallel and between layers series
resistance concepts was proposed. The FJ2530 anisotropic conductive films (ACF)
by Sony Inc. containing the currently smallest 3micron conductive particles was
used to conduct the experiments to verify the accuracy of the proposed model.
Calculated resistance of the chip-on-glass (COG) packaging by the proposed
model is 0.163\Omega. It is found that the gold bump with 0.162\Omega
resistance play the major role of the overall resistance. Although the
predicted resistance by the proposed model is only one third of the
experimentally measured value, it has been three-fold improvement compared to
the existing models.
|
[
{
"version": "v1",
"created": "Wed, 21 Nov 2007 09:48:35 GMT"
}
] | 2007-11-29T00:00:00 |
[
[
"Wang",
"Gou-Jen",
""
],
[
"Lin",
"Yi-Chin",
""
],
[
"Lin",
"Gwo-Sen",
""
]
] |
new_dataset
| 0.988073 |
0711.3313
|
EDA Publishing Association
|
Yi Chiu, Chiung-Ting Kuo, Yu-Shan Chu
|
Design and Fabrication of a Micro Electrostatic Vibration-to-Electricity
Energy Converter
|
Submitted on behalf of TIMA Editions
(http://irevues.inist.fr/tima-editions)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)
| null | null |
cs.OH
| null |
This paper presents a micro electrostatic vibration-toelectricity energy
converter. For the 3.3 V supply voltage and 1cm2 chip area constraints, optimal
design parameters were found from theoretical calculation and Simulink
simulation. In the current design, the output power is 200 $\mu$W/cm2 for the
optimal load of 8 M\Omega. The device was fabricated in a silicon-on-insulator
(SOI) wafer. Mechanical and electrical measurements were conducted. Residual
particles caused shortage of the variable capacitor and the output power could
not be measured. Device design and fabrication processes are being refined.
|
[
{
"version": "v1",
"created": "Wed, 21 Nov 2007 09:58:42 GMT"
}
] | 2007-11-29T00:00:00 |
[
[
"Chiu",
"Yi",
""
],
[
"Kuo",
"Chiung-Ting",
""
],
[
"Chu",
"Yu-Shan",
""
]
] |
new_dataset
| 0.999103 |
0711.3329
|
EDA Publishing Association
|
Ruey-Fang Shyu, Hsiharng Yang, Wen-Ren Tsai, Jhy-Cherng Tsai
|
Micro-Ball Lens Array Fabrication in Photoresist Using Ptfe Hydrophobic
Effect
|
Submitted on behalf of TIMA Editions
(http://irevues.inist.fr/tima-editions)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)
| null | null |
cs.OH
| null |
This paper presents a simple method to fabricate micro-ball lens and its
array. The key technology is to use the hydrophobic characteristics of
polyterafluoroethylene (PTFE) substrate. High contact angle between melted
photoresist pattern and PTFE can generate micro-ball lens and its array. PTFE
thin film was spun onto a silicon wafer and dried in oven. Photoresist AZ4620
was used to pattern micro-columns with different diameters 60, 70 and 80
$\mu$m. A thermal reflow process then was applied to melt these micro-column
patterns resulted in micro-ball lens array. The achieved micro-ball lens array
with diameter 98 $\mu$m was fabricated using 80 $\mu$m in diameter patterns.
This method provides a simple fabrication process and low material cost.
|
[
{
"version": "v1",
"created": "Wed, 21 Nov 2007 10:17:24 GMT"
}
] | 2007-11-29T00:00:00 |
[
[
"Shyu",
"Ruey-Fang",
""
],
[
"Yang",
"Hsiharng",
""
],
[
"Tsai",
"Wen-Ren",
""
],
[
"Tsai",
"Jhy-Cherng",
""
]
] |
new_dataset
| 0.998485 |
0711.3334
|
EDA Publishing Association
|
Chao-Heng Chien, Hui-Min Yu
|
Fabrication of Switches on Polymer-Based by Hot Embossing
|
Submitted on behalf of TIMA Editions
(http://irevues.inist.fr/tima-editions)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)
| null | null |
cs.OH
| null |
In MEMS technology, most of the devices are fabricated on glass or silicon
substrate. However, this research presents a novel manufacture method that is
derived from conventional hot embossing technology to fabricate the
electrostatic switches on polymer material. The procedures of fabrication
involve the metal deposition, photolithography, electroplating, hot embossing
and hot embed techniques. The fundamental concept of the hot embed technology
is that the temperature should be increased above Tg of polymer, and the
polymer becomes plastic and viscous and could be molded. According to the
fundamental concept, the metal layer on the silicon/glass substrate could be
embedded into polymer material during the hot embossing process. Afterward, the
metal layer is bonded together with the polymer after removing the substrate in
the de-embossing step. Finally, the electrostatic switch is fabricated on
polymethylmethacrylate(PMMA) material to demonstrate the novel method.
|
[
{
"version": "v1",
"created": "Wed, 21 Nov 2007 10:27:32 GMT"
}
] | 2007-11-29T00:00:00 |
[
[
"Chien",
"Chao-Heng",
""
],
[
"Yu",
"Hui-Min",
""
]
] |
new_dataset
| 0.992467 |
0711.4444
|
Laurent Hascoet
|
Moulay Hicham Tber (INRIA Sophia Antipolis), Laurent Hascoet (INRIA
Sophia Antipolis, SEMA), Arthur Vidard (INRIA Rh\^one-Alpes / LJK Laboratoire
Jean Kuntzmann), Benjamin Dauvergne (INRIA Sophia Antipolis)
|
Building the Tangent and Adjoint codes of the Ocean General Circulation
Model OPA with the Automatic Differentiation tool TAPENADE
| null | null | null | null |
cs.MS cs.CE
| null |
The ocean general circulation model OPA is developed by the LODYC team at
Paris VI university. OPA has recently undergone a major rewriting, migrating to
FORTRAN95, and its adjoint code needs to be rebuilt. For earlier versions, the
adjoint of OPA was written by hand at a high development cost. We use the
Automatic Differentiation tool TAPENADE to build mechanicaly the tangent and
adjoint codes of OPA. We validate the differentiated codes by comparison with
divided differences, and also with an identical twin experiment. We apply
state-of-the-art methods to improve the performance of the adjoint code. In
particular we implement the Griewank and Walther's binomial checkpointing
algorithm which gives us an optimal trade-off between time and memory
consumption. We apply a specific strategy to differentiate the iterative linear
solver that comes from the implicit time stepping scheme
|
[
{
"version": "v1",
"created": "Wed, 28 Nov 2007 08:04:18 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Nov 2007 09:09:27 GMT"
}
] | 2007-11-29T00:00:00 |
[
[
"Tber",
"Moulay Hicham",
"",
"INRIA Sophia Antipolis"
],
[
"Hascoet",
"Laurent",
"",
"INRIA\n Sophia Antipolis, SEMA"
],
[
"Vidard",
"Arthur",
"",
"INRIA Rhône-Alpes / LJK Laboratoire\n Jean Kuntzmann"
],
[
"Dauvergne",
"Benjamin",
"",
"INRIA Sophia Antipolis"
]
] |
new_dataset
| 0.996905 |
0711.4516
|
Jocelyne Troccaz
|
Philippe Merloz (CHU-Grenoble ortho-traumato), Jocelyne Troccaz
(TIMC), Herv\'e Vouaillat (CHU-Grenoble ortho-traumato), Christian Vasile
(CHU-Grenoble ortho-traumato), J\'er\^ome Tonetti (CHU-Grenoble
ortho-traumato), Ahmad Eid (CHU-Grenoble ortho-traumato), St\'ephane Plaweski
(CHU-Grenoble ortho-traumato)
|
Fluoroscopy-based navigation system in spine surgery
| null |
Proceedings of the Institution of Mechanical Engineers. Part H,
Journal of Engineering in Medicine 221, 7 (2007) 813-20
| null | null |
cs.OH
| null |
The variability in width, height, and spatial orientation of a spinal pedicle
makes pedicle screw insertion a delicate operation. The aim of the current
paper is to describe a computer-assisted surgical navigation system based on
fluoroscopic X-ray image calibration and three-dimensional optical localizers
in order to reduce radiation exposure while increasing accuracy and reliability
of the surgical procedure for pedicle screw insertion. Instrumentation using
transpedicular screw fixation was performed: in a first group, a conventional
surgical procedure was carried out with 26 patients (138 screws); in a second
group, a navigated surgical procedure (virtual fluoroscopy) was performed with
26 patients (140 screws). Evaluation of screw placement in every case was done
by using plain X-rays and post-operative computer tomography scan. A 5 per cent
cortex penetration (7 of 140 pedicle screws) occurred for the computer-assisted
group. A 13 per cent penetration (18 of 138 pedicle screws) occurred for the
non computer-assisted group. The radiation running time for each vertebra level
(two screws) reached 3.5 s on average in the computer-assisted group and 11.5 s
on average in the non computer-assisted group. The operative time for two
screws on the same vertebra level reaches 10 min on average in the non
computer-assisted group and 11.9 min on average in the computer-assisted group.
The fluoroscopy-based (two-dimensional) navigation system for pedicle screw
insertion is a safe and reliable procedure for surgery in the lower thoracic
and lumbar spine.
|
[
{
"version": "v1",
"created": "Wed, 28 Nov 2007 15:19:15 GMT"
}
] | 2007-11-29T00:00:00 |
[
[
"Merloz",
"Philippe",
"",
"CHU-Grenoble ortho-traumato"
],
[
"Troccaz",
"Jocelyne",
"",
"TIMC"
],
[
"Vouaillat",
"Hervé",
"",
"CHU-Grenoble ortho-traumato"
],
[
"Vasile",
"Christian",
"",
"CHU-Grenoble ortho-traumato"
],
[
"Tonetti",
"Jérôme",
"",
"CHU-Grenoble\n ortho-traumato"
],
[
"Eid",
"Ahmad",
"",
"CHU-Grenoble ortho-traumato"
],
[
"Plaweski",
"Stéphane",
"",
"CHU-Grenoble ortho-traumato"
]
] |
new_dataset
| 0.999628 |
0706.1751
|
Maximilien Gadouleau
|
Maximilien Gadouleau and Zhiyuan Yan
|
MacWilliams Identity for Codes with the Rank Metric
|
25 pages, submitted to EURASIP Journal on Wireless Communications
| null | null | null |
cs.IT math.IT
| null |
The MacWilliams identity, which relates the weight distribution of a code to
the weight distribution of its dual code, is useful in determining the weight
distribution of codes. In this paper, we derive the MacWilliams identity for
linear codes with the rank metric, and our identity has a different form than
that by Delsarte. Using our MacWilliams identity, we also derive related
identities for rank metric codes. These identities parallel the binomial and
power moment identities derived for codes with the Hamming metric.
|
[
{
"version": "v1",
"created": "Tue, 12 Jun 2007 17:38:47 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Jul 2007 17:56:07 GMT"
},
{
"version": "v3",
"created": "Wed, 28 Nov 2007 03:36:59 GMT"
}
] | 2007-11-28T00:00:00 |
[
[
"Gadouleau",
"Maximilien",
""
],
[
"Yan",
"Zhiyuan",
""
]
] |
new_dataset
| 0.999689 |
0711.4309
|
Giandomenico Sica
|
Ruqian Lu
|
Knowware: the third star after Hardware and Software
|
109 pages, ISBN 978-88-7699-095-3 (Printed edition), ISBN
978-88-7699-096-0 (Electronic edition), printed edition available on Amazon
and on Lulu.com
|
"Publishing studies" book series, edited by Giandomenico Sica,
ISSN 1973-6061 (Printed edition), ISSN 1973-6053 (Electronic edition)
| null | null |
cs.SE cs.AI cs.CY
| null |
This book proposes to separate knowledge from software and to make it a
commodity that is called knowware. The architecture, representation and
function of Knowware are discussed. The principles of knowware engineering and
its three life cycle models: furnace model, crystallization model and spiral
model are proposed and analyzed. Techniques of software/knowware co-engineering
are introduced. A software component whose knowledge is replaced by knowware is
called mixware. An object and component oriented development schema of mixware
is introduced. In particular, the tower model and ladder model for mixware
development are proposed and discussed. Finally, knowledge service and knowware
based Web service are introduced and compared with Web service. In summary,
knowware, software and hardware should be considered as three equally important
underpinnings of IT industry.
Ruqian Lu is a professor of computer science of the Institute of Mathematics,
Academy of Mathematics and System Sciences. He is a fellow of Chinese Academy
of Sciences. His research interests include artificial intelligence, knowledge
engineering and knowledge based software engineering. He has published more
than 100 papers and 10 books. He has won two first class awards from the
Academia Sinica and a National second class prize from the Ministry of Science
and Technology. He has also won the sixth Hua Loo-keng Mathematics Prize.
|
[
{
"version": "v1",
"created": "Tue, 27 Nov 2007 17:36:35 GMT"
}
] | 2007-11-28T00:00:00 |
[
[
"Lu",
"Ruqian",
""
]
] |
new_dataset
| 0.996414 |
0711.3959
|
Frederic Maffray
|
Fr\'ed\'eric Maffray (LGS), Meriem Mechebbek
|
On b-perfect chordal graphs
| null | null | null | null |
cs.DM
| null |
The b-chromatic number of a graph G is the largest integer k such that G has
a coloring of the vertices in k color classes such that every color class
contains a vertex that has a neighbour in all other color classes. We
characterize the class of chordal graphs for which the b-chromatic number is
equal to the chromatic number for every induced subgraph.
|
[
{
"version": "v1",
"created": "Mon, 26 Nov 2007 07:39:19 GMT"
}
] | 2007-11-27T00:00:00 |
[
[
"Maffray",
"Frédéric",
"",
"LGS"
],
[
"Mechebbek",
"Meriem",
""
]
] |
new_dataset
| 0.992279 |
0711.3983
|
Ted Hurley
|
Ted Hurley
|
Self-dual, dual-containing and related quantum codes from group rings
| null | null | null | null |
cs.IT math.IT math.RA
| null |
Classes of self-dual codes and dual-containing codes are constructed. The
codes are obtained within group rings and, using an isomorphism between group
rings and matrices, equivalent codes are obtained in matrix form. Distances and
other properties are derived by working within the group ring. Quantum codes
are constructed from the dual-containing codes.
|
[
{
"version": "v1",
"created": "Mon, 26 Nov 2007 11:36:56 GMT"
}
] | 2007-11-27T00:00:00 |
[
[
"Hurley",
"Ted",
""
]
] |
new_dataset
| 0.999816 |
0711.3500
|
Shiguo Lian
|
Shiguo Lian
|
Secure Fractal Image Coding
|
21 pages, 8 figures. To be submitted
| null | null | null |
cs.MM cs.CR
| null |
In recent work, various fractal image coding methods are reported, which
adopt the self-similarity of images to compress the size of images. However,
till now, no solutions for the security of fractal encoded images have been
provided. In this paper, a secure fractal image coding scheme is proposed and
evaluated, which encrypts some of the fractal parameters during fractal
encoding, and thus, produces the encrypted and encoded image. The encrypted
image can only be recovered by the correct key. To keep secure and efficient,
only the suitable parameters are selected and encrypted through in-vestigating
the properties of various fractal parameters, including parameter space,
parameter distribu-tion and parameter sensitivity. The encryption process does
not change the file format, keeps secure in perception, and costs little time
or computational resources. These properties make it suitable for secure image
encoding or transmission.
|
[
{
"version": "v1",
"created": "Thu, 22 Nov 2007 03:53:29 GMT"
}
] | 2007-11-26T00:00:00 |
[
[
"Lian",
"Shiguo",
""
]
] |
new_dataset
| 0.97713 |
0711.3629
|
Ted Hurley
|
Ted Hurley
|
Convolutional codes from units in matrix and group rings
| null | null | null | null |
cs.IT math.IT math.RA
| null |
A general method for constructing convolutional codes from units in Laurent
series over matrix rings is presented. Using group ring as matrix rings, this
forms a basis for in-depth exploration of convolutional codes from group ring
encoding, wherein the ring in the group ring is itself a group ring. The method
is used to algebraically construct series of convolutional codes. Algebraic
methods are used to compute free distances and to construct convolutional codes
to prescribed distances.
|
[
{
"version": "v1",
"created": "Thu, 22 Nov 2007 18:02:27 GMT"
}
] | 2007-11-26T00:00:00 |
[
[
"Hurley",
"Ted",
""
]
] |
new_dataset
| 0.998925 |
0711.3375
|
Loredana Afanasiev
|
Loredana Afanasiev, Torsten Grust, Maarten Marx, Jan Rittinger, Jens
Teubner
|
An Inflationary Fixed Point Operator in XQuery
|
11 pages, 10 figures, 2 tables
| null | null | null |
cs.DB
| null |
We introduce a controlled form of recursion in XQuery, inflationary fixed
points, familiar in the context of relational databases. This imposes
restrictions on the expressible types of recursion, but we show that
inflationary fixed points nevertheless are sufficiently versatile to capture a
wide range of interesting use cases, including the semantics of Regular XPath
and its core transitive closure construct.
While the optimization of general user-defined recursive functions in XQuery
appears elusive, we will describe how inflationary fixed points can be
efficiently evaluated, provided that the recursive XQuery expressions exhibit a
distributivity property. We show how distributivity can be assessed both,
syntactically and algebraically, and provide experimental evidence that XQuery
processors can substantially benefit during inflationary fixed point
evaluation.
|
[
{
"version": "v1",
"created": "Wed, 21 Nov 2007 13:22:15 GMT"
}
] | 2007-11-22T00:00:00 |
[
[
"Afanasiev",
"Loredana",
""
],
[
"Grust",
"Torsten",
""
],
[
"Marx",
"Maarten",
""
],
[
"Rittinger",
"Jan",
""
],
[
"Teubner",
"Jens",
""
]
] |
new_dataset
| 0.998599 |
0711.3452
|
Eric Laporte
|
Eric Laporte (IGM-LabInfo)
|
In memoriam Maurice Gross
|
8 pages
|
Archives of Control Sciences 15, 3 (2005) 257-278
| null | null |
cs.CL
| null |
Maurice Gross (1934-2001) was both a great linguist and a pioneer in natural
language processing. This article is written in homage to his memory
|
[
{
"version": "v1",
"created": "Wed, 21 Nov 2007 20:38:29 GMT"
}
] | 2007-11-22T00:00:00 |
[
[
"Laporte",
"Eric",
"",
"IGM-LabInfo"
]
] |
new_dataset
| 0.999245 |
cs/0610105
|
Vitaly Shmatikov
|
Arvind Narayanan and Vitaly Shmatikov
|
How To Break Anonymity of the Netflix Prize Dataset
| null | null | null | null |
cs.CR cs.DB
| null |
We present a new class of statistical de-anonymization attacks against
high-dimensional micro-data, such as individual preferences, recommendations,
transaction records and so on. Our techniques are robust to perturbation in the
data and tolerate some mistakes in the adversary's background knowledge.
We apply our de-anonymization methodology to the Netflix Prize dataset, which
contains anonymous movie ratings of 500,000 subscribers of Netflix, the world's
largest online movie rental service. We demonstrate that an adversary who knows
only a little bit about an individual subscriber can easily identify this
subscriber's record in the dataset. Using the Internet Movie Database as the
source of background knowledge, we successfully identified the Netflix records
of known users, uncovering their apparent political preferences and other
potentially sensitive information.
|
[
{
"version": "v1",
"created": "Wed, 18 Oct 2006 06:03:41 GMT"
},
{
"version": "v2",
"created": "Thu, 22 Nov 2007 05:13:06 GMT"
}
] | 2007-11-22T00:00:00 |
[
[
"Narayanan",
"Arvind",
""
],
[
"Shmatikov",
"Vitaly",
""
]
] |
new_dataset
| 0.998214 |
0711.2811
|
Annie Bouyer
|
Gilles Halin (CRAI), Sylvain Kubicki (CRAI)
|
Une approche par les mod\`eles pour le suivi de l'activit\'e de
construction d'un b\^atiment. Bat'iViews : une interface multi-vues
orient\'ee gestion de chantier
| null | null | null | null |
cs.HC
| null |
Cooperation between actors in design and construction activities in
architecture is an essential stake nowadays. In professional practices the
actors involved in construction projects use numerous tools. The project is
unique but the "views" that actors manipulate are various and sometimes
fundamentally different. Their common characteristic is that they partially
represent the cooperation context through a specific point of view.
"Bat'iViews" suggests to the actors a multi-view interface of the context and
enables to navigate through the different views. This proposition is based on a
model-driven approach. We distinguish between "context modelling" and modelling
of concepts represented in each "businessview". A model integrative
infrastructure allows us to develop the prototype and to manage user
interaction through the definition of models' transformations.
|
[
{
"version": "v1",
"created": "Sun, 18 Nov 2007 19:10:18 GMT"
}
] | 2007-11-20T00:00:00 |
[
[
"Halin",
"Gilles",
"",
"CRAI"
],
[
"Kubicki",
"Sylvain",
"",
"CRAI"
]
] |
new_dataset
| 0.983186 |
0711.2844
|
Xueliang Li
|
Xueliang Li, Wenli Zhou
|
Dynamic 3-Coloring of Claw-free Graphs
|
13 pages
| null | null | null |
cs.DM cs.CC
| null |
A {\it dynamic $k$-coloring} of a graph $G$ is a proper $k$-coloring of the
vertices of $G$ such that every vertex of degree at least 2 in $G$ will be
adjacent to vertices with at least 2 different colors. The smallest number $k$
for which a graph $G$ can have a dynamic $k$-coloring is the {\it dynamic
chromatic number}, denoted by $\chi_d(G)$. In this paper, we investigate the
dynamic 3-colorings of claw-free graphs. First, we prove that it is
$NP$-complete to determine if a claw-free graph with maximum degree 3 is
dynamically 3-colorable. Second, by forbidding a kind of subgraphs, we find a
reasonable subclass of claw-free graphs with maximum degree 3, for which the
dynamically 3-colorable problem can be solved in linear time. Third, we give a
linear time algorithm to recognize this subclass of graphs, and a linear time
algorithm to determine whether it is dynamically 3-colorable. We also give a
linear time algorithm to color the graphs in the subclass by 3 colors.
|
[
{
"version": "v1",
"created": "Mon, 19 Nov 2007 05:56:01 GMT"
}
] | 2007-11-20T00:00:00 |
[
[
"Li",
"Xueliang",
""
],
[
"Zhou",
"Wenli",
""
]
] |
new_dataset
| 0.994886 |
0711.2671
|
Himanshu Thapliyal
|
Himanshu Thapliyal, Hamid R. Arabnia, Rajnish Bajpai, Kamal K. Sharma
|
Combined Integer and Variable Precision (CIVP) Floating Point
Multiplication Architecture for FPGAs
|
Published in Proceedings of the 2007 International Conference on
Parallel and Distributed Processing Techniques and Applications (PDPTA'07),
Las Vegas, U.S.A, June 2007, Volume 1, pp. 449-450.(CSREA Press)
| null | null | null |
cs.AR
| null |
In this paper, we propose an architecture/methodology for making FPGAs
suitable for integer as well as variable precision floating point
multiplication. The proposed work will of great importance in applications
which requires variable precision floating point multiplication such as
multi-media processing applications. In the proposed architecture/methodology,
we propose the replacement of existing 18x18 bit and 25x18 bit dedicated
multipliers in FPGAs with dedicated 24x24 bit and 24x9 bit multipliers,
respectively. We have proved that our approach of providing the dedicated 24x24
bit and 24x9 bit multipliers in FPGAs will make them efficient for performing
integer as well as single precision, double precision, and Quadruple precision
floating point multiplications.
|
[
{
"version": "v1",
"created": "Fri, 16 Nov 2007 20:18:32 GMT"
}
] | 2007-11-19T00:00:00 |
[
[
"Thapliyal",
"Himanshu",
""
],
[
"Arabnia",
"Hamid R.",
""
],
[
"Bajpai",
"Rajnish",
""
],
[
"Sharma",
"Kamal K.",
""
]
] |
new_dataset
| 0.990483 |
0708.2571
|
Milton Chowdhury
|
M. M. Chowdhury
|
On the Security of the Cha-Ko-Lee-Han-Cheon Braid Group Public Key
Cryptosystem
| null | null | null | null |
cs.CR
| null |
We show that a number of cryptographic protocols using non-commutative
semigroups including the Cha-Ko-Lee-Han-Cheon braid group public-key
cryptosystem and related public-key cryptosystems such as the Shpilrain-Ushakov
public-key cryptosystems are based on the MSCSP.
|
[
{
"version": "v1",
"created": "Mon, 20 Aug 2007 00:47:15 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Aug 2007 12:58:05 GMT"
},
{
"version": "v3",
"created": "Thu, 23 Aug 2007 02:54:51 GMT"
},
{
"version": "v4",
"created": "Fri, 24 Aug 2007 00:56:05 GMT"
},
{
"version": "v5",
"created": "Thu, 15 Nov 2007 22:28:36 GMT"
}
] | 2007-11-16T00:00:00 |
[
[
"Chowdhury",
"M. M.",
""
]
] |
new_dataset
| 0.989552 |
0711.2383
|
Barbara Cerato
|
Barbara Cerato, Guido Masera and Emanuele Viterbo
|
Decoding the Golden Code: a VLSI design
|
25 pages, 10 figures
| null | null | null |
cs.AR
| null |
The recently proposed Golden code is an optimal space-time block code for 2 X
2 multiple-input multiple-output (MIMO) systems. The aim of this work is the
design of a VLSI decoder for a MIMO system coded with the Golden code. The
architecture is based on a rearrangement of the sphere decoding algorithm that
achieves maximum-likelihood (ML) decoding performance. Compared to other
approaces, the proposed solution exhibits an inherent flexibility in terms of
modulation schemes QAM modulation size and this makes our architecture
particularly suitable for adaptive modulation schemes.
|
[
{
"version": "v1",
"created": "Thu, 15 Nov 2007 11:55:30 GMT"
}
] | 2007-11-16T00:00:00 |
[
[
"Cerato",
"Barbara",
""
],
[
"Masera",
"Guido",
""
],
[
"Viterbo",
"Emanuele",
""
]
] |
new_dataset
| 0.983228 |
0711.2478
|
Vasileios Barmpoutis
|
Vasileios Barmpoutis, Gary F. Dargush
|
A Compact Self-organizing Cellular Automata-based Genetic Algorithm
|
24 pages, 18 figures, Submitted to Evolutionary Computation
| null | null | null |
cs.NE cs.AI
| null |
A Genetic Algorithm (GA) is proposed in which each member of the population
can change schemata only with its neighbors according to a rule. The rule
methodology and the neighborhood structure employ elements from the Cellular
Automata (CA) strategies. Each member of the GA population is assigned to a
cell and crossover takes place only between adjacent cells, according to the
predefined rule. Although combinations of CA and GA approaches have appeared
previously, here we rely on the inherent self-organizing features of CA, rather
than on parallelism. This conceptual shift directs us toward the evolution of
compact populations containing only a handful of members. We find that the
resulting algorithm can search the design space more efficiently than
traditional GA strategies due to its ability to exploit mutations within this
compact self-organizing population. Consequently, premature convergence is
avoided and the final results often are more accurate. In order to reinforce
the superior mutation capability, a re-initialization strategy also is
implemented. Ten test functions and two benchmark structural engineering truss
design problems are examined in order to demonstrate the performance of the
method.
|
[
{
"version": "v1",
"created": "Thu, 15 Nov 2007 18:19:39 GMT"
}
] | 2007-11-16T00:00:00 |
[
[
"Barmpoutis",
"Vasileios",
""
],
[
"Dargush",
"Gary F.",
""
]
] |
new_dataset
| 0.960299 |
0711.2112
|
Michel Grabisch
|
Michel Grabisch (CES), Christophe Labreuche (TRT)
|
Bi-capacities -- Part II: the Choquet integral
| null |
Fuzzy Sets and Systems (2005) 237-259
| null | null |
cs.DM cs.GT
| null |
Bi-capacities arise as a natural generalization of capacities (or fuzzy
measures) in a context of decision making where underlying scales are bipolar.
They are able to capture a wide variety of decision behaviours, encompassing
models such as Cumulative Prospect Theory (CPT). The aim of this paper in two
parts is to present the machinery behind bi-capacities, and thus remains on a
rather theoretical level, although some parts are firmly rooted in decision
theory, notably cooperative game theory. The present second part focuses on the
definition of Choquet integral. We give several expressions of it, including an
expression w.r.t. the M\"obius transform. This permits to express the Choquet
integral for 2-additive bi-capacities w.r.t. the interaction index.
|
[
{
"version": "v1",
"created": "Wed, 14 Nov 2007 06:11:57 GMT"
}
] | 2007-11-15T00:00:00 |
[
[
"Grabisch",
"Michel",
"",
"CES"
],
[
"Labreuche",
"Christophe",
"",
"TRT"
]
] |
new_dataset
| 0.998304 |
0711.2050
|
Hacene Belbachir
|
Kenza Guenda
|
Two Families of Quantum Codes Derived from Cyclic Codes
| null | null | null | null |
cs.IT math.IT
| null |
We characterize the affine-invariant maximal extended cyclic codes. Then by
the CSS construction, we derive from these codes a family of pure quantum
codes. Also for ordnq even, a new family of degenerate quantum stabilizer codes
is derived from the classical duadic codes. This answer an open problem asked
by Aly et al.
|
[
{
"version": "v1",
"created": "Tue, 13 Nov 2007 19:06:43 GMT"
}
] | 2007-11-14T00:00:00 |
[
[
"Guenda",
"Kenza",
""
]
] |
new_dataset
| 0.998229 |
cs/0509023
|
Benjamin Leveque
|
Kathie Cameron (WLU), Jack Edmonds (EP INSTITUTE), Benjamin
L\'ev\^eque (LGS), Fr\'ed\'eric Maffray (LGS)
|
Coloring vertices of a graph or finding a Meyniel obstruction
| null | null | null | null |
cs.DM
| null |
A Meyniel obstruction is an odd cycle with at least five vertices and at most
one chord. A graph is Meyniel if and only if it has no Meyniel obstruction as
an induced subgraph. Here we give a O(n^2) algorithm that, for any graph, finds
either a clique and coloring of the same size or a Meyniel obstruction. We also
give a O(n^3) algorithm that, for any graph, finds either aneasily recognizable
strong stable set or a Meyniel obstruction.
|
[
{
"version": "v1",
"created": "Thu, 8 Sep 2005 15:26:02 GMT"
},
{
"version": "v2",
"created": "Tue, 25 Oct 2005 07:26:32 GMT"
},
{
"version": "v3",
"created": "Tue, 13 Nov 2007 14:35:47 GMT"
}
] | 2007-11-13T00:00:00 |
[
[
"Cameron",
"Kathie",
"",
"WLU"
],
[
"Edmonds",
"Jack",
"",
"EP INSTITUTE"
],
[
"Lévêque",
"Benjamin",
"",
"LGS"
],
[
"Maffray",
"Frédéric",
"",
"LGS"
]
] |
new_dataset
| 0.999711 |
0704.2282
|
Wim H. Hesselink
|
W.H. Hesselink and J.C. Hummelen and H.T. Jonkman and H.G. Reker and
G.R. Renardel de Lavalette and M.H. van der Veen
|
Kekul\'e Cells for Molecular Computation
|
Also on chemistry (unsaturated polycyclic hydrocarbons)
| null | null | null |
cs.OH cs.DM
| null |
The configurations of single and double bonds in polycyclic hydrocarbons are
abstracted as Kekul\'e states of graphs. Sending a so-called soliton over an
open channel between ports (external nodes) of the graph changes the Kekul\'e
state and therewith the set of open channels in the graph. This switching
behaviour is proposed as a basis for molecular computation. The proposal is
highly speculative but may have tremendous impact.
Kekul\'e states with the same boundary behaviour (port assignment) can be
regarded as equivalent. This gives rise to the abstraction of Kekul\'e cells.
The basic theory of Kekul\'e states and Kekul\'e cells is developed here, up to
the classification of Kekul\'e cells with $\leq 4$ ports. To put the theory in
context, we generalize Kekul\'e states to semi-Kekul\'e states, which form the
solutions of a linear system of equations over the field of the bits 0 and 1.
We briefly study so-called omniconjugated graphs, in which every port
assignment of the right signature has a Kekul\'e state. Omniconjugated graphs
may be useful as connectors between computational elements. We finally
investigate some examples with potentially useful switching behaviour.
|
[
{
"version": "v1",
"created": "Wed, 18 Apr 2007 07:44:33 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Nov 2007 09:16:22 GMT"
}
] | 2007-11-08T00:00:00 |
[
[
"Hesselink",
"W. H.",
""
],
[
"Hummelen",
"J. C.",
""
],
[
"Jonkman",
"H. T.",
""
],
[
"Reker",
"H. G.",
""
],
[
"de Lavalette",
"G. R. Renardel",
""
],
[
"van der Veen",
"M. H.",
""
]
] |
new_dataset
| 0.991613 |
0711.0917
|
Jan Wielemaker
|
Jan Wielemaker, Zhisheng Huang and Lourens van der Meij
|
SWI-Prolog and the Web
|
31 pages, 24 figures and 2 tables. To appear in Theory and Practice
of Logic Programming (TPLP)
| null | null | null |
cs.PL cs.SC
| null |
Where Prolog is commonly seen as a component in a Web application that is
either embedded or communicates using a proprietary protocol, we propose an
architecture where Prolog communicates to other components in a Web application
using the standard HTTP protocol. By avoiding embedding in external Web servers
development and deployment become much easier. To support this architecture, in
addition to the transfer protocol, we must also support parsing, representing
and generating the key Web document types such as HTML, XML and RDF.
This paper motivates the design decisions in the libraries and extensions to
Prolog for handling Web documents and protocols. The design has been guided by
the requirement to handle large documents efficiently. The described libraries
support a wide range of Web applications ranging from HTML and XML documents to
Semantic Web RDF processing.
To appear in Theory and Practice of Logic Programming (TPLP)
|
[
{
"version": "v1",
"created": "Tue, 6 Nov 2007 16:22:39 GMT"
}
] | 2007-11-07T00:00:00 |
[
[
"Wielemaker",
"Jan",
""
],
[
"Huang",
"Zhisheng",
""
],
[
"van der Meij",
"Lourens",
""
]
] |
new_dataset
| 0.997977 |
0711.0048
|
Lee Naish
|
Lee Naish
|
Declarative Diagnosis of Floundering
|
12 pages, 0 figures, uses llncs.sty In Proceedings of the 17th
Workshop on Logic-based methods in Programming Environments, Eds. Patricia
Hill and Wim Vanhoof, pp 48-60, September 2007, Porto, Portugal
| null | null | null |
cs.PL cs.SE
| null |
Many logic programming languages have delay primitives which allow
coroutining. This introduces a class of bug symptoms -- computations can
flounder when they are intended to succeed or finitely fail. For concurrent
logic programs this is normally called deadlock. Similarly, constraint logic
programs can fail to invoke certain constraint solvers because variables are
insufficiently instantiated or constrained. Diagnosing such faults has received
relatively little attention to date. Since delay primitives affect the
procedural but not the declarative view of programs, it may be expected that
debugging would have to consider the often complex details of interleaved
execution. However, recent work on semantics has suggested an alternative
approach. In this paper we show how the declarative debugging paradigm can be
used to diagnose unexpected floundering, insulating the user from the
complexities of the execution.
Keywords: logic programming, coroutining, delay, debugging, floundering,
deadlock, constraints
|
[
{
"version": "v1",
"created": "Thu, 1 Nov 2007 01:40:50 GMT"
}
] | 2007-11-06T00:00:00 |
[
[
"Naish",
"Lee",
""
]
] |
new_dataset
| 0.976169 |
0711.0345
|
Wim Vanhoof
|
Roberto Bagnara, Patricia Hill, Enea Zaffanella
|
A Prolog-based Environment for Reasoning about Programming Languages
(Extended abstract)
|
Paper presented at the 17th Workshop on Logic-based Methods in
Programming Environments (WLPE2007)
| null | null | null |
cs.PL cs.SE
| null |
ECLAIR is a Prolog-based prototype system aiming to provide a functionally
complete environment for the study, development and evaluation of programming
language analysis and implementation tools. In this paper, we sketch the
overall structure of the system, outlining the main methodologies and
technologies underlying its components. We also discuss the appropriateness of
Prolog as the implementation language for the system: besides highlighting its
strengths, we also point out a few potential weaknesses, hinting at possible
solutions.
|
[
{
"version": "v1",
"created": "Fri, 2 Nov 2007 16:40:10 GMT"
}
] | 2007-11-06T00:00:00 |
[
[
"Bagnara",
"Roberto",
""
],
[
"Hill",
"Patricia",
""
],
[
"Zaffanella",
"Enea",
""
]
] |
new_dataset
| 0.974587 |
0711.0618
|
Wim Vanhoof
|
Jan Wielemaker, Anjo Anjewierden
|
PIDoc: Wiki style Literate Programming for Prolog
|
Paper presented at the 17th Workshop on Logic-based Methods in
Programming Environments (WLPE2007)
| null | null | null |
cs.PL cs.SE
| null |
This document introduces PlDoc, a literate programming system for Prolog.
Starting point for PlDoc was minimal distraction from the programming task and
maximal immediate reward, attempting to seduce the programmer to use the
system. Minimal distraction is achieved using structured comments that are as
closely as possible related to common Prolog documentation practices. Immediate
reward is provided by a web interface powered from the Prolog development
environment that integrates searching and browsing application and system
documentation. When accessed from localhost, it is possible to go from
documentation shown in a browser to the source code displayed in the user's
editor of choice.
|
[
{
"version": "v1",
"created": "Mon, 5 Nov 2007 12:13:12 GMT"
}
] | 2007-11-06T00:00:00 |
[
[
"Wielemaker",
"Jan",
""
],
[
"Anjewierden",
"Anjo",
""
]
] |
new_dataset
| 0.998983 |
0711.0666
|
Bouselmi Ghazi
|
Ghazi Bouselmi (INRIA Lorraine - LORIA), Dominique Fohr (INRIA
Lorraine - LORIA), Irina Illina (INRIA Lorraine - LORIA), Jean-Paul Haton
(INRIA Lorraine - LORIA)
|
Discriminative Phoneme Sequences Extraction for Non-Native Speaker's
Origin Classification
| null |
Dans ISSPA, International Symposium on Signal Processing and its
Applications (2007)
| null | null |
cs.CL
| null |
In this paper we present an automated method for the classification of the
origin of non-native speakers. The origin of non-native speakers could be
identified by a human listener based on the detection of typical pronunciations
for each nationality. Thus we suppose the existence of several phoneme
sequences that might allow the classification of the origin of non-native
speakers. Our new method is based on the extraction of discriminative sequences
of phonemes from a non-native English speech database. These sequences are used
to construct a probabilistic classifier for the speakers' origin. The existence
of discriminative phone sequences in non-native speech is a significant result
of this work. The system that we have developed achieved a significant correct
classification rate of 96.3% and a significant error reduction compared to some
other tested techniques.
|
[
{
"version": "v1",
"created": "Mon, 5 Nov 2007 15:20:47 GMT"
}
] | 2007-11-06T00:00:00 |
[
[
"Bouselmi",
"Ghazi",
"",
"INRIA Lorraine - LORIA"
],
[
"Fohr",
"Dominique",
"",
"INRIA\n Lorraine - LORIA"
],
[
"Illina",
"Irina",
"",
"INRIA Lorraine - LORIA"
],
[
"Haton",
"Jean-Paul",
"",
"INRIA Lorraine - LORIA"
]
] |
new_dataset
| 0.999309 |
0711.0692
|
Jean-Yves Marion
|
Anne Bonfante (INRIA Lorraine - LORIA), Jean-Yves Marion (INRIA
Lorraine - LORIA)
|
On the defence notion
| null |
Journal in Computer Virology 3, 4 (2007) 247-251
|
10.1007/s11416-007-0058-9
| null |
cs.CR
| null |
'Trojan horses', 'logic bombs', 'armoured viruses' and 'cryptovirology' are
terms recalling war gears. In fact, concepts of attack and defence drive the
world of computer virology, which looks like a war universe in an information
society. This war has several shapes, from invasions of a network by worms, to
military and industrial espionage ...
|
[
{
"version": "v1",
"created": "Mon, 5 Nov 2007 17:02:25 GMT"
}
] | 2007-11-06T00:00:00 |
[
[
"Bonfante",
"Anne",
"",
"INRIA Lorraine - LORIA"
],
[
"Marion",
"Jean-Yves",
"",
"INRIA\n Lorraine - LORIA"
]
] |
new_dataset
| 0.999769 |
0704.2778
|
Brooke Shrader
|
Brooke Shrader and Anthony Ephremides
|
Random Access Broadcast: Stability and Throughput Analysis
|
19 pages, 5 figures. Submitted as correspondence to IEEE Transactions
on Information Theory, Sept 2006. Revised April 2007
|
IEEE Transactions on Information Theory, vol. 53, no. 8, pp.
2915-2921, August 2007.
| null | null |
cs.IT math.IT
| null |
A wireless network in which packets are broadcast to a group of receivers
through use of a random access protocol is considered in this work. The
relation to previous work on networks of interacting queues is discussed and
subsequently, the stability and throughput regions of the system are analyzed
and presented. A simple network of two source nodes and two destination nodes
is considered first. The broadcast service process is analyzed assuming a
channel that allows for packet capture and multipacket reception. In this small
network, the stability and throughput regions are observed to coincide. The
same problem for a network with N sources and M destinations is considered
next. The channel model is simplified in that multipacket reception is no
longer permitted. Bounds on the stability region are developed using the
concept of stability rank and the throughput region of the system is compared
to the bounds. Our results show that as the number of destination nodes
increases, the stability and throughput regions diminish. Additionally, a
previous conjecture that the stability and throughput regions coincide for a
network of arbitrarily many sources is supported for a broadcast scenario by
the results presented in this work.
|
[
{
"version": "v1",
"created": "Fri, 20 Apr 2007 19:17:43 GMT"
}
] | 2007-11-05T00:00:00 |
[
[
"Shrader",
"Brooke",
""
],
[
"Ephremides",
"Anthony",
""
]
] |
new_dataset
| 0.986376 |
0710.5893
|
Paul Hurley
|
Paul Hurley, Ted Hurley
|
Codes from Zero-divisors and Units in Group Rings
| null | null | null | null |
cs.IT math.IT
| null |
We describe and present a new construction method for codes using encodings
from group rings. They consist primarily of two types: zero-divisor and
unit-derived codes. Previous codes from group rings focused on ideals; for
example cyclic codes are ideals in the group ring over a cyclic group. The
fresh focus is on the encodings themselves, which only under very limited
conditions result in ideals. We use the result that a group ring is isomorphic
to a certain well-defined ring of matrices, and thus every group ring element
has an associated matrix. This allows matrix algebra to be used as needed in
the study and production of codes, enabling the creation of standard generator
and check matrices. Group rings are a fruitful source of units and
zero-divisors from which new codes result. Many code properties, such as being
LDPC or self-dual, may be expressed as properties within the group ring thus
enabling the construction of codes with these properties. The methods are
general enabling the construction of codes with many types of group rings.
There is no restriction on the ring and thus codes over the integers, over
matrix rings or even over group rings themselves are possible and fruitful.
|
[
{
"version": "v1",
"created": "Wed, 31 Oct 2007 15:57:31 GMT"
}
] | 2007-11-01T00:00:00 |
[
[
"Hurley",
"Paul",
""
],
[
"Hurley",
"Ted",
""
]
] |
new_dataset
| 0.999873 |
0710.4780
|
Jesus M. Almendros-Jimenez Dr.
|
J. M. Almendros-Jim\'enez and A. Becerra-Ter\'on and F. J.
Enciso-Ba\~nos
|
Querying XML Documents in Logic Programming
| null | null | null | null |
cs.PL cs.DB
| null |
Extensible Markup Language (XML) is a simple, very flexible text format
derived from SGML. Originally designed to meet the challenges of large-scale
electronic publishing, XML is also playing an increasingly important role in
the exchange of a wide variety of data on the Web and elsewhere. XPath language
is the result of an effort to provide address parts of an XML document. In
support of this primary purpose, it becomes in a query language against an XML
document. In this paper we present a proposal for the implementation of the
XPath language in logic programming. With this aim we will describe the
representation of XML documents by means of a logic program. Rules and facts
can be used for representing the document schema and the XML document itself.
In particular, we will present how to index XML documents in logic programs:
rules are supposed to be stored in main memory, however facts are stored in
secondary memory by using two kind of indexes: one for each XML tag, and other
for each group of terminal items. In addition, we will study how to query by
means of the XPath language against a logic program representing an XML
document. It evolves the specialization of the logic program with regard to the
XPath expression. Finally, we will also explain how to combine the indexing and
the top-down evaluation of the logic program. To appear in Theory and Practice
of Logic Programming (TPLP)"
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 10:45:08 GMT"
}
] | 2007-10-26T00:00:00 |
[
[
"Almendros-Jiménez",
"J. M.",
""
],
[
"Becerra-Terón",
"A.",
""
],
[
"Enciso-Baños",
"F. J.",
""
]
] |
new_dataset
| 0.999743 |
0710.4499
|
Colm \'O D\'unlaing
|
Colm O. Dunlaing and Natalie Schluter
|
Remarks on Jurdzinski and Lorys' proof that palindromes are not a
Church-Rosser language
|
15 pages
| null | null |
TCDMATH 07-10
|
cs.LO
| null |
In 2002 Jurdzinski and Lorys settled a long-standing conjecture that
palindromes are not a Church-Rosser language. Their proof required a
sophisticated theory about computation graphs of 2-stack automata. We present
their proof in terms of 1-tape Turing machines.We also provide an alternative
proof of Buntrock and Otto's result that the set of non-square bitstrings,
which is context-free, is not Church-Rosser.
|
[
{
"version": "v1",
"created": "Wed, 24 Oct 2007 15:40:32 GMT"
},
{
"version": "v2",
"created": "Thu, 25 Oct 2007 10:15:54 GMT"
}
] | 2007-10-25T00:00:00 |
[
[
"Dunlaing",
"Colm O.",
""
],
[
"Schluter",
"Natalie",
""
]
] |
new_dataset
| 0.995543 |
0710.4046
|
Alfonso Martinez
|
Alfonso Martinez, Albert Guillen i Fabregas, Giuseppe Caire, and Frans
Willems
|
Bit-interleaved coded modulation in the wideband regime
|
Submitted to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
| null |
The wideband regime of bit-interleaved coded modulation (BICM) in Gaussian
channels is studied. The Taylor expansion of the coded modulation capacity for
generic signal constellations at low signal-to-noise ratio (SNR) is derived and
used to determine the corresponding expansion for the BICM capacity. Simple
formulas for the minimum energy per bit and the wideband slope are given. BICM
is found to be suboptimal in the sense that its minimum energy per bit can be
larger than the corresponding value for coded modulation schemes. The minimum
energy per bit using standard Gray mapping on M-PAM or M^2-QAM is given by a
simple formula and shown to approach -0.34 dB as M increases. Using the low SNR
expansion, a general trade-off between power and bandwidth in the wideband
regime is used to show how a power loss can be traded off against a bandwidth
gain.
|
[
{
"version": "v1",
"created": "Mon, 22 Oct 2007 13:07:28 GMT"
}
] | 2007-10-23T00:00:00 |
[
[
"Martinez",
"Alfonso",
""
],
[
"Fabregas",
"Albert Guillen i",
""
],
[
"Caire",
"Giuseppe",
""
],
[
"Willems",
"Frans",
""
]
] |
new_dataset
| 0.978464 |
cs/0509079
|
Peter Jung
|
Peter Jung, Gerhard Wunder
|
The WSSUS Pulse Design Problem in Multicarrier Transmission
|
24 pages (onecolumn,draft), 4 figures, accepted for publication in
the IEEE Transactions on Communications
|
IEEE Trans. on Comm., 2007, 55(10), 1918-1928
|
10.1109/TCOMM.2007.906427
| null |
cs.IT math.IT
| null |
Optimal link adaption to the scattering function of wide sense stationary
uncorrelated mobile communication channels is still an unsolved problem despite
its importance for next-generation system design. In multicarrier transmission
such link adaption is performed by pulse shaping, i.e. by properly adjusting
the transmit and receive filters. For example pulse shaped Offset--QAM systems
have been recently shown to have superior performance over standard cyclic
prefix OFDM (while operating at higher spectral efficiency).In this paper we
establish a general mathematical framework for joint transmitter and receiver
pulse shape optimization for so-called Weyl--Heisenberg or Gabor signaling with
respect to the scattering function of the WSSUS channel. In our framework the
pulse shape optimization problem is translated to an optimization problem over
trace class operators which in turn is related to fidelity optimization in
quantum information processing. By convexity relaxation the problem is shown to
be equivalent to a \emph{convex constraint quasi-convex maximization problem}
thereby revealing the non-convex nature of the overall WSSUS pulse design
problem. We present several iterative algorithms for optimization providing
applicable results even for large--scale problem constellations. We show that
with transmitter-side knowledge of the channel statistics a gain of $3 - 6$dB
in $\SINR$ can be expected.
|
[
{
"version": "v1",
"created": "Tue, 27 Sep 2005 08:05:30 GMT"
},
{
"version": "v2",
"created": "Mon, 8 Jan 2007 11:46:28 GMT"
}
] | 2007-10-23T00:00:00 |
[
[
"Jung",
"Peter",
""
],
[
"Wunder",
"Gerhard",
""
]
] |
new_dataset
| 0.998047 |
cs/9906001
|
Lane A. Hemaspaandra
|
Russell Bent, Michael Schear, Lane A. Hemaspaandra, Gabriel Istrate
|
On Bounded-Weight Error-Correcting Codes
|
10 pages, 3 tables
| null | null | null |
cs.IT math.IT
| null |
This paper computationally obtains optimal bounded-weight, binary,
error-correcting codes for a variety of distance bounds and dimensions. We
compare the sizes of our codes to the sizes of optimal constant-weight, binary,
error-correcting codes, and evaluate the differences.
|
[
{
"version": "v1",
"created": "Tue, 1 Jun 1999 18:24:00 GMT"
}
] | 2007-10-15T00:00:00 |
[
[
"Bent",
"Russell",
""
],
[
"Schear",
"Michael",
""
],
[
"Hemaspaandra",
"Lane A.",
""
],
[
"Istrate",
"Gabriel",
""
]
] |
new_dataset
| 0.996969 |
0710.1924
|
Mohsen Ravanbakhsh
|
Mohsen Ravanbakhsh, Yasin Abbasi-Yadkori, Maghsoud Abbaspour, Hamid
Sarbazi-Azad
|
A Heuristic Routing Mechanism Using a New Addressing Scheme
|
8 pages, because of lack of space journal reference just contains the
reference to the proceeding
|
Proceedings of First International Conference on Bio Inspired
models of Networks, Information and Computing Systems (BIONETICS), Cavalese,
Italy, December 2006
| null | null |
cs.NI cs.AI
| null |
Current methods of routing are based on network information in the form of
routing tables, in which routing protocols determine how to update the tables
according to the network changes. Despite the variability of data in routing
tables, node addresses are constant. In this paper, we first introduce the new
concept of variable addresses, which results in a novel framework to cope with
routing problems using heuristic solutions. Then we propose a heuristic routing
mechanism based on the application of genes for determination of network
addresses in a variable address network and describe how this method flexibly
solves different problems and induces new ideas in providing integral solutions
for variety of problems. The case of ad-hoc networks is where simulation
results are more supportive and original solutions have been proposed for
issues like mobility.
|
[
{
"version": "v1",
"created": "Wed, 10 Oct 2007 04:29:24 GMT"
}
] | 2007-10-11T00:00:00 |
[
[
"Ravanbakhsh",
"Mohsen",
""
],
[
"Abbasi-Yadkori",
"Yasin",
""
],
[
"Abbaspour",
"Maghsoud",
""
],
[
"Sarbazi-Azad",
"Hamid",
""
]
] |
new_dataset
| 0.997654 |
0710.2018
|
Yingbin Liang
|
Yingbin Liang, Anelia Somekh-Baruch, H. Vincent Poor, Shlomo Shamai
(Shitz), and Sergio Verdu
|
Cognitive Interference Channels with Confidential Messages
|
To appear in Proc. of forty-fifth annual Allerton conference on
communication, control, and computing, Allerton house, Monticello, IL, USA
| null | null | null |
cs.IT math.IT
| null |
The cognitive interference channel with confidential messages is studied.
Similarly to the classical two-user interference channel, the cognitive
interference channel consists of two transmitters whose signals interfere at
the two receivers. It is assumed that there is a common message source (message
1) known to both transmitters, and an additional independent message source
(message 2) known only to the cognitive transmitter (transmitter 2). The
cognitive receiver (receiver 2) needs to decode both messages, while the
non-cognitive receiver (receiver 1) should decode only the common message.
Furthermore, message 2 is assumed to be a confidential message which needs to
be kept as secret as possible from receiver 1, which is viewed as an
eavesdropper with regard to message 2. The level of secrecy is measured by the
equivocation rate. A single-letter expression for the capacity-equivocation
region of the discrete memoryless cognitive interference channel is established
and is further explicitly derived for the Gaussian case. Moreover,
particularizing the capacity-equivocation region to the case without a secrecy
constraint, establishes a new capacity theorem for a class of interference
channels, by providing a converse theorem.
|
[
{
"version": "v1",
"created": "Wed, 10 Oct 2007 16:34:03 GMT"
}
] | 2007-10-11T00:00:00 |
[
[
"Liang",
"Yingbin",
"",
"Shitz"
],
[
"Somekh-Baruch",
"Anelia",
"",
"Shitz"
],
[
"Poor",
"H. Vincent",
"",
"Shitz"
],
[
"Shamai",
"Shlomo",
"",
"Shitz"
],
[
"Verdu",
"Sergio",
""
]
] |
new_dataset
| 0.997973 |
0710.1842
|
Frank Ruskey
|
Frank Ruskey and Aaron Williams
|
An explicit universal cycle for the (n-1)-permutations of an n-set
| null | null | null | null |
cs.DM cs.DS
| null |
We show how to construct an explicit Hamilton cycle in the directed Cayley
graph Cay({\sigma_n, sigma_{n-1}} : \mathbb{S}_n), where \sigma_k = (1 2 >...
k). The existence of such cycles was shown by Jackson (Discrete Mathematics,
149 (1996) 123-129) but the proof only shows that a certain directed graph is
Eulerian, and Knuth (Volume 4 Fascicle 2, Generating All Tuples and
Permutations (2005)) asks for an explicit construction. We show that a simple
recursion describes our Hamilton cycle and that the cycle can be generated by
an iterative algorithm that uses O(n) space. Moreover, the algorithm produces
each successive edge of the cycle in constant time; such algorithms are said to
be loopless.
|
[
{
"version": "v1",
"created": "Tue, 9 Oct 2007 18:06:05 GMT"
}
] | 2007-10-10T00:00:00 |
[
[
"Ruskey",
"Frank",
""
],
[
"Williams",
"Aaron",
""
]
] |
new_dataset
| 0.997245 |
0710.1325
|
Ashish Khisti
|
Ashish Khisti and Gregory Wornell
|
The MIMOME Channel
|
In Proceedings of the 45th Annual Allerton Conference on
Communication, Control, and Computing, October 2007, 8 pages
| null | null | null |
cs.IT math.IT
| null |
The MIMOME channel is a Gaussian wiretap channel in which the sender,
receiver, and eavesdropper all have multiple antennas. We characterize the
secrecy capacity as the saddle-value of a minimax problem. Among other
implications, our result establishes that a Gaussian distribution maximizes the
secrecy capacity characterization of Csisz{\'a}r and K{\"o}rner when applied to
the MIMOME channel. We also determine a necessary and sufficient condition for
the secrecy capacity to be zero. Large antenna array analysis of this condition
reveals several useful insights into the conditions under which secure
communication is possible.
|
[
{
"version": "v1",
"created": "Fri, 5 Oct 2007 22:25:19 GMT"
}
] | 2007-10-09T00:00:00 |
[
[
"Khisti",
"Ashish",
""
],
[
"Wornell",
"Gregory",
""
]
] |
new_dataset
| 0.999144 |
0710.1589
|
Guangwen Li
|
Guangwen Li, Guangzeng Feng
|
Fast Reliability-based Algorithm of Finding Minimum-weight Codewords for
LDPC Codes
|
8 pages, 1 table
| null | null | null |
cs.IT math.IT
| null |
Despite the NP hardness of acquiring minimum distance $d_m$ for linear codes
theoretically, in this paper we propose one experimental method of finding
minimum-weight codewords, the weight of which is equal to $d_m$ for LDPC codes.
One existing syndrome decoding method, called serial belief propagation (BP)
with ordered statistic decoding (OSD), is adapted to serve our purpose. We hold
the conjecture that among many candidate error patterns in OSD reprocessing,
modulo 2 addition of the lightest error pattern with one of the left error
patterns may generate a light codeword. When the decoding syndrome changes to
all-zero state, the lightest error pattern reduces to all-zero, the lightest
non-zero error pattern is a valid codeword to update lightest codeword list.
Given sufficient codewords sending, the survived lightest codewords are
likely to be the target. Compared with existing techniques, our method
demonstrates its efficiency in the simulation of several interested LDPC codes.
|
[
{
"version": "v1",
"created": "Mon, 8 Oct 2007 16:59:11 GMT"
}
] | 2007-10-09T00:00:00 |
[
[
"Li",
"Guangwen",
""
],
[
"Feng",
"Guangzeng",
""
]
] |
new_dataset
| 0.971582 |
0710.0903
|
L.T. Handoko
|
I. Firmansyah, B. Hermanto and L.T. Handoko
|
Control and Monitoring System for Modular Wireless Robot
|
4 pages, Proceeding of the Industrial Electronics Seminar 2007
| null | null | null |
cs.RO
| null |
We introduce our concept on the modular wireless robot consisting of three
main modules : main unit, data acquisition and data processing modules. We have
developed a generic prototype with an integrated control and monitoring system
to enhance its flexibility, and to enable simple operation through a web-based
interface accessible wirelessly. In present paper, we focus on the
microcontroller based hardware to enable data acquisition and remote mechanical
control.
|
[
{
"version": "v1",
"created": "Wed, 3 Oct 2007 23:05:29 GMT"
}
] | 2007-10-05T00:00:00 |
[
[
"Firmansyah",
"I.",
""
],
[
"Hermanto",
"B.",
""
],
[
"Handoko",
"L. T.",
""
]
] |
new_dataset
| 0.998238 |
0710.0925
|
Kimikazu Kato
|
Hidetoshi Muta and Kimikazu Kato
|
Degeneracy of Angular Voronoi Diagram
|
8 pages, 11 figures, 1 table, presented at 4th International
Symposium on Voronoi Diagrams in Science and Engineering (ISVD07)
| null | null | null |
cs.CG
| null |
Angular Voronoi diagram was introduced by Asano et al. as fundamental
research for a mesh generation. In an angular Voronoi diagram, the edges are
curves of degree three. From view of computational robustness we need to treat
the curves carefully, because they might have a singularity.
We enumerate all the possible types of curves that appear as an edge of an
angular Voronoi diagram, which tells us what kind of degeneracy is possible and
tells us necessity of considering a singularity for computational robustness.
|
[
{
"version": "v1",
"created": "Thu, 4 Oct 2007 05:05:06 GMT"
}
] | 2007-10-05T00:00:00 |
[
[
"Muta",
"Hidetoshi",
""
],
[
"Kato",
"Kimikazu",
""
]
] |
new_dataset
| 0.99908 |
0710.0789
|
Ying Jun Zhang Ph.D.
|
Ying Jun Zhang, Peng Xuan Zheng, Soung Chang Liew
|
Wireless Local Area Networks with Multiple-Packet Reception Capability
| null | null | null | null |
cs.PF cs.NI
| null |
Thanks to its simplicity and cost efficiency, wireless local area network
(WLAN) enjoys unique advantages in providing high-speed and low-cost wireless
services in hot spots and indoor environments. Traditional WLAN
medium-access-control (MAC) protocols assume that only one station can transmit
at a time: simultaneous transmissions of more than one station causes the
destruction of all packets involved. By exploiting recent advances in PHY-layer
multiuser detection (MUD) techniques, it is possible for a receiver to receive
multiple packets simultaneously. This paper argues that such multipacket
reception (MPR) capability can greatly enhance the capacity of future WLANs. In
addition, it provides the MAC-layer and PHY-layer designs needed to achieve the
improved capacity. First, to demonstrate MUD/MPR as a powerful
capacity-enhancement technique, we prove a "super-linearity" result, which
states that the system throughput per unit cost increases as the MPR capability
increases. Second, we show that the commonly deployed binary exponential
backoff (BEB) algorithm in today's WLAN MAC may not be optimal in an MPR
system, and that the optimal backoff factor increases with the MPR capability:
the number of packets that can be received simultaneously. Third, based on the
above insights, we design a joint MAC-PHY layer protocol for an IEEE
802.11-like WLAN that incorporates advanced PHY-layer blind detection and MUD
techniques to implement MPR
|
[
{
"version": "v1",
"created": "Wed, 3 Oct 2007 13:46:01 GMT"
}
] | 2007-10-04T00:00:00 |
[
[
"Zhang",
"Ying Jun",
""
],
[
"Zheng",
"Peng Xuan",
""
],
[
"Liew",
"Soung Chang",
""
]
] |
new_dataset
| 0.996854 |
0710.0539
|
Anthony A. Ruffa
|
Anthony A. Ruffa
|
A Novel Solution to the ATT48 Benchmark Problem
| null | null | null | null |
cs.DS cs.CC
| null |
A solution to the benchmark ATT48 Traveling Salesman Problem (from the
TSPLIB95 library) results from isolating the set of vertices into ten
open-ended zones with nine lengthwise boundaries. In each zone, a
minimum-length Hamiltonian Path (HP) is found for each combination of boundary
vertices, leading to an approximation for the minimum-length Hamiltonian Cycle
(HC). Determination of the optimal HPs for subsequent zones has the effect of
automatically filtering out non-optimal HPs from earlier zones. Although the
optimal HC for ATT48 involves only two crossing edges between all zones (with
one exception), adding inter-zone edges can accommodate more complex problems.
|
[
{
"version": "v1",
"created": "Tue, 2 Oct 2007 14:26:33 GMT"
}
] | 2007-10-03T00:00:00 |
[
[
"Ruffa",
"Anthony A.",
""
]
] |
new_dataset
| 0.998547 |
0710.0232
|
Maurice Margenstern
|
Maurice Margenstern
|
Constructing a uniform plane-filling path in the ternary heptagrid of
the hyperbolic plane
| null | null | null | null |
cs.CG cs.DM
| null |
In this paper, we distinguish two levels for the plane-filling property. We
consider a simple and a strong one. In this paper, we give the construction
which proves that the simple plane-filling property also holds for the
hyperbolic plane. The plane-filling property was established for the Euclidean
plane by J. Kari, in 1994, in the strong version.
|
[
{
"version": "v1",
"created": "Mon, 1 Oct 2007 08:42:03 GMT"
}
] | 2007-10-02T00:00:00 |
[
[
"Margenstern",
"Maurice",
""
]
] |
new_dataset
| 0.977397 |
0709.4466
|
K Sivakumar
|
Taikun Cheng, Krishnamoorthy Sivakumar, Benjamin J. Belzer
|
Serially Concatenated IRA Codes
|
Forty-Fifth Annual Allerton Conference on Communication, Control, and
Computing, 2007, 4 pages, 4 figures
| null | null | null |
cs.IT math.IT
| null |
We address the error floor problem of low-density parity check (LDPC) codes
on the binary-input additive white Gaussian noise (AWGN) channel, by
constructing a serially concatenated code consisting of two systematic
irregular repeat accumulate (IRA) component codes connected by an interleaver.
The interleaver is designed to prevent stopping-set error events in one of the
IRA codes from propagating into stopping set events of the other code.
Simulations with two 128-bit rate 0.707 IRA component codes show that the
proposed architecture achieves a much lower error floor at higher SNRs,
compared to a 16384-bit rate 1/2 IRA code, but incurs an SNR penalty of about 2
dB at low to medium SNRs. Experiments indicate that the SNR penalty can be
reduced at larger blocklengths.
|
[
{
"version": "v1",
"created": "Thu, 27 Sep 2007 18:38:09 GMT"
}
] | 2007-09-28T00:00:00 |
[
[
"Cheng",
"Taikun",
""
],
[
"Sivakumar",
"Krishnamoorthy",
""
],
[
"Belzer",
"Benjamin J.",
""
]
] |
new_dataset
| 0.997647 |
0709.4048
|
P. Oscar Boykin
|
P. Oscar Boykin, Jesse S. A. Bridgewater, Joseph S. Kong, Kamen M.
Lozev, Behnam A. Rezaei, Vwani P. Roychowdhury
|
A Symphony Conducted by Brunet
|
13 pages, 11 figures
| null | null | null |
cs.DC cs.NI
| null |
We introduce BruNet, a general P2P software framework which we use to produce
the first implementation of Symphony, a 1-D Kleinberg small-world architecture.
Our framework is designed to easily implement and measure different P2P
protocols over different transport layers such as TCP or UDP. This paper
discusses our implementation of the Symphony network, which allows each node to
keep $k \le \log N$ shortcut connections and to route to any other node with a
short average delay of $O(\frac{1}{k}\log^2 N)$. %This provides a continuous
trade-off between node degree and routing latency. We present experimental
results taken from several PlanetLab deployments of size up to 1060 nodes.
These succes sful deployments represent some of the largest PlanetLab
deployments of P2P overlays found in the literature, and show our
implementation's robustness to massive node dynamics in a WAN environment.
|
[
{
"version": "v1",
"created": "Tue, 25 Sep 2007 22:09:17 GMT"
}
] | 2007-09-27T00:00:00 |
[
[
"Boykin",
"P. Oscar",
""
],
[
"Bridgewater",
"Jesse S. A.",
""
],
[
"Kong",
"Joseph S.",
""
],
[
"Lozev",
"Kamen M.",
""
],
[
"Rezaei",
"Behnam A.",
""
],
[
"Roychowdhury",
"Vwani P.",
""
]
] |
new_dataset
| 0.9987 |
0709.3554
|
Mirela Damian
|
Mirela Damian, Robin Flatland, Joseph O'Rourke and Suneeta Ramaswami
|
A New Lower Bound on Guard Placement for Wireless Localization
|
4 pages, 3 figures
| null | null | null |
cs.CG cs.CC
| null |
The problem of wireless localization asks to place and orient stations in the
plane, each of which broadcasts a unique key within a fixed angular range, so
that each point in the plane can determine whether it is inside or outside a
given polygonal region. The primary goal is to minimize the number of stations.
In this paper we establish a lower bound of 2n/3 - 1 stations for polygons in
general position, for the case in which the placement of stations is restricted
to polygon vertices, improving upon the existing n/2 lower bound.
|
[
{
"version": "v1",
"created": "Sat, 22 Sep 2007 00:35:28 GMT"
}
] | 2007-09-25T00:00:00 |
[
[
"Damian",
"Mirela",
""
],
[
"Flatland",
"Robin",
""
],
[
"O'Rourke",
"Joseph",
""
],
[
"Ramaswami",
"Suneeta",
""
]
] |
new_dataset
| 0.972656 |
0709.2833
|
B.Sundar Rajan
|
G. Susinder Rajan and B. Sundar Rajan
|
Distributed Space Time Codes with Low Decoding Complexity for
Asynchronous Relay Networks
|
A technical report of DRDO-IISc Programme on Advanced Research in
Mathematical Engineering, Indian Institute of Science, Bangalore, India
| null | null |
TR-PME-2007-09
|
cs.IT math.IT
| null |
Recently Li and Xia have proposed a transmission scheme for wireless relay
networks based on the Alamouti space time code and orthogonal frequency
division multiplexing to combat the effect of timing errors at the relay nodes.
This transmission scheme is amazingly simple and achieves a diversity order of
two for any number of relays. Motivated by its simplicity, this scheme is
extended to a more general transmission scheme that can achieve full
cooperative diversity for any number of relays. The conditions on the
distributed space time code (DSTC) structure that admit its application in the
proposed transmission scheme are identified and it is pointed out that the
recently proposed full diversity four group decodable DSTCs from precoded
co-ordinate interleaved orthogonal designs and extended Clifford algebras
satisfy these conditions. It is then shown how differential encoding at the
source can be combined with the proposed transmission scheme to arrive at a new
transmission scheme that can achieve full cooperative diversity in asynchronous
wireless relay networks with no channel information and also no timing error
knowledge at the destination node. Finally, four group decodable distributed
differential space time codes applicable in this new transmission scheme for
power of two number of relays are also provided.
|
[
{
"version": "v1",
"created": "Tue, 18 Sep 2007 14:14:59 GMT"
}
] | 2007-09-19T00:00:00 |
[
[
"Rajan",
"G. Susinder",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.996195 |
0709.1056
|
Stephane Norte
|
Stephane Norte
|
A Sudoku Game for People with Motor Impairments
|
7 pages, 5 figures
| null | null | null |
cs.HC cs.CY
| null |
Computer games are motivating and beneficial in learning different
educational skills. Most people use their fingers, hands, and arms when using a
computer game. However, for people with motor disabilities this task can be a
barrier. We present a new Sudoku game for people whose motion is impaired,
called Sudoku 4ALL. With this special interface a person can control the game
with the voice or with a single switch. Our research aims to cautiously search
for issues that might be appropriate for computational support and to build
enabling technologies that increase individuals' functional independence in a
game environment.
|
[
{
"version": "v1",
"created": "Fri, 7 Sep 2007 11:59:22 GMT"
},
{
"version": "v2",
"created": "Thu, 13 Sep 2007 13:26:17 GMT"
},
{
"version": "v3",
"created": "Mon, 17 Sep 2007 21:08:35 GMT"
}
] | 2007-09-18T00:00:00 |
[
[
"Norte",
"Stephane",
""
]
] |
new_dataset
| 0.996021 |
cs/0605052
|
Yufang Xi
|
Yufang Xi and Edmund M. Yeh
|
Node-Based Optimal Power Control, Routing, and Congestion Control in
Wireless Networks
|
Full paper with 8 figures. Submitted to IEEE Transactions on
Information Theory
| null | null | null |
cs.NI
| null |
We present a unified analytical framework within which power control, rate
allocation, routing, and congestion control for wireless networks can be
optimized in a coherent and integrated manner. We consider a multi-commodity
flow model with an interference-limited physical-layer scheme in which power
control and routing variables are chosen to minimize the sum of convex link
costs reflecting, for instance, queuing delay. Distributed network algorithms
where joint power control and routing are performed on a node-by-node basis are
presented. We show that with appropriately chosen parameters, these algorithms
iteratively converge to the global optimum from any initial point with finite
cost. Next, we study refinements of the algorithms for more accurate link
capacity models, and extend the results to wireless networks where the
physical-layer achievable rate region is given by an arbitrary convex set, and
the link costs are strictly quasiconvex. Finally, we demonstrate that
congestion control can be seamlessly incorporated into our framework, so that
algorithms developed for power control and routing can naturally be extended to
optimize user input rates.
|
[
{
"version": "v1",
"created": "Thu, 11 May 2006 21:15:31 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Sep 2007 15:15:15 GMT"
}
] | 2007-09-18T00:00:00 |
[
[
"Xi",
"Yufang",
""
],
[
"Yeh",
"Edmund M.",
""
]
] |
new_dataset
| 0.996013 |
0709.2252
|
Mathias Boc
|
Mathias Boc, Anne Fladenmuller and Marcelo dias de Amorim
|
Otiy: Loactors tracking nodes
| null | null | null | null |
cs.NI
| null |
We propose Otiy, a node-centric location service that limits the impact of
location updates generate by mobile nodes in IEEE802.11-based wireless mesh
networks. Existing location services use node identifiers to determine the
locator (aka anchor) that is responsible for keeping track of a node's
location. Such a strategy can be inefficient because: (i) identifiers give no
clue on the node's mobility and (ii) locators can be far from the
source/destination shortest path, which increases both location delays and
bandwidth consumption. To solve these issues, Otiy introduces a new strategy
that identifies nodes to play the role of locators based on the likelihood of a
destination to be close to these nodes- i.e., locators are identified depending
on the mobility pattern of nodes. Otiy relies on the cyclic mobility patterns
of nodes and creates a slotted agenda composed of a set of predicted locations,
defined according to the past and present patterns of mobility. Correspondent
nodes fetch this agenda only once and use it as a reference for identifying
which locators are responsible for the node at different points in time. Over a
period of about one year, the weekly proportion of nodes having at least 50% of
exact location predictions is in average about 75%. This proportion increases
by 10% when nodes also consider their closeness to the locator from only what
they know about the network.
|
[
{
"version": "v1",
"created": "Fri, 14 Sep 2007 10:21:45 GMT"
}
] | 2007-09-17T00:00:00 |
[
[
"Boc",
"Mathias",
""
],
[
"Fladenmuller",
"Anne",
""
],
[
"de Amorim",
"Marcelo dias",
""
]
] |
new_dataset
| 0.969993 |
cs/0611030
|
Ambedkar Dukkipati
|
Ambedkar Dukkipati
|
Nonextensive Pythagoras' Theorem
|
19 pages
| null | null | null |
cs.IT math.IT
| null |
Kullback-Leibler relative-entropy, in cases involving distributions resulting
from relative-entropy minimization, has a celebrated property reminiscent of
squared Euclidean distance: it satisfies an analogue of the Pythagoras'
theorem. And hence, this property is referred to as Pythagoras' theorem of
relative-entropy minimization or triangle equality and plays a fundamental role
in geometrical approaches of statistical estimation theory like information
geometry. Equvalent of Pythagoras' theorem in the generalized nonextensive
formalism is established in (Dukkipati at el., Physica A, 361 (2006) 124-138).
In this paper we give a detailed account of it.
|
[
{
"version": "v1",
"created": "Tue, 7 Nov 2006 16:10:43 GMT"
},
{
"version": "v2",
"created": "Wed, 12 Sep 2007 11:41:20 GMT"
}
] | 2007-09-12T00:00:00 |
[
[
"Dukkipati",
"Ambedkar",
""
]
] |
new_dataset
| 0.975614 |
0709.0409
|
Damien Chablat
|
Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN), Maher Baili
(IRCCyN)
|
A DH-parameter based condition for 3R orthogonal manipulators to have 4
distinct inverse kinematic solutions
| null |
Journal of Mechanical Design 127 (2005) 150-155
| null | null |
cs.RO
| null |
Positioning 3R manipulators may have two or four inverse kinematic solutions
(IKS). This paper derives a necessary and sufficient condition for 3R
positioning manipulators with orthogonal joint axes to have four distinct IKS.
We show that the transition between manipulators with 2 and 4 IKS is defined by
the set of manipulators with a quadruple root of their inverse kinematics. The
resulting condition is explicit and states that the last link length of the
manipulator must be greater than a quantity that depends on three of its
remaining DH-parameters. This result is of interest for the design of new
manipulators.
|
[
{
"version": "v1",
"created": "Tue, 4 Sep 2007 12:27:14 GMT"
}
] | 2007-09-05T00:00:00 |
[
[
"Wenger",
"Philippe",
"",
"IRCCyN"
],
[
"Chablat",
"Damien",
"",
"IRCCyN"
],
[
"Baili",
"Maher",
"",
"IRCCyN"
]
] |
new_dataset
| 0.997207 |
0707.1057
|
Sudhir Kumar Singh
|
Sudhir Kumar Singh, Vwani P. Roychowdhury, Himawan Gunadhi, Behnam A.
Rezaei
|
For-profit mediators in sponsored search advertising
|
6 pages
| null | null | null |
cs.GT
| null |
A mediator is a well-known construct in game theory, and is an entity that
plays on behalf of some of the agents who choose to use its services, while the
rest of the agents participate in the game directly. We initiate a game
theoretic study of sponsored search auctions, such as those used by Google and
Yahoo!, involving {\em incentive driven} mediators. We refer to such mediators
as {\em for-profit} mediators, so as to distinguish them from mediators
introduced in prior work, who have no monetary incentives, and are driven by
the altruistic goal of implementing certain desired outcomes. We show that in
our model, (i) players/advertisers can improve their payoffs by choosing to use
the services of the mediator, compared to directly participating in the
auction; (ii) the mediator can obtain monetary benefit by managing the
advertising burden of its group of advertisers; and (iii) the payoffs of the
mediator and the advertisers it plays for are compatible with the incentive
constraints from the advertisers who do dot use its services. A simple
intuition behind the above result comes from the observation that the mediator
has more information about and more control over the bid profile than any
individual advertiser, allowing her to reduce the payments made to the
auctioneer, while still maintaining incentive constraints. Further, our results
indicate that there are significant opportunities for diversification in the
internet economy and we should expect it to continue to develop richer
structure, with room for different types of agents to coexist.
|
[
{
"version": "v1",
"created": "Sat, 7 Jul 2007 03:18:26 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Sep 2007 12:19:30 GMT"
}
] | 2007-09-03T00:00:00 |
[
[
"Singh",
"Sudhir Kumar",
""
],
[
"Roychowdhury",
"Vwani P.",
""
],
[
"Gunadhi",
"Himawan",
""
],
[
"Rezaei",
"Behnam A.",
""
]
] |
new_dataset
| 0.996551 |
0708.3721
|
Marc Daumas
|
Marc Daumas (LIRMM, Eliaus), David Lester (UNIVERSITY of Manchester),
C\'esar Mu\~noz (NIA)
|
Verified Real Number Calculations: A Library for Interval Arithmetic
| null | null | null | null |
cs.MS cs.LO
| null |
Real number calculations on elementary functions are remarkably difficult to
handle in mechanical proofs. In this paper, we show how these calculations can
be performed within a theorem prover or proof assistant in a convenient and
highly automated as well as interactive way. First, we formally establish upper
and lower bounds for elementary functions. Then, based on these bounds, we
develop a rational interval arithmetic where real number calculations take
place in an algebraic setting. In order to reduce the dependency effect of
interval arithmetic, we integrate two techniques: interval splitting and taylor
series expansions. This pragmatic approach has been developed, and formally
verified, in a theorem prover. The formal development also includes a set of
customizable strategies to automate proofs involving explicit calculations over
real numbers. Our ultimate goal is to provide guaranteed proofs of numerical
properties with minimal human theorem-prover interaction.
|
[
{
"version": "v1",
"created": "Tue, 28 Aug 2007 07:14:29 GMT"
}
] | 2007-08-29T00:00:00 |
[
[
"Daumas",
"Marc",
"",
"LIRMM, Eliaus"
],
[
"Lester",
"David",
"",
"UNIVERSITY of Manchester"
],
[
"Muñoz",
"César",
"",
"NIA"
]
] |
new_dataset
| 0.984625 |
0708.3740
|
Noelle Carbonell
|
J\'er\^ome Simonin (INRIA Rocquencourt / INRIA Lorraine - LORIA),
Marius Hategan (INRIA Rocquencourt / INRIA Lorraine - LORIA), No\"elle
Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)
|
Plate-forme Magicien d'Oz pour l'\'etude de l'apport des ACAs \`a
l'interaction
| null |
Dans Actes du Second Workshop sur les Agents Conversationnels
anim\'es - Second Workshop sur les Agents Conversationnels anim\'es, Toulouse
: France (2007)
| null | null |
cs.HC
| null |
In order to evaluate the contribution of Embodied (Animated) Conversational
Agents (ECAs) to the effectiveness and usability of human-computer interaction,
we developed a software platform meant to collect usage data. This platform,
which implements the wizard of Oz paradigm, makes it possible to simulate user
interfaces integrating ACAs for any Windows software application. It can also
save and "replay" a rich interaction trace including user and system events,
screen captures, users' speech and eye fixations. This platform has been used
to assess users' subjective judgements and reactions to a multimodal online
help system meant to facilitate the use of software for the general public
(Flash). The online help system is embodied using a 3D talking head (developed
by FT R&D) which "says" oral help messages illustrated with Flash screen
copies.
|
[
{
"version": "v1",
"created": "Tue, 28 Aug 2007 09:56:05 GMT"
}
] | 2007-08-29T00:00:00 |
[
[
"Simonin",
"Jérôme",
"",
"INRIA Rocquencourt / INRIA Lorraine - LORIA"
],
[
"Hategan",
"Marius",
"",
"INRIA Rocquencourt / INRIA Lorraine - LORIA"
],
[
"Carbonell",
"Noëlle",
"",
"INRIA Rocquencourt / INRIA Lorraine - LORIA"
]
] |
new_dataset
| 0.995451 |
0708.3505
|
Noelle Carbonell
|
Daniel Gepner (INRIA Rocquencourt / INRIA Lorraine - LORIA),
J\'er\^ome Simonin (INRIA Rocquencourt / INRIA Lorraine - LORIA), No\"elle
Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)
|
Gaze as a Supplementary Modality for Interacting with Ambient
Intelligence Environments
|
10 pages
|
Dans Universal Access to Ambient Interaction, Springer-Verlag,
LNCS-LNAI Series, number 4555 - 12th International Conference on
Human-Computer Interaction (HCI Internatinal 2007), Beijing : China (2007)
| null | null |
cs.HC
| null |
We present our current research on the implementation of gaze as an efficient
and usable pointing modality supplementary to speech, for interacting with
augmented objects in our daily environment or large displays, especially
immersive virtual reality environments, such as reality centres and caves. We
are also addressing issues relating to the use of gaze as the main interaction
input modality. We have designed and developed two operational user interfaces:
one for providing motor-disabled users with easy gaze-based access to map
applications and graphical software; the other for iteratively testing and
improving the usability of gaze-contingent displays.
|
[
{
"version": "v1",
"created": "Sun, 26 Aug 2007 18:53:41 GMT"
}
] | 2007-08-28T00:00:00 |
[
[
"Gepner",
"Daniel",
"",
"INRIA Rocquencourt / INRIA Lorraine - LORIA"
],
[
"Simonin",
"Jérôme",
"",
"INRIA Rocquencourt / INRIA Lorraine - LORIA"
],
[
"Carbonell",
"Noëlle",
"",
"INRIA Rocquencourt / INRIA Lorraine - LORIA"
]
] |
new_dataset
| 0.998518 |
0708.3580
|
Noelle Carbonell
|
No\"elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)
|
Ambient Multimodality: an Asset for Developing Universal Access to the
Information Society
| null |
3rd International Conference on Universal Access in Human-Computer
Interaction, Las Vegas : \'Etats-Unis d'Am\'erique (2005)
| null | null |
cs.HC
| null |
The paper tries to point out the benefits that can be derived from research
advances in the implementation of concepts such as ambient intelligence (AmI)
and ubiquitous or pervasive computing for promoting Universal Access (UA) to
the Information Society, that is, for contributing to enable everybody,
especially Physically Disabled (PD) people, to have easy access to all
computing resources and information services that the coming worldwide
Information Society will soon make available to the general public. Following
definitions of basic concepts relating to multimodal interaction, the
significant contribution of multimodality to developing UA is briefly argued.
Then, a short state of the art in AmI research is presented. In the last
section we bring out the potential contribution of advances in AmI research and
technology to the improvement of computer access for PD people. This claim is
supported by the following observations: (i) most projects aiming at
implementing AmI focus on the design of new interaction modalities and flexible
multimodal user interfaces which may facilitate PD users' computer access ;
(ii) targeted applications will support users in a wide range of daily
activities which will be performed simultaneously with supporting computing
tasks; therefore, users will be placed in contexts where they will be
confronted with similar difficulties to those encountered by PD users; (iii)
AmI applications being intended for the general public, a wide range of new
interaction devices and flexible processing software will be available, making
it possible to provide PD users with human-computer facilities tailored to
their specific needs at reasonable expense..
|
[
{
"version": "v1",
"created": "Mon, 27 Aug 2007 12:11:56 GMT"
}
] | 2007-08-28T00:00:00 |
[
[
"Carbonell",
"Noëlle",
"",
"INRIA Rocquencourt / INRIA Lorraine - LORIA"
]
] |
new_dataset
| 0.993164 |
0708.3613
|
Damien Chablat
|
Anatoly Pashkevich (Robotic Laboratory), Damien Chablat (IRCCyN),
Philippe Wenger (IRCCyN)
|
Kinematics and Workspace Analysis of a Three-Axis Parallel Manipulator:
the Orthoglide
| null |
Robotica 24, 1 (2006) 39-49
| null | null |
cs.RO
| null |
The paper addresses kinematic and geometrical aspects of the Orthoglide, a
three-DOF parallel mechanism. This machine consists of three fixed linear
joints, which are mounted orthogonally, three identical legs and a mobile
platform, which moves in the Cartesian x-y-z space with fixed orientation. New
solutions to solve inverse/direct kinematics are proposed and we perform a
detailed workspace and singularity analysis, taking into account specific joint
limit constraints.
|
[
{
"version": "v1",
"created": "Mon, 27 Aug 2007 14:05:34 GMT"
}
] | 2007-08-28T00:00:00 |
[
[
"Pashkevich",
"Anatoly",
"",
"Robotic Laboratory"
],
[
"Chablat",
"Damien",
"",
"IRCCyN"
],
[
"Wenger",
"Philippe",
"",
"IRCCyN"
]
] |
new_dataset
| 0.997952 |
0708.3166
|
Achmad Benny Mutiara
|
A. B. Mutiara and T. A. Sabastian
|
Web Server Benchmark Application WiiBench using Erlang/OTP R11 and
Fedora-Core Linux 5.0
| null | null | null | null |
cs.NI
| null |
As the web grows and the amount of traffics on the web server increase,
problems related to performance begin to appear. Some of the problems, such as
the number of users that can access the server simultaneously, the number of
requests that can be handled by the server per second (requests per second) to
bandwidth consumption and hardware utilization like memories and CPU. To give
better quality of service (\textbf{\textit{QoS}}), web hosting providers and
also the system administrators and network administrators who manage the server
need a benchmark application to measure the capabilities of their servers.
Later, the application intends to work under Linux/Unix -- like platforms and
built using Erlang/OTP R11 as a concurrent oriented language under Fedora Core
Linux 5.0. \textbf{\textit{WiiBench}} is divided into two main parts, the
controller section and the launcher section. Controller is the core of the
application. It has several duties, such as read the benchmark scenario file,
configure the program based on the scenario, initialize the launcher section,
gather the benchmark results from local and remote Erlang node where the
launcher runs and write them in a log file (later the log file will be used to
generate a report page for the sysadmin). Controller also has function as a
timer which act as timing for user inters arrival to the server. Launcher
generates a number of users based on the scenario, initialize them and start
the benchmark by sending requests to the web server. The clients also gather
the benchmark result and send them to the controller.
|
[
{
"version": "v1",
"created": "Thu, 23 Aug 2007 12:25:50 GMT"
}
] | 2007-08-24T00:00:00 |
[
[
"Mutiara",
"A. B.",
""
],
[
"Sabastian",
"T. A.",
""
]
] |
new_dataset
| 0.999669 |
0708.2732
|
Yingbin Liang
|
Yingbin Liang and H. Vincent Poor
|
Secrecy Capacity Region of Binary and Gaussian Multiple Access Channels
|
In Proceedings of the 44th Annual Allerton Conference on
Communication, Control and Computing, University of Illinois, Monticello, IL,
September 27-29, 2006
| null | null | null |
cs.IT math.IT
| null |
A generalized multiple access channel (GMAC) with one confidential message
set is studied, where two users (users 1 and 2) attempt to transmit common
information to a destination, and user 1 also has confidential information
intended for the destination. Moreover, user 1 wishes to keep its confidential
information as secret as possible from user 2. A deterministic GMAC is first
studied, and the capacity-equivocation region and the secrecy capacity region
are obtained. Two main classes of the GMAC are then studied: the binary GMAC
and the Gaussian GMAC. For both channels, the capacity-equivocation region and
the secrecy capacity region are established.
|
[
{
"version": "v1",
"created": "Mon, 20 Aug 2007 20:53:10 GMT"
}
] | 2007-08-22T00:00:00 |
[
[
"Liang",
"Yingbin",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.958086 |
0708.2432
|
Oliver Knill
|
Oliver Knill and Jose Ramirez-Herran
|
A structure from motion inequality
|
15 pages, 22 figures
| null | null | null |
cs.CV cs.AI
| null |
We state an elementary inequality for the structure from motion problem for m
cameras and n points. This structure from motion inequality relates space
dimension, camera parameter dimension, the number of cameras and number points
and global symmetry properties and provides a rigorous criterion for which
reconstruction is not possible with probability 1. Mathematically the
inequality is based on Frobenius theorem which is a geometric incarnation of
the fundamental theorem of linear algebra. The paper also provides a general
mathematical formalism for the structure from motion problem. It includes the
situation the points can move while the camera takes the pictures.
|
[
{
"version": "v1",
"created": "Sat, 18 Aug 2007 14:36:28 GMT"
}
] | 2007-08-21T00:00:00 |
[
[
"Knill",
"Oliver",
""
],
[
"Ramirez-Herran",
"Jose",
""
]
] |
new_dataset
| 0.975555 |
0708.2336
|
Dominik Scheder
|
Dominik Scheder
|
Unsatisfiable Linear k-CNFs Exist, for every k
|
11 pages
| null | null | null |
cs.DM cs.CC cs.LO
| null |
We call a CNF formula linear if any two clauses have at most one variable in
common. Let Linear k-SAT be the problem of deciding whether a given linear
k-CNF formula is satisfiable. Here, a k-CNF formula is a CNF formula in which
every clause has size exactly k. It was known that for k >= 3, Linear k-SAT is
NP-complete if and only if an unsatisfiable linear k-CNF formula exists, and
that they do exist for k >= 4. We prove that unsatisfiable linear k-CNF
formulas exist for every k. Let f(k) be the minimum number of clauses in an
unsatisfiable linear k-CNF formula. We show that f(k) is Omega(k2^k) and
O(4^k*k^4), i.e., minimum size unsatisfiable linear k-CNF formulas are
significantly larger than minimum size unsatisfiable k-CNF formulas. Finally,
we prove that, surprisingly, linear k-CNF formulas do not allow for a larger
fraction of clauses to be satisfied than general k-CNF formulas.
|
[
{
"version": "v1",
"created": "Fri, 17 Aug 2007 09:44:21 GMT"
}
] | 2007-08-20T00:00:00 |
[
[
"Scheder",
"Dominik",
""
]
] |
new_dataset
| 0.994052 |
cs/0611155
|
Deepak Sridhara
|
Christine A. Kelley, Deepak Sridhara, and Joachim Rosenthal
|
Zig-zag and Replacement Product Graphs and LDPC Codes
|
Submitted to Journal of Advances in Mathematics of Communications,
Aug. 2007
| null | null | null |
cs.IT math.IT
| null |
The performance of codes defined from graphs depends on the expansion
property of the underlying graph in a crucial way. Graph products, such as the
zig-zag product and replacement product provide new infinite families of
constant degree expander graphs. The paper investigates the use of zig-zag and
replacement product graphs for the construction of codes on graphs. A
modification of the zig-zag product is also introduced, which can operate on
two unbalanced biregular bipartite graphs.
|
[
{
"version": "v1",
"created": "Thu, 30 Nov 2006 03:36:22 GMT"
},
{
"version": "v2",
"created": "Mon, 20 Aug 2007 13:06:44 GMT"
}
] | 2007-08-20T00:00:00 |
[
[
"Kelley",
"Christine A.",
""
],
[
"Sridhara",
"Deepak",
""
],
[
"Rosenthal",
"Joachim",
""
]
] |
new_dataset
| 0.999006 |
0708.2270
|
Tan Wong
|
Saravanan Vijayakumaran, Tan F. Wong and Tat M. Lok
|
Capacity of the Degraded Half-Duplex Relay Channel
|
10 pages, 2 figures
| null | null | null |
cs.IT math.IT
| null |
A discrete memoryless half-duplex relay channel is constructed from a
broadcast channel from the source to the relay and destination and a multiple
access channel from the source and relay to the destination. When the relay
listens, the channel operates in the broadcast mode. The channel switches to
the multiple access mode when the relay transmits. If the broadcast component
channel is physically degraded, the half-duplex relay channel will also be
referred to as physically degraded. The capacity of this degraded half-duplex
relay channel is examined. It is shown that the block Markov coding suggested
in the seminal paper by Cover and El Gamal can be modified to achieve capacity
for the degraded half-duplex relay channel. In the code construction, the
listen-transmit schedule of the relay is made to depend on the message to be
sent and hence the schedule carries information itself. If the schedule is
restricted to be deterministic, it is shown that the capacity can be achieved
by a simple management of information flows across the broadcast and multiple
access component channels.
|
[
{
"version": "v1",
"created": "Thu, 16 Aug 2007 19:36:03 GMT"
}
] | 2007-08-17T00:00:00 |
[
[
"Vijayakumaran",
"Saravanan",
""
],
[
"Wong",
"Tan F.",
""
],
[
"Lok",
"Tat M.",
""
]
] |
new_dataset
| 0.999792 |
0708.1343
|
Heide Gluesing-Luerssen
|
Heide Gluesing-Luerssen, Fai-Lung Tsang
|
A Matrix Ring Description for Cyclic Convolutional Codes
| null | null | null | null |
cs.IT math.IT math.RA
| null |
In this paper, we study convolutional codes with a specific cyclic structure.
By definition, these codes are left ideals in a certain skew polynomial ring.
Using that the skew polynomial ring is isomorphic to a matrix ring we can
describe the algebraic parameters of the codes in a more accessible way. We
show that the existence of such codes with given algebraic parameters can be
reduced to the solvability of a modified rook problem. It is our strong belief
that the rook problem is always solvable, and we present solutions in
particular cases.
|
[
{
"version": "v1",
"created": "Thu, 9 Aug 2007 21:35:15 GMT"
}
] | 2007-08-13T00:00:00 |
[
[
"Gluesing-Luerssen",
"Heide",
""
],
[
"Tsang",
"Fai-Lung",
""
]
] |
new_dataset
| 0.990088 |
0708.1078
|
Jianwen Zhang
|
Marc A. Armand, Jianwen Zhang
|
Nearly MDS expander codes with reduced alphabet size
| null | null | null | null |
cs.IT math.IT
| null |
Recently, Roth and Skachek proposed two methods for constructing nearly
maximum-distance separable (MDS) expander codes. We show that through the
simple modification of using mixed-alphabet codes derived from MDS codes as
constituent codes in their code designs, one can obtain nearly MDS codes of
significantly smaller alphabet size, albeit at the expense of a (very slight)
reduction in code rate.
|
[
{
"version": "v1",
"created": "Wed, 8 Aug 2007 10:45:51 GMT"
}
] | 2007-08-09T00:00:00 |
[
[
"Armand",
"Marc A.",
""
],
[
"Zhang",
"Jianwen",
""
]
] |
new_dataset
| 0.999103 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.