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-801 | 0707.2926 | Robust Hypothesis Testing with a Relative Entropy Tolerance | <|reference_start|>Robust Hypothesis Testing with a Relative Entropy Tolerance: This paper considers the design of a minimax test for two hypotheses where the actual probability densities of the observations are located in neighborhoods obtained by placing a bound on the relative entropy between actual and nominal dens... | arxiv | @article{levy2007robust,
title={Robust Hypothesis Testing with a Relative Entropy Tolerance},
author={Bernard C. Levy},
journal={arXiv preprint arXiv:0707.2926},
year={2007},
doi={10.1109/TIT.2008.2008128},
archivePrefix={arXiv},
eprint={0707.2926},
primaryClass={cs.IT math.IT}
} | levy2007robust |
arxiv-802 | 0707.2934 | Instrumented Collective Learning Situations (ICLS): the Gap between Theoretical Research and Observed Practices | <|reference_start|>Instrumented Collective Learning Situations (ICLS): the Gap between Theoretical Research and Observed Practices: According to socio-constructivism approach, collective situations are promoted to favor learning in classroom, at a distance or in a blended educational context. So, many Information and C... | arxiv | @article{michel2007instrumented,
title={Instrumented Collective Learning Situations (ICLS): the Gap between
Theoretical Research and Observed Practices},
author={Christine Michel (LIESP), Elise Garrot (LIESP), Sebastien George
(LIESP)},
journal={18th Internationale Conference on Society for Information
... | michel2007instrumented |
arxiv-803 | 0707.2998 | Building a Cooperative Communications System | <|reference_start|>Building a Cooperative Communications System: In this paper, we present the results from over-the-air experiments of a complete implementation of an amplify and forward cooperative communications system. Our custom OFDM-based physical layer uses a distributed version of the Alamouti block code, where... | arxiv | @article{murphy2007building,
title={Building a Cooperative Communications System},
author={Patrick Murphy, Ashutosh Sabharwal and Behnaam Aazhang},
journal={arXiv preprint arXiv:0707.2998},
year={2007},
archivePrefix={arXiv},
eprint={0707.2998},
primaryClass={cs.IT math.IT}
} | murphy2007building |
arxiv-804 | 0707.3014 | Situations d'apprentissage collectives instrument\'ees : \'etude de pratiques dans l'enseignement sup\'erieur | <|reference_start|>Situations d'apprentissage collectives instrument\'ees : \'etude de pratiques dans l'enseignement sup\'erieur: Currently, educational platforms propose many tools of communication, production, labour division or collective work management in order to support collective activities. But it is not guara... | arxiv | @article{michel2007situations,
title={Situations d'apprentissage collectives instrument\'ees : \'etude de
pratiques dans l'enseignement sup\'erieur},
author={Christine Michel (LIESP), Elise Garrot (LIESP), Sebastien George
(LIESP)},
journal={Actes de la Conf\'erence en EIAH 2007 (27/06/2007) 185-196},
... | michel2007situations |
arxiv-805 | 0707.3030 | Optimal Design of Ad Hoc Injection Networks by Using Genetic Algorithms | <|reference_start|>Optimal Design of Ad Hoc Injection Networks by Using Genetic Algorithms: This work aims at optimizing injection networks, which consist in adding a set of long-range links (called bypass links) in mobile multi-hop ad hoc networks so as to improve connectivity and overcome network partitioning. To thi... | arxiv | @article{danoy2007optimal,
title={Optimal Design of Ad Hoc Injection Networks by Using Genetic Algorithms},
author={Gregoire Danoy, Pascal Bouvry, Matthias R. Brust, Enrique Alba},
journal={Genetic and Evolutionary Computation Conference (GECCO 2007), ISBN
978-1-59593-697-4},
year={2007},
archiveP... | danoy2007optimal |
arxiv-806 | 0707.3043 | p-Adic Modelling of the Genome and the Genetic Code | <|reference_start|>p-Adic Modelling of the Genome and the Genetic Code: The present paper is devoted to foundations of p-adic modelling in genomics. Considering nucleotides, codons, DNA and RNA sequences, amino acids, and proteins as information systems, we have formulated the corresponding p-adic formalisms for their ... | arxiv | @article{dragovich2007p-adic,
title={p-Adic Modelling of the Genome and the Genetic Code},
author={Branko Dragovich and Alexandra Dragovich},
journal={The Computer Journal 53 (2010) 432-442},
year={2007},
doi={10.1093/comjnl/bxm083},
archivePrefix={arXiv},
eprint={0707.3043},
primaryClas... | dragovich2007p-adic |
arxiv-807 | 0707.3087 | Universal Reinforcement Learning | <|reference_start|>Universal Reinforcement Learning: We consider an agent interacting with an unmodeled environment. At each time, the agent makes an observation, takes an action, and incurs a cost. Its actions can influence future observations and costs. The goal is to minimize the long-term average cost. We propose a... | arxiv | @article{farias2007universal,
title={Universal Reinforcement Learning},
author={Vivek F. Farias, Ciamac C. Moallemi, Tsachy Weissman, Benjamin Van Roy},
journal={arXiv preprint arXiv:0707.3087},
year={2007},
archivePrefix={arXiv},
eprint={0707.3087},
primaryClass={cs.IT cs.LG math.IT}
} | farias2007universal |
arxiv-808 | 0707.3095 | Channel Capacity Estimation using Free Probability Theory | <|reference_start|>Channel Capacity Estimation using Free Probability Theory: In many channel measurement applications, one needs to estimate some characteristics of the channels based on a limited set of measurements. This is mainly due to the highly time varying characteristics of the channel. In this contribution, i... | arxiv | @article{ryan2007channel,
title={Channel Capacity Estimation using Free Probability Theory},
author={{O}yvind Ryan, Merouane Debbah},
journal={arXiv preprint arXiv:0707.3095},
year={2007},
doi={10.1109/TSP.2008.927074},
archivePrefix={arXiv},
eprint={0707.3095},
primaryClass={cs.IT math.... | ryan2007channel |
arxiv-809 | 0707.3170 | Inductive Definition and Domain Theoretic Properties of Fully Abstract | <|reference_start|>Inductive Definition and Domain Theoretic Properties of Fully Abstract: A construction of fully abstract typed models for PCF and PCF^+ (i.e., PCF + "parallel conditional function"), respectively, is presented. It is based on general notions of sequential computational strategies and wittingly consis... | arxiv | @article{sazonov2007inductive,
title={Inductive Definition and Domain Theoretic Properties of Fully Abstract},
author={Vladimir Sazonov},
journal={Logical Methods in Computer Science, Volume 3, Issue 3 (September
10, 2007) lmcs:914},
year={2007},
doi={10.2168/LMCS-3(3:7)2007},
archivePrefix={a... | sazonov2007inductive |
arxiv-810 | 0707.3175 | Stacked OSTBC: Error Performance and Rate Analysis | <|reference_start|>Stacked OSTBC: Error Performance and Rate Analysis: It is well known, that the Alamouti scheme is the only space-time code from orthogonal design achieving the capacity of a multiple-input multiple-output (MIMO) wireless communication system with n_T=2 transmit antennas and n_R=1 receive antenna. In ... | arxiv | @article{sezgin2007stacked,
title={Stacked OSTBC: Error Performance and Rate Analysis},
author={Aydin Sezgin and Oliver Henkel},
journal={arXiv preprint arXiv:0707.3175},
year={2007},
doi={10.1109/TSP.2007.896025},
archivePrefix={arXiv},
eprint={0707.3175},
primaryClass={cs.IT math.IT}
} | sezgin2007stacked |
arxiv-811 | 0707.3186 | Kinematic and stiffness analysis of the Orthoglide, a PKM with simple, regular workspace and homogeneous performances | <|reference_start|>Kinematic and stiffness analysis of the Orthoglide, a PKM with simple, regular workspace and homogeneous performances: The Orthoglide is a Delta-type PKM dedicated to 3-axis rapid machining applications that was originally developed at IRCCyN in 2000-2001 to meet the advantages of both serial 3-axis ... | arxiv | @article{pashkevich2007kinematic,
title={Kinematic and stiffness analysis of the Orthoglide, a PKM with simple,
regular workspace and homogeneous performances},
author={Anatoly Pashkevich (Robotic Laboratory), Philippe Wenger (IRCCyN),
Damien Chablat (IRCCyN)},
journal={Dans International Conference On ... | pashkevich2007kinematic |
arxiv-812 | 0707.3205 | Neutrality and Many-Valued Logics | <|reference_start|>Neutrality and Many-Valued Logics: In this book, we consider various many-valued logics: standard, linear, hyperbolic, parabolic, non-Archimedean, p-adic, interval, neutrosophic, etc. We survey also results which show the tree different proof-theoretic frameworks for many-valued logics, e.g. framewor... | arxiv | @article{schumann2007neutrality,
title={Neutrality and Many-Valued Logics},
author={Andrew Schumann, Florentin Smarandache},
journal={A. Schumann, F. Smarandache, Neutrality and Many-Valued Logics.
American Research Press, 2007},
year={2007},
archivePrefix={arXiv},
eprint={0707.3205},
prim... | schumann2007neutrality |
arxiv-813 | 0707.3231 | Estimation of Small s-t Reliabilities in Acyclic Networks | <|reference_start|>Estimation of Small s-t Reliabilities in Acyclic Networks: In the classical s-t network reliability problem a fixed network G is given including two designated vertices s and t (called terminals). The edges are subject to independent random failure, and the task is to compute the probability that s a... | arxiv | @article{laumanns2007estimation,
title={Estimation of Small s-t Reliabilities in Acyclic Networks},
author={Marco Laumanns and Rico Zenklusen},
journal={arXiv preprint arXiv:0707.3231},
year={2007},
archivePrefix={arXiv},
eprint={0707.3231},
primaryClass={cs.DM}
} | laumanns2007estimation |
arxiv-814 | 0707.3236 | RS-232 Led Board | <|reference_start|>RS-232 Led Board: This article demonstrates how to develop a Microchip PIC16F84 based device that supports RS-232 interface with PC. Circuit (LED Board) design and software development will be discussed. PicBasic Pro Compiler from microEngineering Labs, Inc. is used for PIC programming. Development o... | arxiv | @article{tskhvaradze2007rs-232,
title={RS-232 Led Board},
author={Vladimir Tskhvaradze},
journal={arXiv preprint arXiv:0707.3236},
year={2007},
archivePrefix={arXiv},
eprint={0707.3236},
primaryClass={cs.OH}
} | tskhvaradze2007rs-232 |
arxiv-815 | 0707.3248 | Decentralized sequential change detection using physical layer fusion | <|reference_start|>Decentralized sequential change detection using physical layer fusion: The problem of decentralized sequential detection with conditionally independent observations is studied. The sensors form a star topology with a central node called fusion center as the hub. The sensors make noisy observations of... | arxiv | @article{zacharias2007decentralized,
title={Decentralized sequential change detection using physical layer fusion},
author={Leena Zacharias, Rajesh Sundaresan},
journal={IEEE Trans. Wireless Commun., vol. 7, no. 12, pp. 4999-5008, Dec.
2008},
year={2007},
doi={10.1109/T-WC.2008.070808},
archiv... | zacharias2007decentralized |
arxiv-816 | 0707.3263 | Autonomous tools for Grid management, monitoring and optimization | <|reference_start|>Autonomous tools for Grid management, monitoring and optimization: We outline design and lines of development of autonomous tools for the computing Grid management, monitoring and optimization. The management is proposed to be based on the notion of utility. Grid optimization is considered to be appl... | arxiv | @article{wislicki2007autonomous,
title={Autonomous tools for Grid management, monitoring and optimization},
author={Wojciech Wislicki},
journal={arXiv preprint arXiv:0707.3263},
year={2007},
archivePrefix={arXiv},
eprint={0707.3263},
primaryClass={cs.DC cs.CE hep-ex}
} | wislicki2007autonomous |
arxiv-817 | 0707.3269 | International Standard for a Linguistic Annotation Framework | <|reference_start|>International Standard for a Linguistic Annotation Framework: This paper describes the Linguistic Annotation Framework under development within ISO TC37 SC4 WG1. The Linguistic Annotation Framework is intended to serve as a basis for harmonizing existing language resources as well as developing new o... | arxiv | @article{romary2007international,
title={International Standard for a Linguistic Annotation Framework},
author={Laurent Romary (INRIA Lorraine - LORIA), Nancy Ide (INRIA Lorraine -
LORIA)},
journal={Natural Language Engineering 10, 3-4 (09/2004) 211-225},
year={2007},
archivePrefix={arXiv},
ep... | romary2007international |
arxiv-818 | 0707.3270 | A Formal Model of Dictionary Structure and Content | <|reference_start|>A Formal Model of Dictionary Structure and Content: We show that a general model of lexical information conforms to an abstract model that reflects the hierarchy of information found in a typical dictionary entry. We show that this model can be mapped into a well-formed XML document, and how the XSL ... | arxiv | @article{romary2007a,
title={A Formal Model of Dictionary Structure and Content},
author={Laurent Romary (INRIA Lorraine - LORIA), Nancy Ide, Adam Kilgarriff},
journal={Dans Euralex 2000 Euralex 2000, Stuttgart : Allemagne (2000)},
year={2007},
archivePrefix={arXiv},
eprint={0707.3270},
prim... | romary2007a |
arxiv-819 | 0707.3336 | Statistical mechanical analysis of the linear vector channel in digital communication | <|reference_start|>Statistical mechanical analysis of the linear vector channel in digital communication: A statistical mechanical framework to analyze linear vector channel models in digital wireless communication is proposed for a large system. The framework is a generalization of that proposed for code-division mult... | arxiv | @article{takeda2007statistical,
title={Statistical mechanical analysis of the linear vector channel in digital
communication},
author={Koujin Takeda, Atsushi Hatabu, Yoshiyuki Kabashima},
journal={J. Phys. A40 (2007) 14085-14098},
year={2007},
doi={10.1088/1751-8113/40/47/004},
archivePrefix={... | takeda2007statistical |
arxiv-820 | 0707.3390 | Consistency of the group Lasso and multiple kernel learning | <|reference_start|>Consistency of the group Lasso and multiple kernel learning: We consider the least-square regression problem with regularization by a block 1-norm, i.e., a sum of Euclidean norms over spaces of dimensions larger than one. This problem, referred to as the group Lasso, extends the usual regularization ... | arxiv | @article{bach2007consistency,
title={Consistency of the group Lasso and multiple kernel learning},
author={Francis Bach (WILLOW Project - Inria/Ens)},
journal={arXiv preprint arXiv:0707.3390},
year={2007},
archivePrefix={arXiv},
eprint={0707.3390},
primaryClass={cs.LG}
} | bach2007consistency |
arxiv-821 | 0707.3407 | Faster subsequence recognition in compressed strings | <|reference_start|>Faster subsequence recognition in compressed strings: Computation on compressed strings is one of the key approaches to processing massive data sets. We consider local subsequence recognition problems on strings compressed by straight-line programs (SLP), which is closely related to Lempel--Ziv compr... | arxiv | @article{tiskin2007faster,
title={Faster subsequence recognition in compressed strings},
author={Alexander Tiskin},
journal={arXiv preprint arXiv:0707.3407},
year={2007},
archivePrefix={arXiv},
eprint={0707.3407},
primaryClass={cs.DS cs.CC cs.DM}
} | tiskin2007faster |
arxiv-822 | 0707.3409 | Faster exon assembly by sparse spliced alignment | <|reference_start|>Faster exon assembly by sparse spliced alignment: Assembling a gene from candidate exons is an important problem in computational biology. Among the most successful approaches to this problem is \emph{spliced alignment}, proposed by Gelfand et al., which scores different candidate exon chains within ... | arxiv | @article{tiskin2007faster,
title={Faster exon assembly by sparse spliced alignment},
author={Alexander Tiskin},
journal={arXiv preprint arXiv:0707.3409},
year={2007},
archivePrefix={arXiv},
eprint={0707.3409},
primaryClass={cs.DS cs.CC cs.CE q-bio.QM}
} | tiskin2007faster |
arxiv-823 | 0707.3435 | A Knowledge-Based Analysis of Global Function Computation | <|reference_start|>A Knowledge-Based Analysis of Global Function Computation: Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends on the whole network, the goal is for every agent to eventuall... | arxiv | @article{halpern2007a,
title={A Knowledge-Based Analysis of Global Function Computation},
author={Joseph Y. Halpern and Sabina Petride},
journal={arXiv preprint arXiv:0707.3435},
year={2007},
archivePrefix={arXiv},
eprint={0707.3435},
primaryClass={cs.DC cs.LO}
} | halpern2007a |
arxiv-824 | 0707.3449 | Zero-automatic queues and product form | <|reference_start|>Zero-automatic queues and product form: We introduce and study a new model: 0-automatic queues. Roughly, 0-automatic queues are characterized by a special buffering mechanism evolving like a random walk on some infinite group or monoid. The salient result is that all stable 0-automatic queues have a ... | arxiv | @article{dao-thi2007zero-automatic,
title={Zero-automatic queues and product form},
author={Thu-Ha Dao-Thi (LIAFA), Jean Mairesse (LIAFA)},
journal={Advances in Applied Probability 39, 2 (2007) 429-461},
year={2007},
archivePrefix={arXiv},
eprint={0707.3449},
primaryClass={cs.DM}
} | dao-thi2007zero-automatic |
arxiv-825 | 0707.3457 | A Generalized Information Formula as the Bridge between Shannon and Popper | <|reference_start|>A Generalized Information Formula as the Bridge between Shannon and Popper: A generalized information formula related to logical probability and fuzzy set is deduced from the classical information formula. The new information measure accords with to Popper's criterion for knowledge evolution very muc... | arxiv | @article{lu2007a,
title={A Generalized Information Formula as the Bridge between Shannon and
Popper},
author={Chenguang Lu},
journal={arXiv preprint arXiv:0707.3457},
year={2007},
archivePrefix={arXiv},
eprint={0707.3457},
primaryClass={cs.IT cs.AI math.IT}
} | lu2007a |
arxiv-826 | 0707.3461 | Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function | <|reference_start|>Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function: Consider a pair of correlated Gaussian sources (X1,X2). Two separate encoders observe the two components and communicate compressed versions of their observations to a common decoder. The decoder... | arxiv | @article{krithivasan2007lattices,
title={Lattices for Distributed Source Coding: Jointly Gaussian Sources and
Reconstruction of a Linear Function},
author={D. Krithivasan and S. S. Pradhan},
journal={arXiv preprint arXiv:0707.3461},
year={2007},
archivePrefix={arXiv},
eprint={0707.3461},
p... | krithivasan2007lattices |
arxiv-827 | 0707.3462 | Separable and Low-Rank Continuous Games | <|reference_start|>Separable and Low-Rank Continuous Games: In this paper, we study nonzero-sum separable games, which are continuous games whose payoffs take a sum-of-products form. Included in this subclass are all finite games and polynomial games. We investigate the structure of equilibria in separable games. We sh... | arxiv | @article{stein2007separable,
title={Separable and Low-Rank Continuous Games},
author={Noah D. Stein, Asuman Ozdaglar, Pablo A. Parrilo},
journal={International Journal of Game Theory, Vol. 37, No. 4, pp. 457-474,
2008.},
year={2007},
doi={10.1007/s00182-008-0129-2},
archivePrefix={arXiv},
... | stein2007separable |
arxiv-828 | 0707.3479 | Quantum Algorithms for Learning and Testing Juntas | <|reference_start|>Quantum Algorithms for Learning and Testing Juntas: In this article we develop quantum algorithms for learning and testing juntas, i.e. Boolean functions which depend only on an unknown set of k out of n input variables. Our aim is to develop efficient algorithms: - whose sample complexity has no d... | arxiv | @article{atici2007quantum,
title={Quantum Algorithms for Learning and Testing Juntas},
author={Alp Atici, Rocco A. Servedio},
journal={Quantum Information Processing, Vol. 6, No. 5, 323 - 348 (2007)},
year={2007},
doi={10.1007/s11128-007-0061-6},
archivePrefix={arXiv},
eprint={0707.3479},
... | atici2007quantum |
arxiv-829 | 0707.3482 | A Bayesian Framework for Combining Valuation Estimates | <|reference_start|>A Bayesian Framework for Combining Valuation Estimates: Obtaining more accurate equity value estimates is the starting point for stock selection, value-based indexing in a noisy market, and beating benchmark indices through tactical style rotation. Unfortunately, discounted cash flow, method of compa... | arxiv | @article{yee2007a,
title={A Bayesian Framework for Combining Valuation Estimates},
author={Kenton K. Yee},
journal={arXiv preprint arXiv:0707.3482},
year={2007},
archivePrefix={arXiv},
eprint={0707.3482},
primaryClass={q-fin.ST cs.CE nlin.AO nlin.CD nlin.SI physics.pop-ph physics.soc-ph stat... | yee2007a |
arxiv-830 | 0707.3507 | Workspace and Kinematic Analysis of the VERNE machine | <|reference_start|>Workspace and Kinematic Analysis of the VERNE machine: This paper describes the workspace and the inverse and direct kinematic analysis of the VERNE machine, a serial/parallel 5-axis machine tool designed by Fatronik for IRCCyN. This machine is composed of a three-degree-of-freedom (DOF) parallel mod... | arxiv | @article{kanaan2007workspace,
title={Workspace and Kinematic Analysis of the VERNE machine},
author={Daniel Kanaan (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat
(IRCCyN)},
journal={Dans International Conference on Advanced Intelligent Mechatronics
- AIM, Z\"urich : Suisse (09/2007)},
year={2007... | kanaan2007workspace |
arxiv-831 | 0707.3509 | Upper bound of loss probability in an OFDMA system with randomly located users | <|reference_start|>Upper bound of loss probability in an OFDMA system with randomly located users: For OFDMA systems, we find a rough but easily computed upper bound for the probability of loosing communications by insufficient number of sub-channels on downlink. We consider as random the positions of receiving users i... | arxiv | @article{decreusefond2007upper,
title={Upper bound of loss probability in an OFDMA system with randomly located
users},
author={Laurent Decreusefond (LTCI), Eduardo Ferraz (LTCI), Philippe Martins
(LTCI)},
journal={arXiv preprint arXiv:0707.3509},
year={2007},
archivePrefix={arXiv},
eprint={... | decreusefond2007upper |
arxiv-832 | 0707.3531 | e-Science initiatives in Venezuela | <|reference_start|>e-Science initiatives in Venezuela: Within the context of the nascent e-Science infrastructure in Venezuela, we describe several web-based scientific applications developed at the Centro Nacional de Calculo Cientifico Universidad de Los Andes (CeCalCULA), Merida, and at the Instituto Venezolano de In... | arxiv | @article{chaves2007e-science,
title={e-Science initiatives in Venezuela},
author={J. L. Chaves, G. Diaz, V. Hamar, R. Isea, F. Rojas, N. Ruiz, R.
Torrens, M. Uzcategui, J. Florez-Lopez, H. Hoeger, C. Mendoza, L. A. Nunez},
journal={Procceedings Spanish Conference on e-Science Grid Computing, J.
Casado, ... | chaves2007e-science |
arxiv-833 | 0707.3534 | The Kinetostatic Optimization of a Novel Prismatic Drive | <|reference_start|>The Kinetostatic 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... | arxiv | @article{chablat2007the,
title={The Kinetostatic Optimization of a Novel Prismatic Drive},
author={Damien Chablat (IRCCyN), St'ephane Caro (IRCCyN)},
journal={Dans 12th World Congress in Mechanism and Machine Science - 12th
World Congress in Mechanism and Machine Science, Besan\c{c}on : France
(06/2007)... | chablat2007the |
arxiv-834 | 0707.3540 | Mumford dendrograms | <|reference_start|>Mumford dendrograms: An effective $p$-adic encoding of dendrograms is presented through an explicit embedding into the Bruhat-Tits tree for a $p$-adic number field. This field depends on the number of children of a vertex and is a finite extension of the field of $p$-adic numbers. It is shown that fi... | arxiv | @article{bradley2007mumford,
title={Mumford dendrograms},
author={Patrick Erik Bradley},
journal={The Computer Journal, Vol. 53, No. 4 (2010), 393-404},
year={2007},
doi={10.1093/comjnl/bxm088},
archivePrefix={arXiv},
eprint={0707.3540},
primaryClass={cs.DM}
} | bradley2007mumford |
arxiv-835 | 0707.3550 | A Six Degree-Of-Freedom Haptic Device Based On The Orthoglide And A Hybrid Agile Eye | <|reference_start|>A Six Degree-Of-Freedom Haptic Device Based On The Orthoglide And A Hybrid Agile Eye: This paper is devoted to the kinematic design of a new six degree-of-freedom haptic device using two parallel mechanisms. The first one, called orthoglide, provides the translation motions and the second one, called... | arxiv | @article{chablat2007a,
title={A Six Degree-Of-Freedom Haptic Device Based On The Orthoglide And A
Hybrid Agile Eye},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={Dans Proceedings of IDETC 2006: 30th Mechanisms & Robotics
Conference (MR) - IDETC, Philadelphie : \'Etats-Unis d'Am\'... | chablat2007a |
arxiv-836 | 0707.3552 | Analyse Comparative des Manipulateurs 3R \`a Axes Orthogonaux | <|reference_start|>Analyse Comparative des Manipulateurs 3R \`a Axes Orthogonaux: A family of 3R orthogonal manipulators without offset on the third body can be divided into exactly nine workspace topologies. The workspace is characterized in a half-cross section by the singular curves. The workspace topology is define... | arxiv | @article{baili2007analyse,
title={Analyse Comparative des Manipulateurs 3R \`a Axes Orthogonaux},
author={Maher Baili (IRCCyN), Damien Chablat (IRCCyN), Philippe Wenger
(IRCCyN)},
journal={Dans Congr\`es international Conception et Mod\'elisation des
Syst\`emes M\'ecaniques - Congr\`es international Con... | baili2007analyse |
arxiv-837 | 0707.3553 | An Exhaustive Study of the Workspace Topologies of all 3R Orthogonal Manipulators with Geometric Simplifications | <|reference_start|>An Exhaustive Study of the Workspace Topologies of all 3R Orthogonal Manipulators with Geometric Simplifications: This paper analyses the workspace of the three-revolute orthogonal manipulators that have at least one of their DH parameters equal to zero. These manipulators are classified into differe... | arxiv | @article{zein2007an,
title={An Exhaustive Study of the Workspace Topologies of all 3R Orthogonal
Manipulators with Geometric Simplifications},
author={Mazen Zein (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Dans Proceedings of CK2005 - Proceedings of CK2005, International
Works... | zein2007an |
arxiv-838 | 0707.3559 | Practical Approach to Knowledge-based Question Answering with Natural Language Understanding and Advanced Reasoning | <|reference_start|>Practical Approach to Knowledge-based Question Answering with Natural Language Understanding and Advanced Reasoning: This research hypothesized that a practical approach in the form of a solution framework known as Natural Language Understanding and Reasoning for Intelligence (NaLURI), which combines... | arxiv | @article{wong2007practical,
title={Practical Approach to Knowledge-based Question Answering with Natural
Language Understanding and Advanced Reasoning},
author={Wilson Wong},
journal={arXiv preprint arXiv:0707.3559},
year={2007},
archivePrefix={arXiv},
eprint={0707.3559},
primaryClass={cs.... | wong2007practical |
arxiv-839 | 0707.3560 | Integration of a Balanced Virtual Manikin in a Virtual Reality Platform aimed at Virtual Prototyping | <|reference_start|>Integration of a Balanced Virtual Manikin in a Virtual Reality Platform aimed at Virtual Prototyping: The work presented here is aimed at introducing a virtual human controller in a virtual prototyping framework. After a brief introduction describing the problem solved in the paper, we describe the i... | arxiv | @article{rennuit2007integration,
title={Integration of a Balanced Virtual Manikin in a Virtual Reality Platform
aimed at Virtual Prototyping},
author={Antoine Rennuit (IRCCyN), Alain Micaelli (CEA/LIST), Xavier Merlhiot
(CEA/LIST), Claude Andriot (CEA/LIST), Franc{c}ois Guillaume, Nicolas
Chevassus, Damie... | rennuit2007integration |
arxiv-840 | 0707.3562 | Balanced Virtual Humans Interacting with their Environment | <|reference_start|>Balanced Virtual Humans Interacting with their Environment: The animation of human avatars seems very successful; the computer graphics industry shows outstanding results in films everyday, the game industry achieves exploits... Nevertheless, the animation and control processes of such manikins are v... | arxiv | @article{rennuit2007balanced,
title={Balanced Virtual Humans Interacting with their Environment},
author={Antoine Rennuit (IRCCyN), Alain Micaelli (CEA/LIST), Xavier Merlhiot
(CEA/LIST), Claude Andriot (CEA/LIST), Franc{c}ois Guillaume, Nicolas
Chevassus, Damien Chablat (IRCCyN), Patrick Chedmail (IRCCyN)},... | rennuit2007balanced |
arxiv-841 | 0707.3563 | Virtual reality: A human centered tool for improving Manufacturing | <|reference_start|>Virtual reality: A human centered tool for improving Manufacturing: Manufacturing is using Virtual Reality tools to enhance the product life cycle. Their definitions are still in flux and it is necessary to define their connections. Thus, firstly, we will introduce more closely some definitions where... | arxiv | @article{bennis2007virtual,
title={Virtual reality: A human centered tool for improving Manufacturing},
author={Fouad Bennis (IRCCyN), Damien Chablat (IRCCyN), Philippe D'epinc'e},
journal={Dans Proceedings of Virtual Concept 2005 - Virtual Concept,
Biarritz : France (11/2005)},
year={2007},
archi... | bennis2007virtual |
arxiv-842 | 0707.3564 | A New Six Degree-of-Freedom Haptic Device based on the Orthoglide and the Agile Eye | <|reference_start|>A New Six Degree-of-Freedom Haptic Device based on the Orthoglide and the Agile Eye: The aim of this paper is to present a new six degree-of-freedom (dof) haptic device using two parallel mechanisms. The first one, called orthoglide, provides the translation motions and the second one produces the ro... | arxiv | @article{chablat2007a,
title={A New Six Degree-of-Freedom Haptic Device based on the Orthoglide and
the Agile Eye},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={Dans Proceedings of Virtual Concept 2005 - Virtual Concept, France
(11/2005)},
year={2007},
archivePrefix={arXi... | chablat2007a |
arxiv-843 | 0707.3574 | L'orthoglide : une machine-outil rapide d'architecture parall\`ele isotrope | <|reference_start|>L'orthoglide : une machine-outil rapide d'architecture parall\`ele isotrope: This article presents the Orthoglide project. The purpose of this project is the realization of a prototype of machine tool to three degrees of translation. The characteristic of this machine is a parallel kinematic architec... | arxiv | @article{wenger2007l'orthoglide,
title={L'orthoglide : une machine-outil rapide d'architecture parall\`ele
isotrope},
author={Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN), F'elix Majou
(IRCCyN)},
journal={Dans 2\`eme Assises Machines et Usinage \`a Grande Vitesse -
2\`eme Assises Machines et Usin... | wenger2007l'orthoglide |
arxiv-844 | 0707.3575 | An exploratory study of Google Scholar | <|reference_start|>An exploratory study of Google Scholar: The paper discusses and analyzes the scientific search service Google Scholar (GS). The focus is on an exploratory study which investigates the coverage of scientific serials in GS. The study shows deficiencies in the coverage and up-to-dateness of the GS index... | arxiv | @article{mayr2007an,
title={An exploratory study of Google Scholar},
author={Philipp Mayr, Anne-Kathrin Walter},
journal={arXiv preprint arXiv:0707.3575},
year={2007},
doi={10.1108/14684520710841784},
archivePrefix={arXiv},
eprint={0707.3575},
primaryClass={cs.DL cs.IR}
} | mayr2007an |
arxiv-845 | 0707.3584 | The effect of fading, channel inversion, and threshold scheduling on ad hoc networks | <|reference_start|>The effect of fading, channel inversion, and threshold scheduling on ad hoc networks: This paper addresses three issues in the field of ad hoc network capacity: the impact of i)channel fading, ii) channel inversion power control, and iii) threshold-based scheduling on capacity. Channel inversion and ... | arxiv | @article{weber2007the,
title={The effect of fading, channel inversion, and threshold scheduling on ad
hoc networks},
author={Steven Weber, Jeffrey G. Andrews, Nihar Jindal},
journal={IEEE Trans. Information Theory, Vol. 53, No. 11, pp. 4127-4149,
Nov. 2007},
year={2007},
archivePrefix={arXiv},
... | weber2007the |
arxiv-846 | 0707.3619 | Semi-local string comparison: algorithmic techniques and applications | <|reference_start|>Semi-local string comparison: algorithmic techniques and applications: A classical measure of string comparison is given by the longest common subsequence (LCS) problem on a pair of strings. We consider its generalisation, called the semi-local LCS problem, which arises naturally in many string-relat... | arxiv | @article{tiskin2007semi-local,
title={Semi-local string comparison: algorithmic techniques and applications},
author={Alexander Tiskin},
journal={arXiv preprint arXiv:0707.3619},
year={2007},
archivePrefix={arXiv},
eprint={0707.3619},
primaryClass={cs.DS cs.DM}
} | tiskin2007semi-local |
arxiv-847 | 0707.3622 | Constant-degree graph expansions that preserve the treewidth | <|reference_start|>Constant-degree graph expansions that preserve the treewidth: Many hard algorithmic problems dealing with graphs, circuits, formulas and constraints admit polynomial-time upper bounds if the underlying graph has small treewidth. The same problems often encourage reducing the maximal degree of vertice... | arxiv | @article{markov2007constant-degree,
title={Constant-degree graph expansions that preserve the treewidth},
author={Igor Markov (University of Michigan) and Yaoyun Shi (University of
Michigan)},
journal={Algorithmica, Volume 59, Number 4, 461-470,2011},
year={2007},
doi={10.1007/s00453-009-9312-5},
... | markov2007constant-degree |
arxiv-848 | 0707.3638 | The Review and Analysis of Human Computer Interaction (HCI) Principles | <|reference_start|>The Review and Analysis of Human Computer Interaction (HCI) Principles: The History of HCI is briefly reviewed together with three HCI models and structure including CSCW, CSCL and CSCR. It is shown that a number of authorities consider HCI to be a fragmented discipline with no agreed set of unifying... | arxiv | @article{hinze-hoare2007the,
title={The Review and Analysis of Human Computer Interaction (HCI) Principles},
author={V. Hinze-Hoare},
journal={arXiv preprint arXiv:0707.3638},
year={2007},
archivePrefix={arXiv},
eprint={0707.3638},
primaryClass={cs.HC}
} | hinze-hoare2007the |
arxiv-849 | 0707.3665 | A Comparative Study of Parallel Kinematic Architectures for Machining Applications | <|reference_start|>A Comparative Study of Parallel Kinematic Architectures for Machining Applications: Parallel kinematic mechanisms are interesting alternative designs for machining applications. Three 2-DOF parallel mechanism architectures dedicated to machining applications are studied in this paper. The three mecha... | arxiv | @article{wenger2007a,
title={A Comparative Study of Parallel Kinematic Architectures for Machining
Applications},
author={Philippe Wenger (IRCCyN), Cl'ement Gosselin (ROBOTICS Laboratory),
Damien Chablat (IRCCyN)},
journal={Dans 2nd Workshop on Computational Kinematics - WCK, S\'eoul :
Cor\'ee, R\'epu... | wenger2007a |
arxiv-850 | 0707.3666 | Kinematic Analysis of a New Parallel Machine Tool: the Orthoglide | <|reference_start|>Kinematic Analysis of a New Parallel Machine Tool: the Orthoglide: This paper describes a new parallel kinematic architecture for machining applications: the orthoglide. This machine features three fixed parallel linear joints which are mounted orthogonally and a mobile platform which moves in the Ca... | arxiv | @article{wenger2007kinematic,
title={Kinematic Analysis of a New Parallel Machine Tool: the Orthoglide},
author={Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Dans 7th International Symposium on Advances in Robot Kinematics -
ARK, France (2000)},
year={2007},
archivePrefix={arXiv},
... | wenger2007kinematic |
arxiv-851 | 0707.3670 | Understanding the Characteristics of Internet Short Video Sharing: YouTube as a Case Study | <|reference_start|>Understanding the Characteristics of Internet Short Video Sharing: YouTube as a Case Study: Established in 2005, YouTube has become the most successful Internet site providing a new generation of short video sharing service. Today, YouTube alone comprises approximately 20% of all HTTP traffic, or nea... | arxiv | @article{cheng2007understanding,
title={Understanding the Characteristics of Internet Short Video Sharing:
YouTube as a Case Study},
author={Xu Cheng and Cameron Dale and Jiangchuan Liu},
journal={arXiv preprint arXiv:0707.3670},
year={2007},
archivePrefix={arXiv},
eprint={0707.3670},
prim... | cheng2007understanding |
arxiv-852 | 0707.3672 | Products of irreducible random matrices in the (Max,+) Algebra | <|reference_start|>Products of irreducible random matrices in the (Max,+) Algebra: We consider the recursive equation ``x(n+1)=A(n)x(n)'' where x(n+1) and x(n) are column vectors of size k and where A(n) is an irreducible random matrix of size k x k. The matrix-vector multiplication in the (max,+) algebra is defined by... | arxiv | @article{mairesse2007products,
title={Products of irreducible random matrices in the (Max,+) Algebra},
author={Jean Mairesse (INRIA Sophia Antipolis)},
journal={Advances in Applied Probability 29, 2 (1997) 444-477},
year={2007},
archivePrefix={arXiv},
eprint={0707.3672},
primaryClass={cs.OH}... | mairesse2007products |
arxiv-853 | 0707.3673 | The Computation of All 4R Serial Spherical Wrists With an Isotropic Architecture | <|reference_start|>The Computation of All 4R Serial Spherical Wrists With an Isotropic Architecture: A spherical wrist of the serial type is said to be isotropic if it can attain a posture whereby the singular values of its Jacobian matrix are all identical and nonzero. What isotropy brings about is robustness to manuf... | arxiv | @article{chablat2007the,
title={The Computation of All 4R Serial Spherical Wrists With an Isotropic
Architecture},
author={Damien Chablat (IRCCyN), Jorge Angeles (CIM)},
journal={Dans 2nd Workshop on Computational Kinematics - WCK, S\'eoul :
Cor\'ee, R\'epublique de (05/2001)},
year={2007},
numb... | chablat2007the |
arxiv-854 | 0707.3717 | GCP: Gossip-based Code Propagation for Large-scale Mobile Wireless Sensor Networks | <|reference_start|>GCP: Gossip-based Code Propagation for Large-scale Mobile Wireless Sensor Networks: Wireless sensor networks (WSN) have recently received an increasing interest. They are now expected to be deployed for long periods of time, thus requiring software updates. Updating the software code automatically on... | arxiv | @article{busnel2007gcp:,
title={GCP: Gossip-based Code Propagation for Large-scale Mobile Wireless
Sensor Networks},
author={Yann Busnel (IRISA, DIT), Marin Bertier (IRISA), Eric Fleury (INRIA
Rh^one-Alpes), Anne-Marie Kermarrec (IRISA)},
journal={arXiv preprint arXiv:0707.3717},
year={2007},
ar... | busnel2007gcp: |
arxiv-855 | 0707.3732 | Further Comments on "Residue-to-Binary Converters Based on New Chinese Remainder Theorems" | <|reference_start|>Further Comments on "Residue-to-Binary Converters Based on New Chinese Remainder Theorems": Ananda Mohan suggested that the first New Chinese Remainder Theorem introduced by Wang can be derived from the constructive proof of the well-known Chinese Remainder Theorem (CRT) and claimed that Wang's appro... | arxiv | @article{beuchat2007further,
title={Further Comments on "Residue-to-Binary Converters Based on New Chinese
Remainder Theorems"},
author={Jean-Luc Beuchat},
journal={arXiv preprint arXiv:0707.3732},
year={2007},
archivePrefix={arXiv},
eprint={0707.3732},
primaryClass={cs.OH}
} | beuchat2007further |
arxiv-856 | 0707.3750 | Recent Advances in Solving the Protein Threading Problem | <|reference_start|>Recent Advances in Solving the Protein Threading Problem: The fold recognition methods are promissing tools for capturing the structure of a protein by its amino acid residues sequence but their use is still restricted by the needs of huge computational resources and suitable efficient algorithms as ... | arxiv | @article{andonov2007recent,
title={Recent Advances in Solving the Protein Threading Problem},
author={Rumen Andonov (IRISA), Guillaume Collet (IRISA), Jean-Franc{c}ois
Gibrat (MIG), Antoine Marin (MIG), Vincent Poirriez (LAMIH), Nikola Yanev
(IRISA)},
journal={arXiv preprint arXiv:0707.3750},
year={... | andonov2007recent |
arxiv-857 | 0707.3781 | Bijective Faithful Translations among Default Logics | <|reference_start|>Bijective Faithful Translations among Default Logics: In this article, we study translations between variants of defaults logics such that the extensions of the theories that are the input and the output of the translation are in a bijective correspondence. We assume that a translation can introduce ... | arxiv | @article{liberatore2007bijective,
title={Bijective Faithful Translations among Default Logics},
author={Paolo Liberatore},
journal={arXiv preprint arXiv:0707.3781},
year={2007},
doi={10.1093/logcom/ext073},
archivePrefix={arXiv},
eprint={0707.3781},
primaryClass={cs.AI cs.LO}
} | liberatore2007bijective |
arxiv-858 | 0707.3782 | Interactive Small-Step Algorithms I: Axiomatization | <|reference_start|>Interactive Small-Step Algorithms I: Axiomatization: In earlier work, the Abstract State Machine Thesis -- that arbitrary algorithms are behaviorally equivalent to abstract state machines -- was established for several classes of algorithms, including ordinary, interactive, small-step algorithms. Thi... | arxiv | @article{blass2007interactive,
title={Interactive Small-Step Algorithms I: Axiomatization},
author={Andreas Blass, Yuri Gurevich, Dean Rosenzweig, and Benjamin Rossman},
journal={Logical Methods in Computer Science, Volume 3, Issue 4 (November
5, 2007) lmcs:1200},
year={2007},
doi={10.2168/LMCS-3(... | blass2007interactive |
arxiv-859 | 0707.3789 | Interactive Small-Step Algorithms II: Abstract State Machines and the<br> Characterization Theorem | <|reference_start|>Interactive Small-Step Algorithms II: Abstract State Machines and the<br> Characterization Theorem: In earlier work, the Abstract State Machine Thesis -- that arbitrary algorithms are behaviorally equivalent to abstract state machines -- was established for several classes of algorithms, including or... | arxiv | @article{blass2007interactive,
title={Interactive Small-Step Algorithms II: Abstract State Machines and
the<br> Characterization Theorem},
author={Andreas Blass, Yuri Gurevich, Dean Rosenzweig, and Benjamin Rossman},
journal={Logical Methods in Computer Science, Volume 3, Issue 4 (November
5, 2007) lmcs... | blass2007interactive |
arxiv-860 | 0707.3807 | How to be correct, lazy and efficient ? | <|reference_start|>How to be correct, lazy and efficient ?: This paper is an introduction to Lambdix, a lazy Lisp interpreter implemented at the Research Laboratory of Paris XI University (Laboratoire de Recherche en Informatique, Orsay). Lambdix was devised in the course of an investigation into the relationship betwe... | arxiv | @article{recanati2007how,
title={How to be correct, lazy and efficient ?},
author={Catherine Recanati (LIPN)},
journal={arXiv preprint arXiv:0707.3807},
year={2007},
archivePrefix={arXiv},
eprint={0707.3807},
primaryClass={cs.PL}
} | recanati2007how |
arxiv-861 | 0707.3878 | Plotkin construction: rank and kernel | <|reference_start|>Plotkin construction: rank and kernel: Given two binary codes of length n, using Plotkin construction we obtain a code of length 2n. The construction works for linear and nonlinear codes. For the linear case, it is straightforward to see that the dimension of the final code is the sum of the dimensio... | arxiv | @article{borges2007plotkin,
title={Plotkin construction: rank and kernel},
author={Joaquim Borges, Cristina Fernandez},
journal={arXiv preprint arXiv:0707.3878},
year={2007},
archivePrefix={arXiv},
eprint={0707.3878},
primaryClass={cs.IT math.IT}
} | borges2007plotkin |
arxiv-862 | 0707.3925 | Use of a $d$-Constraint During LDPC Decoding in a Bliss Scheme | <|reference_start|>Use of a $d$-Constraint During LDPC Decoding in a Bliss Scheme: Bliss schemes of a run length limited (RLL) codec in combination with an LDPC codec, generate LDPC parity bits over a systematic sequence of RLL channel bits that are inherently redundant as they satisfy e.g. a $d=1$ minimum run length c... | arxiv | @article{hekstra2007use,
title={Use of a $d$-Constraint During LDPC Decoding in a Bliss Scheme},
author={Andries P. Hekstra},
journal={arXiv preprint arXiv:0707.3925},
year={2007},
archivePrefix={arXiv},
eprint={0707.3925},
primaryClass={cs.IT math.IT}
} | hekstra2007use |
arxiv-863 | 0707.3936 | Closed form solutions for symmetric water filling games | <|reference_start|>Closed form solutions for symmetric water filling games: We study power control in optimization and game frameworks. In the optimization framework there is a single decision maker who assigns network resources and in the game framework users share the network resources according to Nash equilibrium. ... | arxiv | @article{altman2007closed,
title={Closed form solutions for symmetric water filling games},
author={Eitan Altman (INRIA Sophia Antipolis), Konstantin Avrachenkov (INRIA
Sophia Antipolis), Andrey Garnaev},
journal={arXiv preprint arXiv:0707.3936},
year={2007},
archivePrefix={arXiv},
eprint={070... | altman2007closed |
arxiv-864 | 0707.3959 | Four-Group Decodable Space-Time Block Codes | <|reference_start|>Four-Group Decodable Space-Time Block Codes: Two new rate-one full-diversity space-time block codes (STBC) are proposed. They are characterized by the \emph{lowest decoding complexity} among the known rate-one STBC, arising due to the complete separability of the transmitted symbols into four groups ... | arxiv | @article{dao2007four-group,
title={Four-Group Decodable Space-Time Block Codes},
author={Dung Ngoc Dao, Chau Yuen, Chintha Tellambura, Yong Liang Guan and
Tjeng Thiang Tjhung},
journal={arXiv preprint arXiv:0707.3959},
year={2007},
doi={10.1109/TSP.2007.906729},
archivePrefix={arXiv},
epri... | dao2007four-group |
arxiv-865 | 0707.3972 | Learning Probabilistic Models of Word Sense Disambiguation | <|reference_start|>Learning Probabilistic Models of Word Sense Disambiguation: This dissertation presents several new methods of supervised and unsupervised learning of word sense disambiguation models. The supervised methods focus on performing model searches through a space of probabilistic models, and the unsupervis... | arxiv | @article{pedersen2007learning,
title={Learning Probabilistic Models of Word Sense Disambiguation},
author={Ted Pedersen},
journal={PhD dissertation, May 1998, Department of Computer Science and
Engineering, Southern Methodist University},
year={2007},
archivePrefix={arXiv},
eprint={0707.3972},... | pedersen2007learning |
arxiv-866 | 0707.3979 | Clifford Algebra of the Vector Space of Conics for decision boundary Hyperplanes in m-Euclidean Space | <|reference_start|>Clifford Algebra of the Vector Space of Conics for decision boundary Hyperplanes in m-Euclidean Space: In this paper we embed $m$-dimensional Euclidean space in the geometric algebra $Cl_m $ to extend the operators of incidence in ${R^m}$ to operators of incidence in the geometric algebra to generali... | arxiv | @article{nieto2007clifford,
title={Clifford Algebra of the Vector Space of Conics for decision boundary
Hyperplanes in m-Euclidean Space},
author={Isidro B. Nieto and J. Refugio Vallejo},
journal={arXiv preprint arXiv:0707.3979},
year={2007},
archivePrefix={arXiv},
eprint={0707.3979},
prim... | nieto2007clifford |
arxiv-867 | 0707.4032 | One-way Hash Function Based on Neural Network | <|reference_start|>One-way Hash Function Based on Neural Network: A hash function is constructed based on a three-layer neural network. The three neuron-layers are used to realize data confusion, diffusion and compression respectively, and the multi-block hash mode is presented to support the plaintext with variable le... | arxiv | @article{lian2007one-way,
title={One-way Hash Function Based on Neural Network},
author={Shiguo Lian, Jinsheng Sun, Zhiquan Wang},
journal={arXiv preprint arXiv:0707.4032},
year={2007},
archivePrefix={arXiv},
eprint={0707.4032},
primaryClass={cs.CR cs.NE}
} | lian2007one-way |
arxiv-868 | 0707.4081 | Geometrical derivation of the Boltzmann factor | <|reference_start|>Geometrical derivation of the Boltzmann factor: We show that the Boltzmann factor has a geometrical origin. Its derivation follows from the microcanonical picture. The Maxwell-Boltzmann distribution or the wealth distribution in human society are some direct applications of this new interpretation.<|... | arxiv | @article{lopez-ruiz2007geometrical,
title={Geometrical derivation of the Boltzmann factor},
author={Ricardo Lopez-Ruiz, Jaime Sanudo and Xavier Calbet},
journal={arXiv preprint arXiv:0707.4081},
year={2007},
doi={10.1119/1.2907776},
archivePrefix={arXiv},
eprint={0707.4081},
primaryClass... | lopez-ruiz2007geometrical |
arxiv-869 | 0707.4083 | Chain of Separable Binary Goppa Codes and their Minimal Distance | <|reference_start|>Chain of Separable Binary Goppa Codes and their Minimal Distance: It is shown that subclasses of separable binary Goppa codes, $\Gamma(L,G)$ - codes, with $L=\{\alpha \in GF(2^{2l}):G(\alpha)\neq 0 \}$ and special Goppa polynomials G(x) can be presented as a chain of embedded codes. The true minimal ... | arxiv | @article{bezzateev2007chain,
title={Chain of Separable Binary Goppa Codes and their Minimal Distance},
author={Sergey Bezzateev and Natalia Shekhunova},
journal={arXiv preprint arXiv:0707.4083},
year={2007},
archivePrefix={arXiv},
eprint={0707.4083},
primaryClass={cs.IT math.IT}
} | bezzateev2007chain |
arxiv-870 | 0707.4104 | Queues, stores, and tableaux | <|reference_start|>Queues, stores, and tableaux: Consider the single server queue with an infinite buffer and a FIFO discipline, either of type M/M/1 or Geom/Geom/1. Denote by A the arrival process and by s the services. Assume the stability condition to be satisfied. Denote by D the departure process in equilibrium an... | arxiv | @article{draief2007queues,,
title={Queues, stores, and tableaux},
author={Moez Draief (LIAFA), Jean Mairesse (LIAFA), Neil O'Connell (WMI)},
journal={Journal of Applied Probability 42, 4 (2005) 1145-1167},
year={2007},
archivePrefix={arXiv},
eprint={0707.4104},
primaryClass={cs.DM math.CO}
} | draief2007queues, |
arxiv-871 | 0707.4124 | Services within a busy period of an M/M/1 queue and Dyck paths | <|reference_start|>Services within a busy period of an M/M/1 queue and Dyck paths: We analyze the service times of customers in a stable M/M/1 queue in equilibrium depending on their position in a busy period. We give the law of the service of a customer at the beginning, at the end, or in the middle of the busy period... | arxiv | @article{draief2007services,
title={Services within a busy period of an M/M/1 queue and Dyck paths},
author={Moez Draief (LIAFA), Jean Mairesse (LIAFA)},
journal={Queueing Systems / Queueing Systems Theory Appl 49, 1 (2005) 73-84},
year={2007},
doi={10.1007/s11134-004-5556-6},
archivePrefix={arX... | draief2007services |
arxiv-872 | 0707.4133 | Multiuser Successive Refinement and Multiple Description Coding | <|reference_start|>Multiuser Successive Refinement and Multiple Description Coding: We consider the multiuser successive refinement (MSR) problem, where the users are connected to a central server via links with different noiseless capacities, and each user wishes to reconstruct in a successive-refinement fashion. An a... | arxiv | @article{tian2007multiuser,
title={Multiuser Successive Refinement and Multiple Description Coding},
author={Chao Tian, Jun Chen and Suhas Diggavi},
journal={arXiv preprint arXiv:0707.4133},
year={2007},
archivePrefix={arXiv},
eprint={0707.4133},
primaryClass={cs.IT math.IT}
} | tian2007multiuser |
arxiv-873 | 0707.4166 | Parsimony Principles for Software Components and Metalanguages | <|reference_start|>Parsimony Principles for Software Components and Metalanguages: Software is a communication system. The usual topic of communication is program behavior, as encoded by programs. Domain-specific libraries are codebooks, domain-specific languages are coding schemes, and so forth. To turn metaphor into ... | arxiv | @article{veldhuizen2007parsimony,
title={Parsimony Principles for Software Components and Metalanguages},
author={Todd L. Veldhuizen},
journal={arXiv preprint arXiv:0707.4166},
year={2007},
archivePrefix={arXiv},
eprint={0707.4166},
primaryClass={cs.SE}
} | veldhuizen2007parsimony |
arxiv-874 | 0707.4198 | Reductionism, emergence, and levels of abstractions | <|reference_start|>Reductionism, emergence, and levels of abstractions: Can there be independent higher level laws of nature if everything is reducible to the fundamental laws of physics? The computer science notion of level of abstraction explains why there can -- illustrating how computational thinking can solve one ... | arxiv | @article{abbott2007reductionism,,
title={Reductionism, emergence, and levels of abstractions},
author={Russ Abbott},
journal={arXiv preprint arXiv:0707.4198},
year={2007},
archivePrefix={arXiv},
eprint={0707.4198},
primaryClass={cs.OH}
} | abbott2007reductionism, |
arxiv-875 | 0707.4255 | Complexity of Propositional Proofs under a Promise | <|reference_start|>Complexity of Propositional Proofs under a Promise: We study -- within the framework of propositional proof complexity -- the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiable formula has many satisfying assignments, where ``many'' stands for an explicitly ... | arxiv | @article{dershowitz2007complexity,
title={Complexity of Propositional Proofs under a Promise},
author={Nachum Dershowitz and Iddo Tzameret},
journal={ACM Transactions on Computational Logic, 11(3):1-29, 2010;},
year={2007},
archivePrefix={arXiv},
eprint={0707.4255},
primaryClass={cs.CC cs.LO... | dershowitz2007complexity |
arxiv-876 | 0707.4258 | Star Unfolding Convex Polyhedra via Quasigeodesic Loops | <|reference_start|>Star Unfolding Convex Polyhedra via Quasigeodesic Loops: We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron P to a simple (non-overlapping), planar polygon: cut along one s... | arxiv | @article{itoh2007star,
title={Star Unfolding Convex Polyhedra via Quasigeodesic Loops},
author={Jin-ichi Itoh, Joseph O'Rourke, Costin V^ilcu},
journal={arXiv preprint arXiv:0707.4258},
year={2007},
number={Smith College Computer Science Technical Report 084},
archivePrefix={arXiv},
eprint={... | itoh2007star |
arxiv-877 | 0707.4289 | A Leaf Recognition Algorithm for Plant Classification Using Probabilistic Neural Network | <|reference_start|>A Leaf Recognition Algorithm for Plant Classification Using Probabilistic Neural Network: In this paper, we employ Probabilistic Neural Network (PNN) with image and data processing techniques to implement a general purpose automated leaf recognition algorithm. 12 leaf features are extracted and ortho... | arxiv | @article{wu2007a,
title={A Leaf Recognition Algorithm for Plant Classification Using
Probabilistic Neural Network},
author={Stephen Gang Wu, Forrest Sheng Bao, Eric You Xu, Yu-Xuan Wang, Yi-Fan
Chang and Qiao-Liang Xiang},
journal={arXiv preprint arXiv:0707.4289},
year={2007},
archivePrefix={arX... | wu2007a |
arxiv-878 | 0707.4298 | A note on equipartition | <|reference_start|>A note on equipartition: The problem of the existence of an equi-partition of a curve in $\R^n$ has recently been raised in the context of computational geometry. The problem is to show that for a (continuous) curve $\Gamma : [0,1] \to \R^n$ and for any positive integer N, there exist points $t_0=0<t... | arxiv | @article{lopez2007a,
title={A note on equipartition},
author={M. A. Lopez, S. Reisner},
journal={arXiv preprint arXiv:0707.4298},
year={2007},
archivePrefix={arXiv},
eprint={0707.4298},
primaryClass={cs.CG math.FA}
} | lopez2007a |
arxiv-879 | 0707.4304 | Spatial Aggregation: Data Model and Implementation | <|reference_start|>Spatial Aggregation: Data Model and Implementation: Data aggregation in Geographic Information Systems (GIS) is only marginally present in commercial systems nowadays, mostly through ad-hoc solutions. In this paper, we first present a formal model for representing spatial data. This model integrates ... | arxiv | @article{gomez2007spatial,
title={Spatial Aggregation: Data Model and Implementation},
author={Leticia Gomez, Sofie Haesevoets, Bart Kuijpers and Alejandro Vaisman},
journal={arXiv preprint arXiv:0707.4304},
year={2007},
archivePrefix={arXiv},
eprint={0707.4304},
primaryClass={cs.DB}
} | gomez2007spatial |
arxiv-880 | 0707.4311 | Embedded Rank Distance Codes for ISI channels | <|reference_start|>Embedded Rank Distance Codes for ISI channels: Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time codes for flat fading channels have been designed from sets of binary matr... | arxiv | @article{dusad2007embedded,
title={Embedded Rank Distance Codes for ISI channels},
author={S. Dusad, S. N. Diggavi and A. R. Calderbank},
journal={arXiv preprint arXiv:0707.4311},
year={2007},
doi={10.1109/TIT.2008.929960},
archivePrefix={arXiv},
eprint={0707.4311},
primaryClass={cs.IT m... | dusad2007embedded |
arxiv-881 | 0707.4360 | Linear-programming Decoding of Non-binary Linear Codes | <|reference_start|>Linear-programming Decoding of Non-binary Linear Codes: We develop a framework for linear-programming (LP) decoding of non-binary linear codes over rings. We prove that the resulting LP decoder has the `maximum likelihood certificate' property, and we show that the decoder output is the lowest cost p... | arxiv | @article{flanagan2007linear-programming,
title={Linear-programming Decoding of Non-binary Linear Codes},
author={Mark F. Flanagan, Vitaly Skachek, Eimear Byrne, Marcus Greferath},
journal={arXiv preprint arXiv:0707.4360},
year={2007},
archivePrefix={arXiv},
eprint={0707.4360},
primaryClass={... | flanagan2007linear-programming |
arxiv-882 | 0707.4372 | Blocking a transition in a Free Choice net and what it tells about its throughput | <|reference_start|>Blocking a transition in a Free Choice net and what it tells about its throughput: In a live and bounded Free Choice Petri net, pick a non-conflicting transition. Then there exists a unique reachable marking in which no transition is enabled except the selected one. For a routed live and bounded Free... | arxiv | @article{gaujal2007blocking,
title={Blocking a transition in a Free Choice net and what it tells about its
throughput},
author={Bruno Gaujal (LIP), Stefan Haar (IRISA), Jean Mairesse (LIAFA)},
journal={Journal of Computer and System Sciences 66, 3 (2003) 515-548},
year={2007},
doi={10.1016/S0022-0... | gaujal2007blocking |
arxiv-883 | 0707.4389 | Separation Logic for Small-step Cminor | <|reference_start|>Separation Logic for Small-step Cminor: Cminor is a mid-level imperative programming language; there are proved-correct optimizing compilers from C to Cminor and from Cminor to machine language. We have redesigned Cminor so that it is suitable for Hoare Logic reasoning and we have designed a Separati... | arxiv | @article{appel2007separation,
title={Separation Logic for Small-step Cminor},
author={Andrew W. Appel (INRIA Rocquencourt), Sandrine Blazy (CEDRIC, INRIA
Rocquencourt)},
journal={Dans 20th Int. Conference on Theorem Proving in Higher Order
Logics (TPHOLs 2007) 4732 (2007) 5-21},
year={2007},
arc... | appel2007separation |
arxiv-884 | 0707.4448 | On sparse representations of linear operators and the approximation of matrix products | <|reference_start|>On sparse representations of linear operators and the approximation of matrix products: Thus far, sparse representations have been exploited largely in the context of robustly estimating functions in a noisy environment from a few measurements. In this context, the existence of a basis in which the s... | arxiv | @article{belabbas2007on,
title={On sparse representations of linear operators and the approximation of
matrix products},
author={Mohamed-Ali Belabbas and Patrick J. Wolfe},
journal={arXiv preprint arXiv:0707.4448},
year={2007},
doi={10.1109/CISS.2008.4558532},
archivePrefix={arXiv},
eprint... | belabbas2007on |
arxiv-885 | 0707.4489 | Small weakly universal Turing machines | <|reference_start|>Small weakly universal Turing machines: We give small universal Turing machines with state-symbol pairs of (6, 2), (3, 3) and (2, 4). These machines are weakly universal, which means that they have an infinitely repeated word to the left of their input and another to the right. They simulate Rule 110... | arxiv | @article{neary2007small,
title={Small weakly universal Turing machines},
author={Turlough Neary and Damien Woods},
journal={arXiv preprint arXiv:0707.4489},
year={2007},
archivePrefix={arXiv},
eprint={0707.4489},
primaryClass={cs.CC}
} | neary2007small |
arxiv-886 | 0707.4507 | Competitive minimax universal decoding for several ensembles of random codes | <|reference_start|>Competitive minimax universal decoding for several ensembles of random codes: Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC's)), and various ensembles of random codes, are studied by combining the competitive minimax... | arxiv | @article{akirav2007competitive,
title={Competitive minimax universal decoding for several ensembles of random
codes},
author={Yaniv Akirav and Neri Merhav},
journal={arXiv preprint arXiv:0707.4507},
year={2007},
archivePrefix={arXiv},
eprint={0707.4507},
primaryClass={cs.IT math.IT}
} | akirav2007competitive |
arxiv-887 | 0707.4518 | On Throughput Scaling of Wireless Networks: Effect of Node Density and Propagation Model | <|reference_start|>On Throughput Scaling of Wireless Networks: Effect of Node Density and Propagation Model: This paper derives a lower bound to the per-node throughput achievable by a wireless network when n source-destination pairs are randomly distributed throughout a disk of radius $n^\gamma$, $ \gamma \geq 0$, pro... | arxiv | @article{duarte-melo2007on,
title={On Throughput Scaling of Wireless Networks: Effect of Node Density and
Propagation Model},
author={Enrique J. Duarte-Melo, Awlok Josan, Mingyan Liu, David L. Neuhoff and
Sandeep Pradhan},
journal={arXiv preprint arXiv:0707.4518},
year={2007},
archivePrefix={arX... | duarte-melo2007on |
arxiv-888 | 0707.4524 | Image Authentication Based on Neural Networks | <|reference_start|>Image Authentication Based on Neural Networks: Neural network has been attracting more and more researchers since the past decades. The properties, such as parameter sensitivity, random similarity, learning ability, etc., make it suitable for information protection, such as data encryption, data auth... | arxiv | @article{lian2007image,
title={Image Authentication Based on Neural Networks},
author={Shiguo Lian},
journal={arXiv preprint arXiv:0707.4524},
year={2007},
archivePrefix={arXiv},
eprint={0707.4524},
primaryClass={cs.MM cs.NE}
} | lian2007image |
arxiv-889 | 0707.4565 | On the Complexity of the Interlace Polynomial | <|reference_start|>On the Complexity of the Interlace Polynomial: We consider the two-variable interlace polynomial introduced by Arratia, Bollobas and Sorkin (2004). We develop graph transformations which allow us to derive point-to-point reductions for the interlace polynomial. Exploiting these reductions we obtain n... | arxiv | @article{bläser2007on,
title={On the Complexity of the Interlace Polynomial},
author={Markus Bl"aser, Christian Hoffmann},
journal={arXiv preprint arXiv:0707.4565},
year={2007},
archivePrefix={arXiv},
eprint={0707.4565},
primaryClass={cs.CC math.CO}
} | bläser2007on |
arxiv-890 | 0707.4580 | Note on edge-colored graphs and digraphs without properly colored cycles | <|reference_start|>Note on edge-colored graphs and digraphs without properly colored cycles: We study the following two functions: d(n,c) and $\vec{d}(n,c)$; d(n,c) ($\vec{d}(n,c)$) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and minimum monochromatic degree (out-degree... | arxiv | @article{gutin2007note,
title={Note on edge-colored graphs and digraphs without properly colored cycles},
author={Gregory Gutin},
journal={arXiv preprint arXiv:0707.4580},
year={2007},
archivePrefix={arXiv},
eprint={0707.4580},
primaryClass={cs.DM}
} | gutin2007note |
arxiv-891 | 0707.4597 | Side-information Scalable Source Coding | <|reference_start|>Side-information Scalable Source Coding: The problem of side-information scalable (SI-scalable) source coding is considered in this work, where the encoder constructs a progressive description, such that the receiver with high quality side information will be able to truncate the bitstream and recons... | arxiv | @article{tian2007side-information,
title={Side-information Scalable Source Coding},
author={Chao Tian and Suhas N. Diggavi},
journal={arXiv preprint arXiv:0707.4597},
year={2007},
archivePrefix={arXiv},
eprint={0707.4597},
primaryClass={cs.IT math.IT}
} | tian2007side-information |
arxiv-892 | 0707.4618 | Nonlinear Matroid Optimization and Experimental Design | <|reference_start|>Nonlinear Matroid Optimization and Experimental Design: We study the problem of optimizing nonlinear objective functions over matroids presented by oracles or explicitly. Such functions can be interpreted as the balancing of multi-criteria optimization. We provide a combinatorial polynomial time algo... | arxiv | @article{berstein2007nonlinear,
title={Nonlinear Matroid Optimization and Experimental Design},
author={Yael Berstein, Jon Lee, Hugo Maruri-Aguilar, Shmuel Onn, Eva
Riccomagno, Robert Weismantel, Henry Wynn},
journal={SIAM Journal on Discrete Mathematics, 22:901--919, 2008},
year={2007},
archivePr... | berstein2007nonlinear |
arxiv-893 | 0707.4651 | Comments on the Reliability of Lawson and Hanson's Linear Distance Programming Algorithm: Subroutine LDP | <|reference_start|>Comments on the Reliability of Lawson and Hanson's Linear Distance Programming Algorithm: Subroutine LDP: This brief paper: (1) Discusses strategies to generate random test cases that can be used to extensively test any Linear Distance Program (LDP) software. (2) Gives three numerical examples of inp... | arxiv | @article{rufty2007comments,
title={Comments on the Reliability of Lawson and Hanson's Linear Distance
Programming Algorithm: Subroutine LDP},
author={Alan Rufty},
journal={arXiv preprint arXiv:0707.4651},
year={2007},
archivePrefix={arXiv},
eprint={0707.4651},
primaryClass={cs.MS}
} | rufty2007comments |
arxiv-894 | 0707.4656 | Communication under Strong Asynchronism | <|reference_start|>Communication under Strong Asynchronism: We consider asynchronous communication over point-to-point discrete memoryless channels. The transmitter starts sending one block codeword at an instant that is uniformly distributed within a certain time period, which represents the level of asynchronism. The... | arxiv | @article{tchamkerten2007communication,
title={Communication under Strong Asynchronism},
author={Aslan Tchamkerten, Venkat Chandar, Gregory Wornell},
journal={arXiv preprint arXiv:0707.4656},
year={2007},
archivePrefix={arXiv},
eprint={0707.4656},
primaryClass={cs.IT math.IT}
} | tchamkerten2007communication |
arxiv-895 | 0707.4659 | Difference Equations in Massive Higher Order Calculations | <|reference_start|>Difference Equations in Massive Higher Order Calculations: The calculation of massive 2--loop operator matrix elements, required for the higher order Wilson coefficients for heavy flavor production in deeply inelastic scattering, leads to new types of multiple infinite sums over harmonic sums and rel... | arxiv | @article{bierenbaum2007difference,
title={Difference Equations in Massive Higher Order Calculations},
author={I. Bierenbaum, J. Bl"umlein, S. Klein, and C. Schneider},
journal={PoSACAT2007:082,2007},
year={2007},
number={DESY 07-111, SFB/CPP-07-041},
archivePrefix={arXiv},
eprint={0707.4659}... | bierenbaum2007difference |
arxiv-896 | 0708.0053 | Periodic complementary sets of binary sequences | <|reference_start|>Periodic complementary sets of binary sequences: Let PCS_p^N denote a set of p binary sequences of length N such that the sum of their periodic auto-correlation functions is a delta-function. In the 1990, Boemer and Antweiler addressed the problem of constructing such sequences. They presented a tabl... | arxiv | @article{djokovic2007periodic,
title={Periodic complementary sets of binary sequences},
author={Dragomir Z. Djokovic},
journal={International Mathematical Forum 4 (2009), no. 15, 717-725.},
year={2007},
archivePrefix={arXiv},
eprint={0708.0053},
primaryClass={cs.IT math.CO math.IT}
} | djokovic2007periodic |
arxiv-897 | 0708.0171 | Virtual screening with support vector machines and structure kernels | <|reference_start|>Virtual screening with support vector machines and structure kernels: Support vector machines and kernel methods have recently gained considerable attention in chemoinformatics. They offer generally good performance for problems of supervised classification or regression, and provide a flexible and c... | arxiv | @article{mahé2007virtual,
title={Virtual screening with support vector machines and structure kernels},
author={Pierre Mah'e (XRCE), Jean-Philippe Vert (CB)},
journal={arXiv preprint arXiv:0708.0171},
year={2007},
archivePrefix={arXiv},
eprint={0708.0171},
primaryClass={q-bio.QM cs.LG}
} | mahé2007virtual |
arxiv-898 | 0708.0200 | A Note on Shortest Developments | <|reference_start|>A Note on Shortest Developments: De Vrijer has presented a proof of the finite developments theorem which, in addition to showing that all developments are finite, gives an effective reduction strategy computing longest developments as well as a simple formula computing their length. We show that b... | arxiv | @article{sørensen2007a,
title={A Note on Shortest Developments},
author={Morten Heine S{o}rensen},
journal={Logical Methods in Computer Science, Volume 3, Issue 4 (November
5, 2007) lmcs:838},
year={2007},
doi={10.2168/LMCS-3(4:2)2007},
archivePrefix={arXiv},
eprint={0708.0200},
primar... | sørensen2007a |
arxiv-899 | 0708.0224 | Multisource Bayesian sequential change detection | <|reference_start|>Multisource Bayesian sequential change detection: Suppose that local characteristics of several independent compound Poisson and Wiener processes change suddenly and simultaneously at some unobservable disorder time. The problem is to detect the disorder time as quickly as possible after it happens a... | arxiv | @article{dayanik2007multisource,
title={Multisource Bayesian sequential change detection},
author={Savas Dayanik, H. Vincent Poor, Semih O. Sezer},
journal={Annals of Applied Probability 2008, Vol. 18, No. 2, 552-590},
year={2007},
doi={10.1214/07-AAP463},
number={IMS-AAP-AAP463},
archivePre... | dayanik2007multisource |
arxiv-900 | 0708.0242 | Distributing the Kalman Filter for Large-Scale Systems | <|reference_start|>Distributing the Kalman Filter for Large-Scale Systems: This paper derives a \emph{distributed} Kalman filter to estimate a sparsely connected, large-scale, $n-$dimensional, dynamical system monitored by a network of $N$ sensors. Local Kalman filters are implemented on the ($n_l-$dimensional, where $... | arxiv | @article{khan2007distributing,
title={Distributing the Kalman Filter for Large-Scale Systems},
author={Usman A. Khan and Jose M. F. Moura},
journal={U. A. Khan and J. M. F. Moura, "Distributing the Kalman filter for
large-scale systems," IEEE Transactions on Signal Processing, vol. 56, Part
1, no. 10, p... | khan2007distributing |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.