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-201 | 0705.0124 | On the Low-SNR Capacity of Phase-Shift Keying with Hard-Decision Detection | <|reference_start|>On the Low-SNR Capacity of Phase-Shift Keying with Hard-Decision Detection: The low-snr capacity of M-ary PSK transmission over both the additive white Gaussian noise (AWGN) and fading channels is analyzed when hard-decision detection is employed at the receiver. Closed-form expressions for the first and second derivatives of the capacity at zero snr are obtained. The spectral-efficiency/bit-energy tradeoff in the low-snr regime is analyzed by finding the wideband slope and the bit energy required at zero spectral efficiency. Practical design guidelines are drawn from the information-theoretic analysis. The fading channel analysis is conducted for both coherent and noncoherent cases, and the performance penalty in the low-power regime for not knowing the channel is identified.<|reference_end|> | arxiv | @article{gursoy2007on,
title={On the Low-SNR Capacity of Phase-Shift Keying with Hard-Decision
Detection},
author={Mustafa Cenk Gursoy},
journal={arXiv preprint arXiv:0705.0124},
year={2007},
doi={10.1109/ISIT.2007.4557221},
archivePrefix={arXiv},
eprint={0705.0124},
primaryClass={cs.IT math.IT}
} | gursoy2007on |
arxiv-202 | 0705.0128 | Training Optimization for Gauss-Markov Rayleigh Fading Channels | <|reference_start|>Training Optimization for Gauss-Markov Rayleigh Fading Channels: In this paper, pilot-assisted transmission over Gauss-Markov Rayleigh fading channels is considered. A simple scenario, where a single pilot signal is transmitted every T symbols and T-1 data symbols are transmitted in between the pilots, is studied. First, it is assumed that binary phase-shift keying (BPSK) modulation is employed at the transmitter. With this assumption, the training period, and data and training power allocation are jointly optimized by maximizing an achievable rate expression. Achievable rates and energy-per-bit requirements are computed using the optimal training parameters. Secondly, a capacity lower bound is obtained by considering the error in the estimate as another source of additive Gaussian noise, and the training parameters are optimized by maximizing this lower bound.<|reference_end|> | arxiv | @article{akin2007training,
title={Training Optimization for Gauss-Markov Rayleigh Fading Channels},
author={Sami Akin, Mustafa Cenk Gursoy},
journal={arXiv preprint arXiv:0705.0128},
year={2007},
doi={10.1109/ICC.2007.994},
archivePrefix={arXiv},
eprint={0705.0128},
primaryClass={cs.IT math.IT}
} | akin2007training |
arxiv-203 | 0705.0130 | Performance Analysis for Multichannel Reception of OOFSK Signaling | <|reference_start|>Performance Analysis for Multichannel Reception of OOFSK Signaling: In this paper, the error performance of on-off frequency shift keying (OOFSK) modulation over fading channels is analyzed when the receiver is equipped with multiple antennas. The analysis is conducted in two cases: the coherent scenario where the fading is perfectly known at the receiver, and the noncoherent scenario where neither the receiver nor the transmitter knows the fading coefficients. For both cases, the maximum a posteriori probability (MAP) detection rule is derived and analytical probability of error expressions are obtained. The effect of fading correlation among the receiver antennas is also studied. Simulation results indicate that for sufficiently low duty cycle values, lower probability of error values with respect to FSK signaling are achieved. Equivalently, when compared to FSK modulation, OOFSK with low duty cycle requires less energy to achieve the same probability of error, which renders this modulation a more energy efficient transmission technique.<|reference_end|> | arxiv | @article{wang2007performance,
title={Performance Analysis for Multichannel Reception of OOFSK Signaling},
author={Qingyun Wang, Mustafa Cenk Gursoy},
journal={arXiv preprint arXiv:0705.0130},
year={2007},
doi={10.1109/WCNC.2007.444},
archivePrefix={arXiv},
eprint={0705.0130},
primaryClass={cs.IT math.IT}
} | wang2007performance |
arxiv-204 | 0705.0132 | Error Probability Analysis of Peaky Signaling over Fading Channels | <|reference_start|>Error Probability Analysis of Peaky Signaling over Fading Channels: In this paper, the performance of signaling strategies with high peak-to-average power ratio is analyzed in both coherent and noncoherent fading channels. Two recently proposed modulation schemes, namely on-off binary phase-shift keying and on-off quaternary phase-shift keying, are considered. For these modulation formats, the optimal decision rules used at the detector are identified and analytical expressions for the error probabilities are obtained. Numerical techniques are employed to compute the error probabilities. It is concluded that increasing the peakedness of the signals results in reduced error rates for a given power level and hence improve the energy efficiency.<|reference_end|> | arxiv | @article{gursoy2007error,
title={Error Probability Analysis of Peaky Signaling over Fading Channels},
author={Mustafa Cenk Gursoy},
journal={arXiv preprint arXiv:0705.0132},
year={2007},
archivePrefix={arXiv},
eprint={0705.0132},
primaryClass={cs.IT math.IT}
} | gursoy2007error |
arxiv-205 | 0705.0150 | Comparison of Discrete and Continuous Wavelet Transforms | <|reference_start|>Comparison of Discrete and Continuous Wavelet Transforms: In this paper we outline several points of view on the interplay between discrete and continuous wavelet transforms; stressing both pure and applied aspects of both. We outline some new links between the two transform technologies based on the theory of representations of generators and relations. By this we mean a finite system of generators which are represented by operators in Hilbert space. We further outline how these representations yield sub-band filter banks for signal and image processing algorithms.<|reference_end|> | arxiv | @article{jorgensen2007comparison,
title={Comparison of Discrete and Continuous Wavelet Transforms},
author={Palle E. T. Jorgensen, Myung-Sin Song},
journal={arXiv preprint arXiv:0705.0150},
year={2007},
archivePrefix={arXiv},
eprint={0705.0150},
primaryClass={cs.CE}
} | jorgensen2007comparison |
arxiv-206 | 0705.0178 | Oblivious Transfer based on Key Exchange | <|reference_start|>Oblivious Transfer based on Key Exchange: Key-exchange protocols have been overlooked as a possible means for implementing oblivious transfer (OT). In this paper we present a protocol for mutual exchange of secrets, 1-out-of-2 OT and coin flipping similar to Diffie-Hellman protocol using the idea of obliviously exchanging encryption keys. Since, Diffie-Hellman scheme is widely used, our protocol may provide a useful alternative to the conventional methods for implementation of oblivious transfer and a useful primitive in building larger cryptographic schemes.<|reference_end|> | arxiv | @article{parakh2007oblivious,
title={Oblivious Transfer based on Key Exchange},
author={Abhishek Parakh},
journal={Cryptologia, Volume 32, Issue 1 January 2008, pages 37 - 44},
year={2007},
doi={10.1080/01611190701593228},
archivePrefix={arXiv},
eprint={0705.0178},
primaryClass={cs.CR}
} | parakh2007oblivious |
arxiv-207 | 0705.0197 | Fault Classification in Cylinders Using Multilayer Perceptrons, Support Vector Machines and Guassian Mixture Models | <|reference_start|>Fault Classification in Cylinders Using Multilayer Perceptrons, Support Vector Machines and Guassian Mixture Models: Gaussian mixture models (GMM) and support vector machines (SVM) are introduced to classify faults in a population of cylindrical shells. The proposed procedures are tested on a population of 20 cylindrical shells and their performance is compared to the procedure, which uses multi-layer perceptrons (MLP). The modal properties extracted from vibration data are used to train the GMM, SVM and MLP. It is observed that the GMM produces 98%, SVM produces 94% classification accuracy while the MLP produces 88% classification rates.<|reference_end|> | arxiv | @article{marwala2007fault,
title={Fault Classification in Cylinders Using Multilayer Perceptrons, Support
Vector Machines and Guassian Mixture Models},
author={Tshilidzi Marwala, Unathi Mahola and Snehashish Chakraverty},
journal={Computer Assisted Mechanics and Engineering Sciences, Vol. 14, No.
2, 2007.},
year={2007},
archivePrefix={arXiv},
eprint={0705.0197},
primaryClass={cs.AI}
} | marwala2007fault |
arxiv-208 | 0705.0199 | The Parameter-Less Self-Organizing Map algorithm | <|reference_start|>The Parameter-Less Self-Organizing Map algorithm: The Parameter-Less Self-Organizing Map (PLSOM) is a new neural network algorithm based on the Self-Organizing Map (SOM). It eliminates the need for a learning rate and annealing schemes for learning rate and neighbourhood size. We discuss the relative performance of the PLSOM and the SOM and demonstrate some tasks in which the SOM fails but the PLSOM performs satisfactory. Finally we discuss some example applications of the PLSOM and present a proof of ordering under certain limited conditions.<|reference_end|> | arxiv | @article{berglund2007the,
title={The Parameter-Less Self-Organizing Map algorithm},
author={Erik Berglund, Joaquin Sitte},
journal={IEEE Transactions on Neural Networks, 2006 v.17, n.2, pp.305-316},
year={2007},
archivePrefix={arXiv},
eprint={0705.0199},
primaryClass={cs.NE cs.AI cs.CV}
} | berglund2007the |
arxiv-209 | 0705.0204 | Using Images to create a Hierarchical Grid Spatial Index | <|reference_start|>Using Images to create a Hierarchical Grid Spatial Index: This paper presents a hybrid approach to spatial indexing of two dimensional data. It sheds new light on the age old problem by thinking of the traditional algorithms as working with images. Inspiration is drawn from an analogous situation that is found in machine and human vision. Image processing techniques are used to assist in the spatial indexing of the data. A fixed grid approach is used and bins with too many records are sub-divided hierarchically. Search queries are pre-computed for bins that do not contain any data records. This has the effect of dividing the search space up into non rectangular regions which are based on the spatial properties of the data. The bucketing quad tree can be considered as an image with a resolution of two by two for each layer. The results show that this method performs better than the quad tree if there are more divisions per layer. This confirms our suspicions that the algorithm works better if it gets to look at the data with higher resolution images. An elegant class structure is developed where the implementation of concrete spatial indexes for a particular data type merely relies on rendering the data onto an image.<|reference_end|> | arxiv | @article{machowski2007using,
title={Using Images to create a Hierarchical Grid Spatial Index},
author={Lukasz A. Machowski, and Tshilidzi Marwala},
journal={arXiv preprint arXiv:0705.0204},
year={2007},
doi={10.1109/ICSMC.2006.385020},
archivePrefix={arXiv},
eprint={0705.0204},
primaryClass={cs.DS}
} | machowski2007using |
arxiv-210 | 0705.0214 | Riemannian level-set methods for tensor-valued data | <|reference_start|>Riemannian level-set methods for tensor-valued data: We present a novel approach for the derivation of PDE modeling curvature-driven flows for matrix-valued data. This approach is based on the Riemannian geometry of the manifold of Symmetric Positive Definite Matrices Pos(n).<|reference_end|> | arxiv | @article{zerai2007riemannian,
title={Riemannian level-set methods for tensor-valued data},
author={Mourad Zerai, Maher Moakher},
journal={arXiv preprint arXiv:0705.0214},
year={2007},
archivePrefix={arXiv},
eprint={0705.0214},
primaryClass={cs.CV}
} | zerai2007riemannian |
arxiv-211 | 0705.0252 | Power Allocation for Discrete-Input Non-Ergodic Block-Fading Channels | <|reference_start|>Power Allocation for Discrete-Input Non-Ergodic Block-Fading Channels: We consider power allocation algorithms for fixed-rate transmission over Nakagami-m non-ergodic block-fading channels with perfect transmitter and receiver channel state information and discrete input signal constellations under both short- and long-term power constraints. Optimal power allocation schemes are shown to be direct applications of previous results in the literature. We show that the SNR exponent of the optimal short-term scheme is given by the Singleton bound. We also illustrate the significant gains available by employing long-term power constraints. Due to the nature of the expressions involved, the complexity of optimal schemes may be prohibitive for system implementation. We propose simple sub-optimal power allocation schemes whose outage probability performance is very close to the minimum outage probability obtained by optimal schemes.<|reference_end|> | arxiv | @article{nguyen2007power,
title={Power Allocation for Discrete-Input Non-Ergodic Block-Fading Channels},
author={Khoa D. Nguyen, Albert Guillen i Fabregas and Lars K. Rasmussen},
journal={arXiv preprint arXiv:0705.0252},
year={2007},
archivePrefix={arXiv},
eprint={0705.0252},
primaryClass={cs.IT math.IT}
} | nguyen2007power |
arxiv-212 | 0705.0253 | More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding | <|reference_start|>More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding: There is a large literature devoted to the problem of finding an optimal (min-cost) prefix-free code with an unequal letter-cost encoding alphabet of size. While there is no known polynomial time algorithm for solving it optimally there are many good heuristics that all provide additive errors to optimal. The additive error in these algorithms usually depends linearly upon the largest encoding letter size. This paper was motivated by the problem of finding optimal codes when the encoding alphabet is infinite. Because the largest letter cost is infinite, the previous analyses could give infinite error bounds. We provide a new algorithm that works with infinite encoding alphabets. When restricted to the finite alphabet case, our algorithm often provides better error bounds than the best previous ones known.<|reference_end|> | arxiv | @article{golin2007more,
title={More Efficient Algorithms and Analyses for Unequal Letter Cost
Prefix-Free Coding},
author={Mordecai Golin and Li Jian},
journal={arXiv preprint arXiv:0705.0253},
year={2007},
archivePrefix={arXiv},
eprint={0705.0253},
primaryClass={cs.IT cs.DS math.IT}
} | golin2007more |
arxiv-213 | 0705.0262 | The Complexity of Games on Higher Order Pushdown Automata | <|reference_start|>The Complexity of Games on Higher Order Pushdown Automata: We prove an n-EXPTIME lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches the known upper bound for parity games on HPDA. As a consequence the mu-calculus model checking over graphs given by n-HPDA is n-EXPTIME complete.<|reference_end|> | arxiv | @article{cachat2007the,
title={The Complexity of Games on Higher Order Pushdown Automata},
author={Thierry Cachat (LIAFA), Igor Walukiewicz (LaBRI)},
journal={arXiv preprint arXiv:0705.0262},
year={2007},
archivePrefix={arXiv},
eprint={0705.0262},
primaryClass={cs.GT}
} | cachat2007the |
arxiv-214 | 0705.0281 | Dynamic Clustering in Object-Oriented Databases: An Advocacy for Simplicity | <|reference_start|>Dynamic Clustering in Object-Oriented Databases: An Advocacy for Simplicity: We present in this paper three dynamic clustering techniques for Object-Oriented Databases (OODBs). The first two, Dynamic, Statistical & Tunable Clustering (DSTC) and StatClust, exploit both comprehensive usage statistics and the inter-object reference graph. They are quite elaborate. However, they are also complex to implement and induce a high overhead. The third clustering technique, called Detection & Reclustering of Objects (DRO), is based on the same principles, but is much simpler to implement. These three clustering algorithm have been implemented in the Texas persistent object store and compared in terms of clustering efficiency (i.e., overall performance increase) and overhead using the Object Clustering Benchmark (OCB). The results obtained showed that DRO induced a lighter overhead while still achieving better overall performance.<|reference_end|> | arxiv | @article{darmont2007dynamic,
title={Dynamic Clustering in Object-Oriented Databases: An Advocacy for
Simplicity},
author={J'er^ome Darmont (LIMOS), Christophe Fromantin (LIMOS), St'ephane
R'egnier (LIMOS), Le Gruenwald, Michel Schneider (LIMOS)},
journal={LNCS, Vol. 1944 (06/2000) 71-85},
year={2007},
archivePrefix={arXiv},
eprint={0705.0281},
primaryClass={cs.DB}
} | darmont2007dynamic |
arxiv-215 | 0705.0286 | Inverse-free Berlekamp-Massey-Sakata Algorithm and Small Decoders for Algebraic-Geometric Codes | <|reference_start|>Inverse-free Berlekamp-Massey-Sakata Algorithm and Small Decoders for Algebraic-Geometric Codes: This paper proposes a novel algorithm for finding error-locators of algebraic-geometric codes that can eliminate the division-calculations of finite fields from the Berlekamp-Massey-Sakata algorithm. This inverse-free algorithm provides full performance in correcting a certain class of errors, generic errors, which includes most errors, and can decode codes on algebraic curves without the determination of unknown syndromes. Moreover, we propose three different kinds of architectures that our algorithm can be applied to, and we represent the control operation of shift-registers and switches at each clock-timing with numerical simulations. We estimate the performance in comparison of the total running time and the numbers of multipliers and shift-registers in three architectures with those of the conventional ones for codes on algebraic curves.<|reference_end|> | arxiv | @article{matsui2007inverse-free,
title={Inverse-free Berlekamp-Massey-Sakata Algorithm and Small Decoders for
Algebraic-Geometric Codes},
author={Hajime Matsui, Seiichi Mita},
journal={arXiv preprint arXiv:0705.0286},
year={2007},
archivePrefix={arXiv},
eprint={0705.0286},
primaryClass={cs.IT math.IT}
} | matsui2007inverse-free |
arxiv-216 | 0705.0315 | WDM and Directed Star Arboricity | <|reference_start|>WDM and Directed Star Arboricity: A digraph is $m$-labelled if every arc is labelled by an integer in $\{1, \dots,m\}$. Motivated by wavelength assignment for multicasts in optical networks, we introduce and study $n$-fibre colourings of labelled digraphs. These are colourings of the arcs of $D$ such that at each vertex $v$, and for each colour $\alpha$, $in(v,\alpha)+out(v,\alpha)\leq n$ with $in(v,\alpha)$ the number of arcs coloured $\alpha$ entering $v$ and $out(v,\alpha)$ the number of labels $l$ such that there is at least one arc of label $l$ leaving $v$ and coloured with $\alpha$. The problem is to find the minimum number of colours $\lambda_n(D)$ such that the $m$-labelled digraph $D$ has an $n$-fibre colouring. In the particular case when $D$ is $1$-labelled, $\lambda_1(D)$ is called the directed star arboricity of $D$, and is denoted by $dst(D)$. We first show that $dst(D)\leq 2\Delta^-(D)+1$, and conjecture that if $\Delta^-(D)\geq 2$, then $dst(D)\leq 2\Delta^-(D)$. We also prove that for a subcubic digraph $D$, then $dst(D)\leq 3$, and that if $\Delta^+(D), \Delta^-(D)\leq 2$, then $dst(D)\leq 4$. Finally, we study $\lambda_n(m,k)=\max\{\lambda_n(D) \tq D \mbox{is $m$-labelled} \et \Delta^-(D)\leq k\}$. We show that if $m\geq n$, then $\ds \left\lceil\frac{m}{n}\left\lceil \frac{k}{n}\right\rceil + \frac{k}{n} \right\rceil\leq \lambda_n(m,k) \leq\left\lceil\frac{m}{n}\left\lceil \frac{k}{n}\right\rceil + \frac{k}{n} \right\rceil + C \frac{m^2\log k}{n}$ for some constant $C$. We conjecture that the lower bound should be the right value of $\lambda_n(m,k)$.<|reference_end|> | arxiv | @article{amini2007wdm,
title={WDM and Directed Star Arboricity},
author={Omid Amini, Frederic Havet, Florian Huc, Stephan Thomasse},
journal={Combinatorics, Probability and Computing, Volume 19, Issue 02,
March 2010, pp 161-182},
year={2007},
archivePrefix={arXiv},
eprint={0705.0315},
primaryClass={cs.NI math.CO}
} | amini2007wdm |
arxiv-217 | 0705.0326 | Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Hybrid Random Walk and One-Dimensional Mobility Models | <|reference_start|>Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Hybrid Random Walk and One-Dimensional Mobility Models: Optimal delay-throughput trade-offs for two-dimensional i.i.d mobility models have been established in [23], where we showed that the optimal trade-offs can be achieved using rate-less codes when the required delay guarantees are sufficient large. In this paper, we extend the results to other mobility models including two-dimensional hybrid random walk model, one-dimensional i.i.d. mobility model and one-dimensional hybrid random walk model. We consider both fast mobiles and slow mobiles, and establish the optimal delay-throughput trade-offs under some conditions. Joint coding-scheduling algorithms are also proposed to achieve the optimal trade-offs.<|reference_end|> | arxiv | @article{ying2007optimal,
title={Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Hybrid
Random Walk and One-Dimensional Mobility Models},
author={Lei Ying and R. Srikant},
journal={arXiv preprint arXiv:0705.0326},
year={2007},
archivePrefix={arXiv},
eprint={0705.0326},
primaryClass={cs.NI cs.IT math.IT}
} | ying2007optimal |
arxiv-218 | 0705.0350 | Algorithms for laying points optimally on a plane and a circle | <|reference_start|>Algorithms for laying points optimally on a plane and a circle: Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.<|reference_end|> | arxiv | @article{sharipov2007algorithms,
title={Algorithms for laying points optimally on a plane and a circle},
author={Ruslan Sharipov},
journal={arXiv preprint arXiv:0705.0350},
year={2007},
archivePrefix={arXiv},
eprint={0705.0350},
primaryClass={cs.CG math.OC}
} | sharipov2007algorithms |
arxiv-219 | 0705.0413 | Edges and Switches, Tunnels and Bridges | <|reference_start|>Edges and Switches, Tunnels and Bridges: Edge casing is a well-known method to improve the readability of drawings of non-planar graphs. A cased drawing orders the edges of each edge crossing and interrupts the lower edge in an appropriate neighborhood of the crossing. Certain orders will lead to a more readable drawing than others. We formulate several optimization criteria that try to capture the concept of a "good" cased drawing. Further, we address the algorithmic question of how to turn a given drawing into an optimal cased drawing. For many of the resulting optimization problems, we either find polynomial time algorithms or NP-hardness results.<|reference_end|> | arxiv | @article{eppstein2007edges,
title={Edges and Switches, Tunnels and Bridges},
author={David Eppstein, Marc van Kreveld, Elena Mumford, and Bettina Speckmann},
journal={Computational Geometry Theory & Applications 42(8): 790-802, 2009},
year={2007},
doi={10.1016/j.comgeo.2008.05.005},
archivePrefix={arXiv},
eprint={0705.0413},
primaryClass={cs.DS cs.CG}
} | eppstein2007edges |
arxiv-220 | 0705.0419 | Undirected Graphs of Entanglement Two | <|reference_start|>Undirected Graphs of Entanglement Two: Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical properties of transition systems. We are interested in the problem of deciding whether a graph has entanglement at most k. As this measure is defined by means of games, game theoretic ideas naturally lead to design polynomial algorithms that, for fixed k, decide the problem. Known characterizations of directed graphs of entanglement at most 1 lead, for k = 1, to design even faster algorithms. In this paper we present an explicit characterization of undirected graphs of entanglement at most 2. With such a characterization at hand, we devise a linear time algorithm to decide whether an undirected graph has this property.<|reference_end|> | arxiv | @article{belkhir2007undirected,
title={Undirected Graphs of Entanglement Two},
author={Walid Belkhir (LIF), Luigi Santocanale (LIF)},
journal={FSTTCS 2007: Foundations of Software Technology and Theoretical
Computer Science, Inde (2007)},
year={2007},
doi={10.1007/978-3-540-77050-3_42},
archivePrefix={arXiv},
eprint={0705.0419},
primaryClass={cs.LO cs.GT}
} | belkhir2007undirected |
arxiv-221 | 0705.0422 | Frugal Colouring of Graphs | <|reference_start|>Frugal Colouring of Graphs: A $k$-frugal colouring of a graph $G$ is a proper colouring of the vertices of $G$ such that no colour appears more than $k$ times in the neighbourhood of a vertex. This type of colouring was introduced by Hind, Molloy and Reed in 1997. In this paper, we study the frugal chromatic number of planar graphs, planar graphs with large girth, and outerplanar graphs, and relate this parameter with several well-studied colourings, such as colouring of the square, cyclic colouring, and $L(p,q)$-labelling. We also study frugal edge-colourings of multigraphs.<|reference_end|> | arxiv | @article{amini2007frugal,
title={Frugal Colouring of Graphs},
author={Omid Amini (INRIA Sophia Antipolis), Louis Esperet (LaBRI), Jan Van
Den Heuvel (LSE)},
journal={arXiv preprint arXiv:0705.0422},
year={2007},
archivePrefix={arXiv},
eprint={0705.0422},
primaryClass={cs.DM cs.NI}
} | amini2007frugal |
arxiv-222 | 0705.0423 | Encoding for the Blackwell Channel with Reinforced Belief Propagation | <|reference_start|>Encoding for the Blackwell Channel with Reinforced Belief Propagation: A key idea in coding for the broadcast channel (BC) is binning, in which the transmitter encode information by selecting a codeword from an appropriate bin (the messages are thus the bin indexes). This selection is normally done by solving an appropriate (possibly difficult) combinatorial problem. Recently it has been shown that binning for the Blackwell channel --a particular BC-- can be done by iterative schemes based on Survey Propagation (SP). This method uses decimation for SP and suffers a complexity of O(n^2). In this paper we propose a new variation of the Belief Propagation (BP) algorithm, named Reinforced BP algorithm, that turns BP into a solver. Our simulations show that this new algorithm has complexity O(n log n). Using this new algorithm together with a non-linear coding scheme, we can efficiently achieve rates close to the border of the capacity region of the Blackwell channel.<|reference_end|> | arxiv | @article{braunstein2007encoding,
title={Encoding for the Blackwell Channel with Reinforced Belief Propagation},
author={A. Braunstein, F. Kayhan, G. Montorsi and R. Zecchina},
journal={IEEE International Symposium on Information Theory (ISIT07); 2007.
p. 1891-5},
year={2007},
doi={10.1109/ISIT.2007.4557497},
archivePrefix={arXiv},
eprint={0705.0423},
primaryClass={cs.IT math.IT}
} | braunstein2007encoding |
arxiv-223 | 0705.0425 | Batch Processor Sharing with Hyper-Exponential Service Time | <|reference_start|>Batch Processor Sharing with Hyper-Exponential Service Time: We study Batch Processor-Sharing (BPS) queuing model with hyper-exponential service time distribution and Poisson batch arrival process. One of the main goals to study BPS is the possibility of its application in size-based scheduling, which is used in differentiation between Short and Long flows in the Internet. In the case of hyper-exponential service time distribution we find an analytical expression of the expected conditional response time for the BPS queue. We show, that the expected conditional response time is a concave function of the service time. We apply the received results to the Two Level Processor-Sharing (TLPS) model with hyper-exponential service time distribution and find the expression of the expected response time for the TLPS model. TLPS scheduling discipline can be applied to size-based differentiation in TCP/IP networks and Web server request handling.<|reference_end|> | arxiv | @article{osipova2007batch,
title={Batch Processor Sharing with Hyper-Exponential Service Time},
author={Natalia Osipova (INRIA Sophia Antipolis)},
journal={arXiv preprint arXiv:0705.0425},
year={2007},
archivePrefix={arXiv},
eprint={0705.0425},
primaryClass={cs.NI}
} | osipova2007batch |
arxiv-224 | 0705.0449 | Multiresolution Approximation of Polygonal Curves in Linear Complexity | <|reference_start|>Multiresolution Approximation of Polygonal Curves in Linear Complexity: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality between successive levels of resolution using dynamic programming. We show theoretically and experimentally that this algorithm has a linear complexity in time and space. We experimentally compare the outcomes of our algorithm to the optimal "full search" dynamic programming solution and finally to classical merge and split approaches. The experimental evaluations confirm the theoretical derivations and show that the proposed approach evaluated on 2D coastal maps either show a lower time complexity or provide polygonal approximations closer to the input discrete curves.<|reference_end|> | arxiv | @article{marteau2007multiresolution,
title={Multiresolution Approximation of Polygonal Curves in Linear Complexity},
author={Pierre-Franc{c}ois Marteau (VALORIA), Gilbas M'enier (VALORIA)},
journal={arXiv preprint arXiv:0705.0449},
year={2007},
archivePrefix={arXiv},
eprint={0705.0449},
primaryClass={cs.CV}
} | marteau2007multiresolution |
arxiv-225 | 0705.0450 | VOODB: A Generic Discrete-Event Random Simulation Model to Evaluate the Performances of OODBs | <|reference_start|>VOODB: A Generic Discrete-Event Random Simulation Model to Evaluate the Performances of OODBs: Performance of object-oriented database systems (OODBs) is still an issue to both designers and users nowadays. The aim of this paper is to propose a generic discrete-event random simulation model, called VOODB, in order to evaluate the performances of OODBs in general, and the performances of optimization methods like clustering in particular. Such optimization methods undoubtedly improve the performances of OODBs. Yet, they also always induce some kind of overhead for the system. Therefore, it is important to evaluate their exact impact on the overall performances. VOODB has been designed as a generic discrete-event random simulation model by putting to use a modelling approach, and has been validated by simulating the behavior of the O2 OODB and the Texas persistent object store. Since our final objective is to compare object clustering algorithms, some experiments have also been conducted on the DSTC clustering technique, which is implemented in Texas. To validate VOODB, performance results obtained by simulation for a given experiment have been compared to the results obtained by benchmarking the real systems in the same conditions. Benchmarking and simulation performance evaluations have been observed to be consistent, so it appears that simulation can be a reliable approach to evaluate the performances of OODBs.<|reference_end|> | arxiv | @article{darmont2007voodb:,
title={VOODB: A Generic Discrete-Event Random Simulation Model to Evaluate the
Performances of OODBs},
author={J'er^ome Darmont (LIMOS), Michel Schneider (LIMOS)},
journal={25th International Conference on Very Large Databases (VLDB 99)
(09/1999) 254-265},
year={2007},
archivePrefix={arXiv},
eprint={0705.0450},
primaryClass={cs.DB}
} | darmont2007voodb: |
arxiv-226 | 0705.0453 | OCB: A Generic Benchmark to Evaluate the Performances of Object-Oriented Database Systems | <|reference_start|>OCB: A Generic Benchmark to Evaluate the Performances of Object-Oriented Database Systems: We present in this paper a generic object-oriented benchmark (the Object Clustering Benchmark) that has been designed to evaluate the performances of clustering policies in object-oriented databases. OCB is generic because its sample database may be customized to fit the databases introduced by the main existing benchmarks (e.g., OO1). OCB's current form is clustering-oriented because of its clustering-oriented workload, but it can be easily adapted to other purposes. Lastly, OCB's code is compact and easily portable. OCB has been implemented in a real system (Texas, running on a Sun workstation), in order to test a specific clustering policy called DSTC. A few results concerning this test are presented.<|reference_end|> | arxiv | @article{darmont2007ocb:,
title={OCB: A Generic Benchmark to Evaluate the Performances of Object-Oriented
Database Systems},
author={J'er^ome Darmont (LIMOS), Bertrand Petit (LIMOS), Michel Schneider
(LIMOS)},
journal={LNCS, Vol. 1377 (03/1998) 326-340},
year={2007},
archivePrefix={arXiv},
eprint={0705.0453},
primaryClass={cs.DB}
} | darmont2007ocb: |
arxiv-227 | 0705.0454 | Performance Evaluation for Clustering Algorithms in Object-Oriented Database Systems | <|reference_start|>Performance Evaluation for Clustering Algorithms in Object-Oriented Database Systems: It is widely acknowledged that good object clustering is critical to the performance of object-oriented databases. However, object clustering always involves some kind of overhead for the system. The aim of this paper is to propose a modelling methodology in order to evaluate the performances of different clustering policies. This methodology has been used to compare the performances of three clustering algorithms found in the literature (Cactis, CK and ORION) that we considered representative of the current research in the field of object clustering. The actual performance evaluation was performed using simulation. Simulation experiments we performed showed that the Cactis algorithm is better than the ORION algorithm and that the CK algorithm totally outperforms both other algorithms in terms of response time and clustering overhead.<|reference_end|> | arxiv | @article{darmont2007performance,
title={Performance Evaluation for Clustering Algorithms in Object-Oriented
Database Systems},
author={J'er^ome Darmont (LIMOS), Amar Attoui (LIMOS), Michel Gourgand
(LIMOS)},
journal={LNCS, Vol. 978 (09/1995) 187-196},
year={2007},
archivePrefix={arXiv},
eprint={0705.0454},
primaryClass={cs.DB}
} | darmont2007performance |
arxiv-228 | 0705.0462 | Resource modalities in game semantics | <|reference_start|>Resource modalities in game semantics: The description of resources in game semantics has never achieved the simplicity and precision of linear logic, because of a misleading conception: the belief that linear logic is more primitive than game semantics. We advocate instead the contrary: that game semantics is conceptually more primitive than linear logic. Starting from this revised point of view, we design a categorical model of resources in game semantics, and construct an arena game model where the usual notion of bracketing is extended to multi- bracketing in order to capture various resource policies: linear, affine and exponential.<|reference_end|> | arxiv | @article{melliès2007resource,
title={Resource modalities in game semantics},
author={Paul-Andr'e Melli`es (PPS), Nicolas Tabareau (PPS)},
journal={arXiv preprint arXiv:0705.0462},
year={2007},
archivePrefix={arXiv},
eprint={0705.0462},
primaryClass={math.CT cs.CL}
} | melliès2007resource |
arxiv-229 | 0705.0543 | The Design of Efficiently-Encodable Rate-Compatible LDPC Codes | <|reference_start|>The Design of Efficiently-Encodable Rate-Compatible LDPC Codes: We present a new class of irregular low-density parity-check (LDPC) codes for moderate block lengths (up to a few thousand bits) that are well-suited for rate-compatible puncturing. The proposed codes show good performance under puncturing over a wide range of rates and are suitable for usage in incremental redundancy hybrid-automatic repeat request (ARQ) systems. In addition, these codes are linear-time encodable with simple shift-register circuits. For a block length of 1200 bits the codes outperform optimized irregular LDPC codes and extended irregular repeat-accumulate (eIRA) codes for all puncturing rates 0.6~0.9 (base code performance is almost the same) and are particularly good at high puncturing rates where good puncturing performance has been previously difficult to achieve.<|reference_end|> | arxiv | @article{kim2007the,
title={The Design of Efficiently-Encodable Rate-Compatible LDPC Codes},
author={Jaehong Kim, Aditya Ramamoorthy and Steven W. McLaughlin},
journal={arXiv preprint arXiv:0705.0543},
year={2007},
doi={10.1109/ICC.2006.254899},
archivePrefix={arXiv},
eprint={0705.0543},
primaryClass={cs.IT math.IT}
} | kim2007the |
arxiv-230 | 0705.0552 | Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets | <|reference_start|>Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets: We consider the {\it indexable dictionary} problem, which consists of storing a set $S \subseteq \{0,...,m-1\}$ for some integer $m$, while supporting the operations of $\Rank(x)$, which returns the number of elements in $S$ that are less than $x$ if $x \in S$, and -1 otherwise; and $\Select(i)$ which returns the $i$-th smallest element in $S$. We give a data structure that supports both operations in O(1) time on the RAM model and requires ${\cal B}(n,m) + o(n) + O(\lg \lg m)$ bits to store a set of size $n$, where ${\cal B}(n,m) = \ceil{\lg {m \choose n}}$ is the minimum number of bits required to store any $n$-element subset from a universe of size $m$. Previous dictionaries taking this space only supported (yes/no) membership queries in O(1) time. In the cell probe model we can remove the $O(\lg \lg m)$ additive term in the space bound, answering a question raised by Fich and Miltersen, and Pagh. We present extensions and applications of our indexable dictionary data structure, including: An information-theoretically optimal representation of a $k$-ary cardinal tree that supports standard operations in constant time, A representation of a multiset of size $n$ from $\{0,...,m-1\}$ in ${\cal B}(n,m+n) + o(n)$ bits that supports (appropriate generalizations of) $\Rank$ and $\Select$ operations in constant time, and A representation of a sequence of $n$ non-negative integers summing up to $m$ in ${\cal B}(n,m+n) + o(n)$ bits that supports prefix sum queries in constant time.<|reference_end|> | arxiv | @article{raman2007succinct,
title={Succinct Indexable Dictionaries with Applications to Encoding $k$-ary
Trees, Prefix Sums and Multisets},
author={Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti},
journal={ACM Transactions on Algorithms vol 3 (2007), Article 43, 25pp},
year={2007},
doi={10.1145/1290672.1290680},
archivePrefix={arXiv},
eprint={0705.0552},
primaryClass={cs.DS cs.DM cs.IT math.IT}
} | raman2007succinct |
arxiv-231 | 0705.0561 | Iterative Rounding for the Closest String Problem | <|reference_start|>Iterative Rounding for the Closest String Problem: The closest string problem is an NP-hard problem, whose task is to find a string that minimizes maximum Hamming distance to a given set of strings. This can be reduced to an integer program (IP). However, to date, there exists no known polynomial-time algorithm for IP. In 2004, Meneses et al. introduced a branch-and-bound (B & B) method for solving the IP problem. Their algorithm is not always efficient and has the exponential time complexity. In the paper, we attempt to solve efficiently the IP problem by a greedy iterative rounding technique. The proposed algorithm is polynomial time and much faster than the existing B & B IP for the CSP. If the number of strings is limited to 3, the algorithm is provably at most 1 away from the optimum. The empirical results show that in many cases we can find an exact solution. Even though we fail to find an exact solution, the solution found is very close to exact solution.<|reference_end|> | arxiv | @article{chen2007iterative,
title={Iterative Rounding for the Closest String Problem},
author={Jing-Chao Chen},
journal={arXiv preprint arXiv:0705.0561},
year={2007},
archivePrefix={arXiv},
eprint={0705.0561},
primaryClass={cs.DS cs.CC}
} | chen2007iterative |
arxiv-232 | 0705.0564 | Rate Bounds for MIMO Relay Channels | <|reference_start|>Rate Bounds for MIMO Relay Channels: This paper considers the multi-input multi-output (MIMO) relay channel where multiple antennas are employed by each terminal. Compared to single-input single-output (SISO) relay channels, MIMO relay channels introduce additional degrees of freedom, making the design and analysis of optimal cooperative strategies more complex. In this paper, a partial cooperation strategy that combines transmit-side message splitting and block-Markov encoding is presented. Lower bounds on capacity that improve on a previously proposed non-cooperative lower bound are derived for Gaussian MIMO relay channels.<|reference_end|> | arxiv | @article{lo2007rate,
title={Rate Bounds for MIMO Relay Channels},
author={Caleb K. Lo, Sriram Vishwanath and Robert W. Heath Jr},
journal={arXiv preprint arXiv:0705.0564},
year={2007},
archivePrefix={arXiv},
eprint={0705.0564},
primaryClass={cs.IT math.IT}
} | lo2007rate |
arxiv-233 | 0705.0588 | Clustering Co-occurrence of Maximal Frequent Patterns in Streams | <|reference_start|>Clustering Co-occurrence of Maximal Frequent Patterns in Streams: One way of getting a better view of data is using frequent patterns. In this paper frequent patterns are subsets that occur a minimal number of times in a stream of itemsets. However, the discovery of frequent patterns in streams has always been problematic. Because streams are potentially endless it is in principle impossible to say if a pattern is often occurring or not. Furthermore the number of patterns can be huge and a good overview of the structure of the stream is lost quickly. The proposed approach will use clustering to facilitate the analysis of the structure of the stream. A clustering on the co-occurrence of patterns will give the user an improved view on the structure of the stream. Some patterns might occur so much together that they should form a combined pattern. In this way the patterns in the clustering will be the largest frequent patterns: maximal frequent patterns. Our approach to decide if patterns occur often together will be based on a method of clustering when only the distance between pairs is known. The number of maximal frequent patterns is much smaller and combined with clustering methods these patterns provide a good view on the structure of the stream.<|reference_end|> | arxiv | @article{de graaf2007clustering,
title={Clustering Co-occurrence of Maximal Frequent Patterns in Streams},
author={Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters},
journal={arXiv preprint arXiv:0705.0588},
year={2007},
archivePrefix={arXiv},
eprint={0705.0588},
primaryClass={cs.AI cs.DS}
} | de graaf2007clustering |
arxiv-234 | 0705.0593 | Clustering with Lattices in the Analysis of Graph Patterns | <|reference_start|>Clustering with Lattices in the Analysis of Graph Patterns: Mining frequent subgraphs is an area of research where we have a given set of graphs (each graph can be seen as a transaction), and we search for (connected) subgraphs contained in many of these graphs. In this work we will discuss techniques used in our framework Lattice2SAR for mining and analysing frequent subgraph data and their corresponding lattice information. Lattice information is provided by the graph mining algorithm gSpan; it contains all supergraph-subgraph relations of the frequent subgraph patterns -- and their supports. Lattice2SAR is in particular used in the analysis of frequent graph patterns where the graphs are molecules and the frequent subgraphs are fragments. In the analysis of fragments one is interested in the molecules where patterns occur. This data can be very extensive and in this paper we focus on a technique of making it better available by using the lattice information in our clustering. Now we can reduce the number of times the highly compressed occurrence data needs to be accessed by the user. The user does not have to browse all the occurrence data in search of patterns occurring in the same molecules. Instead one can directly see which frequent subgraphs are of interest.<|reference_end|> | arxiv | @article{de graaf2007clustering,
title={Clustering with Lattices in the Analysis of Graph Patterns},
author={Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters},
journal={arXiv preprint arXiv:0705.0593},
year={2007},
archivePrefix={arXiv},
eprint={0705.0593},
primaryClass={cs.AI cs.DS}
} | de graaf2007clustering |
arxiv-235 | 0705.0599 | NodeTrix: Hybrid Representation for Analyzing Social Networks | <|reference_start|>NodeTrix: Hybrid Representation for Analyzing Social Networks: The need to visualize large social networks is growing as hardware capabilities make analyzing large networks feasible and many new data sets become available. Unfortunately, the visualizations in existing systems do not satisfactorily answer the basic dilemma of being readable both for the global structure of the network and also for detailed analysis of local communities. To address this problem, we present NodeTrix, a hybrid representation for networks that combines the advantages of two traditional representations: node-link diagrams are used to show the global structure of a network, while arbitrary portions of the network can be shown as adjacency matrices to better support the analysis of communities. A key contribution is a set of interaction techniques. These allow analysts to create a NodeTrix visualization by dragging selections from either a node-link or a matrix, flexibly manipulate the NodeTrix representation to explore the dataset, and create meaningful summary visualizations of their findings. Finally, we present a case study applying NodeTrix to the analysis of the InfoVis 2004 coauthorship dataset to illustrate the capabilities of NodeTrix as both an exploration tool and an effective means of communicating results.<|reference_end|> | arxiv | @article{henry2007nodetrix:,
title={NodeTrix: Hybrid Representation for Analyzing Social Networks},
author={Nathalie Henry, Jean-Daniel Fekete, Michael Mcguffin},
journal={arXiv preprint arXiv:0705.0599},
year={2007},
doi={10.1109/TVCG.2007.70582},
archivePrefix={arXiv},
eprint={0705.0599},
primaryClass={cs.HC}
} | henry2007nodetrix: |
arxiv-236 | 0705.0602 | Risk Assessment Algorithms Based On Recursive Neural Networks | <|reference_start|>Risk Assessment Algorithms Based On Recursive Neural Networks: The assessment of highly-risky situations at road intersections have been recently revealed as an important research topic within the context of the automotive industry. In this paper we shall introduce a novel approach to compute risk functions by using a combination of a highly non-linear processing model in conjunction with a powerful information encoding procedure. Specifically, the elements of information either static or dynamic that appear in a road intersection scene are encoded by using directed positional acyclic labeled graphs. The risk assessment problem is then reformulated in terms of an inductive learning task carried out by a recursive neural network. Recursive neural networks are connectionist models capable of solving supervised and non-supervised learning problems represented by directed ordered acyclic graphs. The potential of this novel approach is demonstrated through well predefined scenarios. The major difference of our approach compared to others is expressed by the fact of learning the structure of the risk. Furthermore, the combination of a rich information encoding procedure with a generalized model of dynamical recurrent networks permit us, as we shall demonstrate, a sophisticated processing of information that we believe as being a first step for building future advanced intersection safety systems<|reference_end|> | arxiv | @article{de lara2007risk,
title={Risk Assessment Algorithms Based On Recursive Neural Networks},
author={Alejandro Chinea Manrique De Lara (INRIA Rocquencourt), Michel Parent
(INRIA Rocquencourt)},
journal={Dans International Joint Conference On Neural Networks - IJCNN
2007 (2007)},
year={2007},
archivePrefix={arXiv},
eprint={0705.0602},
primaryClass={cs.NE}
} | de lara2007risk |
arxiv-237 | 0705.0612 | Privacy - an Issue for eLearning? A Trend Analysis Reflecting the Attitude of European eLearning Users | <|reference_start|>Privacy - an Issue for eLearning? A Trend Analysis Reflecting the Attitude of European eLearning Users: Availing services provided via the Internet became a widely accepted means in organising one's life. Beside others, eLearning goes with this trend as well. But, while employing Internet service makes life more convenient, at the same time, it raises risks with respect to the protection of the users' privacy. This paper analyses the attitudes of eLearning users towards their privacy by, initially, pointing out terminology and legal issues connected with privacy. Further, the concept and implementation as well as a result analysis of a conducted study is presented, which explores the problem area from different perspectives. The paper will show that eLearning users indeed care for the protection of their personal information when using eLearning services. However, their attitudes and behaviour slightly differ. In conclusion, we provide first approaches of assisting possibilities for users how to resolve the difference of requirements and their actual activities with respect to privacy protection.<|reference_end|> | arxiv | @article{borcea-pfitzmann2007privacy,
title={Privacy - an Issue for eLearning? A Trend Analysis Reflecting the
Attitude of European eLearning Users},
author={Katrin Borcea-Pfitzmann, Anne-Katrin Stange},
journal={arXiv preprint arXiv:0705.0612},
year={2007},
number={TUD-FI07-01},
archivePrefix={arXiv},
eprint={0705.0612},
primaryClass={cs.CY}
} | borcea-pfitzmann2007privacy |
arxiv-238 | 0705.0635 | Moving Walkways, Escalators, and Elevators | <|reference_start|>Moving Walkways, Escalators, and Elevators: We study a simple geometric model of transportation facility that consists of two points between which the travel speed is high. This elementary definition can model shuttle services, tunnels, bridges, teleportation devices, escalators or moving walkways. The travel time between a pair of points is defined as a time distance, in such a way that a customer uses the transportation facility only if it is helpful. We give algorithms for finding the optimal location of such a transportation facility, where optimality is defined with respect to the maximum travel time between two points in a given set.<|reference_end|> | arxiv | @article{cardinal2007moving,
title={Moving Walkways, Escalators, and Elevators},
author={J. Cardinal, S. Collette, F. Hurtado, S. Langerman and B. Palop},
journal={arXiv preprint arXiv:0705.0635},
year={2007},
archivePrefix={arXiv},
eprint={0705.0635},
primaryClass={cs.CG}
} | cardinal2007moving |
arxiv-239 | 0705.0693 | Learning to Bluff | <|reference_start|>Learning to Bluff: The act of bluffing confounds game designers to this day. The very nature of bluffing is even open for debate, adding further complication to the process of creating intelligent virtual players that can bluff, and hence play, realistically. Through the use of intelligent, learning agents, and carefully designed agent outlooks, an agent can in fact learn to predict its opponents reactions based not only on its own cards, but on the actions of those around it. With this wider scope of understanding, an agent can in learn to bluff its opponents, with the action representing not an illogical action, as bluffing is often viewed, but rather as an act of maximising returns through an effective statistical optimisation. By using a tee dee lambda learning algorithm to continuously adapt neural network agent intelligence, agents have been shown to be able to learn to bluff without outside prompting, and even to learn to call each others bluffs in free, competitive play.<|reference_end|> | arxiv | @article{hurwitz2007learning,
title={Learning to Bluff},
author={Evan Hurwitz and Tshilidzi Marwala},
journal={arXiv preprint arXiv:0705.0693},
year={2007},
archivePrefix={arXiv},
eprint={0705.0693},
primaryClass={cs.AI}
} | hurwitz2007learning |
arxiv-240 | 0705.0734 | Soft constraint abstraction based on semiring homomorphism | <|reference_start|>Soft constraint abstraction based on semiring homomorphism: The semiring-based constraint satisfaction problems (semiring CSPs), proposed by Bistarelli, Montanari and Rossi \cite{BMR97}, is a very general framework of soft constraints. In this paper we propose an abstraction scheme for soft constraints that uses semiring homomorphism. To find optimal solutions of the concrete problem, the idea is, first working in the abstract problem and finding its optimal solutions, then using them to solve the concrete problem. In particular, we show that a mapping preserves optimal solutions if and only if it is an order-reflecting semiring homomorphism. Moreover, for a semiring homomorphism $\alpha$ and a problem $P$ over $S$, if $t$ is optimal in $\alpha(P)$, then there is an optimal solution $\bar{t}$ of $P$ such that $\bar{t}$ has the same value as $t$ in $\alpha(P)$.<|reference_end|> | arxiv | @article{li2007soft,
title={Soft constraint abstraction based on semiring homomorphism},
author={Sanjiang Li and Mingsheng Ying},
journal={Theoretical Computer Science 403(2-3) 192-201, 2008},
year={2007},
doi={10.1016/j.tcs.2008.03.029},
archivePrefix={arXiv},
eprint={0705.0734},
primaryClass={cs.AI}
} | li2007soft |
arxiv-241 | 0705.0738 | The Optimization of a Novel Prismatic Drive | <|reference_start|>The Optimization of a Novel Prismatic Drive: The design of a mechanical transmission taking into account the transmitted forces is reported in this paper. This transmission is based on Slide-o-Cam, a cam mechanism with multiple rollers mounted on a common translating follower. The design of Slide-o-Cam, a transmission intended to produce a sliding motion from a turning drive, or vice versa, was reported elsewhere. This transmission provides pure-rolling motion, thereby reducing the friction of rack-and-pinions and linear drives. The pressure angle is a relevant performance index for this transmission because it determines the amount of force transmitted to the load vs. that transmitted to the machine frame. To assess the transmission capability of the mechanism, the Hertz formula is introduced to calculate the stresses on the rollers and on the cams. The final transmission is intended to replace the current ball-screws in the Orthoglide, a three-DOF parallel robot for the production of translational motions, currently under development for machining applications at Ecole Centrale de Nantes.<|reference_end|> | arxiv | @article{chablat2007the,
title={The Optimization of a Novel Prismatic Drive},
author={Damien Chablat (IRCCyN), St'ephane Caro (IRCCyN), Emilie Bouyer
(IRCCyN)},
journal={arXiv preprint arXiv:0705.0738},
year={2007},
archivePrefix={arXiv},
eprint={0705.0738},
primaryClass={cs.RO}
} | chablat2007the |
arxiv-242 | 0705.0742 | MIMO detection employing Markov Chain Monte Carlo | <|reference_start|>MIMO detection employing Markov Chain Monte Carlo: We propose a soft-output detection scheme for Multiple-Input-Multiple-Output (MIMO) systems. The detector employs Markov Chain Monte Carlo method to compute bit reliabilities from the signals received and is thus suited for coded MIMO systems. It offers a good trade-off between achievable performance and algorithmic complexity.<|reference_end|> | arxiv | @article{sundaram2007mimo,
title={MIMO detection employing Markov Chain Monte Carlo},
author={V.Sundaram and K.P.N.Murthy},
journal={arXiv preprint arXiv:0705.0742},
year={2007},
archivePrefix={arXiv},
eprint={0705.0742},
primaryClass={cs.GL}
} | sundaram2007mimo |
arxiv-243 | 0705.0751 | Approximate textual retrieval | <|reference_start|>Approximate textual retrieval: An approximate textual retrieval algorithm for searching sources with high levels of defects is presented. It considers splitting the words in a query into two overlapping segments and subsequently building composite regular expressions from interlacing subsets of the segments. This procedure reduces the probability of missed occurrences due to source defects, yet diminishes the retrieval of irrelevant, non-contextual occurrences.<|reference_end|> | arxiv | @article{constans2007approximate,
title={Approximate textual retrieval},
author={Pere Constans},
journal={arXiv preprint arXiv:0705.0751},
year={2007},
archivePrefix={arXiv},
eprint={0705.0751},
primaryClass={cs.IR cs.DL}
} | constans2007approximate |
arxiv-244 | 0705.0760 | Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs | <|reference_start|>Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs: Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide variety of applications, there are relatively few theoretical guarantees of convergence and correctness for general loopy graphs that may have many short cycles. Of these, even fewer provide exact ``necessary and sufficient'' characterizations. In this paper we investigate the problem of using max-product to find the maximum weight matching in an arbitrary graph with edge weights. This is done by first constructing a probability distribution whose mode corresponds to the optimal matching, and then running max-product. Weighted matching can also be posed as an integer program, for which there is an LP relaxation. This relaxation is not always tight. In this paper we show that \begin{enumerate} \item If the LP relaxation is tight, then max-product always converges, and that too to the correct answer. \item If the LP relaxation is loose, then max-product does not converge. \end{enumerate} This provides an exact, data-dependent characterization of max-product performance, and a precise connection to LP relaxation, which is a well-studied optimization technique. Also, since LP relaxation is known to be tight for bipartite graphs, our results generalize other recent results on using max-product to find weighted matchings in bipartite graphs.<|reference_end|> | arxiv | @article{sanghavi2007equivalence,
title={Equivalence of LP Relaxation and Max-Product for Weighted Matching in
General Graphs},
author={Sujay Sanghavi},
journal={arXiv preprint arXiv:0705.0760},
year={2007},
archivePrefix={arXiv},
eprint={0705.0760},
primaryClass={cs.IT cs.AI cs.LG cs.NI math.IT}
} | sanghavi2007equivalence |
arxiv-245 | 0705.0761 | Bayesian Approach to Neuro-Rough Models | <|reference_start|>Bayesian Approach to Neuro-Rough Models: This paper proposes a neuro-rough model based on multi-layered perceptron and rough set. The neuro-rough model is then tested on modelling the risk of HIV from demographic data. The model is formulated using Bayesian framework and trained using Monte Carlo method and Metropolis criterion. When the model was tested to estimate the risk of HIV infection given the demographic data it was found to give the accuracy of 62%. The proposed model is able to combine the accuracy of the Bayesian MLP model and the transparency of Bayesian rough set model.<|reference_end|> | arxiv | @article{marwala2007bayesian,
title={Bayesian Approach to Neuro-Rough Models},
author={Tshilidzi Marwala and Bodie Crossingham},
journal={arXiv preprint arXiv:0705.0761},
year={2007},
archivePrefix={arXiv},
eprint={0705.0761},
primaryClass={cs.AI}
} | marwala2007bayesian |
arxiv-246 | 0705.0781 | Medical Image Segmentation and Localization using Deformable Templates | <|reference_start|>Medical Image Segmentation and Localization using Deformable Templates: This paper presents deformable templates as a tool for segmentation and localization of biological structures in medical images. Structures are represented by a prototype template, combined with a parametric warp mapping used to deform the original shape. The localization procedure is achieved using a multi-stage, multi-resolution algorithm de-signed to reduce computational complexity and time. The algorithm initially identifies regions in the image most likely to contain the desired objects and then examines these regions at progressively increasing resolutions. The final stage of the algorithm involves warping the prototype template to match the localized objects. The algorithm is presented along with the results of four example applications using MRI, x-ray and ultrasound images.<|reference_end|> | arxiv | @article{spiller2007medical,
title={Medical Image Segmentation and Localization using Deformable Templates},
author={Jonathan M.Spiller and T. Marwala},
journal={arXiv preprint arXiv:0705.0781},
year={2007},
archivePrefix={arXiv},
eprint={0705.0781},
primaryClass={cs.CV}
} | spiller2007medical |
arxiv-247 | 0705.0783 | Non-cooperative games for spreading code optimization, power control and receiver design in wireless data networks | <|reference_start|>Non-cooperative games for spreading code optimization, power control and receiver design in wireless data networks: This paper focuses on the issue of energy efficiency in wireless data networks through a game theoretic approach. The case considered is that in which each user is allowed to vary its transmit power, spreading code, and uplink receiver in order to maximize its own utility, which is here defined as the ratio of data throughput to transmit power. In particular, the case in which linear multiuser detectors are employed at the receiver is treated first, and, then, the more challenging case in which non-linear decision feedback multiuser receivers are adopted is addressed. It is shown that, for both receivers, the problem at hand of utility maximization can be regarded as a non-cooperative game, and it is proved that a unique Nash equilibrium point exists. Simulation results show that significant performance gains can be obtained through both non-linear processing and spreading code optimization; in particular, for systems with a number of users not larger than the processing gain, remarkable gains come from spreading code optimization, while, for overloaded systems, the largest gainscome from the use of non-linear processing. In every case, however, the non-cooperative games proposed here are shown to outperform competing alternatives.<|reference_end|> | arxiv | @article{buzzi2007non-cooperative,
title={Non-cooperative games for spreading code optimization, power control and
receiver design in wireless data networks},
author={Stefano Buzzi, and H. Vincent Poor},
journal={arXiv preprint arXiv:0705.0783},
year={2007},
archivePrefix={arXiv},
eprint={0705.0783},
primaryClass={cs.IT cs.GT math.IT}
} | buzzi2007non-cooperative |
arxiv-248 | 0705.0815 | Overview of the Netsukuku network | <|reference_start|>Overview of the Netsukuku network: Netsukuku is a P2P network system designed to handle a large number of nodes with minimal CPU and memory resources. It can be easily used to build a worldwide distributed, anonymous and not controlled network, separated from the Internet, without the support of any servers, ISPs or authority controls. In this document, we give a generic and non technical description of the Netsukuku network, emphasizing its main ideas and features.<|reference_end|> | arxiv | @article{pumo2007overview,
title={Overview of the Netsukuku network},
author={Andrea Lo Pumo},
journal={arXiv preprint arXiv:0705.0815},
year={2007},
archivePrefix={arXiv},
eprint={0705.0815},
primaryClass={cs.NI}
} | pumo2007overview |
arxiv-249 | 0705.0817 | Quantum Shortest Path Netsukuku | <|reference_start|>Quantum Shortest Path Netsukuku: This document describes the QSPN, the routing discovery algorithm used by Netsukuku. Through a deductive analysis the main proprieties of the QSPN are shown. Moreover, a second version of the algorithm, is presented.<|reference_end|> | arxiv | @article{pumo2007quantum,
title={Quantum Shortest Path Netsukuku},
author={Andrea Lo Pumo},
journal={arXiv preprint arXiv:0705.0817},
year={2007},
archivePrefix={arXiv},
eprint={0705.0817},
primaryClass={cs.NI}
} | pumo2007quantum |
arxiv-250 | 0705.0819 | The Netsukuku network topology | <|reference_start|>The Netsukuku network topology: In this document, we describe the fractal structure of the Netsukuku topology. Moreover, we show how it is possible to use the QSPN v2 on the high levels of the fractal.<|reference_end|> | arxiv | @article{pumo2007the,
title={The Netsukuku network topology},
author={Andrea Lo Pumo},
journal={arXiv preprint arXiv:0705.0819},
year={2007},
archivePrefix={arXiv},
eprint={0705.0819},
primaryClass={cs.NI}
} | pumo2007the |
arxiv-251 | 0705.0820 | ANDNA: the distributed hostname management system of Netsukuku | <|reference_start|>ANDNA: the distributed hostname management system of Netsukuku: We present the Abnormal Netsukuku Domain Name Anarchy system. ANDNA is the distributed, non hierarchical and decentralised system of hostname management used in the Netsukuku network.<|reference_end|> | arxiv | @article{pumo2007andna:,
title={ANDNA: the distributed hostname management system of Netsukuku},
author={Andrea Lo Pumo},
journal={arXiv preprint arXiv:0705.0820},
year={2007},
archivePrefix={arXiv},
eprint={0705.0820},
primaryClass={cs.NI}
} | pumo2007andna: |
arxiv-252 | 0705.0828 | Enhancement of Noisy Planar Nuclear Medicine Images using Mean Field Annealing | <|reference_start|>Enhancement of Noisy Planar Nuclear Medicine Images using Mean Field Annealing: Nuclear medicine (NM) images inherently suffer from large amounts of noise and blur. The purpose of this research is to reduce the noise and blur while maintaining image integrity for improved diagnosis. The proposed solution is to increase image quality after the standard pre- and post-processing undertaken by a gamma camera system. Mean Field Annealing (MFA) is the image processing technique used in this research. It is a computational iterative technique that makes use of the Point Spread Function (PSF) and the noise associated with the NM image. MFA is applied to NM images with the objective of reducing noise while not compromising edge integrity. Using a sharpening filter as a post-processing technique (after MFA) yields image enhancement of planar NM images.<|reference_end|> | arxiv | @article{falk2007enhancement,
title={Enhancement of Noisy Planar Nuclear Medicine Images using Mean Field
Annealing},
author={D.L. Falk, D. M. Rubin and T. Marwala},
journal={arXiv preprint arXiv:0705.0828},
year={2007},
archivePrefix={arXiv},
eprint={0705.0828},
primaryClass={cs.CV}
} | falk2007enhancement |
arxiv-253 | 0705.0856 | The Multiobjective Optimization of a Prismatic Drive | <|reference_start|>The Multiobjective Optimization of a Prismatic Drive: The multiobjective optimization of Slide-o-Cam is reported in this paper. Slide-o-Cam is a cam mechanism with multiple rollers mounted on a common translating follower. This transmission provides pure-rolling motion, thereby reducing the friction of rack-and-pinions and linear drives. A Pareto frontier is obtained by means of multiobjective optimization. This optimization is based on three objective functions: (i) the pressure angle, which is a suitable performance index for the transmission because it determines the amount of force transmitted to the load vs. that transmitted to the machine frame; (ii) the Hertz pressure used to evaluate the stresses produced on the contact surface between cam and roller; and (iii) the size of the mechanism, characterized by the number of cams and their width.<|reference_end|> | arxiv | @article{bouyer2007the,
title={The Multiobjective Optimization of a Prismatic Drive},
author={Emilie Bouyer (IRCCyN), St'ephane Caro (IRCCyN), Damien Chablat
(IRCCyN), Jorge Angeles (CIM)},
journal={ASME Design Engineering Technical Conference (04/09/2007) 1-9},
year={2007},
archivePrefix={arXiv},
eprint={0705.0856},
primaryClass={cs.RO}
} | bouyer2007the |
arxiv-254 | 0705.0895 | Epsilon-Distortion Complexity for Cantor Sets | <|reference_start|>Epsilon-Distortion Complexity for Cantor Sets: We define the epsilon-distortion complexity of a set as the shortest program, running on a universal Turing machine, which produces this set at the precision epsilon in the sense of Hausdorff distance. Then, we estimate the epsilon-distortion complexity of various central Cantor sets on the line generated by iterated function systems (IFS's). In particular, the epsilon-distortion complexity of a C^k Cantor set depends, in general, on k and on its box counting dimension, contrarily to Cantor sets generated by polynomial IFS or random affine Cantor sets.<|reference_end|> | arxiv | @article{bonanno2007epsilon-distortion,
title={Epsilon-Distortion Complexity for Cantor Sets},
author={C. Bonanno, J.-R. Chazottes, P. Collet},
journal={arXiv preprint arXiv:0705.0895},
year={2007},
archivePrefix={arXiv},
eprint={0705.0895},
primaryClass={math.DS cs.CC math.MG}
} | bonanno2007epsilon-distortion |
arxiv-255 | 0705.0909 | Game-Theoretic Power Control in Impulse Radio UWB Wireless Networks | <|reference_start|>Game-Theoretic Power Control in Impulse Radio UWB Wireless Networks: In this paper, a game-theoretic model for studying power control for wireless data networks in frequency-selective multipath environments is analyzed. The uplink of an impulse-radio ultrawideband system is considered. The effects of self-interference and multiple-access interference on the performance of Rake receivers are investigated for synchronous systems. Focusing on energy efficiency, a noncooperative game is proposed in which users in the network are allowed to choose their transmit powers to maximize their own utilities, and the Nash equilibrium for the proposed game is derived. It is shown that, due to the frequency selective multipath, the noncooperative solution is achieved at different signal-to-interference-plus-noise ratios, respectively of the channel realization. A large-system analysis is performed to derive explicit expressions for the achieved utilities. The Pareto-optimal (cooperative) solution is also discussed and compared with the noncooperative approach.<|reference_end|> | arxiv | @article{bacci2007game-theoretic,
title={Game-Theoretic Power Control in Impulse Radio UWB Wireless Networks},
author={Giacomo Bacci, Marco Luise, H. Vincent Poor},
journal={arXiv preprint arXiv:0705.0909},
year={2007},
archivePrefix={arXiv},
eprint={0705.0909},
primaryClass={cs.GT cs.IT math.IT}
} | bacci2007game-theoretic |
arxiv-256 | 0705.0915 | Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem | <|reference_start|>Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem: Holzer and Holzer (Discrete Applied Mathematics 144(3):345--358, 2004) proved that the Tantrix(TM) rotation puzzle problem is NP-complete. They also showed that for infinite rotation puzzles, this problem becomes undecidable. We study the counting version and the unique version of this problem. We prove that the satisfiability problem parsimoniously reduces to the Tantrix(TM) rotation puzzle problem. In particular, this reduction preserves the uniqueness of the solution, which implies that the unique Tantrix(TM) rotation puzzle problem is as hard as the unique satisfiability problem, and so is DP-complete under polynomial-time randomized reductions, where DP is the second level of the boolean hierarchy over NP.<|reference_end|> | arxiv | @article{baumeister2007satisfiability,
title={Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle
Problem},
author={Dorothea Baumeister and Joerg Rothe},
journal={arXiv preprint arXiv:0705.0915},
year={2007},
archivePrefix={arXiv},
eprint={0705.0915},
primaryClass={cs.CC}
} | baumeister2007satisfiability |
arxiv-257 | 0705.0932 | Variable-Rate Distributed Source Coding in the Presence of Byzantine Sensors | <|reference_start|>Variable-Rate Distributed Source Coding in the Presence of Byzantine Sensors: The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack; that is, an unknown number of sensors have been reprogrammed by a malicious intruder to undermine the reconstruction at the fusion center. Three different forms of the problem are considered. The first is a variable-rate setup, in which the decoder adaptively chooses the rates at which the sensors transmit. An explicit characterization of the variable-rate minimum achievable sum rate is stated, given by the maximum entropy over the set of distributions indistinguishable from the true source distribution by the decoder. In addition, two forms of the fixed-rate problem are considered, one with deterministic coding and one with randomized coding. The achievable rate regions are given for both these problems, with a larger region achievable using randomized coding, though both are suboptimal compared to variable-rate coding.<|reference_end|> | arxiv | @article{kosut2007variable-rate,
title={Variable-Rate Distributed Source Coding in the Presence of Byzantine
Sensors},
author={Oliver Kosut and Lang Tong},
journal={arXiv preprint arXiv:0705.0932},
year={2007},
archivePrefix={arXiv},
eprint={0705.0932},
primaryClass={cs.IT math.IT}
} | kosut2007variable-rate |
arxiv-258 | 0705.0933 | Computing Minimal Polynomials of Matrices | <|reference_start|>Computing Minimal Polynomials of Matrices: We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an $n\times n$ matrix over a finite field that requires $O(n^3)$ field operations and O(n) random vectors, and is well suited for successful practical implementation. The algorithm, and its complexity analysis, use standard algorithms for polynomial and matrix operations. We compare features of the algorithm with several other algorithms in the literature. In addition we present a deterministic verification procedure which is similarly efficient in most cases but has a worst-case complexity of $O(n^4)$. Finally, we report the results of practical experiments with an implementation of our algorithms in comparison with the current algorithms in the {\sf GAP} library.<|reference_end|> | arxiv | @article{neunhoeffer2007computing,
title={Computing Minimal Polynomials of Matrices},
author={Max Neunhoeffer, Cheryl E. Praeger},
journal={arXiv preprint arXiv:0705.0933},
year={2007},
archivePrefix={arXiv},
eprint={0705.0933},
primaryClass={math.RA cs.DS}
} | neunhoeffer2007computing |
arxiv-259 | 0705.0936 | Performance Comparison of Energy-Efficient Power Control for CDMA and Multiuser UWB Networks | <|reference_start|>Performance Comparison of Energy-Efficient Power Control for CDMA and Multiuser UWB Networks: This paper studies the performance of a wireless data network using energy-efficient power control techniques when different multiple access schemes, namely direct-sequence code division multiple access (DS-CDMA) and impulse-radio ultrawideband (IR-UWB), are considered. Due to the large bandwidth of the system, the multipath channel is assumed to be frequency-selective. By making use of noncooperative game-theoretic models and large-system analysis tools, explicit expressions for the achieved utilities at the Nash equilibrium are derived in terms of the network parameters. A measure of the loss of DS-CDMA with respect to IR-UWB is proposed, which proves substantial equivalence between the two schemes. Simulation results are provided to validate the analysis.<|reference_end|> | arxiv | @article{bacci2007performance,
title={Performance Comparison of Energy-Efficient Power Control for CDMA and
Multiuser UWB Networks},
author={Giacomo Bacci, Marco Luise, H. Vincent Poor},
journal={arXiv preprint arXiv:0705.0936},
year={2007},
archivePrefix={arXiv},
eprint={0705.0936},
primaryClass={cs.GT cs.IT math.IT}
} | bacci2007performance |
arxiv-260 | 0705.0952 | An Independent Evaluation of Subspace Face Recognition Algorithms | <|reference_start|>An Independent Evaluation of Subspace Face Recognition Algorithms: This paper explores a comparative study of both the linear and kernel implementations of three of the most popular Appearance-based Face Recognition projection classes, these being the methodologies of Principal Component Analysis, Linear Discriminant Analysis and Independent Component Analysis. The experimental procedure provides a platform of equal working conditions and examines the ten algorithms in the categories of expression, illumination, occlusion and temporal delay. The results are then evaluated based on a sequential combination of assessment tools that facilitate both intuitive and statistical decisiveness among the intra and interclass comparisons. The best categorical algorithms are then incorporated into a hybrid methodology, where the advantageous effects of fusion strategies are considered.<|reference_end|> | arxiv | @article{surajpal2007an,
title={An Independent Evaluation of Subspace Face Recognition Algorithms},
author={Dhiresh R. Surajpal and Tshilidzi Marwala},
journal={arXiv preprint arXiv:0705.0952},
year={2007},
archivePrefix={arXiv},
eprint={0705.0952},
primaryClass={cs.CV}
} | surajpal2007an |
arxiv-261 | 0705.0956 | On Isotropic Sets of Points in the Plane Application to the Design of Robot Archirectures | <|reference_start|>On Isotropic Sets of Points in the Plane Application to the Design of Robot Archirectures: Various performance indices are used for the design of serial manipulators. One method of optimization relies on the condition number of the Jacobian matrix. The minimization of the condition number leads, under certain conditions, to isotropic configurations, for which the roundoff-error amplification is lowest. In this paper, the isotropy conditions, introduced elsewhere, are the motivation behind the introduction of isotropic sets of points. By connecting together these points, we define families of isotropic manipulators. This paper is devoted to planar manipulators, the concepts being currently extended to their spatial counterparts. Furthermore, only manipulators with revolute joints are considered here.<|reference_end|> | arxiv | @article{angeles2007on,
title={On Isotropic Sets of Points in the Plane. Application to the Design of
Robot Archirectures},
author={Jorge Angeles (CIM), Damien Chablat (IRCCyN)},
journal={7th International Symposium on Advances in Robot Kinematics (2000)
1-10},
year={2007},
archivePrefix={arXiv},
eprint={0705.0956},
primaryClass={cs.RO}
} | angeles2007on |
arxiv-262 | 0705.0959 | The Kinematic Analysis of a Symmetrical Three-Degree-of-Freedom Planar Parallel Manipulator | <|reference_start|>The Kinematic Analysis of a Symmetrical Three-Degree-of-Freedom Planar Parallel Manipulator: Presented in this paper is the kinematic analysis of a symmetrical three-degree-of-freedom planar parallel manipulator. In opposite to serial manipulators, parallel manipulators can admit not only multiple inverse kinematic solutions, but also multiple direct kinematic solutions. This property produces more complicated kinematic models but allows more flexibility in trajectory planning. To take into account this property, the notion of aspects, i.e. the maximal singularity-free domains, was introduced, based on the notion of working modes, which makes it possible to separate the inverse kinematic solutions. The aim of this paper is to show that a non-singular assembly-mode changing trajectory exist for a symmetrical planar parallel manipulator, with equilateral base and platform triangle.<|reference_end|> | arxiv | @article{chablat2007the,
title={The Kinematic Analysis of a Symmetrical Three-Degree-of-Freedom Planar
Parallel Manipulator},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={Symposium on Robot Design, Dynamics and Control (2004) 1-7},
year={2007},
archivePrefix={arXiv},
eprint={0705.0959},
primaryClass={cs.RO}
} | chablat2007the |
arxiv-263 | 0705.0960 | Uniqueness Domains in the Workspace of Parallel Manipulators | <|reference_start|>Uniqueness Domains in the Workspace of Parallel Manipulators: This work investigates new kinematic features of parallel manipulators. It is well known that parallel manipulators admit generally several direct kinematic solutions for a given set of input joint values. The aim of this paper is to characterize the uniqueness domains in the workspace of parallel manipulators, as well as their image in the joint space. The study focuses on the most usual case of parallel manipulators with only one inverse kinematic solution. The notion of aspect introduced for serial manipulators in [Borrel 86] is redefined for such parallel manipulators. Then, it is shown that it is possible to link several solutions to the forward kinematic problem without meeting a singularity, thus meaning that the aspects are not uniqueness domains. An additional set of surfaces, namely the characteristic surfaces, are characterized which divide the workspace into basic regions and yield new uniqueness domains. This study is illustrated all along the paper with a 3-RPR planar parallel manipulator. An octree model of spaces is used to compute the joint space, the workspace and all other newly defined sets.<|reference_end|> | arxiv | @article{wenger2007uniqueness,
title={Uniqueness Domains in the Workspace of Parallel Manipulators},
author={Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Syroco' 97 (1997) 1-6},
year={2007},
archivePrefix={arXiv},
eprint={0705.0960},
primaryClass={cs.RO}
} | wenger2007uniqueness |
arxiv-264 | 0705.0961 | The Kinematic design of a 3-dof Hybrid Manipulator | <|reference_start|>The Kinematic design of a 3-dof Hybrid Manipulator: This paper focuses on the kinematic properties of a new three-degree-of-freedom hybrid manipulator. This manipulator is obtained by adding in series to a five-bar planar mechanism (similar to the one studied by Bajpai and Roth) a third revolute passing through the line of centers of the two actuated revolute joints of the above linkage. The resulting architecture is hybrid in that it has both serial and parallel links. Fully-parallel manipulators are known for the existence of particularly undesirable singularities (referred to as parallel singularities) where control is lost [4] and [6]. On the other hand, due to their cantilever type of kinematic arrangement, fully serial manipulators suffer from a lack of stiffness and from relatively large positioning errors. The hybrid manipulator studied is intrinsically stiffer and more accurate. Furthermore, since all actuators are located on the first axis, the inertial effects are considerably reduced. In addition, it is shown that the special kinematic structure of our manipulator has the potential of avoiding parallel singularities by a suitable choice of the "working mode", thus leading to larger workspaces. The influence of the different structural dimensions (e.g. the link lengths) on the kinematic and mechanical properties are analysed in view of the optimal design of such hybrid manipulators.<|reference_end|> | arxiv | @article{chablat2007the,
title={The Kinematic design of a 3-dof Hybrid Manipulator},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), Jorge Angeles (CIM)},
journal={2nd International Conference On Integrated Design and
Manufacturing in Mechanical Engineering (1998) 1-8},
year={2007},
archivePrefix={arXiv},
eprint={0705.0961},
primaryClass={cs.RO}
} | chablat2007the |
arxiv-265 | 0705.0962 | Definition sets for the Direct Kinematics of Parallel Manipulators | <|reference_start|>Definition sets for the Direct Kinematics of Parallel Manipulators: The aim of this paper is to characterize the uniqueness domains in the workspace of parallel manipulators, as well as their image in the joint space. The notion of aspect introduced for serial manipulators in [Borrel 86] is redefined for such parallel manipulators. Then, it is shown that it is possible to link several solutions to the direct kinematic problem without meeting a singularity, thus meaning that the aspects are not uniqueness domains. Additional surfaces are characterized in the workspace which yield new uniqueness domains. An octree model of spaces is used to compute the joint space, the workspace and all other newly defined sets. This study is illustrated all along the paper with a 3-RPR planar parallel manipulator.<|reference_end|> | arxiv | @article{wenger2007definition,
title={Definition sets for the Direct Kinematics of Parallel Manipulators},
author={Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={8th International Conference in Advanced Robotics (1997) 1-6},
year={2007},
archivePrefix={arXiv},
eprint={0705.0962},
primaryClass={cs.RO}
} | wenger2007definition |
arxiv-266 | 0705.0965 | Improved Analysis of Kannan's Shortest Lattice Vector Algorithm | <|reference_start|>Improved Analysis of Kannan's Shortest Lattice Vector Algorithm: The security of lattice-based cryptosystems such as NTRU, GGH and Ajtai-Dwork essentially relies upon the intractability of computing a shortest non-zero lattice vector and a closest lattice vector to a given target vector in high dimensions. The best algorithms for these tasks are due to Kannan, and, though remarkably simple, their complexity estimates have not been improved since more than twenty years. Kannan's algorithm for solving the shortest vector problem is in particular crucial in Schnorr's celebrated block reduction algorithm, on which are based the best known attacks against the lattice-based encryption schemes mentioned above. Understanding precisely Kannan's algorithm is of prime importance for providing meaningful key-sizes. In this paper we improve the complexity analyses of Kannan's algorithms and discuss the possibility of improving the underlying enumeration strategy.<|reference_end|> | arxiv | @article{hanrot2007improved,
title={Improved Analysis of Kannan's Shortest Lattice Vector Algorithm},
author={Guillaume Hanrot (INRIA Lorraine - LORIA), Damien Stehl'e (INRIA
Rh^one-Alpes)},
journal={Dans Advances in Cryptology - Crypto'07 4622 (2007) 170-186},
year={2007},
doi={10.1007/978-3-540-74143-5_10},
archivePrefix={arXiv},
eprint={0705.0965},
primaryClass={cs.CR cs.CC}
} | hanrot2007improved |
arxiv-267 | 0705.0969 | Artificial Neural Networks and Support Vector Machines for Water Demand Time Series Forecasting | <|reference_start|>Artificial Neural Networks and Support Vector Machines for Water Demand Time Series Forecasting: Water plays a pivotal role in many physical processes, and most importantly in sustaining human life, animal life and plant life. Water supply entities therefore have the responsibility to supply clean and safe water at the rate required by the consumer. It is therefore necessary to implement mechanisms and systems that can be employed to predict both short-term and long-term water demands. The increasingly growing field of computational intelligence techniques has been proposed as an efficient tool in the modelling of dynamic phenomena. The primary objective of this paper is to compare the efficiency of two computational intelligence techniques in water demand forecasting. The techniques under comparison are the Artificial Neural Networks (ANNs) and the Support Vector Machines (SVMs). In this study it was observed that the ANNs perform better than the SVMs. This performance is measured against the generalisation ability of the two.<|reference_end|> | arxiv | @article{msiza2007artificial,
title={Artificial Neural Networks and Support Vector Machines for Water Demand
Time Series Forecasting},
author={Ishmael S. Msiza, Fulufhelo V. Nelwamondo and Tshilidzi Marwala},
journal={arXiv preprint arXiv:0705.0969},
year={2007},
archivePrefix={arXiv},
eprint={0705.0969},
primaryClass={cs.AI}
} | msiza2007artificial |
arxiv-268 | 0705.0982 | A New Three-DOF Parallel Mechanism: Milling Machine Applications | <|reference_start|>A New Three-DOF Parallel Mechanism: Milling Machine Applications: This paper describes a new parallel kinematic architecture for machining applications, namely, the orthoglide. This machine 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 main interest of the orthoglide is that it takes benefit from the advantages of the popular PPP serial machines (regular Cartesian workspace shape and uniform performances) as well as from the parallel kinematic arrangement of the links (less inertia and better dynamic performances), which makes the orthoglide well suited to high-speed machining applications. Possible extension of the orthoglide to 5-axis machining is also investigated.<|reference_end|> | arxiv | @article{chablat2007a,
title={A New Three-DOF Parallel Mechanism: Milling Machine Applications},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={The 2nd Chemnitz Parallel Kinematics Seminar (2000) 1-9},
year={2007},
archivePrefix={arXiv},
eprint={0705.0982},
primaryClass={cs.RO}
} | chablat2007a |
arxiv-269 | 0705.0999 | Cellular Systems with Full-Duplex Amplify-and-Forward Relaying and Cooperative Base-Stations | <|reference_start|>Cellular Systems with Full-Duplex Amplify-and-Forward Relaying and Cooperative Base-Stations: In this paper the benefits provided by multi-cell processing of signals transmitted by mobile terminals which are received via dedicated relay terminals (RTs) are assessed. Unlike previous works, each RT is assumed here to be capable of full-duplex operation and receives the transmission of adjacent relay terminals. Focusing on intra-cell TDMA and non-fading channels, a simplified uplink cellular model introduced by Wyner is considered. This framework facilitates analytical derivation of the per-cell sum-rate of multi-cell and conventional single-cell receivers. In particular, the analysis is based on the observation that the signal received at the base stations can be interpreted as the outcome of a two-dimensional linear time invariant system. Numerical results are provided as well in order to provide further insight into the performance benefits of multi-cell processing with relaying.<|reference_end|> | arxiv | @article{somekh2007cellular,
title={Cellular Systems with Full-Duplex Amplify-and-Forward Relaying and
Cooperative Base-Stations},
author={Oren Somekh, Osvaldo Simeone, H. Vincent Poor, and Shlomo Shamai
(Shitz)},
journal={arXiv preprint arXiv:0705.0999},
year={2007},
doi={10.1109/ISIT.2007.4557197},
archivePrefix={arXiv},
eprint={0705.0999},
primaryClass={cs.IT math.IT}
} | somekh2007cellular |
arxiv-270 | 0705.1013 | Tracking User Attention in Collaborative Tagging Communities | <|reference_start|>Tracking User Attention in Collaborative Tagging Communities: Collaborative tagging has recently attracted the attention of both industry and academia due to the popularity of content-sharing systems such as CiteULike, del.icio.us, and Flickr. These systems give users the opportunity to add data items and to attach their own metadata (or tags) to stored data. The result is an effective content management tool for individual users. Recent studies, however, suggest that, as tagging communities grow, the added content and the metadata become harder to manage due to an ease in content diversity. Thus, mechanisms that cope with increase of diversity are fundamental to improve the scalability and usability of collaborative tagging systems. This paper analyzes whether usage patterns can be harnessed to improve navigability in a growing knowledge space. To this end, it presents a characterization of two collaborative tagging communities that target scientific literature: CiteULike and Bibsonomy. We explore three main directions: First, we analyze the tagging activity distribution across the user population. Second, we define new metrics for similarity in user interest and use these metrics to uncover the structure of the tagging communities we study. The structure we uncover suggests a clear segmentation of interests into a large number of individuals with unique preferences and a core set of users with interspersed interests. Finally, we offer preliminary results that demonstrate that the interest-based structure of the tagging community can be used to facilitate content usage as communities scale.<|reference_end|> | arxiv | @article{santos-neto2007tracking,
title={Tracking User Attention in Collaborative Tagging Communities},
author={Elizeu Santos-Neto, Matei Ripeanu and Adriana Iamnitchi},
journal={arXiv preprint arXiv:0705.1013},
year={2007},
archivePrefix={arXiv},
eprint={0705.1013},
primaryClass={cs.DL cs.CY}
} | santos-neto2007tracking |
arxiv-271 | 0705.1025 | Recognizing Partial Cubes in Quadratic Time | <|reference_start|>Recognizing Partial Cubes in Quadratic Time: We show how to test whether a graph with n vertices and m edges is a partial cube, and if so how to find a distance-preserving embedding of the graph into a hypercube, in the near-optimal time bound O(n^2), improving previous O(nm)-time solutions.<|reference_end|> | arxiv | @article{eppstein2007recognizing,
title={Recognizing Partial Cubes in Quadratic Time},
author={David Eppstein},
journal={Journal of Graph Algorithms and Applications 15(2) 269-293, 2011},
year={2007},
archivePrefix={arXiv},
eprint={0705.1025},
primaryClass={cs.DS}
} | eppstein2007recognizing |
arxiv-272 | 0705.1031 | Fuzzy Artmap and Neural Network Approach to Online Processing of Inputs with Missing Values | <|reference_start|>Fuzzy Artmap and Neural Network Approach to Online Processing of Inputs with Missing Values: An ensemble based approach for dealing with missing data, without predicting or imputing the missing values is proposed. This technique is suitable for online operations of neural networks and as a result, is used for online condition monitoring. The proposed technique is tested in both classification and regression problems. An ensemble of Fuzzy-ARTMAPs is used for classification whereas an ensemble of multi-layer perceptrons is used for the regression problem. Results obtained using this ensemble-based technique are compared to those obtained using a combination of auto-associative neural networks and genetic algorithms and findings show that this method can perform up to 9% better in regression problems. Another advantage of the proposed technique is that it eliminates the need for finding the best estimate of the data, and hence, saves time.<|reference_end|> | arxiv | @article{nelwamondo2007fuzzy,
title={Fuzzy Artmap and Neural Network Approach to Online Processing of Inputs
with Missing Values},
author={F.V. Nelwamondo and T. Marwala},
journal={arXiv preprint arXiv:0705.1031},
year={2007},
archivePrefix={arXiv},
eprint={0705.1031},
primaryClass={cs.AI}
} | nelwamondo2007fuzzy |
arxiv-273 | 0705.1033 | Optimal Cache-Oblivious Mesh Layouts | <|reference_start|>Optimal Cache-Oblivious Mesh Layouts: A mesh is a graph that divides physical space into regularly-shaped regions. Meshes computations form the basis of many applications, e.g. finite-element methods, image rendering, and collision detection. In one important mesh primitive, called a mesh update, each mesh vertex stores a value and repeatedly updates this value based on the values stored in all neighboring vertices. The performance of a mesh update depends on the layout of the mesh in memory. This paper shows how to find a memory layout that guarantees that the mesh update has asymptotically optimal memory performance for any set of memory parameters. Such a memory layout is called cache-oblivious. Formally, for a $d$-dimensional mesh $G$, block size $B$, and cache size $M$ (where $M=\Omega(B^d)$), the mesh update of $G$ uses $O(1+|G|/B)$ memory transfers. The paper also shows how the mesh-update performance degrades for smaller caches, where $M=o(B^d)$. The paper then gives two algorithms for finding cache-oblivious mesh layouts. The first layout algorithm runs in time $O(|G|\log^2|G|)$ both in expectation and with high probability on a RAM. It uses $O(1+|G|\log^2(|G|/M)/B)$ memory transfers in expectation and $O(1+(|G|/B)(\log^2(|G|/M) + \log|G|))$ memory transfers with high probability in the cache-oblivious and disk-access machine (DAM) models. The layout is obtained by finding a fully balanced decomposition tree of $G$ and then performing an in-order traversal of the leaves of the tree. The second algorithm runs faster by almost a $\log|G|/\log\log|G|$ factor in all three memory models, both in expectation and with high probability. The layout obtained by finding a relax-balanced decomposition tree of $G$ and then performing an in-order traversal of the leaves of the tree.<|reference_end|> | arxiv | @article{bender2007optimal,
title={Optimal Cache-Oblivious Mesh Layouts},
author={Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang},
journal={arXiv preprint arXiv:0705.1033},
year={2007},
archivePrefix={arXiv},
eprint={0705.1033},
primaryClass={cs.DS cs.CE cs.MS cs.NA}
} | bender2007optimal |
arxiv-274 | 0705.1036 | Strategies for the Design of a Slide-o-Cam Transmission | <|reference_start|>Strategies for the Design of a Slide-o-Cam Transmission: The optimization of the pressure angle in a cam-follower transmission is reported in this paper. This transmission is based on Slide-o-Cam, a cam mechanism with multiple rollers mounted on a common translating follower. The design of Slide-o-Cam, a transmission intended to produce a sliding motion from a turning drive, or vice versa, was reported elsewhere. This transmission provides pure-rolling motion, thereby reducing the friction of rack-and-pinions and linear drives. The pressure angle is a suitable performance index for this transmission because it determines the amount of force transmitted to the load vs. that transmitted to the machine frame. Two alternative design strategies are studied, namely, (i) increase the number of lobes on each cam or (ii) increase the number of cams. This device is intended to replace the current ball-screws in Orthoglide, a three-DOF parallel robot for the production of translational motions, currently under development at Ecole Centrale de Nantes for machining applications.<|reference_end|> | arxiv | @article{chablat2007strategies,
title={Strategies for the Design of a Slide-o-Cam Transmission},
author={Damien Chablat (IRCCyN), Jorge Angeles (CIM)},
journal={Proceedings of CK2005, International Workshop on Computational
Kinematics (10/05/2005) 1-10},
year={2007},
archivePrefix={arXiv},
eprint={0705.1036},
primaryClass={cs.RO}
} | chablat2007strategies |
arxiv-275 | 0705.1037 | Regions of Feasible Point-to-Point Trajectories in the Cartesian Workspace of Fully-Parallel Manipulators | <|reference_start|>Regions of Feasible Point-to-Point Trajectories in the Cartesian Workspace of Fully-Parallel Manipulators: The goal of this paper is to define the n-connected regions in the Cartesian workspace of fully-parallel manipulators, i.e. the maximal regions where it is possible to execute point-to-point motions. The manipulators considered in this study may have multiple direct and inverse kinematic solutions. The N-connected regions are characterized by projection, onto the Cartesian workspace, of the connected components of the reachable configuration space defined in the Cartesian product of the Cartesian space by the joint space. Generalized octree models are used for the construction of all spaces. This study is illustrated with a simple planar fully-parallel manipulator.<|reference_end|> | arxiv | @article{chablat2007regions,
title={Regions of Feasible Point-to-Point Trajectories in the Cartesian
Workspace of Fully-Parallel Manipulators},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={25th Design Automation Conference (1999) 1-6},
year={2007},
archivePrefix={arXiv},
eprint={0705.1037},
primaryClass={cs.RO}
} | chablat2007regions |
arxiv-276 | 0705.1038 | The Design of Parallel Kinematic Machine Tools Using Kinetostatic Performance Criteria | <|reference_start|>The Design of Parallel Kinematic Machine Tools Using Kinetostatic Performance Criteria: Most industrial machine tools have a serial kinematic architecture, which means that each axis has to carry the following one, including its actuators and joints. High Speed Machining highlights some drawbacks of such architectures: heavy moving parts require from the machine structure high stiffness to limit bending problems that lower the machine accuracy, and limit the dynamic performances of the feed axes. That is why PKMs attract more and more researchers and companies, because they are claimed to offer several advantages over their serial counterparts, like high structural rigidity and high dynamic capacities. Indeed, the parallel kinematic arrangement of the links provides higher stiffness and lower moving masses that reduce inertia effects. Thus, PKMs have better dynamic performances. However, the design of a parallel kinematic machine tool (PKMT) is a hard task that requires further research studies before wide industrial use can be expected. Many criteria need to be taken into account in the design of a PKMT. We pay special attention to the description of kinetostatic criteria that rely on the conditioning of the Jacobian matrix of the mechanism. The organisation of this paper is as follows: next section introduces general remarks about PKMs, then is explained why PKMs can be interesting alternative machine tool designs. Then are presented existing PKMTs. An application to the design of a small-scale machine tool prototype developed at IRCCyN is presented at the end of this paper.<|reference_end|> | arxiv | @article{majou2007the,
title={The Design of Parallel Kinematic Machine Tools Using Kinetostatic
Performance Criteria},
author={F'elix Majou (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat
(IRCCyN)},
journal={3d Int. Conference on Metal Cutting (2001) 1-10},
year={2007},
archivePrefix={arXiv},
eprint={0705.1038},
primaryClass={cs.RO}
} | majou2007the |
arxiv-277 | 0705.1110 | Mining Patterns with a Balanced Interval | <|reference_start|>Mining Patterns with a Balanced Interval: In many applications it will be useful to know those patterns that occur with a balanced interval, e.g., a certain combination of phone numbers are called almost every Friday or a group of products are sold a lot on Tuesday and Thursday. In previous work we proposed a new measure of support (the number of occurrences of a pattern in a dataset), where we count the number of times a pattern occurs (nearly) in the middle between two other occurrences. If the number of non-occurrences between two occurrences of a pattern stays almost the same then we call the pattern balanced. It was noticed that some very frequent patterns obviously also occur with a balanced interval, meaning in every transaction. However more interesting patterns might occur, e.g., every three transactions. Here we discuss a solution using standard deviation and average. Furthermore we propose a simpler approach for pruning patterns with a balanced interval, making estimating the pruning threshold more intuitive.<|reference_end|> | arxiv | @article{kosters2007mining,
title={Mining Patterns with a Balanced Interval},
author={Edgar de Graaf Joost Kok Walter Kosters},
journal={arXiv preprint arXiv:0705.1110},
year={2007},
archivePrefix={arXiv},
eprint={0705.1110},
primaryClass={cs.AI cs.DB}
} | kosters2007mining |
arxiv-278 | 0705.1148 | S\'eparation des Solutions aux Mod\`eles G\'eom\'etriques Direct et Inverse pour les Manipulateurs Pleinement Parall\`eles | <|reference_start|>S\'eparation des Solutions aux Mod\`eles G\'eom\'etriques Direct et Inverse pour les Manipulateurs Pleinement Parall\`eles: This article provides a formalism making it possible to manage the solutions of the direct and inverse kinematic models of the fully parallel manipulators. We introduce the concept of working modes to separate the solutions from the opposite geometrical model. Then, we define, for each working mode, the aspects of these manipulators. To separate the solutions from the direct kinematics model, we introduce the concept of characteristic surfaces. Then, we define the uniqueness domains, as being the greatest domains of the workspace in which there is unicity of solutions. The principal applications of this work are the design, the trajectory planning.<|reference_end|> | arxiv | @article{chablat2007s\'eparation,
title={S\'eparation des Solutions aux Mod\`eles G\'eom\'etriques Direct et
Inverse pour les Manipulateurs Pleinement Parall\`eles},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={Journal of Mechanism and Machine Theory 36, 6 (2001) 763-783},
year={2007},
archivePrefix={arXiv},
eprint={0705.1148},
primaryClass={cs.RO}
} | chablat2007s\'eparation |
arxiv-279 | 0705.1150 | On the Kinetostatic Optimization of Revolute-Coupled Planar Manipulators | <|reference_start|>On the Kinetostatic Optimization of Revolute-Coupled Planar Manipulators: Proposed in this paper is a kinetostatic performance index for the optimum dimensioning of planar manipulators of the serial type. The index is based on the concept of distance of the underlying Jacobian matrix to a given isotropic matrix that is used as a reference model for purposes of performance evaluation. Applications of the index fall in the realm of design, but control applications are outlined. The paper focuses on planar manipulators, the basic concepts being currently extended to their three-dimensional counterparts.<|reference_end|> | arxiv | @article{chablat2007on,
title={On the Kinetostatic Optimization of Revolute-Coupled Planar Manipulators},
author={Damien Chablat (IRCCyN), Jorge Angeles (CIM)},
journal={Journal of Mechanism and Machine Theory (2002) 351-374},
year={2007},
archivePrefix={arXiv},
eprint={0705.1150},
primaryClass={cs.RO}
} | chablat2007on |
arxiv-280 | 0705.1151 | Achievable Rates and Optimal Resource Allocation for Imperfectly-Known Fading Relay Channels | <|reference_start|>Achievable Rates and Optimal Resource Allocation for Imperfectly-Known Fading Relay Channels: In this paper, achievable rates of imperfectly-known fading relay channels are studied. It is assumed that communication starts with the network training phase in which the receivers estimate the fading coefficients of their respective channels. In the data transmission phase, amplify-and-forward and decode-and-forward relaying schemes are considered, and the corresponding achievable rate expressions are obtained. The achievable rate expressions are then employed to identify the optimal resource allocation strategies.<|reference_end|> | arxiv | @article{zhang2007achievable,
title={Achievable Rates and Optimal Resource Allocation for Imperfectly-Known
Fading Relay Channels},
author={Junwei Zhang, Mustafa Cenk Gursoy},
journal={arXiv preprint arXiv:0705.1151},
year={2007},
archivePrefix={arXiv},
eprint={0705.1151},
primaryClass={cs.IT math.IT}
} | zhang2007achievable |
arxiv-281 | 0705.1159 | Ordering Finite-State Markov Channels by Mutual Information | <|reference_start|>Ordering Finite-State Markov Channels by Mutual Information: In previous work, an ordering result was given for the symbolwise probability of error using general Markov channels, under iterative decoding of LDPC codes. In this paper, the ordering result is extended to mutual information, under the assumption of an iid input distribution. For certain channels, in which the capacity-achieving input distribution is iid, this allows ordering of the channels by capacity. The complexity of analyzing general Markov channels is mitigated by this ordering, since it is possible to immediately determine that a wide class of channels, with different numbers of states, has a smaller mutual information than a given channel.<|reference_end|> | arxiv | @article{eckford2007ordering,
title={Ordering Finite-State Markov Channels by Mutual Information},
author={Andrew W. Eckford},
journal={arXiv preprint arXiv:0705.1159},
year={2007},
archivePrefix={arXiv},
eprint={0705.1159},
primaryClass={cs.IT math.IT}
} | eckford2007ordering |
arxiv-282 | 0705.1161 | IDF revisited: A simple new derivation within the Robertson-Sp\"arck Jones probabilistic model | <|reference_start|>IDF revisited: A simple new derivation within the Robertson-Sp\"arck Jones probabilistic model: There have been a number of prior attempts to theoretically justify the effectiveness of the inverse document frequency (IDF). Those that take as their starting point Robertson and Sparck Jones's probabilistic model are based on strong or complex assumptions. We show that a more intuitively plausible assumption suffices. Moreover, the new assumption, while conceptually very simple, provides a solution to an estimation problem that had been deemed intractable by Robertson and Walker (1997).<|reference_end|> | arxiv | @article{lee2007idf,
title={IDF revisited: A simple new derivation within the Robertson-Sp\"arck
Jones probabilistic model},
author={Lillian Lee},
journal={arXiv preprint arXiv:0705.1161},
year={2007},
archivePrefix={arXiv},
eprint={0705.1161},
primaryClass={cs.IR cs.CL}
} | lee2007idf |
arxiv-283 | 0705.1183 | Multiple Antenna Secure Broadcast over Wireless Networks | <|reference_start|>Multiple Antenna Secure Broadcast over Wireless Networks: In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of secret communication over the Gaussian broadcast channel, where a multi-antenna transmitter sends independent confidential messages to two users with perfect secrecy. That is, each user would like to obtain its own message reliably and confidentially. First, a computable Sato-type outer bound on the secrecy capacity region is provided for a multi-antenna broadcast channel with confidential messages. Next, a dirty-paper secure coding scheme and its simplified version are described. For each case, the corresponding achievable rate region is derived under the perfect secrecy requirement. Finally, two numerical examples demonstrate that the Sato-type outer bound is consistent with the boundary of the simplified dirty-paper coding secrecy rate region.<|reference_end|> | arxiv | @article{liu2007multiple,
title={Multiple Antenna Secure Broadcast over Wireless Networks},
author={Ruoheng Liu and H. Vincent Poor},
journal={arXiv preprint arXiv:0705.1183},
year={2007},
archivePrefix={arXiv},
eprint={0705.1183},
primaryClass={cs.IT math.IT}
} | liu2007multiple |
arxiv-284 | 0705.1187 | Symbol Error Rates of Maximum-Likelihood Detector: Convex/Concave Behavior and Applications | <|reference_start|>Symbol Error Rates of Maximum-Likelihood Detector: Convex/Concave Behavior and Applications: Convexity/concavity properties of symbol error rates (SER) of the maximum likelihood detector operating in the AWGN channel (non-fading and fading) are studied. Generic conditions are identified under which the SER is a convex/concave function of the SNR. Universal bounds for the SER 1st and 2nd derivatives are obtained, which hold for arbitrary constellations and are tight for some of them. Applications of the results are discussed, which include optimum power allocation in spatial multiplexing systems, optimum power/time sharing to decrease or increase (jamming problem) error rate, and implication for fading channels.<|reference_end|> | arxiv | @article{loyka2007symbol,
title={Symbol Error Rates of Maximum-Likelihood Detector: Convex/Concave
Behavior and Applications},
author={Sergey Loyka, Victoria Kostina, Francois Gagnon},
journal={arXiv preprint arXiv:0705.1187},
year={2007},
doi={10.1109/ISIT.2007.4557176},
archivePrefix={arXiv},
eprint={0705.1187},
primaryClass={cs.IT math.IT}
} | loyka2007symbol |
arxiv-285 | 0705.1209 | Artificial Intelligence for Conflict Management | <|reference_start|>Artificial Intelligence for Conflict Management: Militarised conflict is one of the risks that have a significant impact on society. Militarised Interstate Dispute (MID) is defined as an outcome of interstate interactions, which result on either peace or conflict. Effective prediction of the possibility of conflict between states is an important decision support tool for policy makers. In a previous research, neural networks (NNs) have been implemented to predict the MID. Support Vector Machines (SVMs) have proven to be very good prediction techniques and are introduced for the prediction of MIDs in this study and compared to neural networks. The results show that SVMs predict MID better than NNs while NNs give more consistent and easy to interpret sensitivity analysis than SVMs.<|reference_end|> | arxiv | @article{habtemariam2007artificial,
title={Artificial Intelligence for Conflict Management},
author={E. Habtemariam, T. Marwala and M. Lagazio},
journal={arXiv preprint arXiv:0705.1209},
year={2007},
archivePrefix={arXiv},
eprint={0705.1209},
primaryClass={cs.AI}
} | habtemariam2007artificial |
arxiv-286 | 0705.1214 | Control of Complex Systems Using Bayesian Networks and Genetic Algorithm | <|reference_start|>Control of Complex Systems Using Bayesian Networks and Genetic Algorithm: A method based on Bayesian neural networks and genetic algorithm is proposed to control the fermentation process. The relationship between input and output variables is modelled using Bayesian neural network that is trained using hybrid Monte Carlo method. A feedback loop based on genetic algorithm is used to change input variables so that the output variables are as close to the desired target as possible without the loss of confidence level on the prediction that the neural network gives. The proposed procedure is found to reduce the distance between the desired target and measured outputs significantly.<|reference_end|> | arxiv | @article{marwala2007control,
title={Control of Complex Systems Using Bayesian Networks and Genetic Algorithm},
author={Tshilidzi Marwala},
journal={arXiv preprint arXiv:0705.1214},
year={2007},
archivePrefix={arXiv},
eprint={0705.1214},
primaryClass={cs.CE cs.NE}
} | marwala2007control |
arxiv-287 | 0705.1215 | Kinematic Calibration of the Orthoglide-Type Mechanisms | <|reference_start|>Kinematic Calibration of the Orthoglide-Type Mechanisms: The paper proposes a novel calibration approach for the Orthoglide-type mechanisms based on observations of the manipulator leg parallelism during motions between the prespecified test postures. It employs a low-cost measuring system composed of standard comparator indicators attached to the universal magnetic stands. They are sequentially used for measuring the deviation of the relevant leg location while the manipulator moves the TCP along the Cartesian axes. Using the measured differences, the developed algorithm estimates the joint offsets that are treated as the most essential parameters to be adjusted. The sensitivity of the measurement methods and the calibration accuracy are also studied. Experimental results are presented that demonstrate validity of the proposed calibration technique.<|reference_end|> | arxiv | @article{pashkevich2007kinematic,
title={Kinematic Calibration of the Orthoglide-Type Mechanisms},
author={Anatoly Pashkevich (Robotic Laboratory), Damien Chablat (IRCCyN),
Philippe Wenger (IRCCyN)},
journal={Symposium on Information Control Problems in Manufacturing (2006)
1-6},
year={2007},
archivePrefix={arXiv},
eprint={0705.1215},
primaryClass={cs.RO}
} | pashkevich2007kinematic |
arxiv-288 | 0705.1217 | The Design of a Novel Prismatic Drive for a Three-DOF Parallel-Kinematics Machine | <|reference_start|>The Design of a Novel Prismatic Drive for a Three-DOF Parallel-Kinematics Machine: The design of a novel prismatic drive is reported in this paper. This transmission is based on Slide-O-Cam, a cam mechanism with multiple rollers mounted on a common translating follower. The design of Slide-O-Cam was reported elsewhere. This drive thus provides pure-rolling motion, thereby reducing the friction of rack-and-pinions and linear drives. Such properties can be used to design new transmissions for parallel-kinematics machines. In this paper, this transmission is optimized to replace ball-screws in Orthoglide, a three-DOF parallel robot optimized for machining applications.<|reference_end|> | arxiv | @article{renotte2007the,
title={The Design of a Novel Prismatic Drive for a Three-DOF
Parallel-Kinematics Machine},
author={J'erome Renotte (IRCCyN), Damien Chablat (IRCCyN), Jorge Angeles
(CIM)},
journal={ASME Design Engineering Technical Conferences (2004) 1-10},
year={2007},
archivePrefix={arXiv},
eprint={0705.1217},
primaryClass={cs.RO}
} | renotte2007the |
arxiv-289 | 0705.1218 | Calibration of quasi-isotropic parallel kinematic Machines: Orthoglide | <|reference_start|>Calibration of quasi-isotropic parallel kinematic Machines: Orthoglide: The paper proposes a novel approach for the geometrical model calibration of quasi-isotropic parallel kinematic mechanisms of the Orthoglide family. It is based on the observations of the manipulator leg parallelism during motions between the specific test postures and employs a low-cost measuring system composed of standard comparator indicators attached to the universal magnetic stands. They are sequentially used for measuring the deviation of the relevant leg location while the manipulator moves the TCP along the Cartesian axes. Using the measured differences, the developed algorithm estimates the joint offsets and the leg lengths that are treated as the most essential parameters. Validity of the proposed calibration technique is confirmed by the experimental results.<|reference_end|> | arxiv | @article{pashkevich2007calibration,
title={Calibration of quasi-isotropic parallel kinematic Machines: Orthoglide},
author={Anatoly Pashkevich (ROBOTIC Laboratory), Roman Gomolitsky (ROBOTIC
Laboratory), Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Fourth International Conference on Informatics in Control,
Automation and Robotics (09/05/2007) 1-8},
year={2007},
archivePrefix={arXiv},
eprint={0705.1218},
primaryClass={cs.RO}
} | pashkevich2007calibration |
arxiv-290 | 0705.1227 | Rate Adaptation for Cognitive Radio under Interference from Primary Spectrum User | <|reference_start|>Rate Adaptation for Cognitive Radio under Interference from Primary Spectrum User: A cognitive radio can operate as a secondary system in a given spectrum. This operation should use limited power in order not to disturb the communication by primary spectrum user. Under such conditions, in this paper we investigate how to maximize the spectral efficiency in the secondary system. A secondary receiver observes a multiple access channel of two users, the secondary and the primary transmitter, respectively. We show that, for spectrally-efficient operation, the secondary system should apply Opportunistic Interference Cancellation (OIC). With OIC, the secondary system decodes the primary signal when such an opportunity is created by the primary rate and the power received from the primary system. For such an operation, we derive the achievable data rate in the secondary system. When the primary signal is decodable, we devise a method, based on superposition coding, by which the secondary system can achieve the maximal possible rate. Finally, we investigate the power allocation in the secondary system when multiple channels are used. We show that the optimal power allocation with OIC can be achieved through intercepted water-filling instead of the conventional water-filling. The results show a significant gain for the rate achieved through an opportunistic interference cancellation.<|reference_end|> | arxiv | @article{popovski2007rate,
title={Rate Adaptation for Cognitive Radio under Interference from Primary
Spectrum User},
author={Petar Popovski, Hiroyuki Yomo, Kentaro Nishimori, and Rocco Di Taranto},
journal={arXiv preprint arXiv:0705.1227},
year={2007},
archivePrefix={arXiv},
eprint={0705.1227},
primaryClass={cs.IT cs.NI math.IT}
} | popovski2007rate |
arxiv-291 | 0705.1244 | Evolving Symbolic Controllers | <|reference_start|>Evolving Symbolic Controllers: The idea of symbolic controllers tries to bridge the gap between the top-down manual design of the controller architecture, as advocated in Brooks' subsumption architecture, and the bottom-up designer-free approach that is now standard within the Evolutionary Robotics community. The designer provides a set of elementary behavior, and evolution is given the goal of assembling them to solve complex tasks. Two experiments are presented, demonstrating the efficiency and showing the recursiveness of this approach. In particular, the sensitivity with respect to the proposed elementary behaviors, and the robustness w.r.t. generalization of the resulting controllers are studied in detail.<|reference_end|> | arxiv | @article{godzik2007evolving,
title={Evolving Symbolic Controllers},
author={Nicolas Godzik (INRIA Futurs, INRIA Rocquencourt), Marc Schoenauer
(INRIA Futurs, INRIA Rocquencourt), Mich`ele Sebag (INRIA Futurs, LRI)},
journal={Dans 4th European Workshop on Evolutionary Robotics, 2611 (2003)
638-650},
year={2007},
archivePrefix={arXiv},
eprint={0705.1244},
primaryClass={cs.AI}
} | godzik2007evolving |
arxiv-292 | 0705.1271 | Design of a 3 Axis Parallel Machine Tool for High Speed Machining: The Orthoglide | <|reference_start|>Design of a 3 Axis Parallel Machine Tool for High Speed Machining: The Orthoglide: The Orthoglide project aims at designing a new 3-axis machine tool for High Speed Machining. Basis kinematics is a 3 degree-of-freedom translational parallel mechanism. This basis was submitted to isotropic and manipulability constraints that allowed the optmization of its kinematic architecture and legs architecture. Thus, several leg morphologies are convenient for the chosen mechanism. We explain the process that led us to the choice we made for the Orthoglide. A static study is presented to show how singular configurations of the legs can cause stiffness problems.<|reference_end|> | arxiv | @article{majou2007design,
title={Design of a 3 Axis Parallel Machine Tool for High Speed Machining: The
Orthoglide},
author={F'elix Majou (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat
(IRCCyN)},
journal={4\`eme Conf\'erence Internationale sur la Conception et la
fabrication Int\'egr\'ees en M\'ecanique (2002) 1-10},
year={2007},
archivePrefix={arXiv},
eprint={0705.1271},
primaryClass={cs.RO}
} | majou2007design |
arxiv-293 | 0705.1272 | 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 parallel manipulators. First, we analyze a family of three-degree-of-freedom manipulators. Two Jacobian matrices appear in the kinematic relations between the joint-rate and the Cartesian-velocity vectors, which are called the "inverse kinematics" and the "direct kinematics" matrices. The singular configurations of these matrices are studied. The isotropic configurations are then studied based on the characteristic length of this manipulator. The isoconditioning loci of all Jacobian matrices are computed to define a global performance index to compare the different working modes.<|reference_end|> | arxiv | @article{chablat2007the,
title={The Isoconditioning Loci of Planar Three-DOF Parallel Manipulators},
author={Damien Chablat (IRCCyN), St'ephane Caro (IRCCyN), Philippe Wenger
(IRCCyN), Jorge Angeles (CIM)},
journal={4\`eme Conf\'erence Internationale sur la Conception et la
fabrication Int\'egr\'ees en M\'ecanique (2002) 1-10},
year={2007},
archivePrefix={arXiv},
eprint={0705.1272},
primaryClass={cs.RO}
} | chablat2007the |
arxiv-294 | 0705.1280 | A Novel method for the design of 2-DOF Parallel mechanisms for machining applications | <|reference_start|>A Novel method for the design of 2-DOF Parallel mechanisms for machining applications: Parallel Kinematic Mechanisms (PKM) are interesting alternative designs for machine tools. A design method based on velocity amplification factors analysis is presented in this paper. The comparative study of two simple two-degree-of-freedom PKM dedicated to machining applications is led through this method: the common desired properties are the largest square Cartesian workspace for given kinetostatic performances. The orientation and position of the Cartesian workspace are chosen to avoid singularities and to produce the best ratio between Cartesian workspace size and mechanism size. The machine size of each resulting design is used as a comparative criterion.<|reference_end|> | arxiv | @article{majou2007a,
title={A Novel method for the design of 2-DOF Parallel mechanisms for machining
applications},
author={F'elix Majou (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat
(IRCCyN)},
journal={8th International Symposium on Advances in Robot Kinematics (2002)
1-11},
year={2007},
archivePrefix={arXiv},
eprint={0705.1280},
primaryClass={cs.RO}
} | majou2007a |
arxiv-295 | 0705.1282 | Design of a Three-Axis Isotropic Parallel Manipulator for Machining Applications: The Orthoglide | <|reference_start|>Design of a Three-Axis Isotropic Parallel Manipulator for Machining Applications: The Orthoglide: The orthoglide is a 3-DOF parallel mechanism designed at IRCCyN for machining applications. It 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 orthoglide has been designed as function of a prescribed Cartesian workspace with prescribed kinetostatic performances. 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{wenger2007design,
title={Design of a Three-Axis Isotropic Parallel Manipulator for Machining
Applications: The Orthoglide},
author={Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Workshop on Fundamental Issues and Future Research Directions for
Parallel Mechanisms and Manipulators (2002) 1-9},
year={2007},
archivePrefix={arXiv},
eprint={0705.1282},
primaryClass={cs.RO}
} | wenger2007design |
arxiv-296 | 0705.1284 | Workspace Analysis of the Orthoglide using Interval Analysis | <|reference_start|>Workspace Analysis of the Orthoglide using Interval Analysis: This paper addresses the workspace analysis of the orthoglide, a 3-DOF parallel mechanism designed for machining applications. This machine 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 workspace analysis is conducted on the bases of prescribed kinetostatic performances. The interesting features of the orthoglide are a regular Cartesian workspace shape, uniform performances in all directions and good compactness. Interval analysis based methods for computing the dextrous workspace and the largest cube enclosed in this workspace are presented.<|reference_end|> | arxiv | @article{chablat2007workspace,
title={Workspace Analysis of the Orthoglide using Interval Analysis},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), Jean-Pierre Merlet
(COPRIN)},
journal={8th International Symposium on Advances in Robot Kinematics,
Kluwer Academic Publishers (2002) 1-10},
year={2007},
archivePrefix={arXiv},
eprint={0705.1284},
primaryClass={cs.RO}
} | chablat2007workspace |
arxiv-297 | 0705.1285 | P\'eriph\'eriques haptiques et simulation d'objets, de robots et de mannequins dans un environnement de CAO-Robotique : eM-Virtual Desktop | <|reference_start|>P\'eriph\'eriques haptiques et simulation d'objets, de robots et de mannequins dans un environnement de CAO-Robotique : eM-Virtual Desktop: This paper presents the development of a new software in order to manage objects, robots and mannequins in using the possibilities given by the haptic feedback of the Phantom desktop devices. The haptic device provides 6 positional degree of freedom sensing but three degrees force feedback. This software called eM-Virtual Desktop is integrated in the Tecnomatix's solution called eM-Workplace. The eM-Workplace provides powerful solutions for planning and designing of complex assembly facilities, lines and workplaces. In the digital mockup context, the haptic interfaces can be used to reduce the development cycle of products. Three different loops are used to manage the graphic, the collision detection and the haptic feedback according to theirs own frequencies. The developed software is currently tested in industrial context by a European automotive constructor.<|reference_end|> | arxiv | @article{chablat2007p\'eriph\'eriques,
title={P\'eriph\'eriques haptiques et simulation d'objets, de robots et de
mannequins dans un environnement de CAO-Robotique : eM-Virtual Desktop},
author={Damien Chablat (IRCCyN), Fouad Bennis (IRCCyN), Bernard Hoessler,
Matthieu Guibert},
journal={Virtual Concept (2002) 51-56},
year={2007},
archivePrefix={arXiv},
eprint={0705.1285},
primaryClass={cs.RO}
} | chablat2007p\'eriph\'eriques |
arxiv-298 | 0705.1288 | Predicting the Presence of Internet Worms using Novelty Detection | <|reference_start|>Predicting the Presence of Internet Worms using Novelty Detection: Internet worms cause billions of dollars in damage yearly, affecting millions of users worldwide. For countermeasures to be deployed timeously, it is necessary to use an automated system to detect the spread of a worm. This paper discusses a method of determining the presence of a worm, based on routing information currently available from Internet routers. An autoencoder, which is a specialized type of neural network, was used to detect anomalies in normal routing behavior. The autoencoder was trained using information from a single router, and was able to detect both global instability caused by worms as well as localized routing instability.<|reference_end|> | arxiv | @article{marais2007predicting,
title={Predicting the Presence of Internet Worms using Novelty Detection},
author={E. Marais, T. Marwala},
journal={arXiv preprint arXiv:0705.1288},
year={2007},
archivePrefix={arXiv},
eprint={0705.1288},
primaryClass={cs.CR}
} | marais2007predicting |
arxiv-299 | 0705.1309 | Robust Multi-Cellular Developmental Design | <|reference_start|>Robust Multi-Cellular Developmental Design: This paper introduces a continuous model for Multi-cellular Developmental Design. The cells are fixed on a 2D grid and exchange "chemicals" with their neighbors during the growth process. The quantity of chemicals that a cell produces, as well as the differentiation value of the cell in the phenotype, are controlled by a Neural Network (the genotype) that takes as inputs the chemicals produced by the neighboring cells at the previous time step. In the proposed model, the number of iterations of the growth process is not pre-determined, but emerges during evolution: only organisms for which the growth process stabilizes give a phenotype (the stable state), others are declared nonviable. The optimization of the controller is done using the NEAT algorithm, that optimizes both the topology and the weights of the Neural Networks. Though each cell only receives local information from its neighbors, the experimental results of the proposed approach on the 'flags' problems (the phenotype must match a given 2D pattern) are almost as good as those of a direct regression approach using the same model with global information. Moreover, the resulting multi-cellular organisms exhibit almost perfect self-healing characteristics.<|reference_end|> | arxiv | @article{devert2007robust,
title={Robust Multi-Cellular Developmental Design},
author={Alexandre Devert (INRIA Futurs), Nicolas Bred`eche (INRIA Futurs),
Marc Schoenauer (INRIA Futurs)},
journal={Dans Genetic and Evolutionary Computation COnference (2007)},
year={2007},
archivePrefix={arXiv},
eprint={0705.1309},
primaryClass={cs.AI}
} | devert2007robust |
arxiv-300 | 0705.1329 | Third Order Newton's Method for Zernike Polynomial Zeros | <|reference_start|>Third Order Newton's Method for Zernike Polynomial Zeros: The Zernike radial polynomials are a system of orthogonal polynomials over the unit interval with weight x. They are used as basis functions in optics to expand fields over the cross section of circular pupils. To calculate the roots of Zernike polynomials, we optimize the generic iterative numerical Newton's Method that iterates on zeros of functions with third order convergence. The technique is based on rewriting the polynomials as Gauss Hypergeometric Functions, reduction of second order derivatives to first order derivatives, and evaluation of some ratios of derivatives by terminating continued fractions. A PARI program and a short table of zeros complete up to polynomials of 40th order are included.<|reference_end|> | arxiv | @article{mathar2007third,
title={Third Order Newton's Method for Zernike Polynomial Zeros},
author={Richard J. Mathar},
journal={arXiv preprint arXiv:0705.1329},
year={2007},
archivePrefix={arXiv},
eprint={0705.1329},
primaryClass={math.NA cs.NA}
} | mathar2007third |