8,248 research outputs found

    Fiber optic wavelength division multiplexing: Principles and applications in telecommunications and spectroscopy

    Get PDF
    Design and fabrication tradeoffs of wavelength division multiplexers are discussed and performance parameters are given. The same multiplexer construction based on prism gratings has been used in spectroscopic applications, in the wavelength region from 450 to 1600 nm. For shorter wavelengths down to 200 nm, a similar instrument based on longer fibers (500 to 1000 micrometer) has been constructed and tested with both a fiber array and a photodiode detector array at the output

    Universal deformation rings of modules for algebras of dihedral type of polynomial growth

    Full text link
    Let k be an algebraically closed field, and let \Lambda\ be an algebra of dihedral type of polynomial growth as classified by Erdmann and Skowro\'{n}ski. We describe all finitely generated \Lambda-modules V whose stable endomorphism rings are isomorphic to k and determine their universal deformation rings R(\Lambda,V). We prove that only three isomorphism types occur for R(\Lambda,V): k, k[[t]]/(t^2) and k[[t]].Comment: 11 pages, 2 figure

    A Development Environment for Visual Physics Analysis

    Full text link
    The Visual Physics Analysis (VISPA) project integrates different aspects of physics analyses into a graphical development environment. It addresses the typical development cycle of (re-)designing, executing and verifying an analysis. The project provides an extendable plug-in mechanism and includes plug-ins for designing the analysis flow, for running the analysis on batch systems, and for browsing the data content. The corresponding plug-ins are based on an object-oriented toolkit for modular data analysis. We introduce the main concepts of the project, describe the technical realization and demonstrate the functionality in example applications

    CMS Barrel Pixel Detector Overview

    Get PDF
    The pixel detector is the innermost tracking device of the CMS experiment at the LHC. It is built from two independent sub devices, the pixel barrel and the end disks. The barrel consists of three concentric layers around the beam pipe with mean radii of 4.4, 7.3 and 10.2 cm. There are two end disks on each side of the interaction point at 34.5 cm and 46.5 cm. This article gives an overview of the pixel barrel detector, its mechanical support structure, electronics components, services and its expected performance.Comment: Proceedings of Vertex06, 15th International Workshop on Vertex Detector

    Compact Frontend-Electronics and Bidirectional 3.3 Gbps Optical Datalink for Fast Proportional Chamber Readout

    Get PDF
    The 9600 channels of the multi-wire proportional chamber of the H1 experiment at HERA have to be read out within 96 ns and made available to the trigger system. The tight spatial conditions at the rear end flange require a compact bidirectional readout electronics with minimal power consumption and dead material. A solution using 40 identical optical link modules, each transferring the trigger information with a physical rate of 4 x 832 Mbps via optical fibers, has been developed and commisioned. The analog pulses from the chamber can be monitored and the synchronization to the global HERA clock signal is ensured.Comment: 13 pages, 10 figure

    Entanglement can increase asymptotic rates of zero-error classical communication over classical channels

    Full text link
    It is known that the number of different classical messages which can be communicated with a single use of a classical channel with zero probability of decoding error can sometimes be increased by using entanglement shared between sender and receiver. It has been an open question to determine whether entanglement can ever increase the zero-error communication rates achievable in the limit of many channel uses. In this paper we show, by explicit examples, that entanglement can indeed increase asymptotic zero-error capacity, even to the extent that it is equal to the normal capacity of the channel. Interestingly, our examples are based on the exceptional simple root systems E7 and E8.Comment: 14 pages, 2 figur

    Universal deformation rings for the symmetric group S_4

    Full text link
    Let k be an algebraically closed field of characteristic 2, and let W be the ring of infinite Witt vectors over k. Let S_4 denote the symmetric group on 4 letters. We determine the universal deformation ring R(S_4,V) for every kS_4-module V which has stable endomorphism ring k and show that R(S_4,V) is isomorphic to either k, or W[t]/(t^2,2t), or the group ring W[Z/2]. This gives a positive answer in this case to a question raised by the first author and Chinburg whether the universal deformation ring of a representation of a finite group with stable endomorphism ring k is always isomorphic to a subquotient ring of the group ring over W of a defect group of the modular block associated to the representation.Comment: 12 pages, 2 figure

    Вимоги видавничого відділу ІМФЕ ім. М. Т. Рильського до оформлення авторами рукописів

    Get PDF
    Industrial parts are manufactured to tolerances as no production process is capable of delivering perfectly identical parts. It is unacceptable that a plan for a manipulation task that was determined on the basis of a CAD model of a part fails on some manufactured instance of that part, and therefore it is crucial that the admitted shape variations are systematically taken into account during the planning of the task. We study the problem of orienting a part with given admitted shape variations by means of pushing with a single frictionless jaw. We use a very general model for admitted shape variations that only requires that any valid instance must contain a given convex polygon PI while it must be contained in another convex polygon PE. The problem that we solve is to determine, for a given h, the sequence of h push actions that puts all valid instances of a part with given shape variation into the smallest possible interval of final orientations. The resulting algorithm runs in O(hn) time, where n=|PI|+|PE|
    corecore