电子直线加速器束流均方根发射度变化方程

本文导出了考虑外场和束流效应后束流均方根发射度平方变化方程的一般表达式,并就仅考虑外场,仅考虑空间电荷场和仅考虑尾场等三种特殊情况进行了分析。     

A compactness result for Kähler Ricci solitons

In this paper we prove a compactness result for compact Kähler Ricci gradient shrinking solitons. If (Mi,gi) is a sequence of Kähler Ricci solitons of real dimension n?4, whose curvatures have uniformly bounded Ln/2 norms, whose Ricci curvatures are uniformly bounded from below and μ(gi,1/2)?A (where μ is Perelman's functional), there is a subsequence (Mi,gi) converging to a compact orbifold (M_∞,g_∞) with finitely many isolated singularities, where g_∞ is a Kähler Ricci soliton metric in an orbifold sense (satisfies a soliton equation away from singular points and smoothly extends in some gauge to a metric satisfying Kähler Ricci soliton equation in a lifting around singular points).     

Carathéodory's method for a class of second order differential equations on the half-line

The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate boundary value problems for a class of second order differential equations on the half-line. Some applications are presented to illustrate the potential of this method.     

Enumerating disjunctions and conjunctions of paths and cuts in reliability theory

Let G=(V,E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of source-sink pairs of vertices of G, an important problem that arises in the computation of network reliability is the enumeration of minimal subsets of edges (arcs) that connect/disconnect all/at least one of the given source-sink pairs of P. For undirected graphs, we show that the enumeration problems for conjunctions of paths and disjunctions of cuts can be solved in incremental polynomial time. Furthermore, under the assumption that P consists of all pairs within a given vertex set, we also give incremental polynomial time algorithm for enumerating all minimal path disjunctions and cut conjunctions. For directed graphs, the enumeration problem for cut disjunction is known to be NP-complete. We extend this result to path conjunctions and path disjunctions, leaving open the complexity of the enumeration of cut conjunctions. Finally, we give a polynomial delay algorithm for enumerating all minimal sets of arcs connecting two given nodes s₁ and s₂ to, respectively, a given vertex t₁, and each vertex of a given subset of vertices T₂.     

Bifurcation and Isochronicity at Infinity in a Class of Cubic Polynomial Vector Fields

In this paper, we study the appearance of limit cycles from the equator and isochronicity of infinity in polynomial vector fields with no singular points at infinity. We give a recursive formula to compute the singular point quantities of a class of cubic polynomial systems, which is used to calculate the first seven singular point quantities. Further, we prove that such a cubic vector field can have maximal seven limit cycles in the neighborhood of infinity. We actually and construct a system that has seven limit cycles. The positions of these limit cycles can be given exactly without constructing the Poincare cycle fields. The technique employed in this work is essentially different from the previously widely used ones. Finally, the isochronous center conditions at infinity are given.     

ON DIRECT METHOD OF SOLUTION FOR A CLASS OF SINGULAR INTEGRAL EQUATIONS

In this article, by introducing characteristic singular integral operator and associate singular integral equations (SIEs), the authors discuss the direct method of solution for a class of singular integral equations with certain analytic inputs. They obtain both the conditions of solvability and the solutions in closed form. It is noteworthy that the method is different from the classical one that is due to Lu.     

Wait-and-switch stochastic model of the non-Debye relaxation. Derivation of the Burr survival probability

Stochastic mechanism of relaxation, in which a dipole waits until a favourable condition for reorientation exists, is discussed. Assuming that an imposed direction of a dipole moment may be changed when a migrating defect reaches the dipole, we present a mathematically rigorous scheme relating the local random characteristics of a macroscopic system to its effective relaxation behaviour. We derive a relaxation function (the Burr survival probability) that is characterized by the stretched exponential or the power-law behaviour.     

Time Asymptotic Behaviour for a One-Velocity Transport Operator with Maxwell Boundary Condition

This paper is concerned with the spectral analysis of a one-velocity transport operator with Maxwell boundary condition in L ₁-space. After a detailed spectral analysis it is shown that the associated Cauchy problem is governed by a C ₀-semigroup. Next, we discuss the irreducibility of the transport semigroup. In particular, we show that the transport semigroup is irreducible. Finally, a spectral decomposition of the solutions into an asymptotic term and a transient one which will be estimated for smooth initial data is given.     

Modulation of Particle Concentrations in the Interference Laser Radiation Field

Spatial redistribution of microparticles in a suspension on exposure to the interference laser field depending on the parameters of the particles and the field characteristics has been analyzed theoretically. Results of experimental investigations are presented that illustrate the capture of an ensemble of polymeric small spheres and also of the lymphocytes of human blood and other microparticles in a liquid in the interference radiation bands of the He–Ne laser.     

Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices

The sum of the largest eigenvalues of a symmetric matrix is a nonsmooth convex function of the matrix elements. Max characterizations for this sum are established, giving a concise characterization of the subdifferential in terms of a dual matrix. This leads to a very useful characterization of the generalized gradient of the following convex composite function: the sum of the largest eigenvalues of a smooth symmetric matrix-valued function of a set of real parameters. The dual matrix provides the information required to either verify first-order optimality conditions at a point or to generate a descent direction for the eigenvalue sum from that point, splitting a multiple eigenvalue if necessary. Connections with the classical literature on sums of eigenvalues and eigenvalue perturbation theory are discussed. Sums of the largest eigenvalues in the absolute value sense are also addressed.This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday.The work of this author was supported by the National Science Foundation under grants CCR-8802408 and CCR-9101640.The work of this author was supported in part during a visit to Argonne National Laboratory by the Applied Mathematical Sciences subprogram of the Office of Energy Research of the U.S. Department of Energy under contract W-31-109-Eng-38, and in part during a visit to the Courant Institute by the U.S. Department of Energy under Contract DEFG0288ER25053.