OpenRaiser/Intern-Atlas huggingface dataset:
Pathways: Augmenting interoperability across scholarly repositories
Venue: arXiv cs.DL 2006
Year: 2006

In the emerging eScience environment, repositories of papers, datasets, software, etc., should be the foundation of a global and natively-digital scholarly communications system. The current infrastructure falls far short of this goal. Cross-repository interoperability must be augmented to support the many workflows and value-chains involved in scholarly communication. This will not be achieved through the promotion of single repository architecture or content representation, but instead requires an interoperability framework to connect the many heterogeneous systems that will exist. We present a simple data model and service architecture that augments repository interoperability to enable scholarly value-chains to be implemented. We describe an experiment that demonstrates how the proposed infrastructure can be deployed to implement the workflow involved in the creation of an overlay journal over several different repository systems (Fedora, aDORe, DSpace and arXiv).
Mécanismes de Transmission Multipoint pour Réseaux Locaux Sans Fil IEEE 802.11
Venue: arXiv cs.NI 2006
Year: 2006

Le standard IEEE 802.11 est inefficace pour la transmission multimédia en multipoint. En particulier, les paquets multipoints sont envoyés en boucle ouverte de la même manière que les paquets broadcast. L'absence d'acquittements rend impossible la mise en oeuvre de mécanismes de contrôle de congestion, de mécanisme de fiabilisation de la transmission ainsi que d'algorithmes d'adaptation du débit de transmission physique. Dans ce rapport, nous proposons de nouveaux mécanismes de ransmission multipoint qui se basent sur une approche leader pour renvoyer des acquittements. Nous nous interessons à des solutions pratiques qui sont suceptibles d'être implantés dans les cartes réseaux sans fil actuelles et futures et qui restent compatibles avec les stations IEEE 802.11 standards. Nous proposons deux mécanismes pour adapter le débit de transmission physique des flots multipoints: un mécanisme simplifié appelé LB-ARF et un mécanisme plus robuste appelé RRAM. Nos simulations montrent que pour des environnements statiques, un mécanisme aussi simple que LB-ARF suffit pour obtenir de bonnes performances. Le mécanisme RRAM est quant à lui aussi efficace dans des environnements statiques que lorsque les stations sont mobiles.
Restricted Complexity, General Complexity
Venue: arXiv cs.CC 2006
Year: 2006

Why has the problematic of complexity appeared so late? And why would it be justified?
Strong bi-homogeneous Bézout theorem and its use in effective real algebraic geometry
Venue: arXiv cs.SC 2006
Year: 2006

Let f1, ..., fs be a polynomial family in Q[X1,..., Xn] (with s less than n) of degree bounded by D. Suppose that f1, ..., fs generates a radical ideal, and defines a smooth algebraic variety V. Consider a projection P. We prove that the degree of the critical locus of P restricted to V is bounded by D^s(D-1)^(n-s) times binomial of n and n-s. This result is obtained in two steps. First the critical points of P restricted to V are characterized as projections of the solutions of Lagrange's system for which a bi-homogeneous structure is exhibited. Secondly we prove a bi-homogeneous Bézout Theorem, which bounds the sum of the degrees of the equidimensional components of the radical of an ideal generated by a bi-homogeneous polynomial family. This result is improved when f1,..., fs is a regular sequence. Moreover, we use Lagrange's system to design an algorithm computing at least one point in each connected component of a smooth real algebraic set. This algorithm generalizes, to the non equidimensional case, the one of Safey El Din and Schost. The evaluation of the output size of this algorithm gives new upper bounds on the first Betti number of a smooth real algebraic set. Finally, we estimate its arithmetic complexity and prove that in the worst cases it is polynomial in n, s, D^s(D-1)^(n-s) and the binomial of n and n-s, and the complexity of evaluation of f1,..., fs.
Context-sensitive access to e-document corpus
Venue: arXiv cs.IR 2006
Year: 2006

