3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects

We present a new data structure for a set of n convex simply-shaped fat objects in the plane, and use it to obtain efficient and rather simple solutions to several problems including (i) vertical ray shooting—preprocess a set of n non-intersecting convex simply-shaped flat objects in 3-space, whose xy-projections are fat, for efficient vertical ray shooting queries, (ii) point enclosure—preprocess a set C of n convex simply-shaped fat objects in the plane, so that the k objects containing a query point p can be reported efficiently, (iii) bounded-size range searching— preprocess a set C of n convex fat polygons, so that the k objects intersecting a “not-too-large” query polygon can be reported efficiently, and (iv) bounded-size segment shooting—preprocess a set C as in (iii), so that the first object (if exists) hit by a “not-too-long” oriented query segment can be found efficiently. For the first three problems we construct data structures of size O(λ_s(n)log³n), where s is the maximum number of intersections between the boundaries of the (xy-projections) of any pair of objects, and λ_s(n) is the maximum length of (n, s) Davenport-Schinzel sequences. The data structure for the fourth problem is of size O(λ_s(n)log²n). The query time in the first problem is O(log⁴n), the query time in the second and third problems is O(log³n + klog²n), and the query time in the fourth problem is O(log³n).

We also present a simple algorithm for computing a depth order for a set as in (i), that is based on the solution to the vertical ray shooting problem. (A depth order for , if exists, is a linear order of , such that, if K₁, K₂ and K₁ lies vertically above K₂, then K₁ precedes K₂.) Unlike the algorithm of Agarwal et al. (1995) that might output a false order when a depth order does not exist, the new algorithm is able to determine whether such an order exists, and it is often more efficient in practical situations than the former algorithm.     

Alloying by high dose ion implantation of iron into magnesium and aluminium

Alloys of the systems Fe–Al (mixable over the whole concentration range) and Fe–Mg (insoluble with each other) were produced by implantation of Fe ions into Al and Mg, respectively. The implantation energy was 200 keV and the ion doses ranged from 1 × 10₁₄ to 9 × 10₁₇cm^-2The obtained implantation profiles were determined by Auger electron spectroscopy depth profiling. Maximum iron concentrations reached were up to 60 at.% for implantation into Al and 94 at.% for implantation into Mg. Phase analysis of the implanted layers was performed by conversion electron Mössbauer spectroscopy and X‐ray diffraction. For implantation into Mg, two different kinds of Mössbauer spectra were obtained: at low doses paramagnetic doublets indicating at least two different iron sites and at high doses a dominant ferromagnetic six‐line‐pattern with a small paramagnetic fraction. The X‐ray diffraction pattern concluded that in the latter case a dilated αiron lattice is formed. For implantation into Al, the Mössbauer spectra were doublet structures very similar to those obtained at amorphous Fe–Al alloys produced by rapid quenching methods. They also indicated at least two different main iron environments. For the highest implanted sample a ferromagnetic six‐line‐pattern with magnetic field values close to those of Fe₃Al appeared.     

Logarithmic temperature dependence of the conductivity of the two-dimensional metal

We report on the first observation and studies of a weak delocalizing logarithmic temperature dependence of the conductivity, which causes the conductivity of the 2D metal to increase as T decreases down to 16 mK. The prefactor of the logarithmic dependence is found to decrease gradually with density, to vanish at a critical density n _c , 2∼2×10¹² cm⁻², and then to have the opposite sign at n>n _c ,2. The second critical density sets the upper limit on the existence region of the 2D metal, whereas the conductivity at the critical point, G _c ,2∼120e ²/h, sets an upper (low-temperature) limit on its conductivity. Pis’ma Zh. éksp. Teor. Fiz. 68, No. 6, 497–501 (25 September 1998) Published in English in the original Russian journal. Edited by Steve Torstveit.     

The signature theorem and some related questions

Some corollaries of the Hirzebruch-Thom signature theorem are discussed. The multiplicativity of the signature and the naturalness of the Pontryagin classes for coverings in the case of ℚ-homology manifolds is proved. A geometric proof of Hirzebruch’s well-known “functional equation” for the virtual signature is outlined. Bibliography: 25 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 231, 1995, pp. 197–209. Translated by N. Yu. Netsvetaev.     

On lower bounds of moderate large deviations of tests and estimators

New lower bounds for probabilities of large deviations of tests and estimators are proposed. These bounds cover the cases of moderate and Cramér-type large deviations. Bibliography: 12 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 216, 1994, pp. 52–61. Translated by the author.