Total Electron Content Measurements in the Ionosphere Disturbed by High-Power High-Frequency Waves by the Methods of Incoherent Scattering of Radio Waves and Radio Sounding by Glonass Satellite Signal

Radiophysics and Quantum Electronics - We present the results of comparing the total electron content measurements based on GLONASS satellite signals and the EISCAT UHF incoherent scatter radar...     

Three-Dimensional Analysis of the Polarization of Scattered Neutrons of the Thermal,Cold, and Very Cold Spectrum in Studies of the Magnetic Dynamics of Endometallofullerenes

Journal of Surface Investigation: X-ray, Synchrotron and Neutron Techniques - A method for studying the magnetic dynamics of endofullerenes M@C2n (2n = 60, 70, …) and their derivatives,...     

On S-Normal Spaces and Pre GS-Closed Functions

In this paper the notion of pre gs-closed functions is introduced and investigated. Presemiclosed functions are pre gs-closed but not conversely. It is shown that s-normality is preserved under continuous pre gs-closed surjections.     

Laser spectroscopy of the 1s HFS of H-like ions at a bunched beam in the storage ring ESR

The investigation of the 1s HFS provides a good possibility for testing QED effects in a combination of a strong electric and magnetic field. Here, we report about the laserspectroscopic measurements of the ground state hyperfine splitting in ²⁰⁷Pb⁸¹⁺. To handle this M1-transition in the infrared optical regime with its long lifetime, we developed a new detection technique using a bunched ion beam. For the observation of fluorescence light, a new mirror system is adapted to the emission characteristics from an ion beam at relativistic velocities. This revised version was published online in July 2006 with corrections to the Cover Date.     

Bounds for rectilinear crossing numbers

A rectilinear drawing of a graph is one where each edge is drawn as a straight-line segment, and the rectilinear crossing number of a graph is the minimum number of crossings over all rectilinear drawings. We describe, for every integer k ≥ 4, a class of graphs of crossing number k, but unbounded rectilinear crossing number. This is best possible since the rectilinear crossing number is equal to the crossing number whenever the latter is at most 3. Further, if we consider drawings where each edge is drawn as a polygonal line segment with at most one break point, then the resulting crossing number is at most quadratic in the regular crossing number. © 1993 John Wiley & Sons, Inc.