The methodology of context-sensitive access to e-documents considers context as a problem model based on the knowledge extracted from the application domain, and presented in the form of application ontology. Efficient access to an information in the text form is needed. Wiki resources as a modern text format provides huge number of text in a semi formalized structure. At the first stage of the methodology, documents are indexed against the ontology representing macro-situation. The indexing method uses a topic tree as a middle layer between documents and the application ontology. At the second stage documents relevant to the current situation (the abstract and operational contexts) are identified and sorted by degree of relevance. Abstract context is a problem-oriented ontology-based model. Operational context is an instantiation of the abstract context with data provided by the information sources. The following parts of the methodology are described: (i) metrics for measuring similarity of e-documents to ontology, (ii) a document index storing results of indexing of e-documents against the ontology; (iii) a method for identification of relevant e-documents based on semantic similarity measures. Wikipedia (wiki resource) is used as a corpus of e-documents for approach evaluation in a case study. Text categorization, the presence of metadata, and an existence of a lot of articles related to different topics characterize the corpus.
Definitions by Rewriting in the Calculus of Constructions
Venue: arXiv cs.LO 2006
Year: 2006

The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prove the strong normalization of the reduction relation generated by the beta-rule and the user-defined rules under some general syntactic conditions including confluence. As examples, we show that two important systems satisfy these conditions: a sub-system of the Calculus of Inductive Constructions which is the basis of the proof assistant Coq, and the Natural Deduction Modulo a large class of equational theories.
An Isabelle formalization of protocol-independent secrecy with an application to e-commerce
Venue: arXiv cs.LO 2006
Year: 2006

A protocol-independent secrecy theorem is established and applied to several non-trivial protocols. In particular, it is applied to protocols proposed for protecting the computation results of free-roaming mobile agents doing comparison shopping. All the results presented here have been formally proved in Isabelle by building on Larry Paulson's inductive approach. This therefore provides a library of general theorems that can be applied to other protocols.
Rewriting modulo in Deduction modulo
Venue: arXiv cs.LO 2006
Year: 2006

We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions and predicates defined by higher-order rewrite rules. In a previous work, we defined general syntactic conditions based on the notion of computable closure for ensuring the termination of the combination of rewriting and beta-reduction. Here, we show that this result is preserved when considering rewriting modulo a set of equations if the equivalence classes generated by these equations are finite, the equations are linear and satisfy general syntactic conditions also based on the notion of computable closure. This includes equations like associativity and commutativity, and provides an original treatment of termination modulo equations.
Inductive types in the Calculus of Algebraic Constructions
Venue: arXiv cs.LO 2006
Year: 2006

In a previous work, we proved that an important part of the Calculus of Inductive Constructions (CIC), the basis of the Coq proof assistant, can be seen as a Calculus of Algebraic Constructions (CAC), an extension of the Calculus of Constructions with functions and predicates defined by higher-order rewrite rules. In this paper, we prove that almost all CIC can be seen as a CAC, and that it can be further extended with non-strictly positive types and inductive-recursive types together with non-free constructors and pattern-matching on defined symbols.
Collaborative Decoding of Interleaved Reed-Solomon Codes and Concatenated Code Designs
Venue: arXiv cs.IT 2006
Year: 2006

Interleaved Reed-Solomon codes are applied in numerous data processing, data transmission, and data storage systems. They are generated by interleaving several codewords of ordinary Reed-Solomon codes. Usually, these codewords are decoded independently by classical algebraic decoding methods. However, by collaborative algebraic decoding approaches, such interleaved schemes allow the correction of error patterns beyond half the minimum distance, provided that the errors in the received signal occur in bursts. In this work, collaborative decoding of interleaved Reed-Solomon codes by multi-sequence shift-register synthesis is considered and analyzed. Based on the framework of interleaved Reed-Solomon codes, concatenated code designs are investigated, which are obtained by interleaving several Reed-Solomon codes, and concatenating them with an inner block code.
Vector field visualization with streamlines
Venue: arXiv cs.GR 2006
Year: 2006

