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 novel method for amplify DNA sample. For this concept, the DNA sample in the silicon chamber which was pushed by a beam through three temperature regions around a center and then the DNA segments could be amplified rapidly after 30 cycles. The polymerase chain reaction platform was composed of thin-film heaters, copper plates, DC powers, and temperature controllers. The photolithography and bulk etching technologies were utilized to construct the thin-film heater and DNA reaction chambers. Finally, 1 pound gL 100bp DNA segment of E. coli K12 was amplified successfully within 36 minutes on this PCR platform.<|reference_end|> | 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={arXiv},
eprint={0711.3319},
primaryClass={cs.OH}
} | 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 (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3320},
primaryClass={cs.OH}
} | 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 demonstration that the pull-in effect can be shifted beyond one third of the initial gap and even be eliminated when electrostatic actuators are operated in liquids. This should benefit to applications in microfluidics requiring either binary state actuation (e.g. pumps, valves) or continuous displacements over the whole gap (e.g. microtweezers). In dynamic mode, actuators like micro-cantilevers present a great interest for Atomic Force Microscopy (AFM) in liquids. As this application requires a good understanding of the cantilever resonance frequency and Q-factor, an analytical modeling in liquid environment has been established. The theoretically derived curves are validated by experimental results using a nitride encapsulated cantilever with integrated electrostatic actuation. Electrode potential screening and undesirable electrochemistry in dielectric liquids are counteracted using AC-voltages. Both experimental and theoretical results should prove useful in micro-cantilever design for AFM in liquids.<|reference_end|> | 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, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3321},
primaryClass={cs.OH}
} | 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 the Au-Sn solder directly onto a wafer at or near the eutectic composition from a single solution. Two distinct phases, Au5Sn and AuSn, were deposited at a composition of 30at.%Sn. The Au-Sn flip-chip joints were formed at 300 and 400 degrees without using any flux. In the case where the samples were reflowed at 300 degrees, only an (Au,Ni)3Sn2 IMC layer formed at the interface between the Au-Sn solder and Ni UBM. On the other hand, two IMC layers, (Au,Ni)3Sn2 and (Au,Ni)3Sn, were found at the interfaces of the samples reflowed at 400 degrees. As the reflow time increased, the thickness of the (Au,Ni)3Sn2 and (Au,Ni)3Sn IMC layers formed at the interface increased and the eutectic lamellae in the bulk solder coarsened.<|reference_end|> | 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 : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3323},
primaryClass={cs.OH}
} | 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 on sensing the infrared radiation is introduced. With the proposed method the IR radiation-distribution of boards from the close proximity of the sensor card is monitored in quasi real-time. The proposed method is enabling in situ IR measurement among operating cards of a system e.g. in a rack.<|reference_end|> | 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={2007},
archivePrefix={arXiv},
eprint={0711.3324},
primaryClass={cs.OH}
} | 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 for optical fiber alignment and micro-mirror were included. Combing with anodic bonding technique to adhere glass, silicon structure and optical fiber for a fluorescence excitation platform was completed. In this study, the etching solution 40% KOH was used to study the parameters effect. The results show that working temperature is the main parameter to significantly effect the etch rate. The anisotropic etching resulted 54.7 degrees reflective mirrors and its reflectivity for optical beam were also examined. The surface roughness of the micro-mirror is Ra 4.1 nm measured using AFM, it provides excellent optical reflection. The incident light and beam profiles were also examined for further study. This study can show this micro-platform adaptable for fluorescence bio-detection.<|reference_end|> | 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)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3325},
primaryClass={cs.OH}
} | 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. This paper presents the used fabrication process based on micromoulding. The dielectric substrates are flexible thin films of polymer, which allow the microcoil to be form fitted to none-plane surface. Electrical characterizations of the RF coils are first performed and results are compared to the attempted values. Proton MRI of a saline phantom using a flexible RF coil of 15 mm in diameter is performed. When the coil is conformed to the phantom surface, a SNR gain up to 2 is achieved as compared to identical but planar RF coil. Finally, the flexible coil is used in vivo to perform MRI with high spatial resolution on a mouse using a small animal dedicated scanner operating at in a 2.35 T.<|reference_end|> | 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. Martincic (IEF), O.
Girard (U2R2M)},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3326},
primaryClass={cs.OH}
} | 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 acts as one of the laser cavity reflectors and, at the same time, as switching/ modulator element. We aim to obtain laser systems emitting short, high-power pulses and having variable repetition rate. The electro-mechanical behavior of membrane (bridge-type) was simulated by using electrostatic and modal 3D finite element analysis (FEA). The results of the simulations fit well with the experimental mechanical, electrical and thermal measurements of the components. In order to decrease the sensitiveness to fiber-mirror alignment we are developing novel optical devices based on stressed-metal cantilever-type geometry that allow deflections up to 50 $\mu$m with increased reflectivity discrimination during actuation.<|reference_end|> | 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={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3327},
primaryClass={cs.OH}
} | 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 photoresist pattern and PTFE can generate micro-ball lens and its array. PTFE thin film was spun onto a silicon wafer and dried in oven. Photoresist AZ4620 was used to pattern micro-columns with different diameters 60, 70 and 80 $\mu$m. A thermal reflow process then was applied to melt these micro-column patterns resulted in micro-ball lens array. The achieved micro-ball lens array with diameter 98 $\mu$m was fabricated using 80 $\mu$m in diameter patterns. This method provides a simple fabrication process and low material cost.<|reference_end|> | 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 : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3329},
primaryClass={cs.OH}
} | 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 characteristics of the micromirrors by taking into account the flexural deformation of the structure is presented. The results are compared with 3D coupled-field FEM simulation.<|reference_end|> | 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)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3330},
primaryClass={cs.OH}
} | 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 electric as well as mechanical and fluid phenomena appear and interact. Because of their microscopic scale, strong coupling effects arise between the different physical fields, and some forces, which were negligible at macroscopic scale, have to be taken into account. In order to accurately design such micro-electro-mechanical systems, it is of primary importance to be able to handle the strong coupling between the electric and the mechanical fields. In this paper, the finite element method (FEM) is used to model the strong coupled electro-mechanical interactions and to perform static and transient analyses taking into account large mesh displacements. These analyses will be used to study the behaviour of electrostatically actuated micro-mirrors.<|reference_end|> | 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, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3331},
primaryClass={cs.OH}
} | 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 deposition process. Al thin films are deposited partly on the actuator beam and on the substrate. By etching the structure, the actuator contracts and pulls the Al film. Full stress strain curves can be generated by designing a set of micromachines with various actuator lengths. In the present study, the displacements have been measured by scanning electronic microscopy. The stress is derived from simple continuum mechanics relationships. The tensile properties of Al films of various thicknesses have been tested. A marked increase of the strength with decreasing film thickness is observed.<|reference_end|> | 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, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3332},
primaryClass={cs.OH}
} | 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 conducted to look at the effects of load applied, embossing temperature and embossing time on the fidelity of line arrays representing micro channels. The results revealed that the embossing temperature is a more sensitive parameter than the others due to its large effect on the polymer material's viscoelastic properties. Dynamic mechanical analysis (DMA) on polymethyl methacrylate (PMMA) revealed a steep glass transition over a 20 oC range, with the material losing more than 95 % of its storage modulus. The data explained the hot embossing results which showed large change in the embossed channel dimensions when the temperature is within the glass transition range. It was demonstrated that the micro-printing of silver epoxy is a possible low-cost technique in the mass production of disposable lab chips. An interconnecting network of electrical traces was fabricated in the form of a four-layer PMMA-based device. A four PMMA layer device with interconnecting microfluidic channels was also fabricated and tested.<|reference_end|> | 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},
archivePrefix={arXiv},
eprint={0711.3333},
primaryClass={cs.OH}
} | 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 switches on polymer material. The procedures of fabrication involve the metal deposition, photolithography, electroplating, hot embossing and hot embed techniques. The fundamental concept of the hot embed technology is that the temperature should be increased above Tg of polymer, and the polymer becomes plastic and viscous and could be molded. According to the fundamental concept, the metal layer on the silicon/glass substrate could be embedded into polymer material during the hot embossing process. Afterward, the metal layer is bonded together with the polymer after removing the substrate in the de-embossing step. Finally, the electrostatic switch is fabricated on polymethylmethacrylate(PMMA) material to demonstrate the novel method.<|reference_end|> | 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={arXiv},
eprint={0711.3334},
primaryClass={cs.OH}
} | 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 dimensions of the moving plate. Even in this case, the existing formulations often result in complicated mathematical models from which it is difficult to determine the deflection of the moving plate for given voltages and therefore to predict the necessary applied voltages for actuation control. This work presents a new method for the modeling of fringing field, in which the effect of fringing field is modeled as a serial capacitor. Numerical simulation demonstrates the suitability of this formulation. Based on this model, a robust control scheme is constructed using the theory of input-to-state stabilization (ISS) and back-stepping state feedback design. The stability and the performance of the system using this control scheme are demonstrated through both stability analysis and numerical simulation.<|reference_end|> | 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 Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3335},
primaryClass={cs.OH}
} | 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 this paper we consider several popular streaming models and ask in which, if any, we can compress as well as we can with the BWT. We first prove a nearly tight tradeoff between memory and redundancy for the Standard, Multipass and W-Streams models, demonstrating a bound that is achievable with the BWT but unachievable in those models. We then show we can compute the related Schindler Transform in the StreamSort model and the BWT in the Read-Write model and, thus, achieve that bound.<|reference_end|> | 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 are sufficiently versatile to capture a wide range of interesting use cases, including the semantics of Regular XPath and its core transitive closure construct. While the optimization of general user-defined recursive functions in XQuery appears elusive, we will describe how inflationary fixed points can be efficiently evaluated, provided that the recursive XQuery expressions exhibit a distributivity property. We show how distributivity can be assessed both, syntactically and algebraically, and provide experimental evidence that XQuery processors can substantially benefit during inflationary fixed point evaluation.<|reference_end|> | 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 parser. In its present state, it annotates one-stem words only. The output is a graph of morphemes annotated with accurate linguistic information. The granularity of the tagset is 3 to 5 times higher than usual tagsets. A comparison with a reference annotated corpus showed that it achieves 89% recall without any corpus training. The language resources used by the system are lexicons of stems, transducers of suffixes and transducers of generation of allomorphs. All can be easily updated, which allows users to control the evolution of the performances of the system. It has been claimed that morphological annotation of Korean text could only be performed by a morphological analysis module accessing a lexicon of morphemes. We show that it can also be performed directly with a lexicon of words and without applying morphological rules at annotation time, which speeds up annotation to 1,210 word/s. The lexicon of words is obtained from the maintainable language resources through a fully automated compilation process.<|reference_end|> | 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) - Morphological annotation of Korean with Directly
Maintainable Resources, Genoa : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3412},
primaryClass={cs.CL}
} | 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 and its rule extension SWRL to develop an integrated ontology/rule language, and 2) layering rules on top of an ontology with RuleML and OWL. Toward this end, we are developing the SWORIER system, which enables efficient automated reasoning on ontologies and rules, by translating all of them into Prolog and adding a set of general rules that properly capture the semantics of OWL. We have also enabled the user to make dynamic changes on the fly, at run time. This work addresses several of the concerns expressed in previous work, such as negation, complementary classes, disjunctive heads, and cardinality, and it discusses alternative approaches for dealing with inconsistencies in the knowledge base. In addition, for efficiency, we implemented techniques called extensionalization, avoiding reanalysis, and code minimization.<|reference_end|> | 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 preprint arXiv:0711.3419},
year={2007},
archivePrefix={arXiv},
eprint={0711.3419},
primaryClass={cs.AI}
} | 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 little debated in the past, nor are they as a part of the present standardization effort. We examine these issues. IGM has developed XML formats compatible with the emerging international standards, and we report experimental results on large-coverage lexica.<|reference_end|> | 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 used by the system can be easily updated, which allows us-ers to control the evolution of the per-formances of the system. We show that morphological annotation of Korean text can be performed directly with a lexicon of words and without morpho-logical rules.<|reference_end|> | 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 system, Jeju : Cor\'ee, R\'epublique de (2005)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3453},
primaryClass={cs.CL}
} | 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 grammar lexicalization. We carried out experiments for which we used a grammar with a very simple content and formalism, and a very informative syntactic lexicon, the lexicon-grammar of French elaborated by the LADL. Lexicalization was performed by applying the parameterized-graph approach. Our results tend to show that most information in the lexicon-grammar can be transferred into a grammar and exploited successfully for the syntactic parsing of sentences.<|reference_end|> | 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={2007},
archivePrefix={arXiv},
eprint={0711.3454},
primaryClass={cs.CL}
} | 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 of French determiners that takes the form of a recursive transition network. The result of the application of this local grammar gives deeper syntactic information than chunking or information available in treebanks. We performed the evaluation by comparison with a corpus independently annotated with information on determiners. We obtained 86% precision and 92% recall on text not tagged for parts of speech.<|reference_end|> | 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},
archivePrefix={arXiv},
eprint={0711.3457},
primaryClass={cs.CL}
} | 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 image coding scheme is proposed and evaluated, which encrypts some of the fractal parameters during fractal encoding, and thus, produces the encrypted and encoded image. The encrypted image can only be recovered by the correct key. To keep secure and efficient, only the suitable parameters are selected and encrypted through in-vestigating the properties of various fractal parameters, including parameter space, parameter distribu-tion and parameter sensitivity. The encryption process does not change the file format, keeps secure in perception, and costs little time or computational resources. These properties make it suitable for secure image encoding or transmission.<|reference_end|> | 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 technological advances have enabled the possibility of low-rate feedback from the receiver to the transmitter. The focus of this paper is on the implications of this feedback in a single-user multi-antenna system with a general model for spatial correlation. We assume a limited feedback model, that is, a coherent receiver and statistics along with B bits of quantized channel information at the transmitter. We study space-time coding with a family of linear dispersion (LD) codes that meet an additional orthogonality constraint so as to ensure low-complexity decoding. Our results show that, when the number of bits of feedback (B) is small, a space-time coding scheme that is equivalent to beamforming and does not code across time is optimal in a weak sense in that it maximizes the average received SNR. As B increases, this weak optimality transitions to optimality in a strong sense which is characterized by the maximization of the average mutual information. Thus, from a system designer's perspective, our work suggests that beamforming may not only be attractive from a low-complexity viewpoint, but also from an information-theoretic viewpoint.<|reference_end|> | 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},
primaryClass={cs.IT math.IT}
} | 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 evolution of a complex code can't be attained without maintaining a large inactive fraction. To test this hypothesis we performed computer simulations of an evolutionary toy model for Turing machines, studying the relations among fitness and coding/non-coding ratio while varying mutation and code growth rates. The results suggest that, in our model, having a large reservoir of non-coding states constitutes a great (long term) evolutionary advantage.<|reference_end|> | 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},
primaryClass={q-bio.QM cs.NE q-bio.GN}
} | 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 main framework of the algorithm is an estimation of distribution algorithm, in which an ant-miner methodology improves the individual solutions produced in each generation. Unlike our previous work (where learning is implicit), the learning in the memetic estimation of distribution algorithm is explicit, i.e. we are able to identify building blocks directly. The overall approach learns by building a probabilistic model, i.e. an estimation of the probability distribution of individual nurse-rule pairs that are used to construct schedules. The local search processor (i.e. the ant-miner) reinforces nurse-rule pairs that receive higher rewards. A challenging real world nurse rostering problem is used as the test problem. Computational results show that the proposed approach outperforms most existing approaches. It is suggested that the learning methodologies suggested in this paper may be applied to other scheduling problems where schedules are built systematically according to specific rules<|reference_end|> | 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.1057/palgrave.jors.2602308},
archivePrefix={arXiv},
eprint={0711.3591},
primaryClass={cs.NE cs.CE}
} | 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-eigenproblem based clustering method is proposed to deal with the clustering problem. Its performance is comparable to the spectral clustering algorithms but it is more efficient with computational complexity $O(n^2)$. We show that with a transitive distance and an observed property, called K-means duality, our algorithm can be used to handle data sets with complex cluster shapes, multi-scale clusters, and noise. Moreover, no parameters except the number of clusters need to be set in our algorithm.<|reference_end|> | 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 definition of the class of verbs includes several features: - They have only one essential complement, which is a direct object. - The nominal distribution of the complement is very limited, i.e., few nouns can be selected as head nouns of the complement. However, this selection is not restricted to a single noun, as would be the case for verbal idioms such as Fr. monter la garde "mount guard". - We excluded from the class constructions which are reductions of more complex constructions, e.g. Port. afinar [instrumento] com "tune [instrument] with".<|reference_end|> | 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)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3605},
primaryClass={cs.CL}
} | 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 transfer. While most phylogenetics tools implement a wide range of algorithms on phylogenetic trees, there exist only a few applications to work with phylogenetic networks, and there are no open-source libraries either. In order to improve this situation, we have developed a Perl package that relies on the BioPerl bundle and implements many algorithms on phylogenetic networks. We have also developed a Java applet that makes use of the aforementioned Perl package and allows the user to make simple experiments with phylogenetic networks without having to develop a program or Perl script by herself. The Perl package has been accepted as part of the BioPerl bundle. It can be downloaded from http://dmi.uib.es/~gcardona/BioInfo/Bio-PhyloNetwork.tgz. The web-based application is available at http://dmi.uib.es/~gcardona/BioInfo/. The Perl package includes full documentation of all its features.<|reference_end|> | 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, wherein the ring in the group ring is itself a group ring. The method is used to algebraically construct series of convolutional codes. Algebraic methods are used to compute free distances and to construct convolutional codes to prescribed distances.<|reference_end|> | 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 principle and the high nonlinear of chaotic system guarantee the numerical error is random and departure from the analytical result. Combining these two properties we can produce unilateral one-way function and provide a case of utilizing this function to construct encryption algorithm. The multiple-precision (MP) library is used to analyze nonlinear dynamics systems and achieve the code. As an example, we provide a scheme of encrypting a plaintext by employing the one-way function with Lorenz system. Since the numerical solution used in this scheme is beyond the maximum effective computation time (MECT) and it cannot satisfy the requirements of return-map analysis and phase space reconstruction, it can block some existing attacks.<|reference_end|> | 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 only gives probabilistic convergence to a correct behavior. Also, weak stabilization only gives the possibility of convergence. In this paper, we investigate the relative power of weak, self, and probabilistic stabilization, with respect to the set of problems that can be solved. We formally prove that in that sense, weak stabilization is strictly stronger that self-stabilization. Also, we refine previous results on weak stabilization to prove that, for practical schedule instances, a deterministic weak-stabilizing protocol can be turned into a probabilistic self-stabilizing one. This latter result hints at more practical use of weak-stabilization, as such algorthms are easier to design and prove than their (probabilistic) self-stabilizing counterparts.<|reference_end|> | 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},
primaryClass={cs.DC cs.DS cs.NI}
} | 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, information-based criteria, such as mutual information, are becoming popular in feature/model selections. In this work, we propose to assess classifiers in terms of normalized mutual information (NI), which is novel and well defined in a compact range for classifier evaluation. We derive close-form relations of normalized mutual information with respect to accuracy, precision, and recall in binary classifications. By exploring the relations among them, we reveal that NI is actually a set of nonlinear functions, with a concordant power-exponent form, to each performance index. The relations can also be expressed with respect to precision and recall, or to false alarm and hitting rate (recall).<|reference_end|> | 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, exploitation of lexicons and grammars, language resource management. All data are structured in XML formats, and also in more compact formats, either readable or binary, whenever necessary; the required format converters are included in the platform; the grammar formats allow for combining statistical approaches with resource-based approaches. Manually constructed lexicons for French and English, originating from the LADL, and of substantial coverage, will be distributed with the platform under LGPL-LR license.<|reference_end|> | 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 textes \'ecrits, Louvain : Belgique (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3691},
primaryClass={cs.CL}
} | 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 (intentions), the usual starting point. To help the learner to acquire these skills we propose an enhanced, electronic version of an age old method: pattern drills (henceforth PDs). While being highly regarded in the fifties, PDs have become unpopular since then, partially because of their lack of grounding (natural context) and rigidity. Despite these shortcomings we do believe in the virtues of this approach, at least with regard to the acquisition of basic linguistic reflexes or skills (automatisms), necessary to survive in the new language. Of course, the method needs improvement, and we will show here how this can be achieved. Unlike tapes or books, computers are open media, allowing for dynamic changes, taking users' performances and preferences into account. Building an electronic version of PDs amounts to building an open resource, accomodatable to the users' ever changing needs.<|reference_end|> | 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},
primaryClass={cs.CL}
} | 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 knowledge of the distribution of the process $\{X_n\}$. We present a simple procedure $g_n$ which is evaluated on the data segment $(X_0,...,X_n)$ and for which, ${\rm error}(n) = |g_{n}(x)-P(X_{n+1}=x |X_0,...,X_n)|\to 0$ almost surely for a subclass of all stationary and ergodic time series, while for the full class the Cesaro average of the error tends to zero almost surely and moreover, the error tends to zero in probability.<|reference_end|> | 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},
primaryClass={math.PR cs.IT math.IT}
} | 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 approximate to any non-trivial factor, and little progress has been made despite its importance in modeling activity allocation under uncertainty. We consider a special case that we call Feedback MAB, where the reward obtained by playing each of n independent arms varies according to an underlying on/off Markov process whose exact state is only revealed when the arm is played. The goal is to design a policy for playing the arms in order to maximize the infinite horizon time average expected reward. This problem is also an instance of a Partially Observable Markov Decision Process (POMDP), and is widely studied in wireless scheduling and unmanned aerial vehicle (UAV) routing. Unlike the stochastic MAB problem, the Feedback MAB problem does not admit to greedy index-based optimal policies. We develop a novel and general duality-based algorithmic technique that yields a surprisingly simple and intuitive 2+epsilon-approximate greedy policy to this problem. We then define a general sub-class of restless bandit problems that we term Monotone bandits, for which our policy is a 2-approximation. Our technique is robust enough to handle generalizations of these problems to incorporate various side-constraints such as blocking plays and switching costs. This technique is also of independent interest for other restless bandit problems. By presenting the first (and efficient) O(1) approximations for non-trivial instances of restless bandits as well as of POMDPs, our work initiates the study of approximation algorithms in both these contexts.<|reference_end|> | 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 (LRS) CDMA, no suboptimal detector has been found to achieve unit AME. In this letter, we obtain that the WSLAS detector with a linear per-bit complexity achieves unit AME in the LRS-CDMA with a channel load < 1/2 - 1/(4ln2) bits/s/Hz. For a practical system with any user number, a quasi LRS-CDMA is then proposed to approach the single-user performance in the high SNR regime.<|reference_end|> | 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.IT math.IT}
} | 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 detector is obtained by bounding the fixed point region with the worst initial detector. The concept of indecomposable errors developed by Verdu is applied to tighten the upper bound. In a special instance, the upper bound is reduced to that for all the local maximum likelihood detectors. The upper bound is comparable with that of the optimum detector obtained by Verdu. A lower bound on the asymptotic multiuser efficiency (AME) is then obtained. It is shown that there are nontrivial CDMA channels such that a LAS detector can achieve unit AME regardless of user number. The AME lower bound provides a means for further seeking a good set of spreading sequences and power distribution for spectral and power efficient CDMA.<|reference_end|> | 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={arXiv},
eprint={0711.3869},
primaryClass={cs.IT math.IT}
} | 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 reduces the bias of the final average estimate but increases its variance. We present two different compromises to this tradeoff: the $\mathcal{A-ND}$ algorithm modifies conventional consensus by forcing the weights to satisfy a \emph{persistence} condition (slowly decaying to zero); and the $\mathcal{A-NC}$ algorithm where the weights are constant but consensus is run for a fixed number of iterations $\hat{\imath}$, then it is restarted and rerun for a total of $\hat{p}$ runs, and at the end averages the final states of the $\hat{p}$ runs (Monte Carlo averaging). We use controlled Markov processes and stochastic approximation arguments to prove almost sure convergence of $\mathcal{A-ND}$ to the desired average (asymptotic unbiasedness) and compute explicitly the m.s.e. (variance) of the consensus limit. We show that $\mathcal{A-ND}$ represents the best of both worlds--low bias and low variance--at the cost of a slow convergence rate; rescaling the weights...<|reference_end|> | 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 math.IT math.OC}
} | 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 perspective on this problem, for which achievable rates are shown that depend on the realized actions of the adversary. Specifically, rateless codes are constructed which require a limited amount of common randomness. These codes are constructed for two kinds of AVC models. In the first the channel state cannot depend on the channel input, and in the second it can. As a byproduct, the randomized coding capacity of the AVC with state depending on the transmitted codeword is found and shown to be achievable with a small amount of common randomness. The results for this model are proved using a randomized strategy based on list decoding.<|reference_end|> | 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 introduce a probabilistic model for errors. We compute the capacity of this channel and we define an error-correction scheme based on random sparse graphs and a low-complexity decoding algorithm. By optimizing over the code degree profile, we show that this construction achieves the channel capacity in complexity which is jointly quadratic in the number of coded information bits and sublogarithmic in the error probability.<|reference_end|> | 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 normal form of its elements, some known algorithms for solving the word problem in the braid group, the major public-key cryptosystems based on the braid group, and some of the known attacks on these cryptosystems. We conclude with a discussion of future directions (which includes also a description of cryptosystems which are based on other non-commutative groups).<|reference_end|> | 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 flows in their design and deployment it is reasonable to consider the impact of work flow deployment over a Volunteer Computing infrastructure. In this case, the inter work flow I/O can lead to a significant increase in I/O demands at the work pool server. A possible solution is the use of a Peer-to- Peer based parallel computing architecture to off-load this I/O demand to the workers; where the workers can fulfill some aspects of work flow coordination and I/O checking, etc. However, achieving robustness in such a large scale system is a challenging hurdle towards the decentralized execution of work flows and general parallel processes. To increase robustness, we propose and show the merits of using an adaptive checkpoint scheme that efficiently checkpoints the status of the parallel processes according to the estimation of relevant network and peer parameters. Our scheme uses statistical data observed during runtime to dynamically make checkpoint decisions in a completely de- centralized manner. The results of simulation show support for our proposed approach in terms of reduced required runtime.<|reference_end|> | 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 the b-chromatic number is equal to the chromatic number for every induced subgraph.<|reference_end|> | 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 give a nonlinear formula to define the reputation of raters and objects. We also provide an iterative algorithm that superlinearly converges to the unique vector of reputations and this for any rating matrix. In contrast to classical outliers detection, no evaluation is discarded in this method but each one is taken into account with different weights for the reputation of the objects. The complexity of one iteration step is linear in the number of evaluations, making our algorithm efficient for large data set. Experiments show good robustness of the reputation of the objects against cheaters and spammers and good detection properties of cheaters and spammers.<|reference_end|> | 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 and other properties are derived by working within the group ring. Quantum codes are constructed from the dual-containing codes.<|reference_end|> | 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 prove that this problem is fixed parameter tractable, when k is chosen as the parameter. Previously this was only known for restricted classes of directed graphs. The main new ingredient in our approach is a lemma that shows that given a locally optimal out-branching of a directed graph in which every arc is part of at least one out-branching, either an out-branching with at least k leaves exists, or a path decomposition with width O(k^3) can be found. This enables a dynamic programming based algorithm of running time 2^{O(k^3 \log k)} n^{O(1)}, where n=|V(D)|.<|reference_end|> | 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 general, considered as rather obscure and difficult to use. The proposed formal presentation of its trace constitutes a simple and pedagogical approach for teaching Prolog or for implementing Prolog tracers. It is a form of declarative specification for the tracers. The trace model introduced here is only one example to illustrate general problems relating to tracers and observing processes. Observing processes know, from observed processes, only their traces. The issue is then to be able to reconstitute, by the sole analysis of the trace, part of the behaviour of the observed process, and if possible, without any loss of information. As a matter of fact, our approach highlights qualities of the Prolog resolution box model which made its success, but also its insufficiencies.<|reference_end|> | 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 by compression technique (the latter based on Normalized Compression Distance, NCD). We show how to decrease the complexity of the considered books introducing several modifications in them. We measure how the information contained in each book is maintained using a clustering error measure. We find experimentally that the best way to keep the clustering error is by means of modifications in the most frequent words. We explain the details of these information distortions and we compare with other kinds of modifications like random word distortions and unfrequent word distortions. Finally, some phenomenological explanations from the different empirical results that have been carried out are presented.<|reference_end|> | 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={0711.4075},
primaryClass={cs.IT math.IT}
} | 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 social knowledge in this context by exploiting collaboration among users, little research has been done to quantify the current level of user collaboration in these communities. This paper introduces two metrics to quantify the level of collaboration: content reuse and shared interest. Using these two metrics, this paper shows that the current level of collaboration in CiteULike and Connotea is consistently low, which significantly limits the potential of harnessing the social knowledge in communities. This study also discusses implications of these findings in the context of recommendation and reputation systems.<|reference_end|> | 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 number of vertices minus the size of the graph's shortest index code. We show that the Network Coding solvability of each specific multiple unicast network is completely determined by the entropy (as well as by the shortest index code) of the directed graph that occur by identifying each source node with each corresponding target node. Shannon's information inequalities can be used to calculate upper bounds on a graph's entropy as well as calculating the size of the minimal index code. Recently, a number of new families of so-called non-shannon-type information inequalities have been discovered. It has been shown that there exist communication networks with a capacity strictly less than required for solvability, but where this fact cannot be derived using Shannon's classical information inequalities. Based on this result we show that there exist graphs with an entropy that cannot be calculated using only Shannon's classical information inequalities, and show that better estimate can be obtained by use of certain non-shannon-type information inequalities.<|reference_end|> | 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 dynamically instantiated instructions is turned into a program without them that exhibits on execution the same behaviour by interaction with some service. The complexity of the translations differ considerably, whereas the services concerned are equally simple. However, the service concerned in the case of the simpler translation is far more powerful than the service concerned in the other case.<|reference_end|> | 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},
eprint={0711.4217},
primaryClass={cs.PL}
} | 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 models: furnace model, crystallization model and spiral model are proposed and analyzed. Techniques of software/knowware co-engineering are introduced. A software component whose knowledge is replaced by knowware is called mixware. An object and component oriented development schema of mixware is introduced. In particular, the tower model and ladder model for mixware development are proposed and discussed. Finally, knowledge service and knowware based Web service are introduced and compared with Web service. In summary, knowware, software and hardware should be considered as three equally important underpinnings of IT industry. Ruqian Lu is a professor of computer science of the Institute of Mathematics, Academy of Mathematics and System Sciences. He is a fellow of Chinese Academy of Sciences. His research interests include artificial intelligence, knowledge engineering and knowledge based software engineering. He has published more than 100 papers and 10 books. He has won two first class awards from the Academia Sinica and a National second class prize from the Ministry of Science and Technology. He has also won the sixth Hua Loo-keng Mathematics Prize.<|reference_end|> | 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={0711.4309},
primaryClass={cs.SE cs.AI cs.CY}
} | 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 differences may arise when simulating the process for American option holder has more rights, spelling that the option can be exercised at anytime before its maturity. Our method is dynamic-hedging method.<|reference_end|> | 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 robustness and flexibility in application, whilst not making significant sacrifices in terms of multiuser efficiency. We present results for sparse random codes of two types, with and without modulation. Simple microscopic consideration on system samples would suggest differences in the phase space of the two models, but we demonstrate that the thermodynamic results and metastable states are equivalent in the minimum bit error rate detector. We analyse marginal properties of interactions and also make analogies to constraint satisfiability problems in order to understand qualitative features of detection and metastable states. This may have consequences for developing algorithmic methods to escape metastable states, thus improving decoding performance.<|reference_end|> | 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 techniques (outliers), and novel organization of data base structure. The paper shows how they can be integrated to retrieve information from generic databases using long (text-based) queries. Two important problems are analyzed in the paper. On the one hand, how to detect "false positives" when the distance among the documents is very low and there is actual similarity. On the other hand, we propose a way to structure a document database which similarities distance estimation depends on the length of the selected text. Finally, the experimental evaluations that have been carried out to study previous problems are shown.<|reference_end|> | 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={10.1109/ITW.2008.4578672},
archivePrefix={arXiv},
eprint={0711.4388},
primaryClass={cs.IR cs.IT math.IT}
} | 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 states, such as partial response channels, or they can have an infinite state-space, such as time-varying fading channels. We optimize recently-proposed information rate bounds for such channels, which make use of auxiliary finite-state machine channels (FSMCs). Our main contribution in this paper is to provide iterative expectation-maximization (EM) type algorithms to optimize the parameters of the auxiliary FSMC to tighten these bounds. We provide an explicit, iterative algorithm that improves the upper bound at each iteration. We also provide an effective method for iteratively optimizing the lower bound. To demonstrate the effectiveness of our algorithms, we provide several examples of partial response and fading channels, where the proposed optimization techniques significantly tighten the initial upper and lower bounds. Finally, we compare our results with an improved variation of the \emph{simplex} local optimization algorithm, called \emph{Soblex}. This comparison shows that our proposed algorithms are superior to the Soblex method, both in terms of robustness in finding the tightest bounds and in computational efficiency. Interestingly, from a channel coding/decoding perspective, optimizing the lower bound is related to increasing the achievable mismatched information rate, i.e., the information rate of a communication system where the decoder at the receiver is matched to the auxiliary channel, and not to the original channel.<|reference_end|> | 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},
eprint={0711.4406},
primaryClass={cs.IT math.IT}
} | 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 the existing primary (higher priority) users. For such a scenario, a secondary user usually has to trade off between two conflicting goals at the same time: one is to maximize its own transmit throughput; and the other is to minimize the amount of interference it produces at each primary receiver. In this paper, we study this fundamental tradeoff from an information-theoretic perspective by characterizing the secondary user's channel capacity under both its own transmit-power constraint as well as a set of interference-power constraints each imposed at one of the primary receivers. In particular, this paper exploits multi-antennas at the secondary transmitter to effectively balance between spatial multiplexing for the secondary transmission and interference avoidance at the primary receivers. Convex optimization techniques are used to design algorithms for the optimal secondary transmit spatial spectrum that achieves the capacity of the secondary transmission. Suboptimal solutions for ease of implementation are also presented and their performances are compared with the optimal solution. Furthermore, algorithms developed for the single-channel transmission are also extended to the case of multi-channel transmission whereby the secondary user is able to achieve opportunistic spectrum sharing via transmit adaptations not only in space, but in time and frequency domains as well.<|reference_end|> | 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={0711.4414},
primaryClass={cs.IT math.IT}
} | 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 its adjoint code needs to be rebuilt. For earlier versions, the adjoint of OPA was written by hand at a high development cost. We use the Automatic Differentiation tool TAPENADE to build mechanicaly the tangent and adjoint codes of OPA. We validate the differentiated codes by comparison with divided differences, and also with an identical twin experiment. We apply state-of-the-art methods to improve the performance of the adjoint code. In particular we implement the Griewank and Walther's binomial checkpointing algorithm which gives us an optimal trade-off between time and memory consumption. We apply a specific strategy to differentiate the iterative linear solver that comes from the implicit time stepping scheme<|reference_end|> | 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 Laboratoire
Jean Kuntzmann), Benjamin Dauvergne (INRIA Sophia Antipolis)},
journal={arXiv preprint arXiv:0711.4444},
year={2007},
archivePrefix={arXiv},
eprint={0711.4444},
primaryClass={cs.MS cs.CE}
} | 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 reasonable values for test data. A method of principal component analysis (RS-PCA) is also proposed using regular simplex expressions, which allows easy interpretation of the principal components. The proposed methods apply to variable selection problem of categorical data USCensus1990 data. The proposed methods give appropriate criterion for the variable selection problem of categorical<|reference_end|> | 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 frame forests, obtained by applying a non-probabilistic deep grammar parser and some post-processing to the text. The second new idea concerns filtering of incorrect frames detected in the parsed text and is motivated by an observation that verbs which take similar arguments tend to have similar frames. This phenomenon is described in terms of newly introduced co-occurrence matrices. Using co-occurrence matrices, we split filtering into two steps. The list of valid arguments is first determined for each verb, whereas the pattern according to which the arguments are combined into frames is computed in the following stage. Our best extracted dictionary reaches an $F$-score of 45%, compared to an $F$-score of 39% for the standard frame-based BHT filtering.<|reference_end|> | 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},
primaryClass={cs.CL}
} | 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 argued that in low occupation number statistical systems, the second law of thermodynamics yields an increase of thermal entropy and a canonic energy distribution. However, in high occupation number statistical systems, the same law for the same reasons yields an increase of information and a Benford's law/power-law energy distribution. It is therefore, plausible, that eventually the heat death is not necessarily the end of the universe.<|reference_end|> | 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, hierarchical, and recursive manner. The representation can exploit any computable regularity in objects to compactly describe them, while also being capable of representing random objects as raw data. A set of rules uniformly dictates the interpretation of the representation into raw signal, which makes it possible to ask what pattern a given raw signal contains. Also, it allows simple separation of the information that we wish to ignore from that which we measure, by using a set of maps to delineate the a priori parts of the objects, leaving only the information in the structure. Using the representation, we introduce a measure of information in general objects relative to structures defined by the set of maps. We point out that the common prescription of encoding objects by strings to use Kolmogorov complexity is meaningless when, as often is the case, the encoding is not specified in any way other than that it exists. Noting this, we define the measure directly in terms of the structures of the spaces in which the objects reside. As a result, the measure is defined relative to a set of maps that characterize the structures. It turns out that the measure is equivalent to Kolmogorov complexity when it is defined relative to the maps characterizing the structure of natural numbers. Thus, the formulation gives the larger class of objects a meaningful measure of information that generalizes Kolmogorov complexity.<|reference_end|> | 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-ray image calibration and three-dimensional optical localizers in order to reduce radiation exposure while increasing accuracy and reliability of the surgical procedure for pedicle screw insertion. Instrumentation using transpedicular screw fixation was performed: in a first group, a conventional surgical procedure was carried out with 26 patients (138 screws); in a second group, a navigated surgical procedure (virtual fluoroscopy) was performed with 26 patients (140 screws). Evaluation of screw placement in every case was done by using plain X-rays and post-operative computer tomography scan. A 5 per cent cortex penetration (7 of 140 pedicle screws) occurred for the computer-assisted group. A 13 per cent penetration (18 of 138 pedicle screws) occurred for the non computer-assisted group. The radiation running time for each vertebra level (two screws) reached 3.5 s on average in the computer-assisted group and 11.5 s on average in the non computer-assisted group. The operative time for two screws on the same vertebra level reaches 10 min on average in the non computer-assisted group and 11.9 min on average in the computer-assisted group. The fluoroscopy-based (two-dimensional) navigation system for pedicle screw insertion is a safe and reliable procedure for surgery in the lower thoracic and lumbar spine.<|reference_end|> | 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
ortho-traumato), Ahmad Eid (CHU-Grenoble ortho-traumato), St'ephane Plaweski
(CHU-Grenoble ortho-traumato)},
journal={Proceedings of the Institution of Mechanical Engineers. Part H,
Journal of Engineering in Medicine 221, 7 (2007) 813-20},
year={2007},
archivePrefix={arXiv},
eprint={0711.4516},
primaryClass={cs.OH}
} | 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 reproduces the movements of the real probe, which sends back ultrasound images and force feedback. This tool could be used to perform ultrasound examinations in small health care centers or from isolated sites. The objective of this study was to prove, under real conditions, the feasibility and reliability of the TER system in detecting abdominal aortic and iliac aneurysms. METHODS: Fifty-eight patients were included in 2 centers in Brest and Grenoble, France. The remote examination was compared with the reference standard, the bedside examination, for aorta and iliac artery diameter measurement, detection and description of aneurysms, detection of atheromatosis, the duration of the examination, and acceptability. RESULTS: All aneurysms (8) were detected by both techniques as intramural thrombosis and extension to the iliac arteries. The interobserver correlation coefficient was 0.982 (P < .0001) for aortic diameters. The rate of concordance between 2 operators in evaluating atheromatosis was 84% +/- 11% (95% confidence interval). CONCLUSIONS: Our study on 58 patients suggests that the TER system could be a reliable, acceptable, and effective robot-based system for performing remote abdominal aortic ultrasound examinations. Research is continuing to improve the equipment for general abdominal use.<|reference_end|> | 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 Troccaz (TIMC), Philippe Cinquin (TIMC)},
journal={Journal of ultrasound in medicine : official journal of the
American Institute of Ultrasound in Medicine 26, 11 (2007) 1611-6},
year={2007},
archivePrefix={arXiv},
eprint={0711.4523},
primaryClass={cs.OH}
} | 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 remaining constant over the entire coding block. On the one hand, in the wideband limit the minimum achievable energy per nat required for reliable transmission, as a random variable, converges in probability to certain deterministic quantity. On the other hand, the exponential decay rate of the outage probability, termed as the wideband outage exponent, characterizes how the number of parallel channels, {\it i.e.}, the ``bandwidth'', should asymptotically scale in order to achieve a target outage probability at a target energy per nat. We examine two scenarios: when the transmitter has no channel state information and adopts uniform transmit power allocation among parallel channels; and when the transmitter is endowed with an one-bit channel state feedback for each parallel channel and accordingly allocates its transmit power. For both scenarios, we evaluate the wideband minimum energy per nat and the wideband outage exponent, and discuss their implication for system performance.<|reference_end|> | 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 math.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 provide better topological view of the Internet. An inherent problem in current algorithms is their extensive use of heuristics. Such heuristics incur unbounded errors which are spread over all inferred relationships. We propose a near-deterministic algorithm for solving the ToR inference problem. Our algorithm uses as input the Internet core, which is a dense sub-graph of top-level ASes. We test several methods for creating such a core and demonstrate the robustness of the algorithm to the core's size and density, the inference period, and errors in the core. We evaluate our algorithm using AS-level paths collected from RouteViews BGP paths and DIMES traceroute measurements. Our proposed algorithm deterministically infers over 95% of the approximately 58,000 AS topology links. The inference becomes stable when using a week worth of data and as little as 20 ASes in the core. The algorithm infers 2-3 times more peer-to-peer relationships in edges discovered only by DIMES than in RouteViews edges, validating the DIMES promise to discover periphery AS edges.<|reference_end|> | 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 X_j \neq \emptyset.$ Two sets $X,Y\in {\cal F}$ are in the same overlap class if there is a series $X=X_1,X_2, ..., X_k=Y$ of sets of ${\cal F}$ in which each $X_iX_{i+1}$ overlaps. In this note, we focus on efficiently identifying all overlap classes in $O(n+\sum_{i=1}^m |X_i|)$ time. We thus revisit the clever algorithm of Dahlhaus of which we give a clear presentation and that we simplify to make it practical and implementable in its real worst case complexity. An useful variant of Dahlhaus's approach is also explained.<|reference_end|> | 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},
archivePrefix={arXiv},
eprint={0711.4573},
primaryClass={cs.DS}
} | 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-correcting MDS stabilizer codes over finite fields.<|reference_end|> | 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 as being a heavy user of spreadsheets internally. The approach to spreadsheet risk assessment and spreadsheet audit is by the use of trained computer auditors and data handlers. This, by definition, limits the use of our specialist spreadsheet audit tool to such trained staff. In order to tackle the growing use of spreadsheets, a new way of approaching the problem has been piloted. The aim is to issue all staff who come across spreadsheets with a simple to use analysis and risk assessment tool, based on the departmental software SpACE (Spreadsheet Audit & Compliance Examination).<|reference_end|> | 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 technology. The increasing focus on achieving regulatory and other forms of compliance over key technology assets has made it clear that organizations must regard spreadsheets as an enterprise resource and account for them when developing an overall compliance strategy. This paper provides the reader with a set of practical strategies for addressing spreadsheet compliance from an organizational perspective. It then presents capabilities offered in the 2007 Microsoft Office System which can be used to help customers address compliance challenges.<|reference_end|> | 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 problem. Our algorithm is intended only for nondegenerate cases, in which case the solution is a 1-dimensional curve. Our first main contribution is a definition of a condition number measuring reciprocal distance to degeneracy that can distinguish poor and well conditioned instances of this problem. (Degenerate problems would be infinitely ill conditioned in our framework.) Our second contribution, which is the main novelty of our algorithm, is an analysis showing that its running time is bounded in terms of the condition number of the problem instance as well as $n$ and the polynomial degrees.<|reference_end|> | 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.4656},
primaryClass={cs.CG cs.NA}
} | 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 Copeland voting are computationally resistant to many, yet not all, types of constructive control and that they also provide broad resistance to bribery. We study a parameterized version of Copeland voting, denoted by Copeland^alpha where the parameter alpha is a rational number between 0 and 1 that specifies how ties are valued in the pairwise comparisons of candidates in Copeland elections. We establish resistance or vulnerability results, in every previously studied control scenario, for Copeland^alpha, for each rational alpha, 0 <alpha < 1. In particular, we prove that Copeland^0.5, the system commonly referred to as ``Copeland voting,'' provides full resistance to constructive control. Among the systems with a polynomial-time winner problem, this is the first natural election system proven to have full resistance to constructive control. Results on bribery and fixed-parameter tractability of bounded-case control proven for Copeland^0 and Copeland^1 in [FHHR07] are extended to Copeland^alpha for each rational alpha, 0 < alpha < 1; we also give results in more flexible models such as microbribery and extended control.<|reference_end|> | 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.4759},
primaryClass={cs.GT cs.CC cs.MA}
} | 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 user. The channel setting is equivalent to an interference channel with degraded message sets (with the cognitive user having access to the licensed user's message). An achievable region and an outer bound is derived for such a network setting. It is shown that under certain conditions, the achievable region is optimal for a portion of the capacity region that includes sum capacity.<|reference_end|> | 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 math.IT}
} | 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-algebras S(t-a,t+a) and S(t'-a,t'+a) are asymptotically independent as a tends to 0. We show this in the strong sense that Shannon's mutual information between these two sigma-algebras tends to zero as a tends to 0. Some generalizations and quantitative estimates are provided also.<|reference_end|> | 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 the walk. One obtains a generalization, namely orienteering with time-windows (also referred to as TSP with time-windows), if each node v has a specified time-window [R(v), D(v)] and a node v is counted as visited by the walk only if v is visited during its time-window. For the time-window problem, an O(\log \opt) approximation can be achieved even for directed graphs if the algorithm is allowed quasi-polynomial time. However, the best known polynomial time approximation ratios are O(\log^2 \opt) for undirected graphs and O(\log^4 \opt) in directed graphs. In this paper we make some progress towards closing this discrepancy, and in the process obtain improved approximation ratios in several natural settings. Let L(v) = D(v) - R(v) denote the length of the time-window for v and let \lmax = \max_v L(v) and \lmin = \min_v L(v). Our results are given below with \alpha denoting the known approximation ratio for orienteering (without time-windows). Currently \alpha = (2+\eps) for undirected graphs and \alpha = O(\log^2 \opt) in directed graphs. 1. An O(\alpha \log \lmax) approximation when R(v) and D(v) are integer valued for each v. 2. An O(\alpha \max{\log \opt, \log \frac{\lmax}{\lmin}}) approximation. 3. An O(\alpha \log \frac{\lmax}{\lmin}) approximation when no start and end points are specified. In particular, if \frac{\lmax}{\lmin} is poly-bounded, we obtain an O(\log n) approximation for the time-window problem in undirected graphs.<|reference_end|> | 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 capabilities, i.e, the relay in our model. In the discrete memoryless (DM) case, we derive lower and upper bounds on channel capacity. The lower bound is obtained by a coding scheme at the relay that consists in a combination of codeword splitting, Gel'fand-Pinsker binning, and a decode-and-forward scheme. The upper bound is better than that obtained by assuming that the channel state is available at the source and the destination as well. For the Gaussian case, we also derive lower and upper bounds on channel capacity. The lower bound is obtained by a coding scheme which is based on a combination of codeword splitting and Generalized dirty paper coding. The upper bound is also better than that obtained by assuming that the channel state is available at the source, the relay, and the destination. The two bounds meet, and so give the capacity, in some special cases for the degraded Gaussian case.<|reference_end|> | 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},
eprint={0711.4864},
primaryClass={cs.IT math.IT}
} | 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 landscape of a problem instance by {\em never going upwards} in energy. ChainSAT is a \emph{focused} algorithm in the sense that it considers only variables occurring in unsatisfied clauses. We show by extensive numerical investigations that ChainSAT and other focused algorithms solve large $K$-SAT instances almost surely in linear time, up to high clause-to-variable ratios $\alpha$; for example, for K=4 we observe linear-time performance well beyond the recently postulated clustering and condensation transitions in the solution space. The performance of ChainSAT is a surprise given that by design the algorithm gets trapped into the first local energy minimum it encounters, yet no such minima are encountered. We also study the geometry of the solution space as accessed by stochastic local search algorithms.<|reference_end|> | 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},
doi={10.1073/pnas.0712263105},
archivePrefix={arXiv},
eprint={0711.4902},
primaryClass={cs.DS cond-mat.stat-mech cs.AI}
} | 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 price for any change we may ask for. We show polynomial-time algorithms for our version of bribery for a broad range of voting protocols, including plurality, veto, approval, and utility based voting. In addition to our polynomial-time algorithms we provide NP-completeness results for a couple of our nonuniform bribery problems for weighted voters, and a couple of approximation algorithms for NP-complete bribery problems defined in [FHH06] (in particular, an FPTAS for plurality-weighted-$bribery problem).<|reference_end|> | 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 placed on the patient's skin and can be used with the patient in the lateral or dorsal supine position was tested on cadavers and laboratory pigs in order to allow successive modifications. The current control system is based on voice recognition. The range of vision is 360 degrees with an angle of 160 degrees . Twenty-three procedures were performed. RESULTS: The tests made it possible to advance the prototype on a variety of aspects, including reliability, steadiness, ergonomics, and dimensions. The ease of installation of the robot, which takes only 5 minutes, and the easy handling made it possible for 21 of the 23 procedures to be performed without an assistant. CONCLUSION: The LER is a camera holder guided by the surgeon's voice that can eliminate the need for an assistant during laparoscopic surgery. The ease of installation and manufacture should make it an effective and inexpensive system for use on patients in the lateral and dorsal supine positions. Randomized clinical trials will soon validate a new version of this robot prior to marketing.<|reference_end|> | 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 Rambeaud},
journal={Journal of Endourology 21, 8 (2007) 911-4},
year={2007},
doi={10.1089/end.2006.0328},
archivePrefix={arXiv},
eprint={0711.4944},
primaryClass={cs.OH}
} | 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 determine the order of polynomial growth in quadratic time.<|reference_end|> | 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 user chooses one channel to sense and access in each slot and collects a reward determined by the state of the chosen channel. The problem is to design a sensing policy for channel selection to maximize the average reward, which can be formulated as a multi-arm restless bandit process. In this paper, we study the structure, optimality, and performance of the myopic sensing policy. We show that the myopic sensing policy has a simple robust structure that reduces channel selection to a round-robin procedure and obviates the need for knowing the channel transition probabilities. The optimality of this simple policy is established for the two-channel case and conjectured for the general case based on numerical results. The performance of the myopic sensing policy is analyzed, which, based on the optimality of myopic sensing, characterizes the maximum throughput of a multi-channel opportunistic communication system and its scaling behavior with respect to the number of channels. These results apply to cognitive radio networks, opportunistic transmission in fading environments, and resource-constrained jamming and anti-jamming.<|reference_end|> | 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},
eprint={0712.0035},
primaryClass={cs.NI}
} | 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 multiplexing. New exact closed-form expressions are derived for the variance of the mutual information. In contrast to previous results, our new expressions apply for systems with both arbitrary numbers of antennas and arbitrary-length channels. Simplified expressions are also presented for high and low SNR regimes. The analytical variance results are used to provide accurate analytical approximations for the distribution of the mutual information and the outage capacity.<|reference_end|> | 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.1109/TIT.2008.924685},
archivePrefix={arXiv},
eprint={0712.0042},
primaryClass={cs.IT math.IT}
} | 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 following simple connection between the redundancy $R$ and the number of bits $W$ necessary for representation of source's probabilities in computer's memory ($R$ is assumed to be small): \begin{equation*} W \lesssim \eta \log_2 \frac{m}{R}, \end{equation*} where $m$ is the cardinality of the source's alphabet, and $\eta \leqslant 1$ is an implementation-specific constant. In case of binary alphabets ($m=2$) we show that there exist codes for which $\eta = 1/2$, and in $m$-ary case ($m > 2$) we show that there exist codes for which $\eta = m/(m+1)$. In general case, however (which includes designs relying on progressive updates of frequency counters), we show that $\eta = 1$. Usefulness of these results for practical designs of source coding algorithms is also discussed.<|reference_end|> | 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.<|reference_end|> | 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^{-5/3}$. Therefore, word-based codes can attain the same redundancy as block-codes while being much less complex. We also consider uniform on the output codes, the benefit of which is the lack of a running synchronization error. For such codes $\bar N^{-1} \lesssim R \lesssim \bar N^{-1}$, except for a case when all input symbols are equiprobable, when $R \leqslant \bar N^{-2}$ for infinitely many $\bar N$.<|reference_end|> | 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 conditional distribution of $X_1$ given only $\{X_n\}_{n=1-K}^0$. The least such value of $K$ is called the memory length. We give a rather complete analysis of the problems of universally estimating the least such value of $K$, both in the backward sense that we have just described and in the forward sense, where one observes successive values of $\{X_n\}$ for $n \geq 0$ and asks for the least value $K$ such that the conditional distribution of $X_{n+1}$ given $\{X_i\}_{i=n-K+1}^n$ is the same as the conditional distribution of $X_{n+1}$ given $\{X_i\}_{i=-\infty}^n$. We allow for finite or countably infinite alphabet size.<|reference_end|> | 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={0712.0105},
primaryClass={math.PR cs.IT math.IT}
} | 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 programs must include comprehensive testing. Several forms of testing are possible, but logic inspection is recommended for module testing. Logic inspection appears to be feasible for spreadsheet developers to do, and logic inspection appears to be safe and effective.<|reference_end|> | 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. Abstractions and patterns useful in the implementation of the interval operations are described. A number of benchmarks and comparisons to bit-blit based implementations on standard document images are provided.<|reference_end|> | 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 algebraic dual which are also representative on the multiplicative semigroup of the algebra. When the algebra is free, this notion is indeed equivalent to that of rational functions of automata theory. For the sake of applications, the range of coefficients has been considerably broadened, i.e. extended to semirings, so that the results could be specialized to the boolean and multiplicity cases. This requires some caution (use of ``positive formulas'', iteration replacing inversion, stable submodules replacing finite-rank families for instance). For the theory and its applications has been created a rational calculus which can, in return, be applied to harness Sweedler's duals. A new theorem of rational closure and application to Hopf algebras of use in Physics and Combinatorics is provided. The concrete use of this ``calculus'' is eventually illustrated on an example.<|reference_end|> | 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.MP}
} | 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 classification. This paper analyzes demonstrates several additional properties of that conditional distribution. The paper first shows that we can reconstruct, up to class labels, the class posterior distribution $P(\omega|x)$ given $P(\omega\eq\omega'|x,x')$, gives a procedure for recovering the class labels, and gives an asymptotically Bayes-optimal classification procedure. It also shows, given such an optimal similarity measure, how to construct a classifier that outperforms the nearest neighbor classifier and achieves Bayes-optimal classification rates. The paper then analyzes Bayesian similarity in a framework where a classifier faces a number of related classification tasks (multitask learning) and illustrates that reconstruction of the class posterior distribution is not possible in general. Finally, the paper identifies a distinct class of classification problems using $P(\omega\eq\omega'|x,x')$ and shows that using $P(\omega\eq\omega'|x,x')$ to solve those problems is the Bayes optimal solution.<|reference_end|> | 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 methods is discussed. The approach is related to variable kernel Experimental results on character recognition and 3D object recognition are presented..<|reference_end|> | 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 an alternative framework for learning in visual object recognition, that of learning the view-generalization function. Using the view-generalization function, an observer can perform Bayes-optimal 3D object recognition given one or more 2D training views directly, without the need for a separate model acquisition step. The paper shows that view generalization functions can be computationally practical by restating two widely-used methods, the eigenspace and linear combination of views approaches, in a view generalization framework. The paper relates the approach to recent methods for object recognition based on non-uniform blurring. The paper presents results both on simulated 3D ``paperclip'' objects and real-world images from the COIL-100 database showing that useful view-generalization functions can be realistically be learned from a comparatively small number of training examples.<|reference_end|> | 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 coordinate information and able of using arbitrary 3D models internally. Furthermore, it demonstrates that such systems do not require more training views than Bayes-optimal 3D model-based systems. For building computer vision systems, these results imply that using view-based or appearance-based techniques with carefully constructed combination of evidence mechanisms may not be at a disadvantage relative to 3D model-based systems. For computational approaches to human vision, they show that it is impossible to distinguish view-based and 3D model-based techniques for 3D object recognition solely by comparing the performance achievable by human and 3D model-based systems.}<|reference_end|> | 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 definition is given by a deterministic finite automaton with output. In short, the sequence is automatic.<|reference_end|> | 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 several additional results on local sentences. The first one is a new decidability result in the case of local sentences whose function symbols are at most unary: one can decide, for every regular cardinal k whether a local sentence phi has a model of order type k. Secondly we show that this result can not be extended to the general case. Assuming the consistency of an inaccessible cardinal we prove that the set of local sentences having a model of order type omega_2 is not determined by the axiomatic system ZFC + GCH, where GCH is the generalized continuum hypothesis<|reference_end|> | 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 saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.