Development of nine-channel 10-micrometer (Hg, Cd)Te pushbroom IR/CCD system

The engineering development of the 9-channel detector array is documented. The development of the array demonstrates the feasibility of a self scanned multi-element infrared detector focal plane. Procedures for operating the array are outlined

Search for eta-mesic Helium with the WASA-at-COSY detector

A search for the 4He-eta bound state via exclusive measurement of the excitation function for the dd->3Heppi- reaction, was performed at the Cooler Synchrotron COSY-Juelich with the WASA-at-COSY detection system. The data were taken during a slow acceleration of the beam from 2.185 GeV/c to 2.400 GeV/c crossing the kinematic threshold for the eta production in the dd -> 4He-eta reaction at 2.336 GeV/c. The corresponding excess energy in the 4He-eta system varied from -51.4 MeV to 22 MeV. The shape of the excitation function for the dd -> 3Heppi- was examined. No signal of the 4He-eta bound state was observed in the excitation function.Comment: 4 pages, 5 figures, to appear in proceedings of MESON201

Preparation and characteristics of superconducting cuprate thin films: Nd(2-x)Ce(x)CuO4 and substrated Bi-system

Characteristics of the electron-doped-type Nd(sub 2-x)Ce(sub x)CuO4 system and substituted Bi-system were studied using the high quality thin film samples grown by rf magnetron sputtering and/or subsequent heat treatment. The Nd(sub 2-x)Ce(sub x)CuO4 samples with excellent superconducting properties were obtained in thin films and their optical and X-ray photoelectron spectroscopy (XPS) studies were performed with regard to the Ce content and reducing treatment. Substituted BiSr-Ln-Cu-O thin films were prepared and growth conditions for Bi-system with 2-2-1-2 and 2-2-2-2 phases were found. Moreover, a new 2-2-1-2 phase in the simple Bi-Sr-Cu-O system was fabricated by thin film processing and 80 K superconductivity was obtained

Shortest Reconfiguration of Colorings Under Kempe Changes

International audienc

Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph

In this paper, we address the problem of enumerating all induced subtrees in an input k-degenerate graph, where an induced subtree is an acyclic and connected induced subgraph. A graph G = (V, E) is a k-degenerate graph if for any its induced subgraph has a vertex whose degree is less than or equal to k, and many real-world graphs have small degeneracies, or very close to small degeneracies. Although, the studies are on subgraphs enumeration, such as trees, paths, and matchings, but the problem addresses the subgraph enumeration, such as enumeration of subgraphs that are trees. Their induced subgraph versions have not been studied well. One of few example is for chordless paths and cycles. Our motivation is to reduce the time complexity close to O(1) for each solution. This type of optimal algorithms are proposed many subgraph classes such as trees, and spanning trees. Induced subtrees are fundamental object thus it should be studied deeply and there possibly exist some efficient algorithms. Our algorithm utilizes nice properties of k-degeneracy to state an effective amortized analysis. As a result, the time complexity is reduced to O(k) time per induced subtree. The problem is solved in constant time for each in planar graphs, as a corollary

Event Reconstruction for a DIRC

Monte Carlo simulations were made for a possible DIRC at the WASA detector at COSY. A statistical method for pattern recognition is presented and the possible angle resolution and velocity precision achieved are discussed.Comment: Minor changes in text. Figures updated. accepted by JINS