固液界面双电荷层结构的一个界面势模型

当液体受限在纳米尺度下时,会呈现出跟宏观尺度下完全不同的输运性质。这些新的性质可以被应用于很多领域,譬如对生物体中体液输运的研究,液体抽运,药物的混合和分离,以及离子和胶体颗粒的选择等领域。为了充分利用这些新性质,需要对纳米液体中最基本的双电荷层结构有深刻认识。文章回顾了传统的泊松—玻尔兹曼方程对双电荷层结构中液体离子分布的计算,指出了其中的不足,并提出一种基于液体电荷保持中性的固液表面势模型。     

基于PML边界的有限差分法及其在光波导泄漏损耗计算中的应用

利用结合完美匹配层(PML)边界的有限差分法计算了光波导的泄漏损耗.通过采用非均匀格点差分格式和反正切坐标变换的方法,有效地减小了计算量并提高了计算精度.分析了PI(polyimide)掩埋型波导和SOI(silicon-on-insulator)脊型波导两种典型结构的泄漏损耗,给出了波导结构尺寸对泄漏损耗的影响,并对有效减小泄漏损耗的方法进行了讨论.     

Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems

In this paper we introduce a new class of facet-inducing inequalities for the Windy Rural Postman Problem and the Windy General Routing Problem. These inequalities are called Zigzag inequalities because they cut off fractional solutions containing a zigzag associated with variables with 0.5 value. Two different types of inequalities, the Odd Zigzag and the Even Zigzag inequalities, are presented. Finally, their application to other known Arc Routing Problems is discussed.     

双纽线｜w~2十c｜=1的弧长

设s（c）为双纽线｜W2＋c｜＝1的弧长，c∈「0，＋∞）．该文讨论了s（c）的性质，并在n＝2的情况下解决了Erdos，Herzog和Piranian提出的一个猜测。     

Study of uniformity of plasmas produced in a wall‐stabilized arc

In this contribution the plasma of an arc discharge in a mixture of helium and argon is studied. The gas mixture is introduced uniformly along the arc column between each of the stabilizing plates. From the measured lateral distribution of radiation (HeI, HI, ArI, ArII, NI, FI line intensity and width measurements), after Abel inversion, the radial temperature distributions were obtained at various positions of the arc column. Beside the expected radial temperature gradients, a distinct temperature gradient along the arc column was found.     

局部环上典型群的生成问题

回顾了域上典型群的生成问题所得成果,对局部环上典型群生成问题的研究,作了一个展示,并按展示的范式,给出了辛群生成定理的证明.     

An easy applicable method for the design of asymmetrical finline and slotline tapers

In this paper, some utilities for the developement of asymmetrical circular arc tapes are described. Basing on a polygon-approximation of characteristic impedance a method for to determine the geometrical parameters of the taper is explained. The applicability of the method presented here is proved by extensive measurements.     

A new arc algorithm for unconstrained optimization

The gradient path of a real valued differentiable function is given by the solution of a system of differential equations. For a quadratic function the above equations are linear, resulting in a closed form solution. A quasi-Newton type algorithm for minimizing ann-dimensional differentiable function is presented. Each stage of the algorithm consists of a search along an arc corresponding to some local quadratic approximation of the function being minimized. The algorithm uses a matrix approximating the Hessian in order to represent the arc. This matrix is updated each stage and is stored in its Cholesky product form. This simplifies the representation of the arc and the updating process. Quadratic termination properties of the algorithm are discussed as well as its global convergence for a general continuously differentiable function. Numerical experiments indicating the efficiency of the algorithm are presented.     

电弧-AES法测定金属硅中12个杂质元素

用直流电弧粉末法在氩气气氛中摄谱，消除硅带干扰，采用铍为内标，直接测定金属硅中12个杂质元素，此法较化学光谱法具有操作简便、快速，试剂耗量少；较化学法和分光光度法更加优越，能同时测定12个元素，更能反映金属硅的真实含量。     

A restricted Lagrangean approach to the traveling salesman problem

We describe an algorithm for the asymmetric traveling salesman problem (TSP) using a new, restricted Lagrangean relaxation based on the assignment problem (AP). The Lagrange multipliers are constrained so as to guarantee the continued optimality of the initial AP solution, thus eliminating the need for repeatedly solving AP in the process of computing multipliers. We give several polynomially bounded procedures for generating valid inequalities and taking them into the Lagrangean function with a positive multiplier without violating the constraints, so as to strengthen the current lower bound. Upper bounds are generated by a fast tour-building heuristic. When the bound-strengthening techniques are exhausted without matching the upper with the lower bound, we branch by using two different rules, according to the situation: the usual subtour breaking disjunction, and a new disjunction based on conditional bounds. We discuss computational experience on 120 randomly generated asymmetric TSP's with up to 325 cities, the maximum time used for any single problem being 82 seconds. This is a considerable improvement upon earlier methods. Though the algorithm discussed here is for the asymmetric TSP, the approach can be adapted to the symmetric TSP by using the 2-matching problem instead of AP.Research supported by the National Science Foundation through grant no. MCS76-12026 A02 and the U.S. Office of Naval Research through contract no. N0014-75-C-0621 NR 047-048.