Quadrics on Riemannian spaces of constant curvature. Separation of variables and connection with the Gaudin magnet

Integrable systems associated with separation of the variables in real Riemannian spaces of constant curvature are considered. An isomorphism between all such systems and the hyperbolic Gaudin magnet is established. This isomorphism is used in a classification of all coordinate systems that admit separation of the variables, the basis of which is the classification of the correspondingL operators of the Gaudin magnet.Leningrad State University. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 91, No. 1, pp. 83–111, April, 1992.     

Sputtering yield of chromium by argon and xenon ions with energies from 50 to 500 eV

A radioactive tracer technique is described for the quantitative measurement of the sputtering yield of a target material electroplated on a copper substrate. Sputtering yields of chromium by argon and xenon ions with energies from 50 to 500 eV are reported. The ion beams, having a current density ranging from 0.01 to 0.1 mA/cm² at an operating pressure of 2×10^–5 Torr, were produced by a low-energy ion gun. The sputtered atoms were collected on an aluminum foil surrounding the target. ⁵¹Cr was used as the tracer isotope. The results indicate that the radioactive tracer technique is sensitive enough in measuring the extremely small amount of sputtered material at low ion currents and low ion energies.     

Bank-office Process Management in the Financial Services: a Simulation Approach Using a Model Generator

For the last ten years or so, developments in simulation software and methodology have been focused in two areas: (1) automating the model-building process; and (2) interfacing with other techniques and systems. That both academic and commercial research continues to be carried out in these areas is evidence of the continued popularity of the simulation technique. The most popular application areas where simulation modelling is used include manufacturing (engineering and process), warehousing and communications; not surprisingly, research and developments have therefore been concentrated in these areas. This paper describes the development of a simulation model generator for a different application area, that of clerical office processing of paper and documents for financial service companies. It outlines the reasons why there is a need for such a model generator and discusses the initial design requirements. The paper goes on to detail the developments and re-defined criteria required as the model generator brief changes as a result of practical applications.     

Dynamic Point Location in General Subdivisions

The dynamic planar point location problem is the task of maintaining a dynamic set S of n nonintersecting (except possibly at endpoints) line segments in the plane under the following operations:

• Locate (: point): Report the segment immediately above , i.e., the first segment intersected by an upward vertical ray starting at ;

• Insert (: segment): Add segment to the collection of segments;

• Delete (: segment): Remove segment from the collection of segments.

We present a solution which requires space O(n) and has query and insertion time O(log n log log n) and deletion time O(log²n). The bounds for insertions and deletions are amortized. A query time below O(log²n) was previously only known for monotone subdivisions and subdivisions consisting of horizontal segments and required nonlinear space.     

A Faster Deterministic Maximum Flow Algorithm

Cheriyan and Hagerup developed a randomized algorithm to compute the maximum flow in a graph with n nodes and m edges in O(mn + n² log²n) expected time. The randomization is used to efficiently play a certain combinatorial game that arises during the computation. We give a version of their algorithm where a general version of their game arises. Then we give a strategy for the game that yields a deterministic algorithm for computing the maximum flow in a directed graph with n nodes and m edges that runs in time O(mn(log_{m/n log n}n)). Our algorithm gives an O(mn) deterministic algorithm for all m/n = Ω(n^ε) for any positive constant ε, and is currently the fastest deterministic algorithm for computing maximum flow as long as m/n = ω(log n).     

Properties of neodymium-doped aluminophosphate laser glasses

Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 56, No. 1, pp. 90–95, January, 1992.     

The elastoplastic stressed state of a half-plane under local nonstationary heating

We solve the thermoplastic problem for a semi-infinite plate under local nonstationary heating by heat sources. The physical equations are taken to be the relations of the nonisothermic theory of plastic flow associated with the Mises fluidity condition. The solution of the problem is constructed by the method of integral equations and the self-correcting method of sequential loading, where time is taken as the loading parameter. We carry out numerical computations of the stresses in the case of heating a plate with heat output by normal-circular heat sources. We study the problem of optimization of heating regimes in order to introduce favorable residual compressive stresses (from the point of view of hardness) in a given region of a half-plane. Two figures.Translated fromMatematicheskie Metody i Fiziko-Mekhanicheskie Polya, Issue 27, 1988, pp. 29–34.     

On the existence of <Emphasis Type="Bold">1, 3</Emphasis>P <Emphasis Type="Bold">o</Emphasis> resonances in H<Superscript>-</Superscript> between n = 2 and 3 H thresholds

We examine the influence of relativistic and QED effects on the existence of the ^1,3P ^o H^- resonances between n = 2 and 3 hydrogen thresholds, the relativistic and QED corrections and the coupling effects between the high singlet and triplet states are considered as first-order perturbations. We firstly obtain accurate non-relativistic resonant energies and widths of fifteen ¹P ^o resonances, and fifteen ³P ^o resonances. The fifteen ¹P ^o resonances are classified to be ₃ (2, 0) ^- _n ( 4 ? n ? 12) and ₃ (1, 1) ⁺ _n ( 3 ? n ? 8). The fifteen ³P ^o resonances are classified to be ₃ (2, 0) ⁺ _n ( 3 ? n ? 12) and ₃ (1, 1) ^- _n ( 4 ? n ? 8). We found there exist six Feshbach resonances for ₃ (2, 0) ^- _n (¹P ^o ) series, four Feshbach resonances for ₃ (1, 1) ⁺ _n (¹P ^o ) series, seven Feshbach resonances for ₃ (2, 0) ⁺ _n (³P ^o ) series, and three Feshbach resonances for ₃ (1, 1) ^- _n (¹P ^o ) series. Received 22 February 2002 Published online 24 September 2002