We have recently developed an algorithm for vector field visualization with oriented streamlines, able to depict the flow directions everywhere in a dense vector field and the sense of the local orientations. The algorithm has useful applications in the visualization of the director field in nematic liquid crystals. Here we propose an improvement of the algorithm able to enhance the visualization of the local magnitude of the field. This new approach of the algorithm is compared with the same procedure applied to the Line Integral Convolution (LIC) visualization.
Combined Integer and Floating Point Multiplication Architecture(CIFM) for FPGAs and Its Reversible Logic Implementation
Venue: arXiv cs.AR 2006
Year: 2006

In this paper, the authors propose the idea of a combined integer and floating point multiplier(CIFM) for FPGAs. The authors propose the replacement of existing 18x18 dedicated multipliers in FPGAs with dedicated 24x24 multipliers designed with small 4x4 bit multipliers. It is also proposed that for every dedicated 24x24 bit multiplier block designed with 4x4 bit multipliers, four redundant 4x4 multiplier should be provided to enforce the feature of self repairability (to recover from the faults). In the proposed CIFM reconfigurability at run time is also provided resulting in low power. The major source of motivation for providing the dedicated 24x24 bit multiplier stems from the fact that single precision floating point multiplier requires 24x24 bit integer multiplier for mantissa multiplication. A reconfigurable, self-repairable 24x24 bit multiplier (implemented with 4x4 bit multiply modules) will ideally suit this purpose, making FPGAs more suitable for integer as well floating point operations. A dedicated 4x4 bit multiplier is also proposed in this paper. Moreover, in the recent years, reversible logic has emerged as a promising technology having its applications in low power CMOS, quantum computing, nanotechnology, and optical computing. It is not possible to realize quantum computing without reversible logic. Thus, this paper also paper provides the reversible logic implementation of the proposed CIFM. The reversible CIFM designed and proposed here will form the basis of the completely reversible FPGAs.
On the Behavior of Journal Impact Factor Rank-Order Distribution
Venue: arXiv cs.IR 2006
Year: 2006

An empirical law for the rank-order behavior of journal impact factors is found. Using an extensive data base on impact factors including journals on Education, Agrosciences, Geosciences, Biosciences and Environ- mental, Chemical, Computer, Engineering, Material, Mathematical, Medical and Physical Sciences we have found extremely good fits out- performing other rank-order models. Some extensions to other areas of knowledge are discussed.
Characterizing Solution Concepts in Games Using Knowledge-Based Programs
Venue: arXiv cs.GT 2006
Year: 2006

We show how solution concepts in games such as Nash equilibrium, correlated equilibrium, rationalizability, and sequential equilibrium can be given a uniform definition in terms of \emph{knowledge-based programs}. Intuitively, all solution concepts are implementations of two knowledge-based programs, one appropriate for games represented in normal form, the other for games represented in extensive form. These knowledge-based programs can be viewed as embodying rationality. The representation works even if (a) information sets do not capture an agent's knowledge, (b) uncertainty is not represented by probability, or (c) the underlying game is not common knowledge.
Approximate Convex Optimization by Online Game Playing
Venue: arXiv cs.DS 2006
Year: 2006

Lagrangian relaxation and approximate optimization algorithms have received much attention in the last two decades. Typically, the running time of these methods to obtain a $ε$ approximate solution is proportional to $\frac{1}{ε^2}$. Recently, Bienstock and Iyengar, following Nesterov, gave an algorithm for fractional packing linear programs which runs in $\frac{1}ε$ iterations. The latter algorithm requires to solve a convex quadratic program every iteration - an optimization subroutine which dominates the theoretical running time. We give an algorithm for convex programs with strictly convex constraints which runs in time proportional to $\frac{1}ε$. The algorithm does NOT require to solve any quadratic program, but uses gradient steps and elementary operations only. Problems which have strictly convex constraints include maximum entropy frequency estimation, portfolio optimization with loss risk constraints, and various computational problems in signal processing. As a side product, we also obtain a simpler version of Bienstock and Iyengar's result for general linear programming, with similar running time. We derive these algorithms using a new framework for deriving convex optimization algorithms from online game playing algorithms, which may be of independent interest.
Dependency Treebanks: Methods, Annotation Schemes and Tools
Venue: arXiv cs.CL 2006
Year: 2006

