corpus_id
stringlengths 7
12
| paper_id
stringlengths 9
16
| title
stringlengths 1
261
| abstract
stringlengths 70
4.02k
| source
stringclasses 1
value | bibtex
stringlengths 208
20.9k
| citation_key
stringlengths 6
100
|
|---|---|---|---|---|---|---|
arxiv-1001 | 0708.2456 | On the subset sum problem over finite fields | <|reference_start|>On the subset sum problem over finite fields: The subset sum problem over finite fields is a well-known {\bf NP}-complete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study the number of solutions of the subset sum problem from a mathematical point of view. In several interesting cases, we obtain explicit or asymptotic formulas for the solution number. As a consequence, we obtain some results on the decoding problem of Reed-Solomon codes.<|reference_end|> | arxiv | @article{li2007on,
title={On the subset sum problem over finite fields},
author={Jiyou Li and Daqing Wan},
journal={arXiv preprint arXiv:0708.2456},
year={2007},
archivePrefix={arXiv},
eprint={0708.2456},
primaryClass={math.NT cs.IT math.IT}
} | li2007on |
arxiv-1002 | 0708.2462 | Eigenvalue bounds on the pseudocodeword weight of expander codes | <|reference_start|>Eigenvalue bounds on the pseudocodeword weight of expander codes: Four different ways of obtaining low-density parity-check codes from expander graphs are considered. For each case, lower bounds on the minimum stopping set size and the minimum pseudocodeword weight of expander (LDPC) codes are derived. These bounds are compared with the known eigenvalue-based lower bounds on the minimum distance of expander codes. Furthermore, Tanner's parity-oriented eigenvalue lower bound on the minimum distance is generalized to yield a new lower bound on the minimum pseudocodeword weight. These bounds are useful in predicting the performance of LDPC codes under graph-based iterative decoding and linear programming decoding.<|reference_end|> | arxiv | @article{kelley2007eigenvalue,
title={Eigenvalue bounds on the pseudocodeword weight of expander codes},
author={Christine A. Kelley and Deepak Sridhara},
journal={Journal on Advances of Mathematics of Communications, vol. 1, no.
3, pp. 287 -- 307, Aug. 2007},
year={2007},
archivePrefix={arXiv},
eprint={0708.2462},
primaryClass={cs.IT math.IT}
} | kelley2007eigenvalue |
arxiv-1003 | 0708.2514 | Minimum Cost Homomorphisms to Reflexive Digraphs | <|reference_start|>Minimum Cost Homomorphisms to Reflexive Digraphs: For digraphs $G$ and $H$, a homomorphism of $G$ to $H$ is a mapping $f:\ V(G)\dom V(H)$ such that $uv\in A(G)$ implies $f(u)f(v)\in A(H)$. If moreover each vertex $u \in V(G)$ is associated with costs $c_i(u), i \in V(H)$, then the cost of a homomorphism $f$ is $\sum_{u\in V(G)}c_{f(u)}(u)$. For each fixed digraph $H$, the {\em minimum cost homomorphism problem} for $H$, denoted MinHOM($H$), is the following problem. Given an input digraph $G$, together with costs $c_i(u)$, $u\in V(G)$, $i\in V(H)$, and an integer $k$, decide if $G$ admits a homomorphism to $H$ of cost not exceeding $k$. We focus on the minimum cost homomorphism problem for {\em reflexive} digraphs $H$ (every vertex of $H$ has a loop). It is known that the problem MinHOM($H$) is polynomial time solvable if the digraph $H$ has a {\em Min-Max ordering}, i.e., if its vertices can be linearly ordered by $<$ so that $i<j, s<r$ and $ir, js \in A(H)$ imply that $is \in A(H)$ and $jr \in A(H)$. We give a forbidden induced subgraph characterization of reflexive digraphs with a Min-Max ordering; our characterization implies a polynomial time test for the existence of a Min-Max ordering. Using this characterization, we show that for a reflexive digraph $H$ which does not admit a Min-Max ordering, the minimum cost homomorphism problem is NP-complete. Thus we obtain a full dichotomy classification of the complexity of minimum cost homomorphism problems for reflexive digraphs.<|reference_end|> | arxiv | @article{gupta2007minimum,
title={Minimum Cost Homomorphisms to Reflexive Digraphs},
author={Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey},
journal={arXiv preprint arXiv:0708.2514},
year={2007},
archivePrefix={arXiv},
eprint={0708.2514},
primaryClass={cs.DM cs.CC}
} | gupta2007minimum |
arxiv-1004 | 0708.2544 | On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments | <|reference_start|>On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments: For digraphs $D$ and $H$, a mapping $f: V(D)\dom V(H)$ is a homomorphism of $D$ to $H$ if $uv\in A(D)$ implies $f(u)f(v)\in A(H).$ For a fixed digraph $H$, the homomorphism problem is to decide whether an input digraph $D$ admits a homomorphism to $H$ or not, and is denoted as HOMP($H$). Digraphs are allowed to have loops, but not allowed to have parallel arcs. A natural optimization version of the homomorphism problem is defined as follows. If each vertex $u \in V(D)$ is associated with costs $c_i(u), i \in V(H)$, then the cost of the homomorphism $f$ is $\sum_{u\in V(D)}c_{f(u)}(u)$. For each fixed digraph $H$, we have the {\em minimum cost homomorphism problem for} $H$ and denote it as MinHOMP($H$). The problem is to decide, for an input graph $D$ with costs $c_i(u),$ $u \in V(D), i\in V(H)$, whether there exists a homomorphism of $D$ to $H$ and, if one exists, to find one of minimum cost. In a recent paper, we posed a problem of characterizing polynomial time solvable and NP-hard cases of the minimum cost homomorphism problem for acyclic multipartite tournaments with possible loops (w.p.l.). In this paper, we solve the problem for reflexive multipartite tournaments and demonstrate a considerate difficulty of the problem for the whole class of multipartite tournaments w.p.l. using, as an example, acyclic 3-partite tournaments of order 4 w.p.l.\footnote{This paper was submitted to Discrete Mathematics on April 6, 2007}<|reference_end|> | arxiv | @article{gutin2007on,
title={On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive
Multipartite Tournaments},
author={G. Gutin and E.J. Kim},
journal={arXiv preprint arXiv:0708.2544},
year={2007},
archivePrefix={arXiv},
eprint={0708.2544},
primaryClass={cs.DM cs.DS}
} | gutin2007on |
arxiv-1005 | 0708.2545 | Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops | <|reference_start|>Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops: For digraphs $D$ and $H$, a mapping $f: V(D)\dom V(H)$ is a homomorphism of $D$ to $H$ if $uv\in A(D)$ implies $f(u)f(v)\in A(H).$ For a fixed digraph $H$, the homomorphism problem is to decide whether an input digraph $D$ admits a homomorphism to $H$ or not, and is denoted as HOM($H$). An optimization version of the homomorphism problem was motivated by a real-world problem in defence logistics and was introduced in \cite{gutinDAM154a}. If each vertex $u \in V(D)$ is associated with costs $c_i(u), i \in V(H)$, then the cost of the homomorphism $f$ is $\sum_{u\in V(D)}c_{f(u)}(u)$. For each fixed digraph $H$, we have the {\em minimum cost homomorphism problem for} $H$ and denote it as MinHOM($H$). The problem is to decide, for an input graph $D$ with costs $c_i(u),$ $u \in V(D), i\in V(H)$, whether there exists a homomorphism of $D$ to $H$ and, if one exists, to find one of minimum cost. Although a complete dichotomy classification of the complexity of MinHOM($H$) for a digraph $H$ remains an unsolved problem, complete dichotomy classifications for MinHOM($H$) were proved when $H$ is a semicomplete digraph \cite{gutinDAM154b}, and a semicomplete multipartite digraph \cite{gutinDAM}. In these studies, it is assumed that the digraph $H$ is loopless. In this paper, we present a full dichotomy classification for semicomplete digraphs with possible loops, which solves a problem in \cite{gutinRMS}.\footnote{This paper was submitted to SIAM J. Discrete Math. on October 27, 2006}<|reference_end|> | arxiv | @article{kim2007complexity,
title={Complexity of the Minimum Cost Homomorphism Problem for Semicomplete
Digraphs with Possible Loops},
author={E.J. Kim and G. Gutin},
journal={arXiv preprint arXiv:0708.2545},
year={2007},
archivePrefix={arXiv},
eprint={0708.2545},
primaryClass={cs.DM cs.DS}
} | kim2007complexity |
arxiv-1006 | 0708.2566 | Discrete Denoising with Shifts | <|reference_start|>Discrete Denoising with Shifts: We introduce S-DUDE, a new algorithm for denoising DMC-corrupted data. The algorithm, which generalizes the recently introduced DUDE (Discrete Universal DEnoiser) of Weissman et al., aims to compete with a genie that has access, in addition to the noisy data, also to the underlying clean data, and can choose to switch, up to $m$ times, between sliding window denoisers in a way that minimizes the overall loss. When the underlying data form an individual sequence, we show that the S-DUDE performs essentially as well as this genie, provided that $m$ is sub-linear in the size of the data. When the clean data is emitted by a piecewise stationary process, we show that the S-DUDE achieves the optimum distribution-dependent performance, provided that the same sub-linearity condition is imposed on the number of switches. To further substantiate the universal optimality of the S-DUDE, we show that when the number of switches is allowed to grow linearly with the size of the data, \emph{any} (sequence of) scheme(s) fails to compete in the above senses. Using dynamic programming, we derive an efficient implementation of the S-DUDE, which has complexity (time and memory) growing only linearly with the data size and the number of switches $m$. Preliminary experimental results are presented, suggesting that S-DUDE has the capacity to significantly improve on the performance attained by the original DUDE in applications where the nature of the data abruptly changes in time (or space), as is often the case in practice.<|reference_end|> | arxiv | @article{moon2007discrete,
title={Discrete Denoising with Shifts},
author={Taesup Moon, Tsachy Weissman},
journal={arXiv preprint arXiv:0708.2566},
year={2007},
doi={10.1109/TIT.2009.2030461},
archivePrefix={arXiv},
eprint={0708.2566},
primaryClass={cs.IT math.IT}
} | moon2007discrete |
arxiv-1007 | 0708.2571 | On the Security of the Cha-Ko-Lee-Han-Cheon Braid Group Public Key Cryptosystem | <|reference_start|>On the Security of the Cha-Ko-Lee-Han-Cheon Braid Group Public Key Cryptosystem: 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.<|reference_end|> | arxiv | @article{chowdhury2007on,
title={On the Security of the Cha-Ko-Lee-Han-Cheon Braid Group Public Key
Cryptosystem},
author={M. M. Chowdhury},
journal={arXiv preprint arXiv:0708.2571},
year={2007},
archivePrefix={arXiv},
eprint={0708.2571},
primaryClass={cs.CR}
} | chowdhury2007on |
arxiv-1008 | 0708.2575 | Rateless Coding for Gaussian Channels | <|reference_start|>Rateless Coding for Gaussian Channels: A rateless code-i.e., a rate-compatible family of codes-has the property that codewords of the higher rate codes are prefixes of those of the lower rate ones. A perfect family of such codes is one in which each of the codes in the family is capacity-achieving. We show by construction that perfect rateless codes with low-complexity decoding algorithms exist for additive white Gaussian noise channels. Our construction involves the use of layered encoding and successive decoding, together with repetition using time-varying layer weights. As an illustration of our framework, we design a practical three-rate code family. We further construct rich sets of near-perfect rateless codes within our architecture that require either significantly fewer layers or lower complexity than their perfect counterparts. Variations of the basic construction are also developed, including one for time-varying channels in which there is no a priori stochastic model.<|reference_end|> | arxiv | @article{erez2007rateless,
title={Rateless Coding for Gaussian Channels},
author={Uri Erez, Mitchell D. Trott and Gregory W. Wornell},
journal={arXiv preprint arXiv:0708.2575},
year={2007},
archivePrefix={arXiv},
eprint={0708.2575},
primaryClass={cs.IT math.IT}
} | erez2007rateless |
arxiv-1009 | 0708.2584 | Claw Finding Algorithms Using Quantum Walk | <|reference_start|>Claw Finding Algorithms Using Quantum Walk: The claw finding problem has been studied in terms of query complexity as one of the problems closely connected to cryptography. For given two functions, f and g, as an oracle which have domains of size N and M (N<=M), respectively, and the same range, the goal of the problem is to find x and y such that f(x)=g(y). This paper describes an optimal algorithm using quantum walk that solves this problem. Our algorithm can be generalized to find a claw of k functions for any constant integer k>1, where the domains of the functions may have different size.<|reference_end|> | arxiv | @article{tani2007claw,
title={Claw Finding Algorithms Using Quantum Walk},
author={Seiichiro Tani},
journal={Theoretical Computer Science, 410(50): 5285-5297 (2009)},
year={2007},
doi={10.1016/j.tcs.2009.08.030},
archivePrefix={arXiv},
eprint={0708.2584},
primaryClass={quant-ph cs.CC}
} | tani2007claw |
arxiv-1010 | 0708.2616 | An Experimental Investigation of Secure Communication With Chaos Masking | <|reference_start|>An Experimental Investigation of Secure Communication With Chaos Masking: The most exciting recent development in nonlinear dynamics is realization that chaos can be useful. One application involves "Secure Communication". Two piecewise linear systems with switching nonlinearities have been taken as chaos generators. In the present work the phenomenon of secure communication with chaos masking has been investigated experimentally. In this investigation chaos which is generated from two chaos generators is masked with the massage signal to be transmitted, thus makes communication is more secure.<|reference_end|> | arxiv | @article{dhar2007an,
title={An Experimental Investigation of Secure Communication With Chaos Masking},
author={Sourav Dhar and Kabir Chakraborty},
journal={arXiv preprint arXiv:0708.2616},
year={2007},
archivePrefix={arXiv},
eprint={0708.2616},
primaryClass={cs.CR}
} | dhar2007an |
arxiv-1011 | 0708.2668 | Zone and double zone diagrams in abstract spaces | <|reference_start|>Zone and double zone diagrams in abstract spaces: A zone diagram is a relatively new concept which was first defined and studied by T. Asano, J. Matousek and T. Tokuyama. It can be interpreted as a state of equilibrium between several mutually hostile kingdoms. Formally, it is a fixed point of a certain mapping. These authors considered the Euclidean plane and proved the existence and uniqueness of zone diagrams there. In the present paper we generalize this concept in various ways. We consider general sites in m-spaces (a simple generalization of metric spaces) and prove several existence and (non)uniqueness results in this setting. In contrast to previous works, our (rather simple) proofs are based on purely order theoretic arguments. Many explicit examples are given, and some of them illustrate new phenomena which occur in the general case. We also re-interpret zone diagrams as a stable configuration in a certain combinatorial game, and provide an algorithm for finding this configuration in a particular case.<|reference_end|> | arxiv | @article{reem2007zone,
title={Zone and double zone diagrams in abstract spaces},
author={Daniel Reem, Simeon Reich},
journal={Colloquium Mathematicum 115 (2009), 129-145},
year={2007},
doi={10.4064/cm115-1-11},
archivePrefix={arXiv},
eprint={0708.2668},
primaryClass={math.MG cs.CG math.CO}
} | reem2007zone |
arxiv-1012 | 0708.2686 | The universal evolutionary computer based on super-recursive algorithms of evolvability | <|reference_start|>The universal evolutionary computer based on super-recursive algorithms of evolvability: This work exposes which mechanisms and procesess in the Nature of evolution compute a function not computable by Turing machine. The computer with intelligence that is not higher than one bacteria population could have, but with efficency to solve the problems that are non-computable by Turing machine is represented. This theoretical construction is called Universal Evolutinary Computer and it is based on the superecursive algorithms of evolvability.<|reference_end|> | arxiv | @article{roglic2007the,
title={The universal evolutionary computer based on super-recursive algorithms
of evolvability},
author={D. Roglic},
journal={arXiv preprint arXiv:0708.2686},
year={2007},
archivePrefix={arXiv},
eprint={0708.2686},
primaryClass={cs.NE}
} | roglic2007the |
arxiv-1013 | 0708.2717 | Aggregation Languages for Moving Object and Places of Interest Data | <|reference_start|>Aggregation Languages for Moving Object and Places of Interest Data: We address aggregate queries over GIS data and moving object data, where non-spatial data are stored in a data warehouse. We propose a formal data model and query language to express complex aggregate queries. Next, we study the compression of trajectory data, produced by moving objects, using the notions of stops and moves. We show that stops and moves are expressible in our query language and we consider a fragment of this language, consisting of regular expressions to talk about temporally ordered sequences of stops and moves. This fragment can be used to efficiently express data mining and pattern matching tasks over trajectory data.<|reference_end|> | arxiv | @article{gomez2007aggregation,
title={Aggregation Languages for Moving Object and Places of Interest Data},
author={Leticia Gomez, Bart Kuijpers, Alejandro Vaisman},
journal={arXiv preprint arXiv:0708.2717},
year={2007},
archivePrefix={arXiv},
eprint={0708.2717},
primaryClass={cs.DB}
} | gomez2007aggregation |
arxiv-1014 | 0708.2732 | Secrecy Capacity Region of Binary and Gaussian Multiple Access Channels | <|reference_start|>Secrecy Capacity Region of Binary and Gaussian Multiple Access Channels: 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.<|reference_end|> | arxiv | @article{liang2007secrecy,
title={Secrecy Capacity Region of Binary and Gaussian Multiple Access Channels},
author={Yingbin Liang and H. Vincent Poor},
journal={arXiv preprint arXiv:0708.2732},
year={2007},
archivePrefix={arXiv},
eprint={0708.2732},
primaryClass={cs.IT math.IT}
} | liang2007secrecy |
arxiv-1015 | 0708.2733 | Secure Communications over Fading Channels | <|reference_start|>Secure Communications over Fading Channels: The fading wire-tap channel is investigated, where the source-to-destination channel and the source-to-wire-tapper channel are corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information is assumed to be known at both the transmitter and the receiver. The parallel wire-tap channel with independent subchannels is first studied, which serves as an information-theoretic model for the fading wire-tap channel. The secrecy capacity of the parallel wire-tap channel is established. This result is then specialized to give the secrecy capacity of the fading wire-tap channel, which is achieved with the source node dynamically changing the power allocation according to the channel state realization. An optimal source power allocation is obtained to achieve the secrecy capacity.<|reference_end|> | arxiv | @article{liang2007secure,
title={Secure Communications over Fading Channels},
author={Yingbin Liang and H. Vincent Poor},
journal={arXiv preprint arXiv:0708.2733},
year={2007},
archivePrefix={arXiv},
eprint={0708.2733},
primaryClass={cs.IT math.IT}
} | liang2007secure |
arxiv-1016 | 0708.2784 | On a linear code from a configuration of affine lines | <|reference_start|>On a linear code from a configuration of affine lines: We will show how to obtain a linear code from a configuration of affine lines in general position and a suitable set of rational points. We will also explain a new decoding algorithm based on the configuration, which seems to be quite effective.<|reference_end|> | arxiv | @article{sugiyama2007on,
title={On a linear code from a configuration of affine lines},
author={Ken-ichi Sugiyama},
journal={arXiv preprint arXiv:0708.2784},
year={2007},
archivePrefix={arXiv},
eprint={0708.2784},
primaryClass={cs.IT cs.DM math.AG math.IT}
} | sugiyama2007on |
arxiv-1017 | 0708.2788 | Integrating users' needs into multimedia information retrieval system | <|reference_start|>Integrating users' needs into multimedia information retrieval system: The exponential growth of multimedia information and the development of various communication media generated new problems at various levels including the rate of flow of information, problems of storage and management. The difficulty which arises is no longer the existence of information but rather the access to this information. When designing multimedia information retrieval system, it is appropriate to bear in mind the potential users and their information needs. We assumed that multimedia information representation which takes into account explicitly the users' needs and the cases of use could contribute to the adaptation potentials of the system for the end-users. We believe also that responses of multimedia information system would be more relevant to the users' needs if the types of results to be used from the system were identified before the design and development of the system. We propose the integration of the users' information needs. More precisely integrating usage contexts of resulting information in an information system (during creation and feedback) should enhance more pertinent users' need. The first section of this study is dedicated to traditional multimedia information systems and specifically the approaches of representing multimedia information. Taking into account the dynamism of users, these approaches do not permit the explicit integration of the users' information needs. In this paper, we will present our proposals based on economic intelligence approach. This approach emphasizes the importance of starting any process of information retrieval witch the user information need.<|reference_end|> | arxiv | @article{maghrebi2007integrating,
title={Integrating users' needs into multimedia information retrieval system},
author={Han`ene Maghrebi (LORIA), Amos David (LORIA)},
journal={Dans Third international conference on computer (2007)},
year={2007},
archivePrefix={arXiv},
eprint={0708.2788},
primaryClass={cs.IR}
} | maghrebi2007integrating |
arxiv-1018 | 0708.2804 | On Fast-Decodable Space-Time Block Codes | <|reference_start|>On Fast-Decodable Space-Time Block Codes: We focus on full-rate, fast-decodable space-time block codes (STBCs) for 2x2 and 4x2 multiple-input multiple-output (MIMO) transmission. We first derive conditions for reduced-complexity maximum-likelihood decoding, and apply them to a unified analysis of two families of 2x2 STBCs that were recently proposed. In particular, we describe a reduced-complexity sphere decoding algorithm suitable for QAM signal constellations. Next, we derive a novel reduced-complexity 4x2 STBC, and show that it outperforms all previously known codes with certain constellations.<|reference_end|> | arxiv | @article{biglieri2007on,
title={On Fast-Decodable Space-Time Block Codes},
author={Ezio Biglieri, Yi Hong, Emanuele Viterbo},
journal={arXiv preprint arXiv:0708.2804},
year={2007},
archivePrefix={arXiv},
eprint={0708.2804},
primaryClass={cs.IT math.IT}
} | biglieri2007on |
arxiv-1019 | 0708.2843 | The Impossibility Of Secure Two-Party Classical Computation | <|reference_start|>The Impossibility Of Secure Two-Party Classical Computation: We present attacks that show that unconditionally secure two-party classical computation is impossible for many classes of function. Our analysis applies to both quantum and relativistic protocols. We illustrate our results by showing the impossibility of oblivious transfer.<|reference_end|> | arxiv | @article{colbeck2007the,
title={The Impossibility Of Secure Two-Party Classical Computation},
author={Roger Colbeck},
journal={Physical Review A 76, 062308 (2007)},
year={2007},
doi={10.1103/PhysRevA.76.062308},
archivePrefix={arXiv},
eprint={0708.2843},
primaryClass={quant-ph cs.CR}
} | colbeck2007the |
arxiv-1020 | 0708.2854 | Algorithmic Semi-algebraic Geometry and Topology -- Recent Progress and Open Problems | <|reference_start|>Algorithmic Semi-algebraic Geometry and Topology -- Recent Progress and Open Problems: We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms for computing the Betti numbers of semi-algebraic sets. Aside from describing these results, we discuss briefly the background as well as the importance of these problems, and also describe the main tools from algorithmic semi-algebraic geometry, as well as algebraic topology, which make these advances possible. We end with a list of open problems.<|reference_end|> | arxiv | @article{basu2007algorithmic,
title={Algorithmic Semi-algebraic Geometry and Topology -- Recent Progress and
Open Problems},
author={Saugata Basu},
journal={arXiv preprint arXiv:0708.2854},
year={2007},
archivePrefix={arXiv},
eprint={0708.2854},
primaryClass={math.GT cs.CC cs.CG math.AG math.AT}
} | basu2007algorithmic |
arxiv-1021 | 0708.2893 | Fast Recursive Coding Based on Grouping of Symbols | <|reference_start|>Fast Recursive Coding Based on Grouping of Symbols: A novel fast recursive coding technique is proposed. It operates with only integer values not longer 8 bits and is multiplication free. Recursion the algorithm is based on indirectly provides rather effective coding of symbols for very large alphabets. The code length for the proposed technique can be up to 20-30% less than for arithmetic coding and, in the worst case it is only by 1-3% larger.<|reference_end|> | arxiv | @article{ponomarenko2007fast,
title={Fast Recursive Coding Based on Grouping of Symbols},
author={Nikolay Ponomarenko, Vladimir Lukin, Karen Egiazarian, Jaakko Astola,
Boris Y Ryabko},
journal={arXiv preprint arXiv:0708.2893},
year={2007},
archivePrefix={arXiv},
eprint={0708.2893},
primaryClass={cs.IT math.IT}
} | ponomarenko2007fast |
arxiv-1022 | 0708.2911 | Optimal Sequential Frame Synchronization | <|reference_start|>Optimal Sequential Frame Synchronization: We consider the `one-shot frame synchronization problem' where a decoder wants to locate a sync pattern at the output of a channel on the basis of sequential observations. We assume that the sync pattern of length N starts being emitted at a random time within some interval of size A, that characterizes the asynchronism level between the transmitter and the receiver. We show that a sequential decoder can optimally locate the sync pattern, i.e., exactly, without delay, and with probability approaching one as N tends to infinity, if and only if the asynchronism level grows as O(exp(N*k)), with k below the `synchronization threshold,' a constant that admits a simple expression depending on the channel. This constant is the same as the one that characterizes the limit for reliable asynchronous communication, as was recently reported by the authors. If k exceeds the synchronization threshold, any decoder, sequential or non-sequential, locates the sync pattern with an error that tends to one as N tends to infinity. Hence, a sequential decoder can locate a sync pattern as well as the (non-sequential) maximum likelihood decoder that operates on the basis of output sequences of maximum length A+N-1, but with much fewer observations.<|reference_end|> | arxiv | @article{chandar2007optimal,
title={Optimal Sequential Frame Synchronization},
author={Venkat Chandar, Aslan Tchamkerten, Gregory Wornell},
journal={arXiv preprint arXiv:0708.2911},
year={2007},
archivePrefix={arXiv},
eprint={0708.2911},
primaryClass={cs.IT math.IT}
} | chandar2007optimal |
arxiv-1023 | 0708.2936 | Priority Queue Based on Multilevel Prefix Tree | <|reference_start|>Priority Queue Based on Multilevel Prefix Tree: Tree structures are very often used data structures. Among ordered types of trees there are many variants whose basic operations such as insert, delete, search, delete-min are characterized by logarithmic time complexity. In the article I am going to present the structure whose time complexity for each of the above operations is $O(\frac{M}{K} + K)$, where M is the size of data type and K is constant properly matching the size of data type. Properly matched K will make the structure function as a very effective Priority Queue. The structure size linearly depends on the number and size of elements. PTrie is a clever combination of the idea of prefix tree -- Trie, structure of logarithmic time complexity for insert and remove operations, doubly linked list and queues.<|reference_end|> | arxiv | @article{planeta2007priority,
title={Priority Queue Based on Multilevel Prefix Tree},
author={David S. Planeta},
journal={arXiv preprint arXiv:0708.2936},
year={2007},
number={TR2006-2023},
archivePrefix={arXiv},
eprint={0708.2936},
primaryClass={cs.DS}
} | planeta2007priority |
arxiv-1024 | 0708.2974 | The Fuzzy Vault for fingerprints is Vulnerable to Brute Force Attack | <|reference_start|>The Fuzzy Vault for fingerprints is Vulnerable to Brute Force Attack: The \textit{fuzzy vault} approach is one of the best studied and well accepted ideas for binding cryptographic security into biometric authentication. The vault has been implemented in connection with fingerprint data by Uludag and Jain. We show that this instance of the vault is vulnerable to brute force attack. An interceptor of the vault data can recover both secret and template data using only generally affordable computational resources. Some possible alternatives are then discussed and it is suggested that cryptographic security may be preferable to the one - way function approach to biometric security.<|reference_end|> | arxiv | @article{mihailescu2007the,
title={The Fuzzy Vault for fingerprints is Vulnerable to Brute Force Attack},
author={Preda Mihailescu},
journal={arXiv preprint arXiv:0708.2974},
year={2007},
archivePrefix={arXiv},
eprint={0708.2974},
primaryClass={cs.CV cs.CR}
} | mihailescu2007the |
arxiv-1025 | 0708.3014 | Explicit formulas for efficient multiplication in F_3^6m | <|reference_start|>Explicit formulas for efficient multiplication in F_3^6m: Efficient computation of the Tate pairing is an important part of pairing-based cryptography. Recently with the introduction of the Duursma-Lee method special attention has been given to the fields of characteristic 3. Especially multiplication in F_{3^{6m}}, where m is prime, is an important operation in the above method. In this paper we propose a new method to reduce the number of F_{3^m} multiplications for multiplication in F_{3^{6m}} from 18 in recent implementations to 15. The method is based on the fast Fourier tranmsform and explicit formulas are given. The execution times of our software implementations for F_{3^{6m}} show the efficiency of our results.<|reference_end|> | arxiv | @article{gorla2007explicit,
title={Explicit formulas for efficient multiplication in F_{3^{6m}}},
author={Elisa Gorla, Christoph Puttmann, and Jamshid Shokrollahi},
journal={arXiv preprint arXiv:0708.3014},
year={2007},
archivePrefix={arXiv},
eprint={0708.3014},
primaryClass={cs.CR cs.CC}
} | gorla2007explicit |
arxiv-1026 | 0708.3019 | Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent Cooperative Networks | <|reference_start|>Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent Cooperative Networks: Space-time block codes (STBCs) that are single-symbol decodable (SSD) in a co-located multiple antenna setting need not be SSD in a distributed cooperative communication setting. A relay network with N relays and a single source-destination pair is called a partially-coherent relay channel (PCRC) if the destination has perfect channel state information (CSI) of all the channels and the relays have only the phase information of the source-to-relay channels. In this paper, first, a new set of necessary and sufficient conditions for a STBC to be SSD for co-located multiple antenna communication is obtained. Then, this is extended to a set of necessary and sufficient conditions for a distributed STBC (DSTBC) to be SSD for a PCRC, by identifying the additional conditions. Using this, several SSD DSTBCs for PCRC are identified among the known classes of STBCs. It is proved that even if a SSD STBC for a co-located MIMO channel does not satisfy the additional conditions for the code to be SSD for a PCRC, single-symbol decoding of it in a PCRC gives full-diversity and only coding gain is lost. It is shown that when a DSTBC is SSD for a PCRC, then arbitrary coordinate interleaving of the in-phase and quadrature-phase components of the variables does not disturb its SSD property for PCRC. Finally, it is shown that the possibility of {\em channel phase compensation} operation at the relay nodes using partial CSI at the relays increases the possible rate of SSD DSTBCs from $\frac{2}{N}$ when the relays do not have CSI to 1/2, which is independent of N.<|reference_end|> | arxiv | @article{sreedhar2007single-symbol,
title={Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent
Cooperative Networks},
author={D. Sreedhar, A. Chockalingam, B. Sundar Rajan},
journal={arXiv preprint arXiv:0708.3019},
year={2007},
archivePrefix={arXiv},
eprint={0708.3019},
primaryClass={cs.IT math.IT}
} | sreedhar2007single-symbol |
arxiv-1027 | 0708.3022 | Efficient FPGA-based multipliers for F_3^97 and F_3^6*97 | <|reference_start|>Efficient FPGA-based multipliers for F_3^97 and F_3^6*97: In this work we present a new structure for multiplication in finite fields. This structure is based on a digit-level LFSR (Linear Feedback Shift Register) multiplier in which the area of digit-multipliers are reduced using the Karatsuba method. We compare our results with the other works in the literature for F_{3^97}. We also propose new formulas for multiplication in F_{3^{6*97}}. These new formulas reduce the number of F_{3^97}-multiplications from 18 to 15. The fields F_{3^{97}} and F_{3^{6*97}} are relevant in the context of pairing-based cryptography.<|reference_end|> | arxiv | @article{shokrollahi2007efficient,
title={Efficient FPGA-based multipliers for F_{3^97} and F_{3^{6*97}}},
author={Jamshid Shokrollahi, Elisa Gorla, Christoph Puttmann},
journal={arXiv preprint arXiv:0708.3022},
year={2007},
archivePrefix={arXiv},
eprint={0708.3022},
primaryClass={cs.CR}
} | shokrollahi2007efficient |
arxiv-1028 | 0708.3048 | Identifying Small Mean Reverting Portfolios | <|reference_start|>Identifying Small Mean Reverting Portfolios: Given multivariate time series, we study the problem of forming portfolios with maximum mean reversion while constraining the number of assets in these portfolios. We show that it can be formulated as a sparse canonical correlation analysis and study various algorithms to solve the corresponding sparse generalized eigenvalue problems. After discussing penalized parameter estimation procedures, we study the sparsity versus predictability tradeoff and the impact of predictability in various markets.<|reference_end|> | arxiv | @article{d'aspremont2007identifying,
title={Identifying Small Mean Reverting Portfolios},
author={Alexandre d'Aspremont},
journal={arXiv preprint arXiv:0708.3048},
year={2007},
archivePrefix={arXiv},
eprint={0708.3048},
primaryClass={cs.CE}
} | d'aspremont2007identifying |
arxiv-1029 | 0708.3057 | Voice Service Support in Mobile Ad Hoc Networks | <|reference_start|>Voice Service Support in Mobile Ad Hoc Networks: Mobile ad hoc networks are expected to support voice traffic. The requirement for small delay and jitter of voice traffic poses a significant challenge for medium access control (MAC) in such networks. User mobility makes it more complex due to the associated dynamic path attenuation. In this paper, a MAC scheme for mobile ad hoc networks supporting voice traffic is proposed. With the aid of a low-power probe prior to DATA transmissions, resource reservation is achieved in a distributed manner, thus leading to small delay and jitter. The proposed scheme can automatically adapt to dynamic path attenuation in a mobile environment. Simulation results demonstrate the effectiveness of the proposed scheme.<|reference_end|> | arxiv | @article{jiang2007voice,
title={Voice Service Support in Mobile Ad Hoc Networks},
author={Hai Jiang, Ping Wang, H. Vincent Poor, and Weihua Zhuang},
journal={arXiv preprint arXiv:0708.3057},
year={2007},
doi={10.1109/GLOCOM.2007.186},
archivePrefix={arXiv},
eprint={0708.3057},
primaryClass={cs.IT cs.NI math.IT}
} | jiang2007voice |
arxiv-1030 | 0708.3070 | Network Coding Capacity of Random Wireless Networks under a Signal-to-Interference-and-Noise Model | <|reference_start|>Network Coding Capacity of Random Wireless Networks under a Signal-to-Interference-and-Noise Model: In this paper, we study network coding capacity for random wireless networks. Previous work on network coding capacity for wired and wireless networks have focused on the case where the capacities of links in the network are independent. In this paper, we consider a more realistic model, where wireless networks are modeled by random geometric graphs with interference and noise. In this model, the capacities of links are not independent. We consider two scenarios, single source multiple destinations and multiple sources multiple destinations. In the first scenario, employing coupling and martingale methods, we show that the network coding capacity for random wireless networks still exhibits a concentration behavior around the mean value of the minimum cut under some mild conditions. Furthermore, we establish upper and lower bounds on the network coding capacity for dependent and independent nodes. In the second one, we also show that the network coding capacity still follows a concentration behavior. Our simulation results confirm our theoretical predictions.<|reference_end|> | arxiv | @article{kong2007network,
title={Network Coding Capacity of Random Wireless Networks under a
Signal-to-Interference-and-Noise Model},
author={Zhenning Kong, Salah A. Aly, Emina Soljanin, Edmund M. Yeh and Andreas
Klappenecker},
journal={arXiv preprint arXiv:0708.3070},
year={2007},
archivePrefix={arXiv},
eprint={0708.3070},
primaryClass={cs.IT math.IT}
} | kong2007network |
arxiv-1031 | 0708.3127 | Question on Conditional Entropy | <|reference_start|>Question on Conditional Entropy: The problems of conditional entropy's definition and the formula to compute conditional entropy are analyzed from various perspectives, and the corrected computing formula is presented. Examples are given to prove the conclusion that conditional entropy never be increased is not absolute, thus the representation that information is to decrease uncertainty in the definition of information is not absolutely correct.<|reference_end|> | arxiv | @article{yong2007question,
title={Question on Conditional Entropy},
author={Wang Yong},
journal={arXiv preprint arXiv:0708.3127},
year={2007},
archivePrefix={arXiv},
eprint={0708.3127},
primaryClass={cs.IT math.IT}
} | yong2007question |
arxiv-1032 | 0708.3166 | Web Server Benchmark Application WiiBench using Erlang/OTP R11 and Fedora-Core Linux 50 | <|reference_start|>Web Server Benchmark Application WiiBench using Erlang/OTP R11 and Fedora-Core Linux 50: 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.<|reference_end|> | arxiv | @article{mutiara2007web,
title={Web Server Benchmark Application WiiBench using Erlang/OTP R11 and
Fedora-Core Linux 5.0},
author={A. B. Mutiara and T. A. Sabastian},
journal={arXiv preprint arXiv:0708.3166},
year={2007},
archivePrefix={arXiv},
eprint={0708.3166},
primaryClass={cs.NI}
} | mutiara2007web |
arxiv-1033 | 0708.3220 | Optimal strategies in the average consensus problem | <|reference_start|>Optimal strategies in the average consensus problem: We prove that for a set of communicating agents to compute the average of their initial positions (average consensus problem), the optimal topology of communication is given by a de Bruijn's graph. Consensus is then reached in a finitely many steps. A more general family of strategies, constructed by block Kronecker products, is investigated and compared to Cayley strategies.<|reference_end|> | arxiv | @article{delvenne2007optimal,
title={Optimal strategies in the average consensus problem},
author={Jean-Charles Delvenne, Ruggero Carli and Sandro Zampieri},
journal={arXiv preprint arXiv:0708.3220},
year={2007},
archivePrefix={arXiv},
eprint={0708.3220},
primaryClass={cs.MA cs.NI math.OC}
} | delvenne2007optimal |
arxiv-1034 | 0708.3224 | The Frobenius Problem in a Free Monoid | <|reference_start|>The Frobenius Problem in a Free Monoid: The classical Frobenius problem is to compute the largest number g not representable as a non-negative integer linear combination of non-negative integers x_1, x_2, ..., x_k, where gcd(x_1, x_2, ..., x_k) = 1. In this paper we consider generalizations of the Frobenius problem to the noncommutative setting of a free monoid. Unlike the commutative case, where the bound on g is quadratic, we are able to show exponential or subexponential behavior for an analogue of g, depending on the particular measure chosen.<|reference_end|> | arxiv | @article{kao2007the,
title={The Frobenius Problem in a Free Monoid},
author={Jui-Yi Kao, Jeffrey Shallit, Zhi Xu},
journal={arXiv preprint arXiv:0708.3224},
year={2007},
archivePrefix={arXiv},
eprint={0708.3224},
primaryClass={cs.DM math.CO}
} | kao2007the |
arxiv-1035 | 0708.3226 | A Dichotomy Theorem for General Minimum Cost Homomorphism Problem | <|reference_start|>A Dichotomy Theorem for General Minimum Cost Homomorphism Problem: In the constraint satisfaction problem ($CSP$), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost homomorphism problem ($MinHom$), one is additionally given weights $c_{va}$ for every variable $v$ and value $a$, and the aim is to find an assignment $f$ to the variables that minimizes $\sum_{v} c_{vf(v)}$. Let $MinHom(\Gamma)$ denote the $MinHom$ problem parameterized by the set of predicates allowed for constraints. $MinHom(\Gamma)$ is related to many well-studied combinatorial optimization problems, and concrete applications can be found in, for instance, defence logistics and machine learning. We show that $MinHom(\Gamma)$ can be studied by using algebraic methods similar to those used for CSPs. With the aid of algebraic techniques, we classify the computational complexity of $MinHom(\Gamma)$ for all choices of $\Gamma$. Our result settles a general dichotomy conjecture previously resolved only for certain classes of directed graphs, [Gutin, Hell, Rafiey, Yeo, European J. of Combinatorics, 2008].<|reference_end|> | arxiv | @article{takhanov2007a,
title={A Dichotomy Theorem for General Minimum Cost Homomorphism Problem},
author={Rustem Takhanov},
journal={arXiv preprint arXiv:0708.3226},
year={2007},
archivePrefix={arXiv},
eprint={0708.3226},
primaryClass={cs.LG cs.CC}
} | takhanov2007a |
arxiv-1036 | 0708.3230 | Can Alice and Bob be random: a study on human playing zero knowledge protocols | <|reference_start|>Can Alice and Bob be random: a study on human playing zero knowledge protocols: The research described in this abstract was initiated by discussions between the author and Giovanni Di Crescenzo in Barcelona in early 2004. It was during Advanced Course on Contemporary Cryptology that Di Crescenzo gave a course on zero knowledge protocols (ZKP), see [1]. After that course we started to play with unorthodox ideas for breaking ZKP, especially one based on graph 3-coloring. It was chosen for investigation because it is being considered as a "benchmark" ZKP, see [2], [3]. At this point we briefly recall such a protocol's description.<|reference_end|> | arxiv | @article{kulesza2007can,
title={Can Alice and Bob be random: a study on human playing zero knowledge
protocols},
author={Kamil Kulesza},
journal={arXiv preprint arXiv:0708.3230},
year={2007},
archivePrefix={arXiv},
eprint={0708.3230},
primaryClass={cs.CR cs.CY}
} | kulesza2007can |
arxiv-1037 | 0708.3259 | Fast evaluation of union-intersection expressions | <|reference_start|>Fast evaluation of union-intersection expressions: We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient way. This problem has applications in e.g. information retrieval and database systems. We mainly consider the RAM model of computation, and sets of machine words, but also state our results in the I/O model. On a RAM with word size $w$, a special case of our result is that the intersection of $m$ (preprocessed) sets, containing $n$ elements in total, can be computed in expected time $O(n (\log w)^2 / w + km)$, where $k$ is the number of elements in the intersection. If the first of the two terms dominates, this is a factor $w^{1-o(1)}$ faster than the standard solution of merging sorted lists. We show a cell probe lower bound of time $\Omega(n/(w m \log m)+ (1-\tfrac{\log k}{w}) k)$, meaning that our upper bound is nearly optimal for small $m$. Our algorithm uses a novel combination of approximate set representations and word-level parallelism.<|reference_end|> | arxiv | @article{bille2007fast,
title={Fast evaluation of union-intersection expressions},
author={Philip Bille, Anna Pagh, Rasmus Pagh},
journal={arXiv preprint arXiv:0708.3259},
year={2007},
archivePrefix={arXiv},
eprint={0708.3259},
primaryClass={cs.DS cs.DB cs.IR}
} | bille2007fast |
arxiv-1038 | 0708.3341 | Browsing through 3D representations of unstructured picture collections: an empirical study | <|reference_start|>Browsing through 3D representations of unstructured picture collections: an empirical study: The paper presents a 3D interactive representation of fairly large picture collections which facilitates browsing through unstructured sets of icons or pictures. Implementation of this representation implies choosing between two visualization strategies: users may either manipulate the view (OV) or be immersed in it (IV). The paper first presents this representation, then describes an empirical study (17 participants) aimed at assessing the utility and usability of each view. Subjective judgements in questionnaires and debriefings were varied: 7 participants preferred the IV view, 4 the OV one, and 6 could not choose between the two. Visual acuity and visual exploration strategies seem to have exerted a greater influence on participants' preferences than task performance or feeling of immersion.<|reference_end|> | arxiv | @article{christmann2007browsing,
title={Browsing through 3D representations of unstructured picture collections:
an empirical study},
author={Olivier Christmann (INRIA Rocquencourt / INRIA Lorraine - LORIA),
No"elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)},
journal={Dans Proceedings of ACM Working Conference on Advanced Visual
Interfaces (AVI 2006), Venezia, Italy, May 23-26, 2006 - ACM Working
Conference on Advanced Visual Interfaces (AVI 2006), Venezia : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0708.3341},
primaryClass={cs.HC}
} | christmann2007browsing |
arxiv-1039 | 0708.3381 | Architecture Optimization of a 3-DOF Translational Parallel Mechanism for Machining Applications, the Orthoglide | <|reference_start|>Architecture Optimization of a 3-DOF Translational Parallel Mechanism for Machining Applications, the Orthoglide: This paper addresses the architecture optimization of a 3-DOF translational parallel mechanism designed for machining applications. The design optimization is conducted on the basis of a prescribed Cartesian workspace with prescribed kinetostatic performances. The resulting machine, the Orthoglide, features three fixed parallel linear joints which are mounted orthogonally and a mobile platform which moves in the Cartesian x-y-z space with fixed orientation. The interesting features of the Orthoglide are a regular Cartesian workspace shape, uniform performances in all directions and good compactness. A small-scale prototype of the Orthoglide under development is presented at the end of this paper.<|reference_end|> | arxiv | @article{chablat2007architecture,
title={Architecture Optimization of a 3-DOF Translational Parallel Mechanism
for Machining Applications, the Orthoglide},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={IEEE Transactions on Robotics and Automation 19, 3 (2003) 403-410},
year={2007},
archivePrefix={arXiv},
eprint={0708.3381},
primaryClass={cs.RO}
} | chablat2007architecture |
arxiv-1040 | 0708.3387 | The Impact of Noise Correlation and Channel Phase Information on the Data-Rate of the Single-Symbol ML Decodable Distributed STBCs | <|reference_start|>The Impact of Noise Correlation and Channel Phase Information on the Data-Rate of the Single-Symbol ML Decodable Distributed STBCs: Very recently, we proposed the row-monomial distributed orthogonal space-time block codes (DOSTBCs) and showed that the row-monomial DOSTBCs achieved approximately twice higher bandwidth efficiency than the repetitionbased cooperative strategy [1]. However, we imposed two limitations on the row-monomial DOSTBCs. The first one was that the associated matrices of the codes must be row-monomial. The other was the assumption that the relays did not have any channel state information (CSI) of the channels from the source to the relays, although this CSI could be readily obtained at the relays without any additional pilot signals or any feedback overhead. In this paper, we first remove the row-monomial limitation; but keep the CSI limitation. In this case, we derive an upper bound of the data-rate of the DOSTBC and it is larger than that of the row-monomial DOSTBCs in [1]. Secondly, we abandon the CSI limitation; but keep the row-monomial limitation. Specifically, we propose the row-monomial DOSTBCs with channel phase information (DOSTBCs-CPI) and derive an upper bound of the data-rate of those codes. The rowmonomial DOSTBCs-CPI have higher data-rate than the DOSTBCs and the row-monomial DOSTBCs. Furthermore, we find the actual row-monomial DOSTBCs-CPI which achieve the upper bound of the data-rate.<|reference_end|> | arxiv | @article{yi2007the,
title={The Impact of Noise Correlation and Channel Phase Information on the
Data-Rate of the Single-Symbol ML Decodable Distributed STBCs},
author={Zhihang Yi and Il-Min Kim},
journal={arXiv preprint arXiv:0708.3387},
year={2007},
archivePrefix={arXiv},
eprint={0708.3387},
primaryClass={cs.IT math.IT}
} | yi2007the |
arxiv-1041 | 0708.3408 | Linear Time Algorithms Based on Multilevel Prefix Tree for Finding Shortest Path with Positive Weights and Minimum Spanning Tree in a Networks | <|reference_start|>Linear Time Algorithms Based on Multilevel Prefix Tree for Finding Shortest Path with Positive Weights and Minimum Spanning Tree in a Networks: In this paper I present general outlook on questions relevant to the basic graph algorithms; Finding the Shortest Path with Positive Weights and Minimum Spanning Tree. I will show so far known solution set of basic graph problems and present my own. My solutions to graph problems are characterized by their linear worst-case time complexity. It should be noticed that the algorithms which compute the Shortest Path and Minimum Spanning Tree problems not only analyze the weight of arcs (which is the main and often the only criterion of solution hitherto known algorithms) but also in case of identical path weights they select this path which walks through as few vertices as possible. I have presented algorithms which use priority queue based on multilevel prefix tree -- PTrie. PTrie is a clever combination of the idea of prefix tree -- Trie, the structure of logarithmic time complexity for insert and remove operations, doubly linked list and queues. In C++ I will implement linear worst-case time algorithm computing the Single-Destination Shortest-Paths problem and I will explain its usage.<|reference_end|> | arxiv | @article{planeta2007linear,
title={Linear Time Algorithms Based on Multilevel Prefix Tree for Finding
Shortest Path with Positive Weights and Minimum Spanning Tree in a Networks},
author={David S. Planeta},
journal={arXiv preprint arXiv:0708.3408},
year={2007},
number={Cornell University TR2006-2043},
archivePrefix={arXiv},
eprint={0708.3408},
primaryClass={cs.DS}
} | planeta2007linear |
arxiv-1042 | 0708.3446 | Multi and Independent Block Approach in Public Cluster | <|reference_start|>Multi and Independent Block Approach in Public Cluster: We present extended multi block approach in the LIPI Public Cluster. The multi block approach enables a cluster to be divided into several independent blocks which run jobs owned by different users simultaneously. Previously, we have maintained the blocks using single master node for all blocks due to efficiency and resource limitations. Following recent advancements and expansion of node\'s number, we have modified the multi block approach with multiple master nodes, each of them is responsible for a single block. We argue that this approach improves the overall performance significantly, for especially data intensive computational works.<|reference_end|> | arxiv | @article{akbar2007multi,
title={Multi and Independent Block Approach in Public Cluster},
author={Z. Akbar and L.T. Handoko},
journal={arXiv preprint arXiv:0708.3446},
year={2007},
number={FISIKALIPI-07012},
archivePrefix={arXiv},
eprint={0708.3446},
primaryClass={cs.DC}
} | akbar2007multi |
arxiv-1043 | 0708.3463 | A Neural Networks Model of the Venezuelan Economy | <|reference_start|>A Neural Networks Model of the Venezuelan Economy: Besides an indicator of the GDP, the Central Bank of Venezuela generates the so called Monthly Economic Activity General Indicator. The a priori knowledge of this indicator, which represents and sometimes even anticipates the economy's fluctuations, could be helpful in developing public policies and in investment decision making. The purpose of this study is forecasting the IGAEM through non parametric methods, an approach that has proven effective in a wide variety of problems in economics and finance.<|reference_end|> | arxiv | @article{costanzo2007a,
title={A Neural Networks Model of the Venezuelan Economy},
author={Sabatino Costanzo, Loren Trigo, Luis Jimenez, Juan Gonzalez},
journal={arXiv preprint arXiv:0708.3463},
year={2007},
archivePrefix={arXiv},
eprint={0708.3463},
primaryClass={cs.CE cs.NE}
} | costanzo2007a |
arxiv-1044 | 0708.3464 | A Non Parametric Study of the Volatility of the Economy as a Country Risk Predictor | <|reference_start|>A Non Parametric Study of the Volatility of the Economy as a Country Risk Predictor: This paper intends to explain Venezuela's country spread behavior through the Neural Networks analysis of a monthly economic activity general index of economic indicators constructed by the Central Bank of Venezuela, a measure of the shocks affecting country risk of emerging markets and the U.S. short term interest rate. The use of non parametric methods allowed the finding of non linear relationship between these inputs and the country risk. The networks performance was evaluated using the method of excess predictability.<|reference_end|> | arxiv | @article{costanzo2007a,
title={A Non Parametric Study of the Volatility of the Economy as a Country
Risk Predictor},
author={Sabatino Costanzo, Loren Trigo, Ramses Dominguez, William Moreno},
journal={arXiv preprint arXiv:0708.3464},
year={2007},
archivePrefix={arXiv},
eprint={0708.3464},
primaryClass={cs.CE cs.NE}
} | costanzo2007a |
arxiv-1045 | 0708.3465 | An Early Warning System for Bankruptcy Prediction: lessons from the Venezuelan Bank Crisis | <|reference_start|>An Early Warning System for Bankruptcy Prediction: lessons from the Venezuelan Bank Crisis: During 1993-94 Venezuela experienced a severe banking crisis which ended up with 18 commercial banks intervened by the government. Here we develop an early warning system for detecting credit related bankruptcy through discriminant functions developed on financial and macroeconomic data predating the crisis. A robustness test performed on these functions shows high precision in error estimation. The model calibrated on pre-crisis data could detect abnormal financial tension in the late Banco Capital many months before it was intervened and liquidated.<|reference_end|> | arxiv | @article{trigo2007an,
title={An Early Warning System for Bankruptcy Prediction: lessons from the
Venezuelan Bank Crisis},
author={Loren Trigo, Sabatino Costanzo, Felix Gonzalez, Jose Llamozas},
journal={arXiv preprint arXiv:0708.3465},
year={2007},
archivePrefix={arXiv},
eprint={0708.3465},
primaryClass={cs.CE}
} | trigo2007an |
arxiv-1046 | 0708.3477 | The Church Synthesis Problem with Parameters | <|reference_start|>The Church Synthesis Problem with Parameters: For a two-variable formula ψ(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of an operator Y=F(X) such that ψ(X,F(X)) is universally valid over Nat. B\"{u}chi and Landweber proved that the Church synthesis problem is decidable; moreover, they showed that if there is an operator F that solves the Church Synthesis Problem, then it can also be solved by an operator defined by a finite state automaton or equivalently by an MLO formula. We investigate a parameterized version of the Church synthesis problem. In this version ψ might contain as a parameter a unary predicate P. We show that the Church synthesis problem for P is computable if and only if the monadic theory of <Nat,<,P> is decidable. We prove that the B\"{u}chi-Landweber theorem can be extended only to ultimately periodic parameters. However, the MLO-definability part of the B\"{u}chi-Landweber theorem holds for the parameterized version of the Church synthesis problem.<|reference_end|> | arxiv | @article{rabinovich2007the,
title={The Church Synthesis Problem with Parameters},
author={Alexander Rabinovich},
journal={Logical Methods in Computer Science, Volume 3, Issue 4 (November
14, 2007) lmcs:1233},
year={2007},
doi={10.2168/LMCS-3(4:9)2007},
archivePrefix={arXiv},
eprint={0708.3477},
primaryClass={cs.LO}
} | rabinovich2007the |
arxiv-1047 | 0708.3499 | Comparison of Tree-Child Phylogenetic Networks | <|reference_start|>Comparison of Tree-Child Phylogenetic Networks: Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of non-treelike evolutionary events, like recombination, hybridization, or lateral gene transfer. In this paper, we present and study a new class of phylogenetic networks, called tree-child phylogenetic networks, where every non-extant species has some descendant through mutation. We provide an injective representation of these networks as multisets of vectors of natural numbers, their path multiplicity vectors, and we use this representation to define a distance on this class and to give an alignment method for pairs of these networks. To the best of our knowledge, they are respectively the first true distance and the first alignment method defined on a meaningful class of phylogenetic networks strictly extending the class of phylogenetic trees. Simple, polynomial algorithms for reconstructing a tree-child phylogenetic network from its path multiplicity vectors, for computing the distance between two tree-child phylogenetic networks, and for aligning a pair of tree-child phylogenetic networks, are provided, and they have been implemented as a Perl package and a Java applet, and they are available at http://bioinfo.uib.es/~recerca/phylonetworks/mudistance<|reference_end|> | arxiv | @article{cardona2007comparison,
title={Comparison of Tree-Child Phylogenetic Networks},
author={Gabriel Cardona, Francesc Rossello, Gabriel Valiente},
journal={arXiv preprint arXiv:0708.3499},
year={2007},
archivePrefix={arXiv},
eprint={0708.3499},
primaryClass={q-bio.PE cs.CE cs.DM}
} | cardona2007comparison |
arxiv-1048 | 0708.3505 | Gaze as a Supplementary Modality for Interacting with Ambient Intelligence Environments | <|reference_start|>Gaze as a Supplementary Modality for Interacting with Ambient Intelligence Environments: 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.<|reference_end|> | arxiv | @article{gepner2007gaze,
title={Gaze as a Supplementary Modality for Interacting with Ambient
Intelligence Environments},
author={Daniel Gepner (INRIA Rocquencourt / INRIA Lorraine - LORIA),
J'er^ome Simonin (INRIA Rocquencourt / INRIA Lorraine - LORIA), No"elle
Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)},
journal={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)},
year={2007},
archivePrefix={arXiv},
eprint={0708.3505},
primaryClass={cs.HC}
} | gepner2007gaze |
arxiv-1049 | 0708.3522 | Bounding the Betti numbers and computing the Euler-Poincar\'e characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials | <|reference_start|>Bounding the Betti numbers and computing the Euler-Poincar\'e characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials: Let $\R$ be a real closed field, $ {\mathcal Q} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], $ with $ \deg_{Y}(Q) \leq 2, \deg_{X}(Q) \leq d, Q \in {\mathcal Q}, #({\mathcal Q})=m,$ and $ {\mathcal P} \subset \R[X_1,...,X_k] $ with $\deg_{X}(P) \leq d, P \in {\mathcal P}, #({\mathcal P})=s$, and $S \subset \R^{\ell+k}$ a semi-algebraic set defined by a Boolean formula without negations, with atoms $P=0, P \geq 0, P \leq 0, P \in {\mathcal P} \cup {\mathcal Q}$. We prove that the sum of the Betti numbers of $S$ is bounded by \[ \ell^2 (O(s+\ell+m)\ell d)^{k+2m}. \] This is a common generalization of previous results on bounding the Betti numbers of closed semi-algebraic sets defined by polynomials of degree $d$ and 2, respectively. We also describe an algorithm for computing the Euler-Poincar\'e characteristic of such sets, generalizing similar algorithms known before. The complexity of the algorithm is bounded by $(\ell s m d)^{O(m(m+k))}$.<|reference_end|> | arxiv | @article{basu2007bounding,
title={Bounding the Betti numbers and computing the Euler-Poincar\'e
characteristic of semi-algebraic sets defined by partly quadratic systems of
polynomials},
author={Saugata Basu, Dmitrii V. Pasechnik, Marie-Francoise Roy},
journal={J. European Math. Soc. 12(2010), 529-553},
year={2007},
doi={10.1137/070711141},
archivePrefix={arXiv},
eprint={0708.3522},
primaryClass={math.AG cs.SC math.AT math.GT}
} | basu2007bounding |
arxiv-1050 | 0708.3531 | Networked Multiple Description Estimation and Compression with Resource Scalability | <|reference_start|>Networked Multiple Description Estimation and Compression with Resource Scalability: We present a joint source-channel multiple description (JSC-MD) framework for resource-constrained network communications (e.g., sensor networks), in which one or many deprived encoders communicate a Markov source against bit errors and erasure errors to many heterogeneous decoders, some powerful and some deprived. To keep the encoder complexity at minimum, the source is coded into K descriptions by a simple multiple description quantizer (MDQ) with neither entropy nor channel coding. The code diversity of MDQ and the path diversity of the network are exploited by decoders to correct transmission errors and improve coding efficiency. A key design objective is resource scalability: powerful nodes in the network can perform JSC-MD distributed estimation/decoding under the criteria of maximum a posteriori probability (MAP) or minimum mean-square error (MMSE), while primitive nodes resort to simpler MD decoding, all working with the same MDQ code. The application of JSC-MD to distributed estimation of hidden Markov models in a sensor network is demonstrated. The proposed JSC-MD MAP estimator is an algorithm of the longest path in a weighted directed acyclic graph, while the JSC-MD MMSE decoder is an extension of the well-known forward-backward algorithm to multiple descriptions. Both algorithms simultaneously exploit the source memory, the redundancy of the fixed-rate MDQ, and the inter-description correlations. They outperform the existing hard-decision MDQ decoders by large margins (up to 8dB). For Gaussian Markov sources, the complexity of JSC-MD distributed MAP sequence estimation can be made as low as that of typical single description Viterbi-type algorithms.<|reference_end|> | arxiv | @article{wu2007networked,
title={Networked Multiple Description Estimation and Compression with Resource
Scalability},
author={Xiaolin Wu, Xiaohan Wang and Zhe Wang},
journal={arXiv preprint arXiv:0708.3531},
year={2007},
archivePrefix={arXiv},
eprint={0708.3531},
primaryClass={cs.IT math.IT}
} | wu2007networked |
arxiv-1051 | 0708.3564 | Deciding security properties for cryptographic protocols Application to key cycles | <|reference_start|>Deciding security properties for cryptographic protocols Application to key cycles: There is a large amount of work dedicated to the formal verification of security protocols. In this paper, we revisit and extend the NP-complete decision procedure for a bounded number of sessions. We use a, now standard, deducibility constraints formalism for modeling security protocols. Our first contribution is to give a simple set of constraint simplification rules, that allows to reduce any deducibility constraint system to a set of solved forms, representing all solutions (within the bound on sessions). As a consequence, we prove that deciding the existence of key cycles is NP-complete for a bounded number of sessions. The problem of key-cycles has been put forward by recent works relating computational and symbolic models. The so-called soundness of the symbolic model requires indeed that no key cycle (e.g., enc(k,k)) ever occurs in the execution of the protocol. Otherwise, stronger security assumptions (such as KDM-security) are required. We show that our decision procedure can also be applied to prove again the decidability of authentication-like properties and the decidability of a significant fragment of protocols with timestamps.<|reference_end|> | arxiv | @article{comon-lundh2007deciding,
title={Deciding security properties for cryptographic protocols. Application to
key cycles},
author={Hubert Comon-Lundh and V'eronique Cortier and Eugen Zalinescu},
journal={arXiv preprint arXiv:0708.3564},
year={2007},
archivePrefix={arXiv},
eprint={0708.3564},
primaryClass={cs.LO cs.CR}
} | comon-lundh2007deciding |
arxiv-1052 | 0708.3567 | On the Distortion of the Eigenvalue Spectrum in MIMO Amplify-and-Forward Multi-Hop Channels | <|reference_start|>On the Distortion of the Eigenvalue Spectrum in MIMO Amplify-and-Forward Multi-Hop Channels: Consider a wireless MIMO multi-hop channel with n_s non-cooperating source antennas and n_d fully cooperating destination antennas, as well as L clusters containing k non-cooperating relay antennas each. The source signal traverses all L clusters of relay antennas, before it reaches the destination. When relay antennas within the same cluster scale their received signals by the same constant before the retransmission, the equivalent channel matrix H relating the input signals at the source antennas to the output signals at the destination antennas is proportional to the product of channel matrices H_l, l=1,...,L+1, corresponding to the individual hops. We perform an asymptotic capacity analysis for this channel as follows: In a first instance we take the limits n_s->infty, n_d->infty and k->infty, but keep both n_s/n_d and k/n_d fixed. Then, we take the limits L->infty and k/n_d->infty. Requiring that the H_l's satisfy the conditions needed for the Marcenko-Pastur law, we prove that the capacity scales linearly in min{n_s,n_d}, as long as the ratio k/n_d scales at least linearly in L. Moreover, we show that up to a noise penalty and a pre-log factor the capacity of a point-to-point MIMO channel is approached, when this scaling is slightly faster than linear. Conversely, almost all spatial degrees of freedom vanish for less than linear scaling.<|reference_end|> | arxiv | @article{wagner2007on,
title={On the Distortion of the Eigenvalue Spectrum in MIMO Amplify-and-Forward
Multi-Hop Channels},
author={Joerg Wagner and Armin Wittneben},
journal={arXiv preprint arXiv:0708.3567},
year={2007},
archivePrefix={arXiv},
eprint={0708.3567},
primaryClass={cs.IT math.IT}
} | wagner2007on |
arxiv-1053 | 0708.3568 | A Polynomial-time Algorithm for Computing the Permanent in GF(3^q) | <|reference_start|>A Polynomial-time Algorithm for Computing the Permanent in GF(3^q): A polynomial-time algorithm for computing the permanent in any field of characteristic 3 is presented in this article. The principal objects utilized for that purpose are the Cauchy and Vandermonde matrices, the discriminant function and their generalizations of various types. Classical theorems on the permanent such as the Binet-Minc identity and Borchadt's formula are widely applied, while a special new technique involving the notion of limit re-defined for fields of finite characteristics and corresponding computational methods was developed in order to deal with a number of polynomial-time reductions. All the constructions preserve a strictly algebraic nature ignoring the structure of the basic field, while applying its infinite extensions for calculating limits. A natural corollary of the polynomial-time computability of the permanent in a field of a characteristic different from 2 is the non-uniform equality between the complexity classes P and NP what is equivalent to RP=NP (Ref. [1]).<|reference_end|> | arxiv | @article{tarin2007a,
title={A Polynomial-time Algorithm for Computing the Permanent in GF(3^q)},
author={Vadim Tarin},
journal={arXiv preprint arXiv:0708.3568},
year={2007},
archivePrefix={arXiv},
eprint={0708.3568},
primaryClass={cs.CC}
} | tarin2007a |
arxiv-1054 | 0708.3573 | On the Outage Capacity of a Practical Decoder Accounting for Channel Estimation Inaccuracies | <|reference_start|>On the Outage Capacity of a Practical Decoder Accounting for Channel Estimation Inaccuracies: The optimal decoder achieving the outage capacity under imperfect channel estimation is investigated. First, by searching into the family of nearest neighbor decoders, which can be easily implemented on most practical coded modulation systems, we derive a decoding metric that minimizes the average of the transmission error probability over all channel estimation errors. Next, we specialize our general expression to obtain the corresponding decoding metric for fading MIMO channels. According to the notion of estimation-induced outage (EIO) capacity introduced in our previous work and assuming no channel state information (CSI) at the transmitter, we characterize maximal achievable information rates, using Gaussian codebooks, associated to the proposed decoder. In the case of uncorrelated Rayleigh fading, these achievable rates are compared to the rates achieved by the classical mismatched maximum-likelihood (ML) decoder and the ultimate limits given by the EIO capacity. Numerical results show that the derived metric provides significant gains for the considered scenario, in terms of achievable information rates and bit error rate (BER), in a bit interleaved coded modulation (BICM) framework, without introducing any additional decoding complexity.<|reference_end|> | arxiv | @article{piantanida2007on,
title={On the Outage Capacity of a Practical Decoder Accounting for Channel
Estimation Inaccuracies},
author={Pablo Piantanida, Sajad Sadough and Pierre Duhamel},
journal={arXiv preprint arXiv:0708.3573},
year={2007},
doi={10.1109/TCOMM.2009.070353},
archivePrefix={arXiv},
eprint={0708.3573},
primaryClass={cs.IT math.IT}
} | piantanida2007on |
arxiv-1055 | 0708.3575 | How really effective are Multimodal Hints in enhancing Visual Target Spotting? Some evidence from a usability study | <|reference_start|>How really effective are Multimodal Hints in enhancing Visual Target Spotting? Some evidence from a usability study: The main aim of the work presented here is to contribute to computer science advances in the multimodal usability area, in-as-much as it addresses one of the major issues relating to the generation of effective oral system messages: how to design messages which effectively help users to locate specific graphical objects in information visualisations? An experimental study was carried out to determine whether oral messages including coarse information on the locations of graphical objects on the current display may facilitate target detection tasks sufficiently for making it worth while to integrate such messages in GUIs. The display spatial layout varied in order to test the influence of visual presentation structure on the contribution of these messages to facilitating visual search on crowded displays. Finally, three levels of task difficulty were defined, based mainly on the target visual complexity and the number of distractors in the scene. The findings suggest that spatial information messages improve participants' visual search performances significantly; they are more appropriate to radial structures than to matrix, random and elleptic structures; and, they are particularly useful for performing difficult visual search tasks.<|reference_end|> | arxiv | @article{kieffer2007how,
title={How really effective are Multimodal Hints in enhancing Visual Target
Spotting? Some evidence from a usability study},
author={Suzanne Kieffer (INRIA Rocquencourt / INRIA Lorraine - LORIA),
No"elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)},
journal={Journal on Multimodal Interaction (JMUI), 1 (2007) 1-9},
year={2007},
archivePrefix={arXiv},
eprint={0708.3575},
primaryClass={cs.HC}
} | kieffer2007how |
arxiv-1056 | 0708.3580 | Ambient Multimodality: an Asset for Developing Universal Access to the Information Society | <|reference_start|>Ambient Multimodality: an Asset for Developing Universal Access to the Information Society: 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..<|reference_end|> | arxiv | @article{carbonell2007ambient,
title={Ambient Multimodality: an Asset for Developing Universal Access to the
Information Society},
author={No"elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)},
journal={3rd International Conference on Universal Access in Human-Computer
Interaction, Las Vegas : \'Etats-Unis d'Am\'erique (2005)},
year={2007},
archivePrefix={arXiv},
eprint={0708.3580},
primaryClass={cs.HC}
} | carbonell2007ambient |
arxiv-1057 | 0708.3582 | HORPO with Computability Closure : A Reconstruction | <|reference_start|>HORPO with Computability Closure : A Reconstruction: This paper provides a new, decidable definition of the higher- order recursive path ordering in which type comparisons are made only when needed, therefore eliminating the need for the computability clo- sure, and bound variables are handled explicitly, making it possible to handle recursors for arbitrary strictly positive inductive types.<|reference_end|> | arxiv | @article{blanqui2007horpo,
title={HORPO with Computability Closure : A Reconstruction},
author={Fr'ed'eric Blanqui (INRIA Lorraine - LORIA), Jean-Pierre Jouannaud
(LIX), Albert Rubio},
journal={Dans 14th International Conference on Logic for Programming
Artificial Intelligence and Reasoning LNCS (2007)},
year={2007},
archivePrefix={arXiv},
eprint={0708.3582},
primaryClass={cs.LO}
} | blanqui2007horpo |
arxiv-1058 | 0708.3607 | Parametric stiffness analysis of the Orthoglide | <|reference_start|>Parametric stiffness analysis of the Orthoglide: This paper presents a parametric stiffness analysis of the Orthoglide. A compliant modeling and a symbolic expression of the stiffness matrix are conducted. This allows a simple systematic analysis of the influence of the geometric design parameters and to quickly identify the critical link parameters. Our symbolic model is used to display the stiffest areas of the workspace for a specific machining task. Our approach can be applied to any parallel manipulator for which stiffness is a critical issue.<|reference_end|> | arxiv | @article{majou2007parametric,
title={Parametric stiffness analysis of the Orthoglide},
author={F'elix Majou (IRCCyN), Cl'ement Gosselin (Robotics Laboratory),
Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Journal of Mechanism and Machine Theory 42, 3 (2007) 296-311},
year={2007},
archivePrefix={arXiv},
eprint={0708.3607},
primaryClass={cs.RO}
} | majou2007parametric |
arxiv-1059 | 0708.3613 | Kinematics and Workspace Analysis of a Three-Axis Parallel Manipulator: the Orthoglide | <|reference_start|>Kinematics and Workspace Analysis of a Three-Axis Parallel Manipulator: the Orthoglide: 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.<|reference_end|> | arxiv | @article{pashkevich2007kinematics,
title={Kinematics and Workspace Analysis of a Three-Axis Parallel Manipulator:
the Orthoglide},
author={Anatoly Pashkevich (Robotic Laboratory), Damien Chablat (IRCCyN),
Philippe Wenger (IRCCyN)},
journal={Robotica 24, 1 (2006) 39-49},
year={2007},
archivePrefix={arXiv},
eprint={0708.3613},
primaryClass={cs.RO}
} | pashkevich2007kinematics |
arxiv-1060 | 0708.3628 | Recursive Structure and Bandwidth of Hales-Numbered Hypercube | <|reference_start|>Recursive Structure and Bandwidth of Hales-Numbered Hypercube: The Hales numbered $n$-dimensional hypercube and the corresponding adjacency matrix exhibit interesting recursive structures in $n$. These structures lead to a very simple proof of the well-known bandwidth formula for hypercube, whose proof was thought to be surprisingly difficult. A related problem called hypercube antibandwidth, for which Harper proposed an algorithm, is also reexamined in the light of the above recursive structures, and a close form solution is found.<|reference_end|> | arxiv | @article{wang2007recursive,
title={Recursive Structure and Bandwidth of Hales-Numbered Hypercube},
author={Xiaohan Wang and Xiaolin Wu},
journal={arXiv preprint arXiv:0708.3628},
year={2007},
archivePrefix={arXiv},
eprint={0708.3628},
primaryClass={cs.DM}
} | wang2007recursive |
arxiv-1061 | 0708.3696 | Relative-Error CUR Matrix Decompositions | <|reference_start|>Relative-Error CUR Matrix Decompositions: Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of ``components.'' Typically, these components are linear combinations of the rows and columns of the matrix, and are thus difficult to interpret in terms of the original features of the input data. In this paper, we propose and study matrix approximations that are explicitly expressed in terms of a small number of columns and/or rows of the data matrix, and thereby more amenable to interpretation in terms of the original data. Our main algorithmic results are two randomized algorithms which take as input an $m \times n$ matrix $A$ and a rank parameter $k$. In our first algorithm, $C$ is chosen, and we let $A'=CC^+A$, where $C^+$ is the Moore-Penrose generalized inverse of $C$. In our second algorithm $C$, $U$, $R$ are chosen, and we let $A'=CUR$. ($C$ and $R$ are matrices that consist of actual columns and rows, respectively, of $A$, and $U$ is a generalized inverse of their intersection.) For each algorithm, we show that with probability at least $1-\delta$: $$ ||A-A'||_F \leq (1+\epsilon) ||A-A_k||_F, $$ where $A_k$ is the ``best'' rank-$k$ approximation provided by truncating the singular value decomposition (SVD) of $A$. The number of columns of $C$ and rows of $R$ is a low-degree polynomial in $k$, $1/\epsilon$, and $\log(1/\delta)$. Our two algorithms are the first polynomial time algorithms for such low-rank matrix approximations that come with relative-error guarantees; previously, in some cases, it was not even known whether such matrix decompositions exist. Both of our algorithms are simple, they take time of the order needed to approximately compute the top $k$ singular vectors of $A$, and they use a novel, intuitive sampling method called ``subspace sampling.''<|reference_end|> | arxiv | @article{drineas2007relative-error,
title={Relative-Error CUR Matrix Decompositions},
author={Petros Drineas, Michael W. Mahoney and S. Muthukrishnan},
journal={arXiv preprint arXiv:0708.3696},
year={2007},
archivePrefix={arXiv},
eprint={0708.3696},
primaryClass={cs.DS}
} | drineas2007relative-error |
arxiv-1062 | 0708.3699 | Convolutional Entanglement Distillation | <|reference_start|>Convolutional Entanglement Distillation: We develop a theory of entanglement distillation that exploits a convolutional coding structure. We provide a method for converting an arbitrary classical binary or quaternary convolutional code into a convolutional entanglement distillation protocol. The imported classical convolutional code does not have to be dual-containing or self-orthogonal. The yield and error-correcting properties of such a protocol depend respectively on the rate and error-correcting properties of the imported classical convolutional code. A convolutional entanglement distillation protocol has several other benefits. Two parties sharing noisy ebits can distill noiseless ebits ``online'' as they acquire more noisy ebits. Distillation yield is high and decoding complexity is simple for a convolutional entanglement distillation protocol. Our theory of convolutional entanglement distillation reduces the problem of finding a good convolutional entanglement distillation protocol to the well-established problem of finding a good classical convolutional code.<|reference_end|> | arxiv | @article{wilde2007convolutional,
title={Convolutional Entanglement Distillation},
author={Mark M. Wilde, Hari Krovi and Todd A. Brun},
journal={Proceedings of the 2010 IEEE International Symposium on
Information Theory, pp. 2657-2661, Austin, Texas, USA},
year={2007},
doi={10.1109/ISIT.2010.5513666},
number={CSI-07-08-02},
archivePrefix={arXiv},
eprint={0708.3699},
primaryClass={quant-ph cs.IT math.IT}
} | wilde2007convolutional |
arxiv-1063 | 0708.3721 | Verified Real Number Calculations: A Library for Interval Arithmetic | <|reference_start|>Verified Real Number Calculations: A Library for Interval Arithmetic: 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.<|reference_end|> | arxiv | @article{daumas2007verified,
title={Verified Real Number Calculations: A Library for Interval Arithmetic},
author={Marc Daumas (LIRMM, Eliaus), David Lester (UNIVERSITY of Manchester),
C'esar Mu~noz (NIA)},
journal={arXiv preprint arXiv:0708.3721},
year={2007},
archivePrefix={arXiv},
eprint={0708.3721},
primaryClass={cs.MS cs.LO}
} | daumas2007verified |
arxiv-1064 | 0708.3722 | Formally Verified Argument Reduction with a Fused-Multiply-Add | <|reference_start|>Formally Verified Argument Reduction with a Fused-Multiply-Add: Cody & Waite argument reduction technique works perfectly for reasonably large arguments but as the input grows there are no bit left to approximate the constant with enough accuracy. Under mild assumptions, we show that the result computed with a fused-multiply-add provides a fully accurate result for many possible values of the input with a constant almost accurate to the full working precision. We also present an algorithm for a fully accurate second reduction step to reach double full accuracy (all the significand bits of two numbers are significant) even in the worst cases of argument reduction. Our work recalls the common algorithms and presents proofs of correctness. All the proofs are formally verified using the Coq automatic proof checker.<|reference_end|> | arxiv | @article{boldo2007formally,
title={Formally Verified Argument Reduction with a Fused-Multiply-Add},
author={Sylvie Boldo (INRIA Futurs), Marc Daumas (LIRMM, Eliaus), Ren Cang Li},
journal={arXiv preprint arXiv:0708.3722},
year={2007},
archivePrefix={arXiv},
eprint={0708.3722},
primaryClass={cs.MS cs.PF}
} | boldo2007formally |
arxiv-1065 | 0708.3723 | Parametric Stiffness Analysis of the Orthoglide | <|reference_start|>Parametric Stiffness Analysis of the Orthoglide: This paper presents a parametric stiffness analysis of the Orthoglide, a 3-DOF translational Parallel Kinematic Machine. First, a compliant modeling of the Orthoglide is conducted based on an existing method. Then stiffness matrix is symbolically computed. This allows one to easily study the influence of the geometric design parameters on the matrix elements. Critical links are displayed. Cutting forces are then modeled so that static displacements of the Orthoglide tool during slot milling are symbolically computed. Influence of the geometric design parameters on the static displacements is checked as well. Other machining operations can be modeled. This parametric stiffness analysis can be applied to any parallel manipulator for which stiffness is a critical issue.<|reference_end|> | arxiv | @article{majou2007parametric,
title={Parametric Stiffness Analysis of the Orthoglide},
author={F'elix Majou (IRCCyN, Robotics Laboratory), Cl'ement Gosselin
(ROBOTICS Laboratory), Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Dans International Symposium on Robotics - International Symposium
on Robotics, Paris : France (2004)},
year={2007},
archivePrefix={arXiv},
eprint={0708.3723},
primaryClass={cs.RO}
} | majou2007parametric |
arxiv-1066 | 0708.3734 | Searching for a dangerous host: randomized vs deterministic | <|reference_start|>Searching for a dangerous host: randomized vs deterministic: A Black Hole is an harmful host in a network that destroys incoming agents without leaving any trace of such event. The problem of locating the black hole in a network through a team of agent coordinated by a common protocol is usually referred in literature as the Black Hole Search problem (or BHS for brevity) and it is a consolidated research topic in the area of distributed algorithms. The aim of this paper is to extend the results for BHS by considering more general (and hence harder) classes of dangerous host. In particular we introduce rB-hole as a probabilistic generalization of the Black Hole, in which the destruction of an incoming agent is a purely random event happening with some fixed probability (like flipping a biased coin). The main result we present is that if we tolerate an arbitrarily small error probability in the result then the rB-hole Search problem, or RBS, is not harder than the usual BHS. We establish this result in two different communication model, specifically both in presence or absence of whiteboards non-located at the homebase. The core of our methods is a general reduction tool for transforming algorithms for the black hole into algorithms for the rB-hole.<|reference_end|> | arxiv | @article{nitto2007searching,
title={Searching for a dangerous host: randomized vs. deterministic},
author={Igor Nitto and Rossano Venturini},
journal={arXiv preprint arXiv:0708.3734},
year={2007},
archivePrefix={arXiv},
eprint={0708.3734},
primaryClass={cs.DC}
} | nitto2007searching |
arxiv-1067 | 0708.3740 | Plate-forme Magicien d'Oz pour l'\'etude de l'apport des ACAs \`a l'interaction | <|reference_start|>Plate-forme Magicien d'Oz pour l'\'etude de l'apport des ACAs \`a l'interaction: 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.<|reference_end|> | arxiv | @article{simonin2007plate-forme,
title={Plate-forme Magicien d'Oz pour l'\'etude de l'apport des ACAs \`a
l'interaction},
author={J'er^ome Simonin (INRIA Rocquencourt / INRIA Lorraine - LORIA),
Marius Hategan (INRIA Rocquencourt / INRIA Lorraine - LORIA), No"elle
Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)},
journal={Dans Actes du Second Workshop sur les Agents Conversationnels
anim\'es - Second Workshop sur les Agents Conversationnels anim\'es, Toulouse
: France (2007)},
year={2007},
archivePrefix={arXiv},
eprint={0708.3740},
primaryClass={cs.HC}
} | simonin2007plate-forme |
arxiv-1068 | 0708.3742 | Interfaces adaptatives Adaptation dynamique \`a l'utilisateur courant | <|reference_start|>Interfaces adaptatives Adaptation dynamique \`a l'utilisateur courant: We present a survey of recent research studies of the implementation of adaptive user models in human-computer interaction. A classification of research directions on adaptive user interfaces is first proposed; it takes account of the user characteristics that are modelled, the distribution of initiative and control of the system evolution between user and system, and the role of dynamic adaptation. Then, a few representative research studies are briefly presented to illustrate this classification. In the conclusion, some major issues regarding the utility and usability of adaptive user interfaces and the design of an appropriate methodology for assessing the ergonomic quality of this new form of interaction are mentioned.<|reference_end|> | arxiv | @article{simonin2007interfaces,
title={Interfaces adaptatives Adaptation dynamique \`a l'utilisateur courant},
author={J'er^ome Simonin (INRIA Rocquencourt / INRIA Lorraine - LORIA),
No"elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)},
journal={Interfaces num\'eriques, Herm\`es Science (Ed.) (2007) 18 pages},
year={2007},
archivePrefix={arXiv},
eprint={0708.3742},
primaryClass={cs.HC}
} | simonin2007interfaces |
arxiv-1069 | 0708.3761 | Multi-agent systems, Equiprobability, Gamma distributions and other Geometrical questions | <|reference_start|>Multi-agent systems, Equiprobability, Gamma distributions and other Geometrical questions: A set of many identical interacting agents obeying a global additive constraint is considered. Under the hypothesis of equiprobability in the high-dimensional volume delimited in phase space by the constraint, the statistical behavior of a generic agent over the ensemble is worked out. The asymptotic distribution of that statistical behavior is derived from geometrical arguments. This distribution is related with the Gamma distributions found in several multi-agent economy models. The parallelism with all these systems is established. Also, as a collateral result, a formula for the volume of high-dimensional symmetrical bodies is proposed.<|reference_end|> | arxiv | @article{lopez-ruiz2007multi-agent,
title={Multi-agent systems, Equiprobability, Gamma distributions and other
Geometrical questions},
author={Ricardo Lopez-Ruiz, Jaime Sanudo and Xavier Calbet},
journal={arXiv preprint arXiv:0708.3761},
year={2007},
archivePrefix={arXiv},
eprint={0708.3761},
primaryClass={nlin.CD cond-mat.stat-mech cs.MA physics.soc-ph}
} | lopez-ruiz2007multi-agent |
arxiv-1070 | 0708.3764 | A Radio Resource Management strategy for downlink cooperation in distributed networks | <|reference_start|>A Radio Resource Management strategy for downlink cooperation in distributed networks: This paper has been withdrawn by the author<|reference_end|> | arxiv | @article{pischella2007a,
title={A Radio Resource Management strategy for downlink cooperation in
distributed networks},
author={Mylene Pischella, Jean-Claude Belfiore},
journal={arXiv preprint arXiv:0708.3764},
year={2007},
archivePrefix={arXiv},
eprint={0708.3764},
primaryClass={cs.IT math.IT}
} | pischella2007a |
arxiv-1071 | 0708.3809 | Design Strategies for the Geometric Synthesis of Orthoglide-type Mechanisms | <|reference_start|>Design Strategies for the Geometric Synthesis of Orthoglide-type Mechanisms: The paper addresses the geometric synthesis of Orthoglide-type mechanism, a family of 3-DOF parallel manipulators for rapid machining applications, which combine advantages of both serial mechanisms and parallel kinematic architectures. These manipulators possess quasi-isotropic kinematic performances and are made up of three actuated fixed prismatic joints, which are mutually orthogonal and connected to a mobile platform via three parallelogram chains. The platform moves in the Cartesian space with fixed orientation, similar to conventional XYZ-machine. Three strategies have been proposed to define the Orthoglide geometric parameters (manipulator link lengths and actuated joint limits) as functions of a cubic workspace size and dextrous properties expressed by bounds on the velocity transmission factors, manipulability or the Jacobian condition number. Low inertia and intrinsic stiffness have been set as additional design goals expressed by the minimal link length requirement. For each design strategy, analytical expressions for computing the Orthoglide parameters are proposed. It is showed that the proposed strategies yield Pareto-optimal solutions, which differ by the kinematic performances outside the prescribed Cartesian cube (but within the workspace bounded by the actuated joint limits). The proposed technique is illustrated with numerical examples for the Orthoglide prototype design.<|reference_end|> | arxiv | @article{pashkevich2007design,
title={Design Strategies for the Geometric Synthesis of Orthoglide-type
Mechanisms},
author={Anatoly Pashkevich (Robotic Laboratory), Philippe Wenger (IRCCyN),
Damien Chablat (IRCCyN)},
journal={Journal of Mechanism and Machine Theory 40, 8 (2005) 907-930},
year={2007},
archivePrefix={arXiv},
eprint={0708.3809},
primaryClass={cs.RO}
} | pashkevich2007design |
arxiv-1072 | 0708.3811 | An Exhaustive Study of the Workspaces Tolopogies of all 3R Orthogonal Manipulators with Geometric Simplifications | <|reference_start|>An Exhaustive Study of the Workspaces Tolopogies of all 3R Orthogonal Manipulators with Geometric Simplifications: This paper proposes a classification of three-revolute orthogonal manipulators that have at least one of their DH parameters equal to zero. This classification is based on the topology of their workspace. The workspace is characterized in a half-cross section by the singular curves. The workspace topology is defined by the number of cusps and nodes that appear on these singular curves. The manipulators are classified into different types with similar kinematic properties. Each type is evaluated according to interesting kinematic properties such as, whether the workspace is fully reachable with four inverse kinematic solutions or not, the existence of voids, and the feasibility of continuous trajectories in the workspace. It is found that several orthogonal manipulators have a "well-connected" workspace, that is, their workspace is fully accessible with four inverse kinematic solutions and any continuous trajectory is feasible. This result is of interest for the design of alternative manipulator geometries.<|reference_end|> | arxiv | @article{zein2007an,
title={An Exhaustive Study of the Workspaces Tolopogies of all 3R Orthogonal
Manipulators with Geometric Simplifications},
author={Mazen Zein (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Journal of Mechanism and Machine Theory 41, 8 (2006) 971-986},
year={2007},
doi={10.1016/j.mechmachtheory.2006.03.013},
archivePrefix={arXiv},
eprint={0708.3811},
primaryClass={cs.RO}
} | zein2007an |
arxiv-1073 | 0708.3829 | A Non Parametric Model for the Forecasting of the Venezuelan Oil Prices | <|reference_start|>A Non Parametric Model for the Forecasting of the Venezuelan Oil Prices: A neural net model for forecasting the prices of Venezuelan crude oil is proposed. The inputs of the neural net are selected by reference to a dynamic system model of oil prices by Mashayekhi (1995, 2001) and its performance is evaluated using two criteria: the Excess Profitability test by Anatoliev and Gerko (2005) and the characteristics of the equity curve generated by a trading strategy based on the neural net predictions. ----- Se introduce aqui un modelo no parametrico para pronosticar los precios del petroleo Venezolano cuyos insumos son seleccionados en base a un sistema dinamico que explica los precios en terminos de dichos insumos. Se describe el proceso de recoleccion y pre-procesamiento de datos y la corrida de la red y se evaluan sus pronosticos a traves de un test estadistico de predictibilidad y de las caracteristicas del Equity Curve inducido por la estrategia de compraventa bursatil generada por dichos pronosticos.<|reference_end|> | arxiv | @article{costanzo2007a,
title={A Non Parametric Model for the Forecasting of the Venezuelan Oil Prices},
author={Sabatino Costanzo, Loren Trigo, Wafaa Dehne, Hender Prato},
journal={arXiv preprint arXiv:0708.3829},
year={2007},
archivePrefix={arXiv},
eprint={0708.3829},
primaryClass={cs.CE cs.NE}
} | costanzo2007a |
arxiv-1074 | 0708.3879 | Graph Annotations in Modeling Complex Network Topologies | <|reference_start|>Graph Annotations in Modeling Complex Network Topologies: The coarsest approximation of the structure of a complex network, such as the Internet, is a simple undirected unweighted graph. This approximation, however, loses too much detail. In reality, objects represented by vertices and edges in such a graph possess some non-trivial internal structure that varies across and differentiates among distinct types of links or nodes. In this work, we abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a network. Assuming we have this profile measured for a given network, we present an algorithm to rescale it in order to construct networks of varying size that still reproduce the original measured annotation profile. Using this methodology, we accurately capture the network properties essential for realistic simulations of network applications and protocols, or any other simulations involving complex network topologies, including modeling and simulation of network evolution. We apply our approach to the Autonomous System (AS) topology of the Internet annotated with business relationships between ASs. This topology captures the large-scale structure of the Internet. In depth understanding of this structure and tools to model it are cornerstones of research on future Internet architectures and designs. We find that our techniques are able to accurately capture the structure of annotation correlations within this topology, thus reproducing a number of its important properties in synthetically-generated random graphs.<|reference_end|> | arxiv | @article{dimitropoulos2007graph,
title={Graph Annotations in Modeling Complex Network Topologies},
author={Xenofontas Dimitropoulos, Dmitri Krioukov, Amin Vahdat, George Riley},
journal={ACM Transactions on Modeling and Computer Simulation (TOMACS),
v.19, n.4, p.17, 2009},
year={2007},
doi={10.1145/1596519.1596522},
archivePrefix={arXiv},
eprint={0708.3879},
primaryClass={cs.NI cond-mat.dis-nn physics.data-an physics.soc-ph}
} | dimitropoulos2007graph |
arxiv-1075 | 0708.3896 | The Isoconditioning Loci of Planar Three-DOF Parallel Manipulators | <|reference_start|>The Isoconditioning Loci of Planar Three-DOF Parallel Manipulators: The subject of this paper is a special class of three-degree-of-freedom parallel manipulators. The singular configurations of the two Jacobian matrices are first studied. The isotropic configurations are then found based on the characteristic length of this manipulator. The isoconditioning loci for the Jacobian matrices are plotted to define a global performance index allowing the comparison of the different working modes. The index thus resulting is compared with the Cartesian workspace surface and the average of the condition number.<|reference_end|> | arxiv | @article{chablat2007the,
title={The Isoconditioning Loci of Planar Three-DOF Parallel Manipulators},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), St'ephane Caro
(IRCCyN), Jorge Angeles (CIM)},
journal={Dans 29th Design Automation Conference - ASME 29th Design
Automation Conference, France (2002)},
year={2007},
archivePrefix={arXiv},
eprint={0708.3896},
primaryClass={cs.RO}
} | chablat2007the |
arxiv-1076 | 0708.3900 | Inference from correlated patterns: a unified theory for perceptron learning and linear vector channels | <|reference_start|>Inference from correlated patterns: a unified theory for perceptron learning and linear vector channels: A framework to analyze inference performance in densely connected single-layer feed-forward networks is developed for situations where a given data set is composed of correlated patterns. The framework is based on the assumption that the left and right singular value bases of the given pattern matrix are generated independently and uniformly from Haar measures. This assumption makes it possible to characterize the objective system by a single function of two variables which is determined by the eigenvalue spectrum of the cross-correlation matrix of the pattern matrix. Links to existing methods for analysis of perceptron learning and Gaussian linear vector channels and an application to a simple but nontrivial problem are also shown.<|reference_end|> | arxiv | @article{kabashima2007inference,
title={Inference from correlated patterns: a unified theory for perceptron
learning and linear vector channels},
author={Yoshiyuki Kabashima},
journal={Journal of Physics Conference Series 95, 012001, 2008;
http://www.iop.org/EJ/toc/1742-6596/95/1},
year={2007},
doi={10.1088/1742-6596/95/1/012001},
archivePrefix={arXiv},
eprint={0708.3900},
primaryClass={cs.IT cond-mat.dis-nn math.IT}
} | kabashima2007inference |
arxiv-1077 | 0708.3920 | Kinematic analysis of the 3-RPR parallel manipulator | <|reference_start|>Kinematic analysis of the 3-RPR parallel manipulator: The aim of this paper is the kinematic study of a 3-RPR planar parallel manipulator where the three fixed revolute joints are actuated. The direct and inverse kinematic problem as well as the singular configuration is characterized. On parallel singular configurations, the motion produce by the mobile platform can be compared to the Reuleaux straight-line mechanism.<|reference_end|> | arxiv | @article{chablat2007kinematic,
title={Kinematic analysis of the 3-RPR parallel manipulator},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), Ilian Bonev (GPA)},
journal={Dans Advances in Robot Kinematics - 10th International Symposium
on Advances in Robot Kinematics, Ljubljana : Slov\'enie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0708.3920},
primaryClass={cs.RO}
} | chablat2007kinematic |
arxiv-1078 | 0708.3936 | Working and Assembly Modes of the Agile Eye | <|reference_start|>Working and Assembly Modes of the Agile Eye: This paper deals with the in-depth kinematic analysis of a special spherical parallel wrist, called the Agile Eye. The Agile Eye is a three-legged spherical parallel robot with revolute joints in which all pairs of adjacent joint axes are orthogonal. Its most peculiar feature, demonstrated in this paper for the first time, is that its (orientation) workspace is unlimited and flawed only by six singularity curves (rather than surfaces). Furthermore, these curves correspond to self-motions of the mobile platform. This paper also demonstrates that, unlike for any other such complex spatial robots, the four solutions to the direct kinematics of the Agile Eye (assembly modes) have a simple geometric relationship with the eight solutions to the inverse kinematics (working modes).<|reference_end|> | arxiv | @article{bonev2007working,
title={Working and Assembly Modes of the Agile Eye},
author={Ilian Bonev (GPA), Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={Dans International Conference On Robotics And Automation - IEEE
International Conference On Robotics And Automation, Orlando : \'Etats-Unis
d'Am\'erique (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0708.3936},
primaryClass={cs.RO}
} | bonev2007working |
arxiv-1079 | 0708.3962 | A course on Combinatorial Algorithms | <|reference_start|>A course on Combinatorial Algorithms: The paper presents a course on Combinatorial Algorithms that is based on the drafts of the author that he used while teaching the course in the Department of Informatics and Applied Mathematics of Yerevan State University, Armenia from February 2007 to June 2007.<|reference_end|> | arxiv | @article{mkrtchyan2007a,
title={A course on Combinatorial Algorithms},
author={V. V. Mkrtchyan},
journal={arXiv preprint arXiv:0708.3962},
year={2007},
archivePrefix={arXiv},
eprint={0708.3962},
primaryClass={cs.DM}
} | mkrtchyan2007a |
arxiv-1080 | 0708.4075 | Graph Isomorphism is PSPACE-complete | <|reference_start|>Graph Isomorphism is PSPACE-complete: Combining the the results of A.R. Meyer and L.J. Stockmeyer "The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space", and K.S. Booth "Isomorphism testing for graphs, semigroups, and finite automata are polynomiamlly equivalent problems" shows that graph isomorphism is PSPACE-complete.<|reference_end|> | arxiv | @article{delacorte2007graph,
title={Graph Isomorphism is PSPACE-complete},
author={Matthew Delacorte},
journal={arXiv preprint arXiv:0708.4075},
year={2007},
archivePrefix={arXiv},
eprint={0708.4075},
primaryClass={cs.CC}
} | delacorte2007graph |
arxiv-1081 | 0708.4082 | Aides en ligne \`a l'utilisation de logiciels grand public : probl\`emes sp\'ecifiques de conception et solutions potentielles | <|reference_start|>Aides en ligne \`a l'utilisation de logiciels grand public : probl\`emes sp\'ecifiques de conception et solutions potentielles: The observation that novice users seldom consult online help was made over twenty years ago. This observation still holds nowadays, although online help to the use of software for the general public has greatly improved in usability during this period. The paper first demonstrates the necessity of online help to the use of new software whatever the transparency of the user interface, as whether online help systems are meant to compensate for interface design weaknesses or actually do provide necessary assistance to the discovery of a new software package functionalities is still an unsolved issue. The discussion relies on results of empirical and experimental studies and theoretical arguments. In the second part, we analyse the specific difficulties raised by the design of effective online help systems for current software intended for the general public so as to try and understand the reluctance of novice users to use online help. In the last part, we present and discuss the possible contributions of various approaches to solving this issue. Recent interaction paradigms and techniques are considered, such as, static and dynamic personalisation, contextual online help and new forms of multimodality.<|reference_end|> | arxiv | @article{capobianco2007aides,
title={Aides en ligne \`a l'utilisation de logiciels grand public : probl\`emes
sp\'ecifiques de conception et solutions potentielles},
author={Antonio Capobianco (INRIA Rocquencourt / INRIA Lorraine - LORIA),
No"elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)},
journal={Intellectica 2006/2, 44 (2006) 87-120},
year={2007},
archivePrefix={arXiv},
eprint={0708.4082},
primaryClass={cs.HC}
} | capobianco2007aides |
arxiv-1082 | 0708.4149 | On the complexity of nonnegative matrix factorization | <|reference_start|>On the complexity of nonnegative matrix factorization: Nonnegative matrix factorization (NMF) has become a prominent technique for the analysis of image databases, text databases and other information retrieval and clustering applications. In this report, we define an exact version of NMF. Then we establish several results about exact NMF: (1) that it is equivalent to a problem in polyhedral combinatorics; (2) that it is NP-hard; and (3) that a polynomial-time local search heuristic exists.<|reference_end|> | arxiv | @article{vavasis2007on,
title={On the complexity of nonnegative matrix factorization},
author={Stephen A. Vavasis},
journal={arXiv preprint arXiv:0708.4149},
year={2007},
archivePrefix={arXiv},
eprint={0708.4149},
primaryClass={cs.NA cs.IR}
} | vavasis2007on |
arxiv-1083 | 0708.4155 | Coexistence of Social Norms based on In- and Out-group Interactions | <|reference_start|>Coexistence of Social Norms based on In- and Out-group Interactions: The question how social norms can emerge from microscopic interactions between individuals is a key problem in social sciences to explain collective behavior. In this paper we propose an agent-based model to show that randomly distributed social behavior by way of local interaction converges to a state with a multimodal distribution of behavior. This can be interpreted as a coexistence of different social norms, a result that goes beyond previous investigations. The model is discrete in time and space, behavior is characterized in a continuous state space. The adaptation of social behavior by each agent is based on attractive and repulsive forces caused by friendly and adversary relations among agents. The model is analyzed both analytically and by means of spatio-temporal computer simulations. It provides conditions under which we find convergence towards a single norm, coexistence of two opposing norms, and coexistence of a multitude of norms. For the latter case, we also show the evolution of the spatio-temporal distribution of behavior.<|reference_end|> | arxiv | @article{fent2007coexistence,
title={Coexistence of Social Norms based on In- and Out-group Interactions},
author={Thomas Fent, Patrick Groeber, Frank Schweitzer},
journal={ACS - Advances in Complex Systems, vol. 10, no. 2 (2007), pp.
271-286},
year={2007},
archivePrefix={arXiv},
eprint={0708.4155},
primaryClass={nlin.AO cs.MA physics.soc-ph}
} | fent2007coexistence |
arxiv-1084 | 0708.4164 | Asymptotic improvement of the Gilbert-Varshamov bound for linear codes | <|reference_start|>Asymptotic improvement of the Gilbert-Varshamov bound for linear codes: The Gilbert-Varshamov bound states that the maximum size A_2(n,d) of a binary code of length n and minimum distance d satisfies A_2(n,d) >= 2^n/V(n,d-1) where V(n,d) stands for the volume of a Hamming ball of radius d. Recently Jiang and Vardy showed that for binary non-linear codes this bound can be improved to A_2(n,d) >= cn2^n/V(n,d-1) for c a constant and d/n <= 0.499. In this paper we show that certain asymptotic families of linear binary [n,n/2] random double circulant codes satisfy the same improved Gilbert-Varshamov bound.<|reference_end|> | arxiv | @article{gaborit2007asymptotic,
title={Asymptotic improvement of the Gilbert-Varshamov bound for linear codes},
author={Philippe Gaborit and Gilles Zemor},
journal={IEEE Transactions on Information Theory, IT-54, No. 9 (2008) pp.
3865--3872.},
year={2007},
doi={10.1109/TIT.2008.928288},
archivePrefix={arXiv},
eprint={0708.4164},
primaryClass={cs.IT math.IT}
} | gaborit2007asymptotic |
arxiv-1085 | 0708.4170 | Raising a Hardness Result | <|reference_start|>Raising a Hardness Result: This article presents a technique for proving problems hard for classes of the polynomial hierarchy or for PSPACE. The rationale of this technique is that some problem restrictions are able to simulate existential or universal quantifiers. If this is the case, reductions from Quantified Boolean Formulae (QBF) to these restrictions can be transformed into reductions from QBFs having one more quantifier in the front. This means that a proof of hardness of a problem at level n in the polynomial hierarchy can be split into n separate proofs, which may be simpler than a proof directly showing a reduction from a class of QBFs to the considered problem.<|reference_end|> | arxiv | @article{liberatore2007raising,
title={Raising a Hardness Result},
author={Paolo Liberatore},
journal={arXiv preprint arXiv:0708.4170},
year={2007},
archivePrefix={arXiv},
eprint={0708.4170},
primaryClass={cs.AI cs.CC cs.LO}
} | liberatore2007raising |
arxiv-1086 | 0708.4176 | Classical and Effective Descriptive Complexities of omega-Powers | <|reference_start|>Classical and Effective Descriptive Complexities of omega-Powers: We prove that, for each non null countable ordinal alpha, there exist some Sigma^0_alpha-complete omega-powers, and some Pi^0_alpha-complete omega-powers, extending previous works on the topological complexity of omega-powers. We prove effective versions of these results. In particular, for each non null recursive ordinal alpha, there exists a recursive finitary language A such that A^omega is Sigma^0_alpha-complete (respectively, Pi^0_alpha-complete). To do this, we prove effective versions of a result by Kuratowski, describing a Borel set as the range of a closed subset of the Baire space by a continuous bijection. This leads us to prove closure properties for the classes Effective-Pi^0_alpha and Effective-Sigma^0_alpha of the hyperarithmetical hierarchy in arbitrary recursively presented Polish spaces. We apply our existence results to get better computations of the topological complexity of some sets of dictionaries considered by the second author in [Omega-Powers and Descriptive Set Theory, Journal of Symbolic Logic, Volume 70 (4), 2005, p. 1210-1232].<|reference_end|> | arxiv | @article{finkel2007classical,
title={Classical and Effective Descriptive Complexities of omega-Powers},
author={Olivier Finkel (LIP, ELM), Dominique Lecomte (UMR 7586)},
journal={Annals of Pure and Applied Logic 2, 160 (2009) 163-191},
year={2007},
number={LIP Research Report RR 2007-38},
archivePrefix={arXiv},
eprint={0708.4176},
primaryClass={math.LO cs.CC cs.LO}
} | finkel2007classical |
arxiv-1087 | 0708.4214 | High Rate Single-Symbol Decodable Precoded DSTBCs for Cooperative Networks | <|reference_start|>High Rate Single-Symbol Decodable Precoded DSTBCs for Cooperative Networks: Distributed Orthogonal Space-Time Block Codes (DOSTBCs) achieving full diversity order and single-symbol ML decodability have been introduced recently for cooperative networks and an upper-bound on the maximal rate of such codes along with code constructions has been presented. In this report, we introduce a new class of Distributed STBCs called Semi-orthogonal Precoded Distributed Single-Symbol Decodable STBCs (S-PDSSDC) wherein, the source performs co-ordinate interleaving of information symbols appropriately before transmitting it to all the relays. It is shown that DOSTBCs are a special case of S-PDSSDCs. A special class of S-PDSSDCs having diagonal covariance matrix at the destination is studied and an upper bound on the maximal rate of such codes is derived. The bounds obtained are approximately twice larger than that of the DOSTBCs. A systematic construction of S-PDSSDCs is presented when the number of relays $K \geq 4$. The constructed codes are shown to achieve the upper-bound on the rate when $K$ is of the form 0 modulo 4 or 3 modulo 4. For the rest of the values of $K$, the constructed codes are shown to have rates higher than that of DOSTBCs. It is also shown that S-PDSSDCs cannot be constructed with any form of linear processing at the relays when the source doesn't perform co-ordinate interleaving of the information symbols.<|reference_end|> | arxiv | @article{harshan2007high,
title={High Rate Single-Symbol Decodable Precoded DSTBCs for Cooperative
Networks},
author={J. Harshan and B. Sundar Rajan},
journal={arXiv preprint arXiv:0708.4214},
year={2007},
number={TR-PME-2007-08},
archivePrefix={arXiv},
eprint={0708.4214},
primaryClass={cs.IT math.IT}
} | harshan2007high |
arxiv-1088 | 0708.4219 | Secure Transmission with Multiple Antennas: The MISOME Wiretap Channel | <|reference_start|>Secure Transmission with Multiple Antennas: The MISOME Wiretap Channel: The role of multiple antennas for secure communication is investigated within the framework of Wyner's wiretap channel. We characterize the secrecy capacity in terms of generalized eigenvalues when the sender and eavesdropper have multiple antennas, the intended receiver has a single antenna, and the channel matrices are fixed and known to all the terminals, and show that a beamforming strategy is capacity-achieving. In addition, we show that in the high signal-to-noise (SNR) ratio regime the penalty for not knowing eavesdropper's channel is small--a simple ``secure space-time code'' that can be thought of as masked beamforming and radiates power isotropically attains near-optimal performance. In the limit of large number of antennas, we obtain a realization-independent characterization of the secrecy capacity as a function of the number $\beta$: the number of eavesdropper antennas per sender antenna. We show that the eavesdropper is comparatively ineffective when $\beta<1$, but that for $\beta\ge2$ the eavesdropper can drive the secrecy capacity to zero, thereby blocking secure communication to the intended receiver. Extensions to ergodic fading channels are also provided.<|reference_end|> | arxiv | @article{khisti2007secure,
title={Secure Transmission with Multiple Antennas: The MISOME Wiretap Channel},
author={Ashish Khisti, Gregory Wornell},
journal={arXiv preprint arXiv:0708.4219},
year={2007},
archivePrefix={arXiv},
eprint={0708.4219},
primaryClass={cs.IT math.IT}
} | khisti2007secure |
arxiv-1089 | 0708.4230 | Implicitization of Bihomogeneous Parametrizations of Algebraic Surfaces via Linear Syzygies | <|reference_start|>Implicitization of Bihomogeneous Parametrizations of Algebraic Surfaces via Linear Syzygies: We show that the implicit equation of a surface in 3-dimensional projective space parametrized by bi-homogeneous polynomials of bi-degree (d,d), for a given positive integer d, can be represented and computed from the linear syzygies of its parametrization if the base points are isolated and form locally a complete intersection.<|reference_end|> | arxiv | @article{busé2007implicitization,
title={Implicitization of Bihomogeneous Parametrizations of Algebraic Surfaces
via Linear Syzygies},
author={Laurent Bus'e (INRIA Sophia Antipolis), Marc Dohm (JAD)},
journal={Dans International Conference on Symbolic and Algebraic
Computation (2007) 69 - 76},
year={2007},
doi={10.1145/1277548.1277559},
archivePrefix={arXiv},
eprint={0708.4230},
primaryClass={math.AG cs.SC math.AC}
} | busé2007implicitization |
arxiv-1090 | 0708.4284 | Optimal Per-Edge Processing Times in the Semi-Streaming Model | <|reference_start|>Optimal Per-Edge Processing Times in the Semi-Streaming Model: We present semi-streaming algorithms for basic graph problems that have optimal per-edge processing times and therefore surpass all previous semi-streaming algorithms for these tasks. The semi-streaming model, which is appropriate when dealing with massive graphs, forbids random access to the input and restricts the memory to O(n*polylog n) bits. Particularly, the formerly best per-edge processing times for finding the connected components and a bipartition are O(alpha(n)), for determining k-vertex and k-edge connectivity O(k^2n) and O(n*log n) respectively for any constant k and for computing a minimum spanning forest O(log n). All these time bounds we reduce to O(1). Every presented algorithm determines a solution asymptotically as fast as the best corresponding algorithm up to date in the classical RAM model, which therefore cannot convert the advantage of unlimited memory and random access into superior computing times for these problems.<|reference_end|> | arxiv | @article{zelke2007optimal,
title={Optimal Per-Edge Processing Times in the Semi-Streaming Model},
author={Mariano Zelke},
journal={Information Processing Letters, Volume 104, Issue 3, 2007, Pages
106-112},
year={2007},
archivePrefix={arXiv},
eprint={0708.4284},
primaryClass={cs.DM cs.DS}
} | zelke2007optimal |
arxiv-1091 | 0708.4288 | Pattern Matching in Trees and Strings | <|reference_start|>Pattern Matching in Trees and Strings: We study the design of efficient algorithms for combinatorial pattern matching. More concretely, we study algorithms for tree matching, string matching, and string matching in compressed texts.<|reference_end|> | arxiv | @article{bille2007pattern,
title={Pattern Matching in Trees and Strings},
author={Philip Bille},
journal={arXiv preprint arXiv:0708.4288},
year={2007},
archivePrefix={arXiv},
eprint={0708.4288},
primaryClass={cs.DS}
} | bille2007pattern |
arxiv-1092 | 0708.4311 | 2006: Celebrating 75 years of AI - History and Outlook: the Next 25 Years | <|reference_start|>2006: Celebrating 75 years of AI - History and Outlook: the Next 25 Years: When Kurt Goedel layed the foundations of theoretical computer science in 1931, he also introduced essential concepts of the theory of Artificial Intelligence (AI). Although much of subsequent AI research has focused on heuristics, which still play a major role in many practical AI applications, in the new millennium AI theory has finally become a full-fledged formal science, with important optimality results for embodied agents living in unknown environments, obtained through a combination of theory a la Goedel and probability theory. Here we look back at important milestones of AI history, mention essential recent results, and speculate about what we may expect from the next 25 years, emphasizing the significance of the ongoing dramatic hardware speedups, and discussing Goedel-inspired, self-referential, self-improving universal problem solvers.<|reference_end|> | arxiv | @article{schmidhuber20072006:,
title={2006: Celebrating 75 years of AI - History and Outlook: the Next 25
Years},
author={Juergen Schmidhuber},
journal={arXiv preprint arXiv:0708.4311},
year={2007},
archivePrefix={arXiv},
eprint={0708.4311},
primaryClass={cs.AI}
} | schmidhuber20072006: |
arxiv-1093 | 0708.4324 | Sensitivity Analysis of the Orthoglide, a 3-DOF Translational Parallel Kinematic Machine | <|reference_start|>Sensitivity Analysis of the Orthoglide, a 3-DOF Translational Parallel Kinematic Machine: This paper presents a sensitivity analysis of the Orthoglide, a 3-DOF translational Parallel Kinematic Machine. Two complementary methods are developed to analyze its sensitivity to its dimensional and angular variations. First, a linkage kinematic analysis method is used to have a rough idea of the influence of the dimensional variations on the location of the end-effector. Besides, this method shows that variations in the design parameters of the same type from one leg to the other have the same influence on the end-effector. However, this method does not take into account the variations in the parallelograms. Thus, a differential vector method is used to study the influence of the dimensional and angular variations in the parts of the manipulator on the position and orientation of the end-effector, and particularly the influence of the variations in the parallelograms. It turns out that the kinematic isotropic configuration of the manipulator is the least sensitive one to its dimensional and angular variations. On the contrary, the closest configurations to its kinematic singular configurations are the most sensitive ones to geometrical variations.<|reference_end|> | arxiv | @article{caro2007sensitivity,
title={Sensitivity Analysis of the Orthoglide, a 3-DOF Translational Parallel
Kinematic Machine},
author={St'ephane Caro (IRCCyN), Philippe Wenger (IRCCyN), Fouad Bennis
(IRCCyN), Damien Chablat (IRCCyN)},
journal={Journal of Mechanical Design 128 (2006) 392-402},
year={2007},
archivePrefix={arXiv},
eprint={0708.4324},
primaryClass={cs.RO}
} | caro2007sensitivity |
arxiv-1094 | 0708.4328 | Dualities Between Entropy Functions and Network Codes | <|reference_start|>Dualities Between Entropy Functions and Network Codes: This paper provides a new duality between entropy functions and network codes. Given a function $g\geq 0$ defined on all proper subsets of $N$ random variables, we provide a construction for a network multicast problem which is solvable if and only if $g$ is entropic. The underlying network topology is fixed and the multicast problem depends on $g$ only through edge capacities and source rates. Relaxing the requirement that the domain of $g$ be subsets of random variables, we obtain a similar duality between polymatroids and the linear programming bound. These duality results provide an alternative proof of the insufficiency of linear (and abelian) network codes, and demonstrate the utility of non-Shannon inequalities to tighten outer bounds on network coding capacity regions.<|reference_end|> | arxiv | @article{chan2007dualities,
title={Dualities Between Entropy Functions and Network Codes},
author={Terence Chan and Alex Grant},
journal={arXiv preprint arXiv:0708.4328},
year={2007},
archivePrefix={arXiv},
eprint={0708.4328},
primaryClass={cs.IT math.IT}
} | chan2007dualities |
arxiv-1095 | 0708.4379 | A system for the simulation of simultaneous moves between two noncolocational players | <|reference_start|>A system for the simulation of simultaneous moves between two noncolocational players: We describe a new system for the simulation of simultaneous moves between noncolocational players. This has applications in the burgeoning Rock-Paper-Scissors by mail movement.<|reference_end|> | arxiv | @article{debowsky2007a,
title={A system for the simulation of simultaneous moves between two
noncolocational players},
author={Marisa Debowsky and Adrian Riskin},
journal={arXiv preprint arXiv:0708.4379},
year={2007},
archivePrefix={arXiv},
eprint={0708.4379},
primaryClass={cs.GT}
} | debowsky2007a |
arxiv-1096 | 0708.4387 | Conjugates of characteristic Sturmian words generated by morphisms | <|reference_start|>Conjugates of characteristic Sturmian words generated by morphisms: This article is concerned with characteristic Sturmian words of slope $\alpha$ and $1-\alpha$ (denoted by $c_\alpha$ and $c_{1-\alpha}$ respectively), where $\alpha \in (0,1)$ is an irrational number such that $\alpha = [0;1+d_1,\bar{d_2,...,d_n}]$ with $d_n \geq d_1 \geq 1$. It is known that both $c_\alpha$ and $c_{1-\alpha}$ are fixed points of non-trivial (standard) morphisms $\sigma$ and $\hat{\sigma}$, respectively, if and only if $\alpha$ has a continued fraction expansion as above. Accordingly, such words $c_\alpha$ and $c_{1-\alpha}$ are generated by the respective morphisms $\sigma$ and $\hat{\sigma}$. For the particular case when $\alpha = [0;2,\bar{r}]$ ($r\geq1$), we give a decomposition of each conjugate of $c_\alpha$ (and hence $c_{1-\alpha}$) into generalized adjoining singular words, by considering conjugates of powers of the standard morphism $\sigma$ by which it is generated. This extends a recent result of Lev\'{e} and S\ee bold on conjugates of the infinite Fibonacci word.<|reference_end|> | arxiv | @article{glen2007conjugates,
title={Conjugates of characteristic Sturmian words generated by morphisms},
author={Amy Glen},
journal={European Journal of Combinatorics 25 (2004) 1025-1037},
year={2007},
doi={10.1016/j.ejc.2003.12.012},
archivePrefix={arXiv},
eprint={0708.4387},
primaryClass={math.CO cs.DM}
} | glen2007conjugates |
arxiv-1097 | 0708.4389 | Occurrences of palindromes in characteristic Sturmian words | <|reference_start|>Occurrences of palindromes in characteristic Sturmian words: This paper is concerned with palindromes occurring in characteristic Sturmian words $c_\alpha$ of slope $\alpha$, where $\alpha \in (0,1)$ is an irrational. As $c_\alpha$ is a uniformly recurrent infinite word, any (palindromic) factor of $c_\alpha$ occurs infinitely many times in $c_\alpha$ with bounded gaps. Our aim is to completely describe where palindromes occur in $c_\alpha$. In particular, given any palindromic factor $u$ of $c_\alpha$, we shall establish a decomposition of $c_\alpha$ with respect to the occurrences of $u$. Such a decomposition shows precisely where $u$ occurs in $c_\alpha$, and this is directly related to the continued fraction expansion of $\alpha$.<|reference_end|> | arxiv | @article{glen2007occurrences,
title={Occurrences of palindromes in characteristic Sturmian words},
author={Amy Glen},
journal={Theoretical Computer Science 352 (2006) 31-46},
year={2007},
doi={10.1016/j.tcs.2005.09.075},
archivePrefix={arXiv},
eprint={0708.4389},
primaryClass={math.CO cs.DM}
} | glen2007occurrences |
arxiv-1098 | 0708.4399 | Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations | <|reference_start|>Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations: We present algorithms for the type-IV discrete cosine transform (DCT-IV) and discrete sine transform (DST-IV), as well as for the modified discrete cosine transform (MDCT) and its inverse, that achieve a lower count of real multiplications and additions than previously published algorithms, without sacrificing numerical accuracy. Asymptotically, the operation count is reduced from ~2NlogN to ~(17/9)NlogN for a power-of-two transform size N, and the exact count is strictly lowered for all N > 4. These results are derived by considering the DCT to be a special case of a DFT of length 8N, with certain symmetries, and then pruning redundant operations from a recent improved fast Fourier transform algorithm (based on a recursive rescaling of the conjugate-pair split radix algorithm). The improved algorithms for DST-IV and MDCT follow immediately from the improved count for the DCT-IV.<|reference_end|> | arxiv | @article{shao2007type-iv,
title={Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic
operations},
author={Xuancheng Shao and Steven G. Johnson},
journal={Signal Processing vol. 88, issue 6, p. 1313-1326 (2008)},
year={2007},
doi={10.1016/j.sigpro.2007.11.024},
archivePrefix={arXiv},
eprint={0708.4399},
primaryClass={cs.DS cs.NA}
} | shao2007type-iv |
arxiv-1099 | 0708.4400 | Powers in a class of A-strict standard episturmian words | <|reference_start|>Powers in a class of A-strict standard episturmian words: This paper concerns a specific class of strict standard episturmian words whose directive words resemble those of characteristic Sturmian words. In particular, we explicitly determine all integer powers occurring in such infinite words, extending recent results of Damanik and Lenz (2003), who studied powers in Sturmian words. The key tools in our analysis are canonical decompositions and a generalization of singular words, which were originally defined for the ubiquitous Fibonacci word. Our main results are demonstrated via some examples, including the $k$-bonacci word: a generalization of the Fibonacci word to a $k$-letter alphabet ($k\geq2$).<|reference_end|> | arxiv | @article{glen2007powers,
title={Powers in a class of A-strict standard episturmian words},
author={Amy Glen},
journal={Theoretical Computer Science 380 (2007) 330-354},
year={2007},
doi={10.1016/j.tcs.2007.03.023},
archivePrefix={arXiv},
eprint={0708.4400},
primaryClass={math.CO cs.DM}
} | glen2007powers |
arxiv-1100 | 0708.4406 | A characterization of fine words over a finite alphabet | <|reference_start|>A characterization of fine words over a finite alphabet: To any infinite word w over a finite alphabet A we can associate two infinite words min(w) and max(w) such that any prefix of min(w) (resp. max(w)) is the lexicographically smallest (resp. greatest) amongst the factors of w of the same length. We say that an infinite word w over A is "fine" if there exists an infinite word u such that, for any lexicographic order, min(w) = au where a = min(A). In this paper, we characterize fine words; specifically, we prove that an infinite word w is fine if and only if w is either a "strict episturmian word" or a strict "skew episturmian word''. This characterization generalizes a recent result of G. Pirillo, who proved that a fine word over a 2-letter alphabet is either an (aperiodic) Sturmian word, or an ultimately periodic (but not periodic) infinite word, all of whose factors are (finite) Sturmian.<|reference_end|> | arxiv | @article{glen2007a,
title={A characterization of fine words over a finite alphabet},
author={Amy Glen},
journal={Theoretical Computer Science 391 (2008) 51-60},
year={2007},
doi={10.1016/j.tcs.2007.10.029},
archivePrefix={arXiv},
eprint={0708.4406},
primaryClass={math.CO cs.DM}
} | glen2007a |
Subsets and Splits