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-1901 | 0711.3319 | The Design and Fabrication of Platform Device for Dna Amplification | <|reference_start|>The Design and Fabrication of Platform Device for Dna Amplification: Thermalcycler were extensively used machine for amplify DNA sample. One of the major problems in the working time was that it spent most of time for cooling and heating. In order to improve the efficient, this study presented a nove... | arxiv | @article{chien2007the,
title={The Design and Fabrication of Platform Device for Dna Amplification},
author={Ch.-Heng Chien, Hui-Min Yu},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix=... | chien2007the |
arxiv-1902 | 0711.3320 | Design and Modeling of a Mems-Based Valveless Pump Driven by an Electromagnetic Force | <|reference_start|>Design and Modeling of a Mems-Based Valveless Pump Driven by an Electromagnetic Force: A novel valveless micro impedance pump is proposed and analyzed in this study.<|reference_end|> | arxiv | @article{chang2007design,
title={Design and Modeling of a Mems-Based Valveless Pump Driven by an
Electromagnetic Force},
author={Hsien-Tsung Chang, Chia-Yen Lee, Chih-Yung Wen},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (... | chang2007design |
arxiv-1903 | 0711.3321 | Electrostatic Actuators Operating in Liquid Environment : Suppression of Pull-in Instability and Dynamic Response | <|reference_start|>Electrostatic Actuators Operating in Liquid Environment : Suppression of Pull-in Instability and Dynamic Response: This paper presents results about fabrication and operation of electrostatic actuators in liquids with various permittivities. In the static mode, we provide experimental and theoretical... | arxiv | @article{rollier2007electrostatic,
title={Electrostatic Actuators Operating in Liquid Environment : Suppression of
Pull-in Instability and Dynamic Response},
author={A.-S. Rollier (IEMN), M. Faucher (IEMN), B. Legrand (IEMN), D. Collard
(IEMN), L. Buchaillot (IEMN)},
journal={Dans Symposium on Design, T... | rollier2007electrostatic |
arxiv-1904 | 0711.3323 | Au-SN Flip-Chip Solder Bump for Microelectronic and Optoelectronic Applications | <|reference_start|>Au-SN Flip-Chip Solder Bump for Microelectronic and Optoelectronic Applications: As an alternative to the time-consuming solder pre-forms and pastes currently used, a co-electroplating method of eutectic Au-Sn alloy was used in this study. Using a co-electroplating process, it was possible to plate t... | arxiv | @article{yoon2007au-sn,
title={Au-SN Flip-Chip Solder Bump for Microelectronic and Optoelectronic
Applications},
author={Jeong-Won Yoon, H.-S. Chun, Ja-Myeong Koo, Seung-Boo Jung},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Itali... | yoon2007au-sn |
arxiv-1905 | 0711.3324 | Contactless Thermal Characterization Method of PCB-s Using an IR Sensor Array | <|reference_start|>Contactless Thermal Characterization Method of PCB-s Using an IR Sensor Array: In this paper the feasibility study of an IR sensor card is presented. The methodology and the results of a quasi real-time thermal characterization tool and method for the temperature mapping of circuits and boards based ... | arxiv | @article{bognar2007contactless,
title={Contactless Thermal Characterization Method of PCB-s Using an IR Sensor
Array},
author={Gy. Bognar, V. Szekely, M. Rencz},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year... | bognar2007contactless |
arxiv-1906 | 0711.3325 | Miniaturized Fluorescence Excitation Platform with Optical Fiber for Bio-Detection Chips | <|reference_start|>Miniaturized Fluorescence Excitation Platform with Optical Fiber for Bio-Detection Chips: This paper presents a new research study on the platform fabrication of fluorescence bio-detection chip with an optical fiber transmission. Anisotropic wet etching on (100) silicon wafers to fabrication V-groove... | arxiv | @article{yang2007miniaturized,
title={Miniaturized Fluorescence Excitation Platform with Optical Fiber for
Bio-Detection Chips},
author={Hsiharng Yang, Chung-Tze Lee},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
... | yang2007miniaturized |
arxiv-1907 | 0711.3326 | Characterization of Flexible RF Microcoil Dedicated to Surface Mri | <|reference_start|>Characterization of Flexible RF Microcoil Dedicated to Surface Mri: In Magnetic Resonance Imaging (MRI), to achieve sufficient Signal to Noise Ratio (SNR), the electrical performance of the RF coil is critical. We developed a device (microcoil) based on the original concept of monolithic resonator. T... | arxiv | @article{woytasik2007characterization,
title={Characterization of Flexible RF Microcoil Dedicated to Surface Mri},
author={M. Woytasik (IEF), J.-C. Ginefri (U2R2M), J.-S. Raynaud, M.
Poirier-Quinot (U2R2M), E. Dufour-Gergam (IEF), J.-P. Grandchamp (IEF), L.
Darrasse (U2R2M), P. Robert, J.-P. Gilles (IEF), E... | woytasik2007characterization |
arxiv-1908 | 0711.3327 | Integration of Micro-Electro-Mechanical Deformable Mirrors in Doped Fiber Amplifiers | <|reference_start|>Integration of Micro-Electro-Mechanical Deformable Mirrors in Doped Fiber Amplifiers: We present a simple technique to produce active Q-switching in various types of fiber amplifiers by active integration of an electrostatic actuated deformable metallic micro-mirror. The optical MEMS (MOEMS) device a... | arxiv | @article{bouyge2007integration,
title={Integration of Micro-Electro-Mechanical Deformable Mirrors in Doped
Fiber Amplifiers},
author={D. Bouyge (XLIM), D. Sabourdy (XLIM), A. Crunteanu (XLIM), P. Blondy
(XLIM), V. Couderc (XLIM), J. Lhermite (XLIM), L. Grossard (XLIM), A.
Barth'elemy (XLIM)},
journal=... | bouyge2007integration |
arxiv-1909 | 0711.3329 | Micro-Ball Lens Array Fabrication in Photoresist Using Ptfe Hydrophobic Effect | <|reference_start|>Micro-Ball Lens Array Fabrication in Photoresist Using Ptfe Hydrophobic Effect: This paper presents a simple method to fabricate micro-ball lens and its array. The key technology is to use the hydrophobic characteristics of polyterafluoroethylene (PTFE) substrate. High contact angle between melted ph... | arxiv | @article{shyu2007micro-ball,
title={Micro-Ball Lens Array Fabrication in Photoresist Using Ptfe Hydrophobic
Effect},
author={Ruey-Fang Shyu, Hsiharng Yang, Wen-Ren Tsai, Jhy-Cherng Tsai},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore ... | shyu2007micro-ball |
arxiv-1910 | 0711.3330 | Reduced-Order Modelling of the Bending of an Array of Torsional Micromirrors | <|reference_start|>Reduced-Order Modelling of the Bending of an Array of Torsional Micromirrors: Reduced-Order Modelling of the Bending of an Array of An array of micromirrors for beam steering optical switching has been designed in a thick polysilicon technology. A novel semi-analytical method to calculate the static ... | arxiv | @article{molfese2007reduced-order,
title={Reduced-Order Modelling of the Bending of an Array of Torsional
Micromirrors},
author={A. Molfese, A. Nannini, F. Pieri},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
ye... | molfese2007reduced-order |
arxiv-1911 | 0711.3331 | Model of Electrostatic Actuated Deformable Mirror Using Strongly Coupled Electro-Mechanical Finite Element | <|reference_start|>Model of Electrostatic Actuated Deformable Mirror Using Strongly Coupled Electro-Mechanical Finite Element: The aim of this paper is to deal with multi-physics simulation of micro-electro-mechanical systems (MEMS) based on an advanced numerical methodology. MEMS are very small devices in which electr... | arxiv | @article{rochus2007model,
title={Model of Electrostatic Actuated Deformable Mirror Using Strongly Coupled
Electro-Mechanical Finite Element},
author={V. Rochus, J.-C. Golinval, C. Louis, C. Mendez, I. Klapka},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, ... | rochus2007model |
arxiv-1912 | 0711.3332 | New Internal Stress Driven on-Chip Micromachines for Extracting Mechanical Properties of Thin Films | <|reference_start|>New Internal Stress Driven on-Chip Micromachines for Extracting Mechanical Properties of Thin Films: A new concept of micromachines has been developed for measuring the mechanical properties of thin metallic films. The actuator is a beam undergoing large internal stresses built up during the depositi... | arxiv | @article{fabrègue2007new,
title={New Internal Stress Driven on-Chip Micromachines for Extracting
Mechanical Properties of Thin Films},
author={D. Fabr`egue, Nicolas Andr'e, T. Pardoen, J.P. Raskin},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lag... | fabrègue2007new |
arxiv-1913 | 0711.3333 | Process Issues for a Multi-Layer Microelectrofluidic Platform | <|reference_start|>Process Issues for a Multi-Layer Microelectrofluidic Platform: We report on the development of some process capabilities for a polymer-based, multi-layer microelectrofluidic platform, namely: the hot embossing process, metallization on polymer and polymer bonding. Hot embossing experiments were condu... | arxiv | @article{ng2007process,
title={Process Issues for a Multi-Layer Microelectrofluidic Platform},
author={S.-H. Ng, Z.-F. Wang, R.-T. Tjeung, N. De Rooij},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
... | ng2007process |
arxiv-1914 | 0711.3334 | Fabrication of Switches on Polymer-Based by Hot Embossing | <|reference_start|>Fabrication of Switches on Polymer-Based by Hot Embossing: In MEMS technology, most of the devices are fabricated on glass or silicon substrate. However, this research presents a novel manufacture method that is derived from conventional hot embossing technology to fabricate the electrostatic switche... | arxiv | @article{chien2007fabrication,
title={Fabrication of Switches on Polymer-Based by Hot Embossing},
author={Chao-Heng Chien, Hui-Min Yu},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={... | chien2007fabrication |
arxiv-1915 | 0711.3335 | A New Model of Fringing Capacitance and its Application to the Control of Parallel-Plate Electrostatic Micro Actuators | <|reference_start|>A New Model of Fringing Capacitance and its Application to the Control of Parallel-Plate Electrostatic Micro Actuators: Fringing field has to be taken into account in the formulation of electrostatic parallel-plate actuators when the gap separating the electrodes is comparable to the geometrical dime... | arxiv | @article{hosseini2007a,
title={A New Model of Fringing Capacitance and its Application to the Control
of Parallel-Plate Electrostatic Micro Actuators},
author={M. Hosseini, G. Zhu, Y.-A. Peter},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Ma... | hosseini2007a |
arxiv-1916 | 0711.3338 | Bounds for Compression in Streaming Models | <|reference_start|>Bounds for Compression in Streaming Models: Compression algorithms and streaming algorithms are both powerful tools for dealing with massive data sets, but many of the best compression algorithms -- e.g., those based on the Burrows-Wheeler Transform -- at first seem incompatible with streaming. In th... | arxiv | @article{gagie2007bounds,
title={Bounds for Compression in Streaming Models},
author={Travis Gagie (corresponding author)},
journal={arXiv preprint arXiv:0711.3338},
year={2007},
archivePrefix={arXiv},
eprint={0711.3338},
primaryClass={cs.IT math.IT}
} | gagie2007bounds |
arxiv-1917 | 0711.3375 | An Inflationary Fixed Point Operator in XQuery | <|reference_start|>An Inflationary Fixed Point Operator in XQuery: We introduce a controlled form of recursion in XQuery, inflationary fixed points, familiar in the context of relational databases. This imposes restrictions on the expressible types of recursion, but we show that inflationary fixed points nevertheless a... | arxiv | @article{afanasiev2007an,
title={An Inflationary Fixed Point Operator in XQuery},
author={Loredana Afanasiev, Torsten Grust, Maarten Marx, Jan Rittinger, Jens
Teubner},
journal={arXiv preprint arXiv:0711.3375},
year={2007},
archivePrefix={arXiv},
eprint={0711.3375},
primaryClass={cs.DB}
} | afanasiev2007an |
arxiv-1918 | 0711.3412 | Morphological annotation of Korean with Directly Maintainable Resources | <|reference_start|>Morphological annotation of Korean with Directly Maintainable Resources: This article describes an exclusively resource-based method of morphological annotation of written Korean text. Korean is an agglutinative language. Our annotator is designed to process text before the operation of a syntactic p... | arxiv | @article{berlocher2007morphological,
title={Morphological annotation of Korean with Directly Maintainable Resources},
author={Ivan Berlocher, Hyun-Gue Huh (IGM-LabInfo), Eric Laporte
(IGM-LabInfo), Jee-Sun Nam},
journal={Dans Proceedings of the Language Resource and Evaluation
Consference (LREC) - Morph... | berlocher2007morphological |
arxiv-1919 | 0711.3419 | Translating OWL and Semantic Web Rules into Prolog: Moving Toward Description Logic Programs | <|reference_start|>Translating OWL and Semantic Web Rules into Prolog: Moving Toward Description Logic Programs: To appear in Theory and Practice of Logic Programming (TPLP), 2008. We are researching the interaction between the rule and the ontology layers of the Semantic Web, by comparing two options: 1) using OWL a... | arxiv | @article{samuel2007translating,
title={Translating OWL and Semantic Web Rules into Prolog: Moving Toward
Description Logic Programs},
author={Ken Samuel, Leo Obrst, Suzette Stoutenberg, Karen Fox, Paul Franklin,
Adrian Johnson, Ken Laskey, Deborah Nichols, Steve Lopez, Jason Peterson},
journal={arXiv pr... | samuel2007translating |
arxiv-1920 | 0711.3449 | Lexicon management and standard formats | <|reference_start|>Lexicon management and standard formats: International standards for lexicon formats are in preparation. To a certain extent, the proposed formats converge with prior results of standardization projects. However, their adequacy for (i) lexicon management and (ii) lexicon-driven applications have been... | arxiv | @article{laporte2007lexicon,
title={Lexicon management and standard formats},
author={Eric Laporte (IGM-LabInfo)},
journal={Archives of Control Sciences 15, 3 (2005) 329-340},
year={2007},
archivePrefix={arXiv},
eprint={0711.3449},
primaryClass={cs.CL}
} | laporte2007lexicon |
arxiv-1921 | 0711.3452 | In memoriam Maurice Gross | <|reference_start|>In memoriam Maurice Gross: Maurice Gross (1934-2001) was both a great linguist and a pioneer in natural language processing. This article is written in homage to his memory<|reference_end|> | arxiv | @article{laporte2007in,
title={In memoriam Maurice Gross},
author={Eric Laporte (IGM-LabInfo)},
journal={Archives of Control Sciences 15, 3 (2005) 257-278},
year={2007},
archivePrefix={arXiv},
eprint={0711.3452},
primaryClass={cs.CL}
} | laporte2007in |
arxiv-1922 | 0711.3453 | A resource-based Korean morphological annotation system | <|reference_start|>A resource-based Korean morphological annotation system: We describe a resource-based method of morphological annotation of written Korean text. Korean is an agglutinative language. The output of our system is a graph of morphemes annotated with accurate linguistic information. The language resources... | arxiv | @article{huh2007a,
title={A resource-based Korean morphological annotation system},
author={Hyun-Gue Huh (IGM-LabInfo), Eric Laporte (IGM-LabInfo)},
journal={Dans Proceedings of the International Joint Conference on Natural
Language Processing (IJCNLP) - A resource-based Korean morphological
annotation ... | huh2007a |
arxiv-1923 | 0711.3454 | Graphes param\'etr\'es et outils de lexicalisation | <|reference_start|>Graphes param\'etr\'es et outils de lexicalisation: Shifting to a lexicalized grammar reduces the number of parsing errors and improves application results. However, such an operation affects a syntactic parser in all its aspects. One of our research objectives is to design a realistic model for gram... | arxiv | @article{laporte2007graphes,
title={Graphes param\'etr\'es et outils de lexicalisation},
author={Eric Laporte (IGM-LabInfo), S'ebastien Paumier (IGM-LabInfo)},
journal={Dans Verbum ex machina. Proceedings of TALN - Graphes
param\'etr\'es et outils de lexicalisation, Louvain : Belgique (2006)},
year={2... | laporte2007graphes |
arxiv-1924 | 0711.3457 | Evaluation of a Grammar of French Determiners | <|reference_start|>Evaluation of a Grammar of French Determiners: Existing syntactic grammars of natural languages, even with a far from complete coverage, are complex objects. Assessments of the quality of parts of such grammars are useful for the validation of their construction. We evaluated the quality of a grammar... | arxiv | @article{laporte2007evaluation,
title={Evaluation of a Grammar of French Determiners},
author={Eric Laporte (IGM-LabInfo)},
journal={Dans Annals of the 27th Congress of the Brazilian Society of
Computation - Evaluation of a Grammar of French Determiners, Rio de Janeiro :
Br\'esil (2007)},
year={2007... | laporte2007evaluation |
arxiv-1925 | 0711.3500 | Secure Fractal Image Coding | <|reference_start|>Secure Fractal Image Coding: In recent work, various fractal image coding methods are reported, which adopt the self-similarity of images to compress the size of images. However, till now, no solutions for the security of fractal encoded images have been provided. In this paper, a secure fractal imag... | arxiv | @article{lian2007secure,
title={Secure Fractal Image Coding},
author={Shiguo Lian},
journal={arXiv preprint arXiv:0711.3500},
year={2007},
archivePrefix={arXiv},
eprint={0711.3500},
primaryClass={cs.MM cs.CR}
} | lian2007secure |
arxiv-1926 | 0711.3545 | To Code or Not to Code Across Time: Space-Time Coding with Feedback | <|reference_start|>To Code or Not to Code Across Time: Space-Time Coding with Feedback: Space-time codes leverage the availability of multiple antennas to enhance the reliability of communication over wireless channels. While space-time codes have initially been designed with a focus on open-loop systems, recent techno... | arxiv | @article{lin2007to,
title={To Code or Not to Code Across Time: Space-Time Coding with Feedback},
author={Che Lin, Vasanthan Raghavan, Venu Veeravalli},
journal={arXiv preprint arXiv:0711.3545},
year={2007},
doi={10.1109/JSAC.2008.081024},
archivePrefix={arXiv},
eprint={0711.3545},
primar... | lin2007to |
arxiv-1927 | 0711.3580 | An evolutionary model with Turing machines | <|reference_start|>An evolutionary model with Turing machines: The development of a large non-coding fraction in eukaryotic DNA and the phenomenon of the code-bloat in the field of evolutionary computations show a striking similarity. This seems to suggest that (in the presence of mechanisms of code growth) the evoluti... | arxiv | @article{feverati2007an,
title={An evolutionary model with Turing machines},
author={Giovanni Feverati, Fabio Musso},
journal={arXiv preprint arXiv:0711.3580},
year={2007},
doi={10.1103/PhysRevE.77.061901},
number={LAPTH-1217/07},
archivePrefix={arXiv},
eprint={0711.3580},
primaryCla... | feverati2007an |
arxiv-1928 | 0711.3591 | An Estimation of Distribution Algorithm with Intelligent Local Search for Rule-based Nurse Rostering | <|reference_start|>An Estimation of Distribution Algorithm with Intelligent Local Search for Rule-based Nurse Rostering: This paper proposes a new memetic evolutionary algorithm to achieve explicit learning in rule-based nurse rostering, which involves applying a set of heuristic rules for each nurse's assignment. The ... | arxiv | @article{aickelin2007an,
title={An Estimation of Distribution Algorithm with Intelligent Local Search
for Rule-based Nurse Rostering},
author={Uwe Aickelin, Edmund Burke and Jingpeng Li},
journal={Journal of the Operational Research Society, 58 (12), pp
1574-1585, 2007},
year={2007},
doi={10.105... | aickelin2007an |
arxiv-1929 | 0711.3594 | Clustering with Transitive Distance and K-Means Duality | <|reference_start|>Clustering with Transitive Distance and K-Means Duality: Recent spectral clustering methods are a propular and powerful technique for data clustering. These methods need to solve the eigenproblem whose computational complexity is $O(n^3)$, where $n$ is the number of data samples. In this paper, a non... | arxiv | @article{xu2007clustering,
title={Clustering with Transitive Distance and K-Means Duality},
author={Chunjing Xu, Jianzhuang Liu, Xiaoou Tang},
journal={arXiv preprint arXiv:0711.3594},
year={2007},
archivePrefix={arXiv},
eprint={0711.3594},
primaryClass={cs.LG}
} | xu2007clustering |
arxiv-1930 | 0711.3605 | Very strict selectional restrictions | <|reference_start|>Very strict selectional restrictions: We discuss the characteristics and behaviour of two parallel classes of verbs in two Romance languages, French and Portuguese. Examples of these verbs are Port. abater [gado] and Fr. abattre [b\'etail], both meaning "slaughter [cattle]". In both languages, the de... | arxiv | @article{laporte2007very,
title={Very strict selectional restrictions},
author={Eric Laporte (IGM-LabInfo), Christian Lecl`ere (IGM-LabInfo), Maria
Carmelita P. Dias},
journal={Dans Proceedings - Very strict selectional restrictions. A
Comparison between Portuguese and French, Itatiaia : Br\'esil (2006)... | laporte2007very |
arxiv-1931 | 0711.3628 | A Perl Package and an Alignment Tool for Phylogenetic Networks | <|reference_start|>A Perl Package and an Alignment Tool for Phylogenetic Networks: Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of evolutionary events acting at the population level, like recombination between genes, hybridization between lineages, and lateral gene ... | arxiv | @article{cardona2007a,
title={A Perl Package and an Alignment Tool for Phylogenetic Networks},
author={Gabriel Cardona, Francesc Rossello, Gabriel Valiente},
journal={arXiv preprint arXiv:0711.3628},
year={2007},
archivePrefix={arXiv},
eprint={0711.3628},
primaryClass={q-bio.PE cs.CE}
} | cardona2007a |
arxiv-1932 | 0711.3629 | Convolutional codes from units in matrix and group rings | <|reference_start|>Convolutional codes from units in matrix and group rings: A general method for constructing convolutional codes from units in Laurent series over matrix rings is presented. Using group ring as matrix rings, this forms a basis for in-depth exploration of convolutional codes from group ring encoding, w... | arxiv | @article{hurley2007convolutional,
title={Convolutional codes from units in matrix and group rings},
author={Ted Hurley},
journal={arXiv preprint arXiv:0711.3629},
year={2007},
archivePrefix={arXiv},
eprint={0711.3629},
primaryClass={cs.IT math.IT math.RA}
} | hurley2007convolutional |
arxiv-1933 | 0711.3663 | The one-way function based on computational uncertainty principle | <|reference_start|>The one-way function based on computational uncertainty principle: This paper presents how to make use of the advantage of round-off error effect in some research areas. The float-point operation complies with the reproduce theorem without the external random perturbation. The computation uncertainty... | arxiv | @article{wang2007the,
title={The one-way function based on computational uncertainty principle},
author={P.F. Wang, J.P. Li},
journal={arXiv preprint arXiv:0711.3663},
year={2007},
archivePrefix={arXiv},
eprint={0711.3663},
primaryClass={cs.CR}
} | wang2007the |
arxiv-1934 | 0711.3672 | Weak vs Self vs Probabilistic Stabilization | <|reference_start|>Weak vs Self vs Probabilistic Stabilization: Self-stabilization is a strong property that guarantees that a network always resume correct behavior starting from an arbitrary initial state. Weaker guarantees have later been introduced to cope with impossibility results: probabilistic stabilization onl... | arxiv | @article{devismes2007weak,
title={Weak vs. Self vs. Probabilistic Stabilization},
author={St'ephane Devismes (LRI), S'ebastien Tixeuil (INRIA Futurs, LIP6),
Masafumi Yamashita (TCSG)},
journal={arXiv preprint arXiv:0711.3672},
year={2007},
archivePrefix={arXiv},
eprint={0711.3672},
primary... | devismes2007weak |
arxiv-1935 | 0711.3675 | Derivations of Normalized Mutual Information in Binary Classifications | <|reference_start|>Derivations of Normalized Mutual Information in Binary Classifications: This correspondence studies the basic problem of classifications - how to evaluate different classifiers. Although the conventional performance indexes, such as accuracy, are commonly used in classifier selection or evaluation, i... | arxiv | @article{wang2007derivations,
title={Derivations of Normalized Mutual Information in Binary Classifications},
author={Yong Wang, Bao-Gang Hu},
journal={arXiv preprint arXiv:0711.3675},
year={2007},
archivePrefix={arXiv},
eprint={0711.3675},
primaryClass={cs.LG cs.IT math.IT}
} | wang2007derivations |
arxiv-1936 | 0711.3691 | Outilex, plate-forme logicielle de traitement de textes \'ecrits | <|reference_start|>Outilex, plate-forme logicielle de traitement de textes \'ecrits: The Outilex software platform, which will be made available to research, development and industry, comprises software components implementing all the fundamental operations of written text processing: processing without lexicons, explo... | arxiv | @article{blanc2007outilex,,
title={Outilex, plate-forme logicielle de traitement de textes \'ecrits},
author={Olivier Blanc (IGM-LabInfo), Matthieu Constant (IGM-LabInfo), Eric
Laporte (IGM-LabInfo)},
journal={Dans Verbum ex machina. Proceedings of TALN - Outilex, plate-forme
logicielle de traitement de... | blanc2007outilex, |
arxiv-1937 | 0711.3726 | Let's get the student into the driver's seat | <|reference_start|>Let's get the student into the driver's seat: Speaking a language and achieving proficiency in another one is a highly complex process which requires the acquisition of various kinds of knowledge and skills, like the learning of words, rules and patterns and their connection to communicative goals (i... | arxiv | @article{zock2007let's,
title={Let's get the student into the driver's seat},
author={Michael Zock and Stergos D. Afantenos},
journal={The Seventh International Symposium on Natural Language Processing
(SNLP 2007). Chonburi, Thailand},
year={2007},
archivePrefix={arXiv},
eprint={0711.3726},
... | zock2007let's |
arxiv-1938 | 0711.3856 | Forward estimation for ergodic time series | <|reference_start|>Forward estimation for ergodic time series: The forward estimation problem for stationary and ergodic time series $\{X_n\}_{n=0}^{\infty}$ taking values from a finite alphabet ${\cal X}$ is to estimate the probability that $X_{n+1}=x$ based on the observations $X_i$, $0\le i\le n$ without prior knowl... | arxiv | @article{morvai2007forward,
title={Forward estimation for ergodic time series},
author={Gusztav Morvai and Benjamin Weiss},
journal={Ann. Inst. H. Poincare Probab. Statist. 41 (2005), no. 5, 859--870},
year={2007},
doi={10.1016/j.anihpb.2004.07.002},
archivePrefix={arXiv},
eprint={0711.3856}... | morvai2007forward |
arxiv-1939 | 0711.3861 | Approximation Algorithms for Restless Bandit Problems | <|reference_start|>Approximation Algorithms for Restless Bandit Problems: The restless bandit problem is one of the most well-studied generalizations of the celebrated stochastic multi-armed bandit problem in decision theory. In its ultimate generality, the restless bandit problem is known to be PSPACE-Hard to approxim... | arxiv | @article{guha2007approximation,
title={Approximation Algorithms for Restless Bandit Problems},
author={Sudipto Guha, Kamesh Munagala and Peng Shi},
journal={arXiv preprint arXiv:0711.3861},
year={2007},
archivePrefix={arXiv},
eprint={0711.3861},
primaryClass={cs.DS}
} | guha2007approximation |
arxiv-1940 | 0711.3867 | A Family of Likelihood Ascent Search Multiuser Detectors: Approach to Single-User Performance via Quasi-Large Random Sequence CDMA | <|reference_start|>A Family of Likelihood Ascent Search Multiuser Detectors: Approach to Single-User Performance via Quasi-Large Random Sequence CDMA: Since Tse and Verdu proved that the global maximum likelihood (GML) detector achieves unit asymptotic multiuser efficiency (AME) in the limit of large random spreading (... | arxiv | @article{sun2007a,
title={A Family of Likelihood Ascent Search Multiuser Detectors: Approach to
Single-User Performance via Quasi-Large Random Sequence CDMA},
author={Yi Sun},
journal={arXiv preprint arXiv:0711.3867},
year={2007},
archivePrefix={arXiv},
eprint={0711.3867},
primaryClass={cs... | sun2007a |
arxiv-1941 | 0711.3869 | A Family of Likelihood Ascent Search Multiuser Detectors: an Upper Bound of Bit Error Rate and a Lower Bound of Asymptotic Multiuser Efficiency | <|reference_start|>A Family of Likelihood Ascent Search Multiuser Detectors: an Upper Bound of Bit Error Rate and a Lower Bound of Asymptotic Multiuser Efficiency: In this paper, the bit error performance of a family of likelihood ascent search (LAS) multiuser detectors is analyzed. An upper bound on the BER of any LAS... | arxiv | @article{sun2007a,
title={A Family of Likelihood Ascent Search Multiuser Detectors: an Upper Bound
of Bit Error Rate and a Lower Bound of Asymptotic Multiuser Efficiency},
author={Yi Sun},
journal={arXiv preprint arXiv:0711.3869},
year={2007},
doi={10.1109/TCOMM.2009.06.060400},
archivePrefix=... | sun2007a |
arxiv-1942 | 0711.3915 | Distributed Consensus Algorithms in Sensor Networks: Link Failures and Channel Noise | <|reference_start|>Distributed Consensus Algorithms in Sensor Networks: Link Failures and Channel Noise: The paper studies average consensus with random topologies (intermittent links) \emph{and} noisy channels. Consensus with noise in the network links leads to the bias-variance dilemma--running consensus for long r... | arxiv | @article{kar2007distributed,
title={Distributed Consensus Algorithms in Sensor Networks: Link Failures and
Channel Noise},
author={Soummya Kar and Jos'e M. F. Moura},
journal={arXiv preprint arXiv:0711.3915},
year={2007},
archivePrefix={arXiv},
eprint={0711.3915},
primaryClass={cs.IT cs.MA... | kar2007distributed |
arxiv-1943 | 0711.3926 | Rateless codes for AVC models | <|reference_start|>Rateless codes for AVC models: The arbitrarily varying channel (AVC) is a channel model whose state is selected maliciously by an adversary. Fixed-blocklength coding assumes a worst-case bound on the adversary's capabilities, which leads to pessimistic results. This paper defines a variable-length pe... | arxiv | @article{sarwate2007rateless,
title={Rateless codes for AVC models},
author={Anand D. Sarwate and Michael Gastpar},
journal={arXiv preprint arXiv:0711.3926},
year={2007},
archivePrefix={arXiv},
eprint={0711.3926},
primaryClass={cs.IT math.IT}
} | sarwate2007rateless |
arxiv-1944 | 0711.3935 | Coding for Network Coding | <|reference_start|>Coding for Network Coding: We consider communication over a noisy network under randomized linear network coding. Possible error mechanism include node- or link- failures, Byzantine behavior of nodes, or an over-estimate of the network min-cut. Building on the work of Koetter and Kschischang, we intr... | arxiv | @article{montanari2007coding,
title={Coding for Network Coding},
author={Andrea Montanari and Ruediger Urbanke},
journal={arXiv preprint arXiv:0711.3935},
year={2007},
archivePrefix={arXiv},
eprint={0711.3935},
primaryClass={cs.IT cs.NI math.IT}
} | montanari2007coding |
arxiv-1945 | 0711.3941 | Braid Group Cryptography | <|reference_start|>Braid Group Cryptography: In the last decade, a number of public key cryptosystems based on com- binatorial group theoretic problems in braid groups have been proposed. We survey these cryptosystems and some known attacks on them. This survey includes: Basic facts on braid groups and on the Garside... | arxiv | @article{garber2007braid,
title={Braid Group Cryptography},
author={David Garber},
journal={arXiv preprint arXiv:0711.3941},
year={2007},
archivePrefix={arXiv},
eprint={0711.3941},
primaryClass={cs.CR math.GR}
} | garber2007braid |
arxiv-1946 | 0711.3949 | An Adaptive Checkpointing Scheme for Peer-to-Peer Based Volunteer Computing Work Flows | <|reference_start|>An Adaptive Checkpointing Scheme for Peer-to-Peer Based Volunteer Computing Work Flows: Volunteer Computing, sometimes called Public Resource Computing, is an emerging computational model that is very suitable for work-pooled parallel processing. As more complex grid applications make use of work flo... | arxiv | @article{ni2007an,
title={An Adaptive Checkpointing Scheme for Peer-to-Peer Based Volunteer
Computing Work Flows},
author={Lei Ni, Aaron Harwood},
journal={arXiv preprint arXiv:0711.3949},
year={2007},
archivePrefix={arXiv},
eprint={0711.3949},
primaryClass={cs.DC}
} | ni2007an |
arxiv-1947 | 0711.3958 | Maximum directed cuts in digraphs with degree restriction | <|reference_start|>Maximum directed cuts in digraphs with degree restriction: For integers m,k >= 1, we investigate the maximum size of a directed cut in directed graphs in which there are m edges and each vertex has either indegree at most k or outdegree at most k.<|reference_end|> | arxiv | @article{lehel2007maximum,
title={Maximum directed cuts in digraphs with degree restriction},
author={Jen"o Lehel, Fr'ed'eric Maffray (LGS), Myriam Preissmann (LGS)},
journal={arXiv preprint arXiv:0711.3958},
year={2007},
archivePrefix={arXiv},
eprint={0711.3958},
primaryClass={cs.DM}
} | lehel2007maximum |
arxiv-1948 | 0711.3959 | On b-perfect chordal graphs | <|reference_start|>On b-perfect chordal graphs: The b-chromatic number of a graph G is the largest integer k such that G has a coloring of the vertices in k color classes such that every color class contains a vertex that has a neighbour in all other color classes. We characterize the class of chordal graphs for which ... | arxiv | @article{maffray2007on,
title={On b-perfect chordal graphs},
author={Fr'ed'eric Maffray (LGS), Meriem Mechebbek},
journal={arXiv preprint arXiv:0711.3959},
year={2007},
archivePrefix={arXiv},
eprint={0711.3959},
primaryClass={cs.DM}
} | maffray2007on |
arxiv-1949 | 0711.3964 | Iterative Filtering for a Dynamical Reputation System | <|reference_start|>Iterative Filtering for a Dynamical Reputation System: The paper introduces a novel iterative method that assigns a reputation to n + m items: n raters and m objects. Each rater evaluates a subset of objects leading to a n x m rating matrix with a certain sparsity pattern. From this rating matrix we ... | arxiv | @article{de kerchove2007iterative,
title={Iterative Filtering for a Dynamical Reputation System},
author={Cristobald de Kerchove, Paul Van Dooren},
journal={arXiv preprint arXiv:0711.3964},
year={2007},
archivePrefix={arXiv},
eprint={0711.3964},
primaryClass={cs.IR}
} | de kerchove2007iterative |
arxiv-1950 | 0711.3983 | Self-dual, dual-containing and related quantum codes from group rings | <|reference_start|>Self-dual, dual-containing and related quantum codes from group rings: Classes of self-dual codes and dual-containing codes are constructed. The codes are obtained within group rings and, using an isomorphism between group rings and matrices, equivalent codes are obtained in matrix form. Distances an... | arxiv | @article{hurley2007self-dual,,
title={Self-dual, dual-containing and related quantum codes from group rings},
author={Ted Hurley},
journal={arXiv preprint arXiv:0711.3983},
year={2007},
archivePrefix={arXiv},
eprint={0711.3983},
primaryClass={cs.IT math.IT math.RA}
} | hurley2007self-dual, |
arxiv-1951 | 0711.4052 | An FPT Algorithm for Directed Spanning k-Leaf | <|reference_start|>An FPT Algorithm for Directed Spanning k-Leaf: An out-branching of a directed graph is a rooted spanning tree with all arcs directed outwards from the root. We consider the problem of deciding whether a given directed graph D has an out-branching with at least k leaves (Directed Spanning k-Leaf). We ... | arxiv | @article{bonsma2007an,
title={An FPT Algorithm for Directed Spanning k-Leaf},
author={Paul Bonsma and Frederic Dorn},
journal={arXiv preprint arXiv:0711.4052},
year={2007},
number={2007-046},
archivePrefix={arXiv},
eprint={0711.4052},
primaryClass={cs.DS cs.DM}
} | bonsma2007an |
arxiv-1952 | 0711.4071 | Observational semantics of the Prolog Resolution Box Model | <|reference_start|>Observational semantics of the Prolog Resolution Box Model: This paper specifies an observational semantics and gives an original presentation of the Byrd box model. The approach accounts for the semantics of Prolog tracers independently of a particular Prolog implementation. Prolog traces are, in ge... | arxiv | @article{deransart2007observational,
title={Observational semantics of the Prolog Resolution Box Model},
author={Pierre Deransart, Mireille Ducass'e, G'erard Ferrand},
journal={arXiv preprint arXiv:0711.4071},
year={2007},
archivePrefix={arXiv},
eprint={0711.4071},
primaryClass={cs.PL}
} | deransart2007observational |
arxiv-1953 | 0711.4075 | Evaluating the Impact of Information Distortion on Normalized Compression Distance | <|reference_start|>Evaluating the Impact of Information Distortion on Normalized Compression Distance: In this paper we apply different techniques of information distortion on a set of classical books written in English. We study the impact that these distortions have upon the Kolmogorov complexity and the clustering b... | arxiv | @article{granados2007evaluating,
title={Evaluating the Impact of Information Distortion on Normalized
Compression Distance},
author={Ana Granados, Manuel Cebrian, David Camacho, Francisco de B. Rodriguez},
journal={arXiv preprint arXiv:0711.4075},
year={2007},
archivePrefix={arXiv},
eprint={07... | granados2007evaluating |
arxiv-1954 | 0711.4142 | Content Reuse and Interest Sharing in Tagging Communities | <|reference_start|>Content Reuse and Interest Sharing in Tagging Communities: Tagging communities represent a subclass of a broader class of user-generated content-sharing online communities. In such communities users introduce and tag content for later use. Although recent studies advocate and attempt to harness socia... | arxiv | @article{santos-neto2007content,
title={Content Reuse and Interest Sharing in Tagging Communities},
author={Elizeu Santos-Neto, Matei Ripeanu, Adriana Iamnitchi},
journal={arXiv preprint arXiv:0711.4142},
year={2007},
archivePrefix={arXiv},
eprint={0711.4142},
primaryClass={cs.DL cs.IR}
} | santos-neto2007content |
arxiv-1955 | 0711.4175 | Graph Entropy, Network Coding and Guessing games | <|reference_start|>Graph Entropy, Network Coding and Guessing games: We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is identical to its guessing number and can be bounded from below with the num... | arxiv | @article{riis2007graph,
title={Graph Entropy, Network Coding and Guessing games},
author={Soren Riis},
journal={arXiv preprint arXiv:0711.4175},
year={2007},
archivePrefix={arXiv},
eprint={0711.4175},
primaryClass={math.CO cs.IT math.IT}
} | riis2007graph |
arxiv-1956 | 0711.4217 | Instruction sequences with dynamically instantiated instructions | <|reference_start|>Instruction sequences with dynamically instantiated instructions: We study sequential programs that are instruction sequences with dynamically instantiated instructions. We define the meaning of such programs in two different ways. In either case, we give a translation by which each program with dyna... | arxiv | @article{bergstra2007instruction,
title={Instruction sequences with dynamically instantiated instructions},
author={J. A. Bergstra, C. A. Middelburg},
journal={Fundamenta Informaticae, 96(1--2):27--48, 2009},
year={2007},
doi={10.3233/FI-2009-165},
number={PRG0710},
archivePrefix={arXiv},
... | bergstra2007instruction |
arxiv-1957 | 0711.4309 | Knowware: the third star after Hardware and Software | <|reference_start|>Knowware: the third star after Hardware and Software: This book proposes to separate knowledge from software and to make it a commodity that is called knowware. The architecture, representation and function of Knowware are discussed. The principles of knowware engineering and its three life cycle mod... | arxiv | @article{lu2007knowware:,
title={Knowware: the third star after Hardware and Software},
author={Ruqian Lu},
journal={"Publishing studies" book series, edited by Giandomenico Sica,
ISSN 1973-6061 (Printed edition), ISSN 1973-6053 (Electronic edition)},
year={2007},
archivePrefix={arXiv},
eprint... | lu2007knowware: |
arxiv-1958 | 0711.4324 | Report on "American Option Pricing and Hedging Strategies" | <|reference_start|>Report on "American Option Pricing and Hedging Strategies": This paper mainly discusses the American option's hedging strategies via binomialmodel and the basic idea of pricing and hedging American option. Although the essential scheme of hedging is almost the same as European option, small differenc... | arxiv | @article{zhang2007report,
title={Report on "American Option Pricing and Hedging Strategies"},
author={Jinshan Zhang},
journal={arXiv preprint arXiv:0711.4324},
year={2007},
archivePrefix={arXiv},
eprint={0711.4324},
primaryClass={cs.CE cs.DM}
} | zhang2007report |
arxiv-1959 | 0711.4380 | Randomness and metastability in CDMA paradigms | <|reference_start|>Randomness and metastability in CDMA paradigms: Code Division Multiple Access (CDMA) in which the signature code assignment to users contains a random element has recently become a cornerstone of CDMA research. The random element in the construction is particularly attractive in that it provides robu... | arxiv | @article{raymond2007randomness,
title={Randomness and metastability in CDMA paradigms},
author={Jack Raymond and David Saad},
journal={arXiv preprint arXiv:0711.4380},
year={2007},
archivePrefix={arXiv},
eprint={0711.4380},
primaryClass={cs.IT math.IT}
} | raymond2007randomness |
arxiv-1960 | 0711.4388 | Contextual Information Retrieval based on Algorithmic Information Theory and Statistical Outlier Detection | <|reference_start|>Contextual Information Retrieval based on Algorithmic Information Theory and Statistical Outlier Detection: The main contribution of this paper is to design an Information Retrieval (IR) technique based on Algorithmic Information Theory (using the Normalized Compression Distance- NCD), statistical te... | arxiv | @article{martinez2007contextual,
title={Contextual Information Retrieval based on Algorithmic Information Theory
and Statistical Outlier Detection},
author={Rafael Martinez, Manuel Cebrian, Francisco de Borja Rodriguez, David
Camacho},
journal={arXiv preprint arXiv:0711.4388},
year={2007},
doi={... | martinez2007contextual |
arxiv-1961 | 0711.4406 | Optimization of Information Rate Upper and Lower Bounds for Channels with Memory | <|reference_start|>Optimization of Information Rate Upper and Lower Bounds for Channels with Memory: We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we consider can have a finite number of stat... | arxiv | @article{sadeghi2007optimization,
title={Optimization of Information Rate Upper and Lower Bounds for Channels
with Memory},
author={Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams},
journal={arXiv preprint arXiv:0711.4406},
year={2007},
doi={10.1109/TIT.2008.2009581},
archivePrefix={arXiv},... | sadeghi2007optimization |
arxiv-1962 | 0711.4414 | Exploiting Multi-Antennas for Opportunistic Spectrum Sharing in Cognitive Radio Networks | <|reference_start|>Exploiting Multi-Antennas for Opportunistic Spectrum Sharing in Cognitive Radio Networks: In cognitive radio (CR) networks, there are scenarios where the secondary (lower priority) users intend to communicate with each other by opportunistically utilizing the transmit spectrum originally allocated to... | arxiv | @article{zhang2007exploiting,
title={Exploiting Multi-Antennas for Opportunistic Spectrum Sharing in
Cognitive Radio Networks},
author={Rui Zhang, and Ying Chang Liang},
journal={arXiv preprint arXiv:0711.4414},
year={2007},
doi={10.1109/JSTSP.2007.914894},
archivePrefix={arXiv},
eprint={0... | zhang2007exploiting |
arxiv-1963 | 0711.4444 | Building the Tangent and Adjoint codes of the Ocean General Circulation Model OPA with the Automatic Differentiation tool TAPENADE | <|reference_start|>Building the Tangent and Adjoint codes of the Ocean General Circulation Model OPA with the Automatic Differentiation tool TAPENADE: The ocean general circulation model OPA is developed by the LODYC team at Paris VI university. OPA has recently undergone a major rewriting, migrating to FORTRAN95, and ... | arxiv | @article{tber2007building,
title={Building the Tangent and Adjoint codes of the Ocean General Circulation
Model OPA with the Automatic Differentiation tool TAPENADE},
author={Moulay Hicham Tber (INRIA Sophia Antipolis), Laurent Hascoet (INRIA
Sophia Antipolis, SEMA), Arthur Vidard (INRIA Rh^one-Alpes / LJK ... | tber2007building |
arxiv-1964 | 0711.4452 | Covariance and PCA for Categorical Variables | <|reference_start|>Covariance and PCA for Categorical Variables: Covariances from categorical variables are defined using a regular simplex expression for categories. The method follows the variance definition by Gini, and it gives the covariance as a solution of simultaneous equations. The calculated results give reas... | arxiv | @article{niitsuma2007covariance,
title={Covariance and PCA for Categorical Variables},
author={Hirotaka Niitsuma and Takashi Okada},
journal={arXiv preprint arXiv:0711.4452},
year={2007},
archivePrefix={arXiv},
eprint={0711.4452},
primaryClass={cs.LG}
} | niitsuma2007covariance |
arxiv-1965 | 0711.4475 | Valence extraction using EM selection and co-occurrence matrices | <|reference_start|>Valence extraction using EM selection and co-occurrence matrices: This paper discusses two new procedures for extracting verb valences from raw texts, with an application to the Polish language. The first novel technique, the EM selection algorithm, performs unsupervised disambiguation of valence fra... | arxiv | @article{dębowski2007valence,
title={Valence extraction using EM selection and co-occurrence matrices},
author={{L}ukasz Dk{e}bowski},
journal={Language Resources and Evaluation 43:301-327, 2009},
year={2007},
doi={10.1007/s10579-009-9100-5},
archivePrefix={arXiv},
eprint={0711.4475},
pr... | dębowski2007valence |
arxiv-1966 | 0711.4507 | The Second Law as a Cause of the Evolution | <|reference_start|>The Second Law as a Cause of the Evolution: It is a common belief that in any environment where life is possible, life will be generated. Here it is suggested that the cause for a spontaneous generation of complex systems is probability driven processes. Based on equilibrium thermodynamics, it is arg... | arxiv | @article{kafri2007the,
title={The Second Law as a Cause of the Evolution},
author={Oded Kafri},
journal={arXiv preprint arXiv:0711.4507},
year={2007},
archivePrefix={arXiv},
eprint={0711.4507},
primaryClass={cs.IT cs.AI math.IT}
} | kafri2007the |
arxiv-1967 | 0711.4508 | Representation and Measure of Structural Information | <|reference_start|>Representation and Measure of Structural Information: We introduce a uniform representation of general objects that captures the regularities with respect to their structure. It allows a representation of a general class of objects including geometric patterns and images in a sparse, modular, hierarc... | arxiv | @article{ishikawa2007representation,
title={Representation and Measure of Structural Information},
author={Hiroshi Ishikawa},
journal={arXiv preprint arXiv:0711.4508},
year={2007},
archivePrefix={arXiv},
eprint={0711.4508},
primaryClass={cs.CC cs.CV cs.IT math.IT}
} | ishikawa2007representation |
arxiv-1968 | 0711.4516 | Fluoroscopy-based navigation system in spine surgery | <|reference_start|>Fluoroscopy-based navigation system in spine surgery: The variability in width, height, and spatial orientation of a spinal pedicle makes pedicle screw insertion a delicate operation. The aim of the current paper is to describe a computer-assisted surgical navigation system based on fluoroscopic X-ra... | arxiv | @article{merloz2007fluoroscopy-based,
title={Fluoroscopy-based navigation system in spine surgery},
author={Philippe Merloz (CHU-Grenoble ortho-traumato), Jocelyne Troccaz
(TIMC), Herv'e Vouaillat (CHU-Grenoble ortho-traumato), Christian Vasile
(CHU-Grenoble ortho-traumato), J'er^ome Tonetti (CHU-Grenoble
... | merloz2007fluoroscopy-based |
arxiv-1969 | 0711.4523 | Robot-based tele-echography: clinical evaluation of the TER system in abdominal aortic exploration | <|reference_start|>Robot-based tele-echography: clinical evaluation of the TER system in abdominal aortic exploration: OBJECTIVE: The TER system is a robot-based tele-echography system allowing remote ultrasound examination. The specialist moves a mock-up of the ultrasound probe at the master site, and the robot reprod... | arxiv | @article{martinelli2007robot-based,
title={Robot-based tele-echography: clinical evaluation of the TER system in
abdominal aortic exploration},
author={Thomas Martinelli (CHU-Grenoble radio), Jean-Luc Bosson (TIMC,
CHU-Grenoble CIC), Luc Bressollette, Franck Pelissier, Eric Boidard (TIMC),
Jocelyne Trocca... | martinelli2007robot-based |
arxiv-1970 | 0711.4557 | On Outage Behavior of Wideband Slow-Fading Channels | <|reference_start|>On Outage Behavior of Wideband Slow-Fading Channels: This paper investigates point-to-point information transmission over a wideband slow-fading channel, modeled as an (asymptotically) large number of independent identically distributed parallel channels, with the random channel fading realizations r... | arxiv | @article{zhang2007on,
title={On Outage Behavior of Wideband Slow-Fading Channels},
author={Wenyi Zhang and Urbashi Mitra},
journal={arXiv preprint arXiv:0711.4557},
year={2007},
number={USC CSI Technical Report CSI 07-08-01},
archivePrefix={arXiv},
eprint={0711.4557},
primaryClass={cs.IT... | zhang2007on |
arxiv-1971 | 0711.4562 | Near-Deterministic Inference of AS Relationships | <|reference_start|>Near-Deterministic Inference of AS Relationships: The discovery of Autonomous Systems (ASes) interconnections and the inference of their commercial Type-of-Relationships (ToR) has been extensively studied during the last few years. The main motivation is to accurately calculate AS-level paths and to ... | arxiv | @article{shavitt2007near-deterministic,
title={Near-Deterministic Inference of AS Relationships},
author={Yuval Shavitt, Eran Shir, Udi Weinsberg},
journal={arXiv preprint arXiv:0711.4562},
year={2007},
archivePrefix={arXiv},
eprint={0711.4562},
primaryClass={cs.NI}
} | shavitt2007near-deterministic |
arxiv-1972 | 0711.4573 | A Note On Computing Set Overlap Classes | <|reference_start|>A Note On Computing Set Overlap Classes: Let ${\cal V}$ be a finite set of $n$ elements and ${\cal F}=\{X_1,X_2, >..., X_m\}$ a family of $m$ subsets of ${\cal V}.$ Two sets $X_i$ and $X_j$ of ${\cal F}$ overlap if $X_i \cap X_j \neq \emptyset,$ $X_j \setminus X_i \neq \emptyset,$ and $X_i \setminus ... | arxiv | @article{charbit2007a,
title={A Note On Computing Set Overlap Classes},
author={Pierre Charbit (LIAFA), Michel Habib (LIAFA), Vincent Limouzy (LIAFA),
Fabien De Montgolfier (LIAFA), Mathieu Raffinot (LIAFA), Micha"el Rao
(LIRMM)},
journal={arXiv preprint arXiv:0711.4573},
year={2007},
archivePre... | charbit2007a |
arxiv-1973 | 0711.4603 | A Note on Quantum Hamming Bound | <|reference_start|>A Note on Quantum Hamming Bound: Proving the quantum Hamming bound for degenerate nonbinary stabilizer codes has been an open problem for a decade. In this note, I prove this bound for double error-correcting degenerate stabilizer codes. Also, I compute the maximum length of single and double error-c... | arxiv | @article{aly2007a,
title={A Note on Quantum Hamming Bound},
author={Salah A. Aly},
journal={arXiv preprint arXiv:0711.4603},
year={2007},
archivePrefix={arXiv},
eprint={0711.4603},
primaryClass={quant-ph cs.IT math.IT}
} | aly2007a |
arxiv-1974 | 0711.4613 | Spreadsheet Risk - A New Direction for HMRC? | <|reference_start|>Spreadsheet Risk - A New Direction for HMRC?: Her Majestys Revenue & Customs (HMRC) was born out of the need to create a UK tax authority by merging both the Inland Revenue and HM Customs & Excise into one department. HMRC encounters spreadsheets in tax-payers systems on a very regular basis as well ... | arxiv | @article{price2007spreadsheet,
title={Spreadsheet Risk - A New Direction for HMRC?},
author={D. Price},
journal={Proc. European Spreadsheet Risks Int. Grp. 2006 1-7
ISBN:1-905617-08-9},
year={2007},
archivePrefix={arXiv},
eprint={0711.4613},
primaryClass={cs.CY}
} | price2007spreadsheet |
arxiv-1975 | 0711.4634 | Strategies for Addressing Spreadsheet Compliance Challenges | <|reference_start|>Strategies for Addressing Spreadsheet Compliance Challenges: Most organizations today use spreadsheets in some form or another to support critical business processes. However the financial resources, and developmental rigor dedicated to them are often minor in comparison to other enterprise technolog... | arxiv | @article{weber2007strategies,
title={Strategies for Addressing Spreadsheet Compliance Challenges},
author={Brandon Weber},
journal={Proc. European Spreadsheet Risks Int. Grp. 2006 17-32
ISBN:1-905617-08-09},
year={2007},
archivePrefix={arXiv},
eprint={0711.4634},
primaryClass={cs.CY}
} | weber2007strategies |
arxiv-1976 | 0711.4656 | A condition number analysis of an algorithm for solving a system of polynomial equations with one degree of freedom | <|reference_start|>A condition number analysis of an algorithm for solving a system of polynomial equations with one degree of freedom: This article considers the problem of solving a system of $n$ real polynomial equations in $n+1$ variables. We propose an algorithm based on Newton's method and subdivision for this pr... | arxiv | @article{srijuntongsiri2007a,
title={A condition number analysis of an algorithm for solving a system of
polynomial equations with one degree of freedom},
author={Gun Srijuntongsiri, Stephen A. Vavasis},
journal={arXiv preprint arXiv:0711.4656},
year={2007},
archivePrefix={arXiv},
eprint={0711... | srijuntongsiri2007a |
arxiv-1977 | 0711.4759 | Copeland Voting Fully Resists Constructive Control | <|reference_start|>Copeland Voting Fully Resists Constructive Control: Control and bribery are settings in which an external agent seeks to influence the outcome of an election. Faliszewski et al. [FHHR07] proved that Llull voting (which is here denoted by Copeland^1) and a variant (here denoted by Copeland^0) of Copel... | arxiv | @article{faliszewski2007copeland,
title={Copeland Voting Fully Resists Constructive Control},
author={Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, J"org
Rothe},
journal={arXiv preprint arXiv:0711.4759},
year={2007},
number={URCS-TR-923},
archivePrefix={arXiv},
eprint={0711.... | faliszewski2007copeland |
arxiv-1978 | 0711.4792 | On the Capacity of a Class of MIMO Cognitive Radios | <|reference_start|>On the Capacity of a Class of MIMO Cognitive Radios: Cognitive radios have been studied recently as a means to utilize spectrum in a more efficient manner. This paper focuses on the fundamental limits of operation of a MIMO cognitive radio network with a single licensed user and a single cognitive us... | arxiv | @article{sridharan2007on,
title={On the Capacity of a Class of MIMO Cognitive Radios},
author={Sriram Sridharan and Sriram Vishwanath},
journal={arXiv preprint arXiv:0711.4792},
year={2007},
doi={10.1109/JSTSP.2007.914890},
archivePrefix={arXiv},
eprint={0711.4792},
primaryClass={cs.IT m... | sridharan2007on |
arxiv-1979 | 0711.4809 | Local independence of fractional Brownian motion | <|reference_start|>Local independence of fractional Brownian motion: Let S(t,t') be the sigma-algebra generated by the differences X(s)-X(s) with s,s' in the interval(t,t'), where (X_t) is the fractional Brownian motion process with Hurst index H between 0 and 1. We prove that for any two distinct t and t' the sigma-al... | arxiv | @article{norros2007local,
title={Local independence of fractional Brownian motion},
author={Ilkka Norros and Eero Saksman},
journal={arXiv preprint arXiv:0711.4809},
year={2007},
archivePrefix={arXiv},
eprint={0711.4809},
primaryClass={math.PR cs.IT math.IT}
} | norros2007local |
arxiv-1980 | 0711.4825 | Approximation Algorithms for Orienteering with Time Windows | <|reference_start|>Approximation Algorithms for Orienteering with Time Windows: Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s,t and a time limit T, find an s-t walk of total length at most T that maximizes the number of distinct nodes visited by t... | arxiv | @article{chekuri2007approximation,
title={Approximation Algorithms for Orienteering with Time Windows},
author={Chandra Chekuri, Nitish Korula},
journal={arXiv preprint arXiv:0711.4825},
year={2007},
archivePrefix={arXiv},
eprint={0711.4825},
primaryClass={cs.DS}
} | chekuri2007approximation |
arxiv-1981 | 0711.4864 | Cooperative Relaying with State Available at the Relay | <|reference_start|>Cooperative Relaying with State Available at the Relay: We consider a state-dependent full-duplex relay channel with the state of the channel non-causally available at only the relay. In the framework of cooperative wireless networks, some specific terminals can be equipped with cognition capabilitie... | arxiv | @article{zaidi2007cooperative,
title={Cooperative Relaying with State Available at the Relay},
author={Abdellatif Zaidi, Shivaprasad Kotagiri, J. Nicholas Laneman and Luc
Vandendorpe},
journal={arXiv preprint arXiv:0711.4864},
year={2007},
doi={10.1109/ITW.2008.4578638},
archivePrefix={arXiv},... | zaidi2007cooperative |
arxiv-1982 | 0711.4902 | Circumspect descent prevails in solving random constraint satisfaction problems | <|reference_start|>Circumspect descent prevails in solving random constraint satisfaction problems: We study the performance of stochastic local search algorithms for random instances of the $K$-satisfiability ($K$-SAT) problem. We introduce a new stochastic local search algorithm, ChainSAT, which moves in the energy l... | arxiv | @article{alava2007circumspect,
title={Circumspect descent prevails in solving random constraint satisfaction
problems},
author={Mikko Alava, John Ardelius, Erik Aurell, Petteri Kaski, Supriya
Krishnamurthy, Pekka Orponen, and Sakari Seitz},
journal={arXiv preprint arXiv:0711.4902},
year={2007},
... | alava2007circumspect |
arxiv-1983 | 0711.4924 | Nonuniform Bribery | <|reference_start|>Nonuniform Bribery: We study the concept of bribery in the situation where voters are willing to change their votes as we ask them, but where their prices depend on the nature of the change we request. Our model is an extension of the one of Faliszewski et al. [FHH06], where each voter has a single p... | arxiv | @article{faliszewski2007nonuniform,
title={Nonuniform Bribery},
author={Piotr Faliszewski},
journal={arXiv preprint arXiv:0711.4924},
year={2007},
number={URCS TR-2007-922},
archivePrefix={arXiv},
eprint={0711.4924},
primaryClass={cs.GT cs.CC cs.MA}
} | faliszewski2007nonuniform |
arxiv-1984 | 0711.4944 | Development of miniaturized light endoscope-holder robot for laparoscopic surgery | <|reference_start|>Development of miniaturized light endoscope-holder robot for laparoscopic surgery: PURPOSE: We have conducted experiments with an innovatively designed robot endoscope holder for laparoscopic surgery that is small and low cost. MATERIALS AND METHODS: A compact light endoscope robot (LER) that is plac... | arxiv | @article{long2007development,
title={Development of miniaturized light endoscope-holder robot for
laparoscopic surgery},
author={Jean-Alexandre Long (TIMC), Philippe Cinquin (TIMC), Jocelyne Troccaz
(TIMC), Sandrine Voros (TIMC), Jean-Luc Descotes, Peter Berkelman (TIMC),
Christian Letoublon, Jean-Jacques... | long2007development |
arxiv-1985 | 0711.4990 | Finding the growth rate of a regular language in polynomial time | <|reference_start|>Finding the growth rate of a regular language in polynomial time: We give an O(n^3+n^2 t) time algorithm to determine whether an NFA with n states and t transitions accepts a language of polynomial or exponential growth. We also show that given a DFA accepting a language of polynomial growth, we can ... | arxiv | @article{krieger2007finding,
title={Finding the growth rate of a regular language in polynomial time},
author={Dalia Krieger, Narad Rampersad, Jeffrey Shallit},
journal={arXiv preprint arXiv:0711.4990},
year={2007},
archivePrefix={arXiv},
eprint={0711.4990},
primaryClass={cs.DM cs.DS}
} | krieger2007finding |
arxiv-1986 | 0712.0035 | On Myopic Sensing for Multi-Channel Opportunistic Access: Structure, Optimality, and Performance | <|reference_start|>On Myopic Sensing for Multi-Channel Opportunistic Access: Structure, Optimality, and Performance: We consider a multi-channel opportunistic communication system where the states of these channels evolve as independent and statistically identical Markov chains (the Gilbert-Elliot channel model). A use... | arxiv | @article{zhao2007on,
title={On Myopic Sensing for Multi-Channel Opportunistic Access: Structure,
Optimality, and Performance},
author={Qing Zhao, Bhaskar Krishnamachari, Keqin Liu},
journal={arXiv preprint arXiv:0712.0035},
year={2007},
doi={10.1109/T-WC.2008.071349},
archivePrefix={arXiv},
... | zhao2007on |
arxiv-1987 | 0712.0042 | On the Mutual Information Distribution of OFDM-Based Spatial Multiplexing: Exact Variance and Outage Approximation | <|reference_start|>On the Mutual Information Distribution of OFDM-Based Spatial Multiplexing: Exact Variance and Outage Approximation: This paper considers the distribution of the mutual information of frequency-selective spatially-uncorrelated Rayleigh fading MIMO channels. Results are presented for OFDM-based spatial... | arxiv | @article{mckay2007on,
title={On the Mutual Information Distribution of OFDM-Based Spatial
Multiplexing: Exact Variance and Outage Approximation},
author={Matthew R. McKay, Peter J. Smith, Himal A. Suraweera, and Iain B.
Collings},
journal={arXiv preprint arXiv:0712.0042},
year={2007},
doi={10.11... | mckay2007on |
arxiv-1988 | 0712.0057 | On Precision - Redundancy Relation in the Design of Source Coding Algorithms | <|reference_start|>On Precision - Redundancy Relation in the Design of Source Coding Algorithms: We study the effects of finite-precision representation of source's probabilities on the efficiency of classic source coding algorithms, such as Shannon, Gilbert-Moore, or arithmetic codes. In particular, we establish the f... | arxiv | @article{reznik2007on,
title={On Precision - Redundancy Relation in the Design of Source Coding
Algorithms},
author={Yuriy Reznik},
journal={arXiv preprint arXiv:0712.0057},
year={2007},
archivePrefix={arXiv},
eprint={0712.0057},
primaryClass={cs.IT math.IT}
} | reznik2007on |
arxiv-1989 | 0712.0084 | From vectors to mnesors | <|reference_start|>From vectors to mnesors: The mnesor theory is the adaptation of vectors to artificial intelligence. The scalar field is replaced by a lattice. Addition becomes idempotent and multiplication is interpreted as a selection operation. We also show that mnesors can be the foundation for a linear calculus.... | arxiv | @article{champenois2007from,
title={From vectors to mnesors},
author={Gilles Champenois},
journal={arXiv preprint arXiv:0712.0084},
year={2007},
archivePrefix={arXiv},
eprint={0712.0084},
primaryClass={cs.LO cs.CC}
} | champenois2007from |
arxiv-1990 | 0712.0097 | Redundancy Estimates for Word-Based Encoding of Sequences Produced by a Bernoulli Source | <|reference_start|>Redundancy Estimates for Word-Based Encoding of Sequences Produced by a Bernoulli Source: The efficiency of a code is estimated by its redundancy $R$, while the complexity of a code is estimated by its average delay $\bar N$. In this work we construct word-based codes, for which $R \lesssim \bar N^{-... | arxiv | @article{khodak2007redundancy,
title={Redundancy Estimates for Word-Based Encoding of Sequences Produced by a
Bernoulli Source},
author={G. L. Khodak},
journal={arXiv preprint arXiv:0712.0097},
year={2007},
archivePrefix={arXiv},
eprint={0712.0097},
primaryClass={cs.IT math.IT}
} | khodak2007redundancy |
arxiv-1991 | 0712.0105 | On estimating the memory for finitarily Markovian processes | <|reference_start|>On estimating the memory for finitarily Markovian processes: Finitarily Markovian processes are those processes $\{X_n\}_{n=-\infty}^{\infty}$ for which there is a finite $K$ ($K = K(\{X_n\}_{n=-\infty}^0$) such that the conditional distribution of $X_1$ given the entire past is equal to the conditio... | arxiv | @article{morvai2007on,
title={On estimating the memory for finitarily Markovian processes},
author={Gusztav Morvai and Benjamin Weiss},
journal={Ann. Inst. H. Poincare Probab. Statist. 43 (2007), no. 1, 15--30},
year={2007},
doi={10.1016/j.anihpb.2005.11.001},
archivePrefix={arXiv},
eprint={... | morvai2007on |
arxiv-1992 | 0712.0109 | Recommended Practices for Spreadsheet Testing | <|reference_start|>Recommended Practices for Spreadsheet Testing: This paper presents the authors recommended practices for spreadsheet testing. Documented spreadsheet error rates are unacceptable in corporations today. Although improvements are needed throughout the systems development life cycle, credible improvement... | arxiv | @article{panko2007recommended,
title={Recommended Practices for Spreadsheet Testing},
author={Raymond R. Panko},
journal={Proc. European Spreadsheet Risks Int. Grp. 2006 73-84
ISBN:1-905617-08-9},
year={2007},
archivePrefix={arXiv},
eprint={0712.0109},
primaryClass={cs.SE}
} | panko2007recommended |
arxiv-1993 | 0712.0121 | Efficient Binary and Run Length Morphology and its Application to Document Image Processing | <|reference_start|>Efficient Binary and Run Length Morphology and its Application to Document Image Processing: This paper describes the implementation and evaluation of an open source library for mathematical morphology based on packed binary and run-length compressed images for document imaging applications. Abstract... | arxiv | @article{breuel2007efficient,
title={Efficient Binary and Run Length Morphology and its Application to
Document Image Processing},
author={Thomas M. Breuel},
journal={arXiv preprint arXiv:0712.0121},
year={2007},
archivePrefix={arXiv},
eprint={0712.0121},
primaryClass={cs.GR}
} | breuel2007efficient |
arxiv-1994 | 0712.0125 | Sweedler's duals and Sch\"utzenberger's calculus | <|reference_start|>Sweedler's duals and Sch\"utzenberger's calculus: We describe the problem of Sweedler's duals for bialgebras as essentially characterizing the domain of the transpose of the multiplication. This domain is the set of what could be called ``representative linear forms'' which are the elements of the al... | arxiv | @article{duchamp2007sweedler's,
title={Sweedler's duals and Sch\"utzenberger's calculus},
author={G'erard H. E. Duchamp (LIPN), Christophe Tollu (LIPN)},
journal={arXiv preprint arXiv:0712.0125},
year={2007},
archivePrefix={arXiv},
eprint={0712.0125},
primaryClass={math.CO cs.DM math-ph math... | duchamp2007sweedler's |
arxiv-1995 | 0712.0130 | On the Relationship between the Posterior and Optimal Similarity | <|reference_start|>On the Relationship between the Posterior and Optimal Similarity: For a classification problem described by the joint density $P(\omega,x)$, models of $P(\omega\eq\omega'|x,x')$ (the ``Bayesian similarity measure'') have been shown to be an optimal similarity measure for nearest neighbor classificati... | arxiv | @article{breuel2007on,
title={On the Relationship between the Posterior and Optimal Similarity},
author={Thomas M. Breuel},
journal={arXiv preprint arXiv:0712.0130},
year={2007},
archivePrefix={arXiv},
eprint={0712.0130},
primaryClass={cs.LG}
} | breuel2007on |
arxiv-1996 | 0712.0131 | Learning Similarity for Character Recognition and 3D Object Recognition | <|reference_start|>Learning Similarity for Character Recognition and 3D Object Recognition: I describe an approach to similarity motivated by Bayesian methods. This yields a similarity function that is learnable using a standard Bayesian methods. The relationship of the approach to variable kernel and variable metric m... | arxiv | @article{breuel2007learning,
title={Learning Similarity for Character Recognition and 3D Object Recognition},
author={Thomas M. Breuel},
journal={arXiv preprint arXiv:0712.0131},
year={2007},
archivePrefix={arXiv},
eprint={0712.0131},
primaryClass={cs.CV}
} | breuel2007learning |
arxiv-1997 | 0712.0136 | Learning View Generalization Functions | <|reference_start|>Learning View Generalization Functions: Learning object models from views in 3D visual object recognition is usually formulated either as a function approximation problem of a function describing the view-manifold of an object, or as that of learning a class-conditional density. This paper describes ... | arxiv | @article{breuel2007learning,
title={Learning View Generalization Functions},
author={Thomas M. Breuel},
journal={arXiv preprint arXiv:0712.0136},
year={2007},
archivePrefix={arXiv},
eprint={0712.0136},
primaryClass={cs.CV}
} | breuel2007learning |
arxiv-1998 | 0712.0137 | View Based Methods can achieve Bayes-Optimal 3D Recognition | <|reference_start|>View Based Methods can achieve Bayes-Optimal 3D Recognition: This paper proves that visual object recognition systems using only 2D Euclidean similarity measurements to compare object views against previously seen views can achieve the same recognition performance as observers having access to all co... | arxiv | @article{breuel2007view,
title={View Based Methods can achieve Bayes-Optimal 3D Recognition},
author={Thomas M. Breuel},
journal={arXiv preprint arXiv:0712.0137},
year={2007},
archivePrefix={arXiv},
eprint={0712.0137},
primaryClass={cs.CV}
} | breuel2007view |
arxiv-1999 | 0712.0139 | Direct definition of a ternary infinite square-free sequence | <|reference_start|>Direct definition of a ternary infinite square-free sequence: We propose a new ternary infinite (even full-infinite) square-free sequence. The sequence is defined both by an iterative method and by a direct definition. Both definitions are analogous to those of the Thue-Morse sequence. The direct def... | arxiv | @article{kurosaki2007direct,
title={Direct definition of a ternary infinite square-free sequence},
author={Tetsuo Kurosaki},
journal={arXiv preprint arXiv:0712.0139},
year={2007},
doi={10.1016/j.ipl.2007.11.012},
archivePrefix={arXiv},
eprint={0712.0139},
primaryClass={cs.DM}
} | kurosaki2007direct |
arxiv-2000 | 0712.0164 | On Decidability Properties of Local Sentences | <|reference_start|>On Decidability Properties of Local Sentences: Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the finite and the infinite model theory of these sentences. We prove here sever... | arxiv | @article{finkel2007on,
title={On Decidability Properties of Local Sentences},
author={Olivier Finkel (ELM)},
journal={Theoretical Computer Science 364 (2) (2006) 196-211},
year={2007},
archivePrefix={arXiv},
eprint={0712.0164},
primaryClass={cs.LO math.LO}
} | finkel2007on |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.