Mark 3 wideband digital recorder in perspective

The tape recorder used for the Mark 3 data acquisition and processing system is compared with earlier very long baseline interferometry recorders. Wideband 33-1/3 kbpi digital channel characteristics of instrumentation recorders and of a modern video cassette recorder are illustrated. Factors which influenced selection of the three major commercial components (transport, heads, and tape) are discussed. A brief functional description and the reasons for development of efficient signal electronics and necessary auxiliary control electronics are given. The design and operation of a digital bit synchronizer is illustrated as an example of the high degree of simplicity achieved

Metal evaporated tape: state of the art and prospects

Thin metallic films are the first choice for media in advanced rigid disk systems. For helical scan tape recorders thin metal films have become more important. The high signal-to-noise ratio per unit of track width allows very high densities. The preparation techniques and materials properties of the thin-film coating of metal evaporated (ME) are described. Important aspects are the size of the grains, the geometry of the columnar structure and the associated anisotropy. The consequences for the recording process are explained. Tribological and corrosion properties also help to determine the usefulness of a recording tape. Corrosion, wear, protection layers and lubricating organic films are briefly discussed

Descriptive Complexity of Deterministic Polylogarithmic Time and Space

We propose logical characterizations of problems solvable in deterministic polylogarithmic time (PolylogTime) and polylogarithmic space (PolylogSpace). We introduce a novel two-sorted logic that separates the elements of the input domain from the bit positions needed to address these elements. We prove that the inflationary and partial fixed point vartiants of this logic capture PolylogTime and PolylogSpace, respectively. In the course of proving that our logic indeed captures PolylogTime on finite ordered structures, we introduce a variant of random-access Turing machines that can access the relations and functions of a structure directly. We investigate whether an explicit predicate for the ordering of the domain is needed in our PolylogTime logic. Finally, we present the open problem of finding an exact characterization of order-invariant queries in PolylogTime.Comment: Submitted to the Journal of Computer and System Science