标量场与电磁场相互作用体系中的Gasimir效应

摘要本文用Feynmann路径积分方法,研究了一种U(1)规范场理论中的Casimir效应。在一圈图近似下,计算了带电标量场在两个平行的理想金属板之间的Casimir能,并对低维情况进行了讨论。     

COMPLETENESS FOR H_q~p(D) SPACE

Abstract Let D be arbitrary simply connected domain with at least two boundary points.We have introduced a kind of analytic functions' space H_■~V (D) (p≥1, q>0)and shown that it is a complete linear space with respect to the norm ■·||_(H_q~p(D)).     

The self-consistent mean spherical approximation for the one-component plasma

The consequences of choosing the adjustable hard-core diameter in the mean spherical approximation for the one-component plasma so as to achieve thermodynamic consistency between the energy and compressibility equations are investigated. Such a choice is found to be possible only for >8.5 and, although the resulting correlation functions are discontinuous, the height of the main peak in the static structure factor is remarkably accurate. Two especially noteworthy aspects of the thermodynamic results are that the compressibility equation is much more accurate than in any previous approximation free of input from computer simulations and that the nonstatic part of the internal energy has a ^1/4 dependence in the strong coupling limit in agreement with Monte Carlo data.     

Approximation algorithms for scheduling unrelated parallel machines

We consider the following scheduling problem. There arem parallel machines andn independent jobs. Each job is to be assigned to one of the machines. The processing of jobj on machinei requires timep _ij . The objective is to find a schedule that minimizes the makespan.Our main result is a polynomial algorithm which constructs a schedule that is guaranteed to be no longer than twice the optimum. We also present a polynomial approximation scheme for the case that the number of machines is fixed. Both approximation results are corollaries of a theorem about the relationship of a class of integer programming problems and their linear programming relaxations. In particular, we give a polynomial method to round the fractional extreme points of the linear program to integral points that nearly satisfy the constraints.In contrast to our main result, we prove that no polynomial algorithm can achieve a worst-case ratio less than 3/2 unlessP = NP. We finally obtain a complexity classification for all special cases with a fixed number of processing times.A preliminary version of this paper appeared in theProceedings of the 28th Annual IEEE Symposium on the Foundations of Computer Science (Computer Society Press of the IEEE, Washington, D.C., 1987) pp. 217–224.     

Stochastic approximation algorithm for minimax problems

A stochastic approximation algorithm for minimax optimization problems is analyzed. At each iterate, it performs one random experiment, based on which it computes a direction vector. It is shown that, under suitable conditions, it a.s. converges to the set of points satisfying necessary optimality conditions. The algorithm and its analysis bring together ideas from stochastic approximation and nondifferentiable optimization.     

The Asymptotic Expansion of Solutions for the Navier-Stokes Equations with Large Parameters

In this paper, we decomposite the coefficient matrix of the Navier-Stokes equations with large parameter in λ power. By factor analysis and energy estimation, the long time existence and asymptotic expansion of the solution tor the system are obtained. Key words Navier-Stokes equations; expansion; approximation.     

Bivariate Free Knot Splines

We consider the least squares approximation of gridded 2D data by tensor product splines with free knots. The smoothing functional to be minimized—a generalization of the univariate Schoenberg functional—is chosen in such a way that the solution of the bivariate problem separates into the solution of a sequence of univariate problems in case of fixed knots. The resulting optimization problem is a constrained separable least squares problem with tensor product structure. Based on some ideas developed by the authors for the univariate case, an efficient method for solving the specially structured 2D problem is proposed, analyzed and tested on hand of some examples from the literature.     

Optimal volume-corrected laplace-metropolis method

The article provides a refinement for the volume-corrected Laplace-Metropolis estimator of the marginal likelihood of DiCiccioet al. The correction volume of probability α in DiCiccioet al. is fixed and suggested to take the value α=0.05. In this article α is selected based on an asymptotic analysis to minimize the mean square relative error (MSRE). This optimal choice of α is shown to be invariant under linear transformations. The invariance property leads to easy implementation for multivariate problems. An implementation procedure is provided for practical use. A simulation study and a real data example are presented.     

Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width

The Multicut problem can be defined as: given a graph G and a collection of pairs of distinct vertices {s_i,t_i} of G, find a minimum set of edges of G whose removal disconnects each s_i from the corresponding t_i. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being a tree. The main result of the paper is a polynomial-time approximation scheme (PTAS) for Multicut in unweighted graphs with bounded degree and bounded tree-width. That is, for any ε>0, we present a polynomial-time (1+ε)-approximation algorithm. In the particular case when the input is a bounded-degree tree, we have a linear-time implementation of the algorithm. We also provide some hardness results: we prove that Multicut is still NP-hard for binary trees and that it is Max SNP-hard if we drop any of the three conditions (unweighted, bounded-degree, bounded tree-width). Finally we show that some of these results extend to the vertex version of Multicut and to a directed version of Multicut.