In this paper, current dependencybased treebanks are introduced and analyzed. The methods used for building the resources, the annotation schemes applied, and the tools used (such as POS taggers, parsers and annotation software) are discussed.
Community Detection in Complex Networks Using Agents
Venue: arXiv cs.MA 2006
Year: 2006

Community structure identification has been one of the most popular research areas in recent years due to its applicability to the wide scale of disciplines. To detect communities in varied topics, there have been many algorithms proposed so far. However, most of them still have some drawbacks to be addressed. In this paper, we present an agent-based based community detection algorithm. The algorithm that is a stochastic one makes use of agents by forcing them to perform biased moves in a smart way. Using the information collected by the traverses of these agents in the network, the network structure is revealed. Also, the network modularity is used for determining the number of communities. Our algorithm removes the need for prior knowledge about the network such as number of the communities or any threshold values. Furthermore, the definite community structure is provided as a result instead of giving some structures requiring further processes. Besides, the computational and time costs are optimized because of using thread like working agents. The algorithm is tested on three network data of different types and sizes named Zachary karate club, college football and political books. For all three networks, the real network structures are identified in almost every run.
Lossless coding for distributed streaming sources
Venue: arXiv cs.IT 2006
Year: 2006

Distributed source coding is traditionally viewed in the block coding context -- all the source symbols are known in advance at the encoders. This paper instead considers a streaming setting in which iid source symbol pairs are revealed to the separate encoders in real time and need to be reconstructed at the decoder with some tolerable end-to-end delay using finite rate noiseless channels. A sequential random binning argument is used to derive a lower bound on the error exponent with delay and show that both ML decoding and universal decoding achieve the same positive error exponents inside the traditional Slepian-Wolf rate region. The error events are different from the block-coding error events and give rise to slightly different exponents. Because the sequential random binning scheme is also universal over delays, the resulting code eventually reconstructs every source symbol correctly with probability 1.
Decoder Error Probability of MRD Codes
Venue: arXiv cs.IT 2006
Year: 2006

In this paper, we first introduce the concept of elementary linear subspace, which has similar properties to those of a set of coordinates. Using this new concept, we derive properties of maximum rank distance (MRD) codes that parallel those of maximum distance separable (MDS) codes. Using these properties, we show that the decoder error probability of MRD codes with error correction capability t decreases exponentially with t^2 based on the assumption that all errors with the same rank are equally likely. We argue that the channel based on this assumption is an approximation of a channel corrupted by crisscross errors.
Adaptation Knowledge Discovery from a Case Base
Venue: arXiv cs.AI 2006
Year: 2006

In case-based reasoning, the adaptation step depends in general on domain-dependent knowledge, which motivates studies on adaptation knowledge acquisition (AKA). CABAMAKA is an AKA system based on principles of knowledge discovery from databases. This system explores the variations within the case base to elicit adaptation knowledge. It has been successfully tested in an application of case-based decision support to breast cancer treatment.
A Taxonomy of Peer-to-Peer Based Complex Queries: a Grid perspective
Venue: arXiv cs.NI 2006
Year: 2006

