ICF空心微球靶传热的有限元分析

 为分析冷冻靶丸外部温度场，应用ANSYS软件对ICF空心微球靶的热传递进行了有限元分析。建立了单元传热的几何物理模型，靶丸微球呈空间均匀分布，计算区域由三个同心球壳组成，分别为液体层、靶丸壳层以及氦气层，氦气层厚度为球壳层厚度的7倍。模型左右两边界设为绝热边界条件，采用智能自动划分网格,设定参数为3，单元类型为三角形。模拟表明，在靶丸工作温度为24 K的情况下，为保持靶丸气泡受力平衡，自洽得到靶丸内部温度梯度为14.02 K/cm，以此求解出所施加的外部温度场为7.758 K/cm。将计算值与现有的实验结果进行了比较，模拟结果与国外实验值(8.2 K/cm)吻合得较好。     

Modeling Sub- and Super-ambient Heat Capacities of the Group Iva Compounds Despite the Lanthanide Contraction

This paper is concerned with the estimation of heat capacities in the IVA 3d-transition element compounds using especially Zr and Hf compounds as examples. Most prediction schemes routinely tacitly assume that volumes and masses trend in parallel. However, the lanthanide contraction here ensures for ZrX/HfX systems — and generally elsewhere — that this is not so in this portion of the periodic table. Available methods such as Latimer's, Volumetric Priority, Komada-Westrum, Grimvall's, and Sommers' are compared on IVA elements and compounds. Only the Sommers approach has volumetric input. It provides the best prediction.This revised version was published online in November 2005 with corrections to the Cover Date.     

The Renormalization Group and Its Finite Lattice Approximations

We investigate finite lattice approximations to the Wilson renormalization group in models of unconstrained spins. We discuss first the properties of the renormalization group transformation (RGT) that control the accuracy of this type of approximation and explain different methods and techniques to practically identify them. We also discuss how to determine the anomalous dimension of the field. We apply our considerations to a linear sigma model in two dimensions in the domain of attraction of the Ising fixed point using a Bell–Wilson RGT. We are able to identify optimal RGTs which allow accurate computations of quantities such as critical exponents, fixed-point couplings and eigenvectors with modest statistics. We finally discuss the advantages and limitations of this type of approach.     

Weight distributions of geometric Goppa codes

The in general hard problem of computing weight distributions of linear codes is considered for the special class of algebraic-geometric codes, defined by Goppa in the early eighties. Known results restrict to codes from elliptic curves. We obtain results for curves of higher genus by expressing the weight distributions in terms of -series. The results include general properties of weight distributions, a method to describe and compute weight distributions, and worked out examples for curves of genus two and three.

     

A finite‐capacity queue with exhaustive vacation/close‐down/setup times and Markovian arrival processes

We consider a finitecapacity singleserver vacation model with closedown/setup times and Markovian arrival processes (MAP). The queueing model has potential applications in classical IP over ATM or IP switching systems, where the closedown time corresponds to an inactive timer and the setup time to the time delay to set up a switched virtual connection (SVC) by the signaling protocol. The vacation time may be considered as the time period required to release an SVC or as the time during which the server goes to set up other SVCs. By using the supplementary variable technique, we obtain the queue length distribution at an arbitrary instant, the loss probability, the setup rate, as well as the Laplace–Stieltjes transforms of both the virtual and actual waiting time distributions.     

Algebraic domain decomposition solver for linear elasticity

We generalize the overlapping Schwarz domain decomposition method to problems of linear elasticity. The convergence rate independent of the mesh size, coarse-space size, Korn's constant and essential boundary conditions is proved here. Abstract convergence bounds developed here can be used for an analysis of the method applied to singular perturbations of other elliptic problems.     

approximations of inertial manifolds via finite differences

We construct an inertial manifold for the evolution equation as a limit of the inertial manifolds for the difference approximations of the Trotter-Kato type and show that this limit is taken in a topology.

     

A monotone finite element scheme for convection-diffusion equations

A simple technique is given in this paper for the construction and analysis of a class of finite element discretizations for convection-diffusion problems in any spatial dimension by properly averaging the PDE coefficients on element edges. The resulting finite element stiffness matrix is an -matrix under some mild assumption for the underlying (generally unstructured) finite element grids. As a consequence the proposed edge-averaged finite element scheme is particularly interesting for the discretization of convection dominated problems. This scheme admits a simple variational formulation, it is easy to analyze, and it is also suitable for problems with a relatively smooth flux variable. Some simple numerical examples are given to demonstrate its effectiveness for convection dominated problems.

     

Bifurcation of periodic solutions to variational inequalities in R κ based on Alexander-Yorke theorem

Variational inequalities are studied, where K is a closed convex cone in , 3, B is a × matrix, G is a small perturbation, a real parameter. The assumptions guaranteeing a Hopf bifurcation at some ₀ for the corresponding equation are considered and it is proved that then, in some situations, also a bifurcation of periodic solutions to our inequality occurs at some _{I 0}. Bifurcating solutions are obtained by the limiting process along branches of solutions to penalty problems starting at ₀ constructed on the basis of the Alexander-Yorke theorem as global bifurcation branches of a certain enlarged system.     

A Characterization of Some Minihypers and its Application to Linear Codes

Any {f,r- 2+s; r,q}-minihyper includes a hyperplane in PG(r, q) if fr-1 + s 1 + q – 1 for 1 s q – 1, q 3, r 4, where i = (qi + 1 – 1)/ (q – 1 ). A lower bound on f for which an {f, r – 2 + 1; r, q}-minihyper with q 3, r 4 exists is also given. As an application to coding theory, we show the nonexistence of [ n, k, n + 1 – qk – 2 ]q codes for k 5, q 3 for qk – 1 – 2q – 1 < n qk – 1 – q – 1 when k > q – q - \sqrt q + 2$$ " align="middle" border="0"> and for when , which is a generalization of [18, Them. 2.4].