Effective field and the Bloch-Siegert shift at bichromatic excitation of multiphoton EPR

The dynamics of multiphoton transitions in a two-level spin system excited by transverse microwave and longitudinal RF fields with the frequencies ω_mw and ω_rf, respectively, is analyzed. The effective time-independent Hamiltonian describing the “dressed” spin states of the “spin + bichromatic field” system is obtained by using the Krylov-Bogoliubov-Mitropolsky averaging method. The direct detection of the time behavior of the spin system by the method of nonstationary nutations makes it possible to identify the multiphoton transitions for resonances ω₀ = ω_mw + rω_rf (ω₀ is the central frequency of the EPR line, r = 1, 2), to measure the amplitudes of the effective fields of these transitions, and to determine the features generated by the inhomogeneous broadening of the EPR line. It is shown that the Bloch-Siegert shifts for multiphoton resonances at the inhomogeneous broadening of spectral lines reduce only the nutation amplitude but do not change their frequencies.     

Influence of Azimuthal Structure of Surface Waves on Efficiency of their Excitation by Tubular Electron Beams

The excitation of eigen surface waves by tubular electron beams in cylindrical discharge devices is studied. The influence of the wave‐field azimuthal structure on the excitation efficiency and nonlinear stage of the plasmabeam instability is investigated both numerically and analytically. Analytical expressions for the saturation amplitude and excitation efficiency of the wave under study are derived. They are found to agree well with results obtained by numerical modelling of the plasma‐beam interaction presented in this paper. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Method of lines with boundary elements for 1‐D transient diffusion‐reaction problems

Time‐dependent differential equations can be solved using the concept of method of lines (MOL) together with the boundary element (BE) representation for the spatial linear part of the equation. The BE method alleviates the need for spatial discretization and casts the problem in an integral format. Hence errors associated with the numerical approximation of the spatial derivatives are totally eliminated. An element level local cubic approximation is used for the variable at each time step to facilitate the time marching and the nonlinear terms are represented in a semi‐implicit manner by a local linearization at each time step. The accuracy of the method has been illustrated on a number of test problems of engineering significance. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006     

Inclusion of carbon nanotubes in a TiO2 sol-gel matrix

We report here the successful inclusion of carbon nanotubes (CNs) into a TiO₂ matrix prepared by a sol-gel method. The presence of CNs in the sol-gel matrix and the structure of the film were analyzed principally by transmission electron microscopy. Complementary information about the behavior of embedded carbon nanotubes versus heat treatment and ion irradiation were obtained by X-ray photoelectron spectroscopy. The elaboration of an inorganic matrix containing embedded carbon nanotubes leads to a new nanocomposite. The possible applications of this nanocomposite are discussed.     

An evolution operator in semiclassical electrodynamics

An evolution operatior is described, which acts on the operators of a problem to take it into the solutions of the corresponding problem of semiclassical electrodynamics.Translated from Izvestiya Vysshikh Uchebnykh Zavedenii, Fizika, No. 12, pp. 66–69, November, 1981.     

Nonlinear electric dipole polarizations of centrosymmetric media at the interaction of fundamental and second harmonic waves

Dominant nonlinear electric dipole polarizations at the interaction of fundamental and second harmonic waves in centrosymmetric media without and with memory are treated in this paper. The process of forming a permanent spatially periodic quadratic susceptibility grating in the medium with memory is described from the phenomenological point of view.Dedicated to the Czechoslovak Student Movement '89.     

Randomized greedy matching

We consider a randomized version of the greedy algorithm for finding a large matching in a graph. We assume that the next edge is always randomly chosen from those remaining. We analyze the performance of this algorithm when the input graph is fixed. We show that there are graphs for which this Randomized Greedy Algorithm (RGA) usually only obtains a matching close in size to that guaranteed by worst-case analysis (i.e., half the size of the maximum). For some classes of sparse graphs (e.g., planar graphs and forests) we show that the RGA performs significantly better than the worst-case. Our main theorem concerns forests. We prove that the ratio to maximum here is at least 0.7690…, and that this bound is tight.     

Solving the problem of contact equilibrium of a punch and an elastic body

The variational problem of contact equilibrium of a punch and an elastic body is considered. An equivalent formulation of the problem is given in variational inequality form. Existence and uniqueness of the solution is investigated in a particular case. A penalty method is proposed for approximate solution of the problem.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 56, pp. 97–103, 1985.     

Stationary turbulent closure via the Hopf functional equation

Exact closed-form solutions are exhibited for the Hopf equation for stationary incompressible 3D Navier-Stokes flow, for the cases of homogeneous forced flow (including a solution with depleted nonlinearity) and inhomogeneous flow with arbitrary boundary conditions. This provides an exact method for computing two- and higher-point moments, given the mean flow.     

A Recursive Algorithm for Order Cycle-time that Minimizes Logistics Cost

A firm's logistics cost, including shipping and inventory-carrying, is a substantial percentage of its sales. Nevertheless, typical inventory-control methods ignore or insufficiently represent the shipping cost. This paper describes a recursive algorithm that determines the reorder cycle-time that minimizes total logistics cost. It allows for a realistic accounting of shipping cost, which is modelled here as a function of shipping distance and weight. The algorithm uses a relaxation procedure to identify a suitable initial approximation to the optimal order cycle-time and then, through a series of recursive steps, moves to the optimal result. We demonstrate the algorithm with a single item, with a group of items that share a common order cycle, and with multi-items when item demands are random variables. Experience with this algorithm indicates that it converges to the optimal result in a very few steps.