Grid superscheduling requires support for efficient and scalable discovery of resources. Resource discovery activities involve searching for the appropriate resource types that match the user's job requirements. To accomplish this goal, a resource discovery system that supports the desired look-up operation is mandatory. Various kinds of solutions to this problem have been suggested, including the centralised and hierarchical information server approach. However, both of these approaches have serious limitations in regards to scalability, fault-tolerance and network congestion. To overcome these limitations, organising resource information using Peer-to-Peer (P2P) network model has been proposed. Existing approaches advocate an extension to structured P2P protocols, to support the Grid resource information system (GRIS). In this paper, we identify issues related to the design of such an efficient, scalable, fault-tolerant, consistent and practical GRIS system using a P2P network model. We compile these issues into various taxonomies in sections III and IV. Further, we look into existing works that apply P2P based network protocols to GRIS. We think that this taxonomy and its mapping to relevant systems would be useful for academic and industry based researchers who are engaged in the design of scalable Grid systems.
Lattice Quantization with Side Information: Codes, Asymptotics, and Applications in Sensor Networks
Venue: arXiv cs.IT 2006
Year: 2006

We consider the problem of rate/distortion with side information available only at the decoder. For the case of jointly-Gaussian source X and side information Y, and mean-squared error distortion, Wyner proved in 1976 that the rate/distortion function for this problem is identical to the conditional rate/distortion function R_{X|Y}, assuming the side information Y is available at the encoder. In this paper we construct a structured class of asymptotically optimal quantizers for this problem: under the assumption of high correlation between source X and side information Y, we show there exist quantizers within our class whose performance comes arbitrarily close to Wyner's bound. As an application illustrating the relevance of the high-correlation asymptotics, we also explore the use of these quantizers in the context of a problem of data compression for sensor networks, in a setup involving a large number of devices collecting highly correlated measurements within a confined area. An important feature of our formulation is that, although the per-node throughput of the network tends to zero as network size increases, so does the amount of information generated by each transmitter. This is a situation likely to be encountered often in practice, which allows us to cast under new--and more ``optimistic''--light some negative results on the transport capacity of large-scale wireless networks.
Protocols for Scholarly Communication
Venue: arXiv cs.DL 2006
Year: 2006

CERN, the European Organization for Nuclear Research, has operated an institutional preprint repository for more than 10 years. The repository contains over 850,000 records of which more than 450,000 are full-text OA preprints, mostly in the field of particle physics, and it is integrated with the library's holdings of books, conference proceedings, journals and other grey literature. In order to encourage effective propagation and open access to scholarly material, CERN is implementing a range of innovative library services into its document repository: automatic keywording, reference extraction, collaborative management tools and bibliometric tools. Some of these services, such as user reviewing and automatic metadata extraction, could make up an interesting testbed for future publishing solutions and certainly provide an exciting environment for e-science possibilities. The future protocol for scientific communication should naturally guide authors towards OA publication and CERN wants to help reach a full open access publishing environment for the particle physics community and the related sciences in the next few years.
Asymptotic SER and Outage Probability of MIMO MRC in Correlated Fading
Venue: arXiv cs.IT 2006
Year: 2006

This letter derives the asymptotic symbol error rate (SER) and outage probability of multiple-input multiple-output (MIMO) maximum ratio combining (MRC) systems. We consider Rayleigh fading channels with both transmit and receive spatial correlation. Our results are based on new asymptotic expressions which we derive for the p.d.f. and c.d.f. of the maximum eigenvalue of positive-definite quadratic forms in complex Gaussian matrices. We prove that spatial correlation does not affect the diversity order, but that it reduces the array gain and hence increases the SER in the high SNR regime.
A New Data Processing Inequality and Its Applications in Distributed Source and Channel Coding
Venue: arXiv cs.IT 2006
Year: 2006

In the distributed coding of correlated sources, the problem of characterizing the joint probability distribution of a pair of random variables satisfying an n-letter Markov chain arises. The exact solution of this problem is intractable. In this paper, we seek a single-letter necessary condition for this n-letter Markov chain. To this end, we propose a new data processing inequality on a new measure of correlation by means of spectrum analysis. Based on this new data processing inequality, we provide a single-letter necessary condition for the required joint probability distribution. We apply our results to two specific examples involving the distributed coding of correlated sources: multi-terminal rate-distortion region and multiple access channel with correlated sources, and propose new necessary conditions for these two problems.