Heat-shrink plastic tubing seals joints in glass tubing

Small units of standard glass apparatus held together by short lengths of transparent heat-shrinkable polyolefin tubing. The tubing is shrunk over glass O-ring type connectors having O-rings but no lubricant

Around Kolmogorov complexity: basic notions and results

Algorithmic information theory studies description complexity and randomness and is now a well known field of theoretical computer science and mathematical logic. There are several textbooks and monographs devoted to this theory where one can find the detailed exposition of many difficult results as well as historical references. However, it seems that a short survey of its basic notions and main results relating these notions to each other, is missing. This report attempts to fill this gap and covers the basic notions of algorithmic information theory: Kolmogorov complexity (plain, conditional, prefix), Solomonoff universal a priori probability, notions of randomness (Martin-L\"of randomness, Mises--Church randomness), effective Hausdorff dimension. We prove their basic properties (symmetry of information, connection between a priori probability and prefix complexity, criterion of randomness in terms of complexity, complexity characterization for effective dimension) and show some applications (incompressibility method in computational complexity theory, incompleteness theorems). It is based on the lecture notes of a course at Uppsala University given by the author

The Complexity of Orbits of Computably Enumerable Sets

The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, \E, such that the question of membership in this orbit is $\Sigma^1_1$-complete. This result and proof have a number of nice corollaries: the Scott rank of \E is \wock +1; not all orbits are elementarily definable; there is no arithmetic description of all orbits of \E; for all finite $\alpha \geq 9$, there is a properly $\Delta^0_\alpha$ orbit (from the proof). A few small corrections made in this versionComment: To appear in the Bulletion of Symbolic Logi

Crystal structure analysis of intermetallic compounds

Study concerns crystal structures and lattice parameters for a number of new intermetallic compounds. Crystal structure data have been collected on equiatomic compounds, formed between an element of the Sc, Ti, V, or Cr group and an element of the Co or Ni group. The data, obtained by conventional methods, are presented in an easily usable tabular form

Computer aided design and manufacturing of composite propfan blades for a cruise missile wind tunnel model

One of the propulsion concepts being investigated for future cruise missiles is advanced unducted propfans. To support the evaluation of this technology applied to the cruise missile, a joint DOD and NASA test project was conducted to design and then test the characteristics of the propfans on a 0.55-scale, cruise missile model in a NASA wind tunnel. The configuration selected for study is a counterrotating rearward swept propfan. The forward blade row, having six blades, rotates in a counterclockwise direction, and the aft blade row, having six blades, rotates in a clockwise direction, as viewed from aft of the test model. Figures show the overall cruise missile and propfan blade configurations. The objective of this test was to evaluate propfan performance and suitability as a viable propulsion option for next generation of cruise missiles. This paper details the concurrent computer aided design, engineering, and manufacturing of the carbon fiber/epoxy propfan blades as the NASA Lewis Research Center

MMIC technology for advanced space communications systems

The current NASA program for 20 and 30 GHz monolithic microwave integrated circuit (MMIC) technology is reviewed. The advantages of MMIC are discussed. Millimeter wavelength MMIC applications and technology for communications systems are discussed. Passive and active MMIC compatible components for millimeter wavelength applications are investigated. The cost of a millimeter wavelength MMIC's is projected

Degree spectra for transcendence in fields

We show that for both the unary relation of transcendence and the finitary relation of algebraic independence on a field, the degree spectra of these relations may consist of any single computably enumerable Turing degree, or of those c.e. degrees above an arbitrary fixed $\Delta^0_2$ degree. In other cases, these spectra may be characterized by the ability to enumerate an arbitrary $\Sigma^0_2$ set. This is the first proof that a computable field can fail to have a computable copy with a computable transcendence basis