The primal-dual method for approximation algorithms

In this survey, we give an overview of a technique used to design and analyze algorithms that provide approximate solutions to NP-hard problems in combinatorial optimization. Because of parallels with the primal-dual method commonly used in combinatorial optimization, we call it the primal-dual method for approximation algorithms. We show how this technique can be used to derive approximation algorithms for a number of different problems, including network design problems, feedback vertex set problems, and facility location problems. Received: June 19, 2000 / Accepted: February 7, 2001?Published online October 2, 2001     

A topological aspect of Sobolev mappings

Let be a connected open set, . We give a sufficient condition for a mapping , , to have the property that sgn is almost everywhere of one sign. Following the work of Müller, Spector, and Tang [MST], we give an application of our results to the theory of non-linear elasticity. Received: 13 October 2000 / Accepted: 23 January 2001 / Published online: 4 May 2001     

Performance and analysis of saddle point preconditioners for the discrete steady-state Navier-Stokes equations

Summary. We examine the convergence characteristics of iterative methods based on a new preconditioning operator for solving the linear systems arising from discretization and linearization of the steady-state Navier-Stokes equations. With a combination of analytic and empirical results, we study the effects of fundamental parameters on convergence. We demonstrate that the preconditioned problem has an eigenvalue distribution consisting of a tightly clustered set together with a small number of outliers. The structure of these distributions is independent of the discretization mesh size, but the cardinality of the set of outliers increases slowly as the viscosity becomes smaller. These characteristics are directly correlated with the convergence properties of iterative solvers. Received August 5, 2000 / Published online June 20, 2001     

The G/M/1 queue revisited

The G/M/1 queue is one of the classical models of queueing theory. The goal of this paper is two-fold: (a) To introduce new derivations of some well-known results, and (b) to present some new results for the G/M/1 queue and its variants. In particular, we pay attention to the G/M/1 queue with a set-up time at the start of each busy period, and the G/M/1 queue with exceptional first service. Dedicated to Arie Hordijk on his 65th birthday, in friendship and admiration.     

Poincaré series and holomorphic averaging

Summary We provide an alternate proof of McMullen's theorem on contractive properties of the Poincaré series operator in the special case of the universal covering. This case includes in particular Kra's Theta Conjecture.Oblatum 16-X-1991 & 14-IV-1992First author supported in part by a grant from the National Science Foundation     

离子束引起的在Al／Cr双层薄膜界面处的原子混合

用600keV的Kr~ 离子轰击Al/Cr双层薄膜样品进行界面原子反应及相互混合的研究。实验样品是在单晶硅上蒸镀约500nm厚的铝膜,相继再蒸上所需厚度的铬膜而制成的。轰击剂量为2.0×10~(15)-2.5×10~(16)Kr~ /cm~2。用2.0MeVa粒子对轰击前后的样品进行了卢瑟福背散射(RBS)分析,发现界面处有明显的原子混合存在;当轰击剂量≥1.0×10~(16)Kr~ /cm~2时,RBS谱出现有明显的坪台,经拟合计算和x射线衍射(XRD)测量证实确有化合物Al_(13)Cr_2存在;还分别得到了原子混合量及混合效率与轰击剂量的关系;最后对界面处的原子混合机制进行了讨论。     

A note on an SOR-like method for augmented systems

Golub et al. (2001, BIT, 41, 71–85) gave a generalizedsuccessive over-relaxation method for the augmented systems.In this paper, the connection between the SOR-like method andthe preconditioned conjugate gradient (PCG) method for the augmentedsystems is investigated. It is shown that the PCG method isat least as accurate (fast) as the SOR-like method. Numericalexamples demonstrate that the PCG method is much faster thanthe SOR-like method.     

青岛港货运吞吐量的时间序列模型

运用时间序列分析方法对时间序列建立ARMA,ARIMA模型.搜集了青岛港1999年1月～2003年5月的货运吞吐量数据,对进行分析,建立了青岛港货运吞吐量的模型.通过预留的部分数据对模型进行检验,并对模型的残差进行检验,得出模型比较合理.     

InAs/GaSb/AlSb resonant tunneling spin device concepts

We discuss device concepts for creating spin-polarized current sources without external magnetic fields, using non-magnetic 6.1 Å semiconductor resonant tunneling structures. Spin filters, spin pumps, and spin transistors that exploit structural and bulk inversion asymmetries will be examined.     

Click chemistry in materials synthesis. III. Metal‐adhesive polymers from Cu(I)‐catalyzed azide–alkyne cycloaddition

1,2,3‐Triazole‐based polymers generated from the Cu(I)‐catalyzed cycloaddition between multivalent azides and acetylenes are effective adhesive materials for metal surfaces. The adhesive capacities of candidate mixtures of azide and alkyne components were measured by a modified peel test, using a customized adhesive tester. A particularly effective tetravalent alkyne and trivalent azide combination was identified, giving exceptional strength that matches or exceeds the best commercial formulations. The addition of Cu catalyst was found to be important for the synthesis of stronger adhesive polymers when cured at room temperature. Heating also accelerated curing rates, but the maximum adhesive strengths achieved at both room temperature and high temperature were the same, suggesting that crosslinking reaches the same advanced point in all cases. Polytriazoles also form adhesives to aluminum, but copper is bound more effectively, presumably because active Cu(I) ions may be leached from the surface to promote crosslinking and adhesion. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 5182–5189, 2007