Special features of magnetic susceptibility dispersion in nanocrystalline magnets

It is demonstrated theoretically that the initial (both elastic and viscous) magnetic susceptibility components for nanocrystalline magnets caused by the processes of rotations (in the region of linear response) have resonant rather than relaxation character typical already for the susceptibility component caused by displacements of domain boundaries. __________ Translated from Izvestiya Vysshikh Uchebnykh Zavedenii, Fizika, No. 6, pp. 88–92, June, 2007.     

On structure of small contractions of odd dimensional projective varieties

Let X be a smooth projective variety of dimension 2k-1 (k≥3) over the complex number field. Assume that fR: X→Y is a small contraction such that every irreducible component Ei of the exceptional locus of fR is a smooth subvariety of dimension k. It is shown that each Ei is isomorphic to the k-dimensional projective space Pk, the k-dimensional hyperquadric surface Qk in Pk 1, or a linear Pk-1-bundle over a smooth curve.     

The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻_n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s₁,…,s_k,t₁,…,t_k, the graph contains k vertex disjoint paths joining s_r to t_r for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

Analysis of heterojunction resonant cavity-enhanced Schottky photodiodes by using two-valley transport model

The article concerns heterojunction resonant cavity-enhanced (RCE) Schottky photodiodes with GaAs in the absorption layer. The quantum efficiency and linear pulse response have thoroughly been analysed. For the first time, the response of a heterojunction photodiode has been modelled by the phenomenological model for a two-valley semiconductor. The results obtained have shown that the satellite valleys, as well as the parasitic time constant, significantly influence the response and, accordingly, have to be taken into account when analysing and optimizing RCE photodetectors.     

Polygaussian Approximation and Adaptive Processing of an Electrocardiographic Signal Against Interference Background

We present the results of a study and substantiation of the method of polygaussian approximation of an electrocardiographic (ECG) signal against interference background during computer analysis of that signal. It is proposed to use adaptive processing of ECG signals, which allows one to increase the signal-to-interference ratio by over 7 dB.     

An alternative approach for non-linear optimal control problems based on the method of moments

We propose an alternative method for computing effectively the solution of non-linear, fixed-terminal-time, optimal control problems when they are given in Lagrange, Bolza or Mayer forms. This method works well when the nonlinearities in the control variable can be expressed as polynomials. The essential of this proposal is the transformation of a non-linear, non-convex optimal control problem into an equivalent optimal control problem with linear and convex structure. The method is based on global optimization of polynomials by the method of moments. With this method we can determine either the existence or lacking of minimizers. In addition, we can calculate generalized solutions when the original problem lacks of minimizers. We also present the numerical schemes to solve several examples arising in science and technology.     

Features of polystyrene synthesis in the presence of (diphenylbutadiene)tricarbonylchromium

Features of radical polymerization of styrene in the presence of (diphenylbutadiene)tricarbonylchromium were studied.