Reaction of methyl bromopropiolate with diamines as a method of synthesis of imidazolidine derivatives

A convenient method of synthesis of 2-(methoxycarbonylmethylene)-substituted imidazolidines and imidazolidinium bromides, and also of bicyclic diazo compounds has been developed starting from methyl bromopropiolate and ethylenediamine and its derivatives.Translated from Khimiya Geterotsiklicheskikh Soedinenii, No. 9, pp. 1205–1208, September, 1991.     

Free and nonsteady-state oscillations of elastic fluid-filled systems situated on an elastic base

We develop a method of computing the nonsteady-state and free oscillations of a framed elastic structure situated on an elastic base and containing an ideal compressible fluid. The solution uses the method of integral transforms in conjunction with the method of orthogonal polynomials. In the transform space the problem reduces to systems of linear algebraic equations. The Fourier transform is applied to return to the original space. Examples of the computation are given.Translated fromDinamicheskie Sistemy, No. 6, 1987, pp. 69–72.     

Isolation of singularities in the density and the kernel of a two-dimensional integral equation for complex boundary surfaces

We consider the solution of integral equations in problems of three-dimensional electromagnetic fields in piecewise-homogeneous media. An algorithm is proposed for analytical isolation of singularities in the kernel and the density of the integral equation of potential theory for the case of complex boundary surfaces.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 56, pp. 14–17, 1985     

Numerical analysis of near electromagnetic fields of a parabolic cylinder and a paraboloid of revolution

Translated from Chislennye Metody Resheniya Obratnykh Zadach Matematicheskoi Fiziki, pp. 119–127.     

Asymptotic description of solutions of the fourth Painlevé equations on the stokes rays analogs

The proof of the existence of classical solutions is given for the Painlevé type nonlinear ordinary differential equations. The solutions have asymptotic formulas, which can be obtained by the isomonodromic deformation method.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova, Vol. 179, pp. 101–109, 1989.     

Analytic calculation of scaling dimensions: Tricritical hard squares and critical hard hexagons

The finite-size corrections, central chargesc, and scaling dimensionsx of tricritical hard squares and critical hard hexagons are calculated analytically. This is achieved by solving the special functional equation or inversion identity satisfied by the commuting row transfer matrices of these lattice models at criticality. The results are expressed in terms of Rogers dilogarithms. For tricritical hard squares we obtainc=7/10,x=3/40, 1/5, 7/8, 6/5 and for hard hexagons we obtainc=4/5,x=2/15, 4/5, 17/15, 4/3, 9/5, in accord with the predictions of conformal and modular invariance.     

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.