A comparison of two algorithms for the assignment problem

State-of-the-art computational results have shown that the shortest augmenting path (SAP) methods are more efficient than other primal-dual and primal-simplex based methods for solving the linear assignment problem on uniprocessor computers. There is, however, some controversy concerning their merits when compared with Bertsekas' auction algorithm on multiprocessor computers. In this study we investigate the performance of these competing methods on the Alliant FX/8. For each method, theoretical motivation, sources of parallelism and computational results are presented.     

On Two Parallel Matched Gratings Demodulation Method of Fiber Grating Strain Sensor

The method of demodulation with two parallel matched fiber Bragg gratings( FBGs)system is introduced to enlarge the range of strain that can be detected by the FBG sensor system.     

Solving large-scale semidefinite programs in parallel

We describe an approach to the parallel and distributed solution of large-scale, block structured semidefinite programs using the spectral bundle method. Various elements of this approach (such as data distribution, an implicitly restarted Lanczos method tailored to handle block diagonal structure, a mixed polyhedral-semidefinite subdifferential model, and other aspects related to parallelism) are combined in an implementation called LAMBDA, which delivers faster solution times than previously possible, and acceptable parallel scalability on sufficiently large problems. This work was supported in part by NSF grants DMS-0215373 and DMS-0238008.     

BOUNDEDNESS OF FRACTIONAL INTEGRALS IN HARDY SPACES WITH NON-DOUBLING MEASURE - In Memory of Professor Sun Yongsheng

Let μ be a Borel measure on Rd which may be non doubling. The only condition that μ must satisfy is μ(Q) ≤ col(Q)n for any cube Q () Rd with sides parallel to the coordinate axes and for some fixed n with 0 ＜ n ≤ d. The purpose of this paper is to obtain a boundedness property of fractional integrals in Hardy spaces H1 (μ).     

Thermal effects on parallel resonance energy of whistler mode wave

In this short communication, we have evaluated the effect of thermal velocity of the plasma particles on the energy of resonantly interacting energetic electrons with the propagating whistler mode waves as a function of wave frequency and L-value for the normal and disturbed magnetospheric conditions. During the disturbed conditions when the magnetosphere is depleted in electron density, the resonance energy of the electron enhances by an order of magnitude at higher latitudes, whereas the effect is small at low latitudes. An attempt is made to explain the enhanced wave activity observed during magnetic storm periods.     

切变模量和转动惯量实验的改进

设计了一种基于垂直轴定理的新型吊钩,对切变模量和转动惯量实验进行了改进,使之成为既可测定金属丝切变模量和环、柱等刚体的转动惯量,又可验证反映转动惯量重要性质的平行轴定理及垂直轴定理的多功能实验仪.     

论浮力的计算

通过讨论物体下表面不与液体接触时浮力的计算,总结浮力计算的一般方法.     

Computing Aviation Sparing Policies: Solving a Large Nonlinear Integer Program

Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous computers in an office environment, thus, drastically reducing the time required to find the solution.     

线性方程组通解并行数值方法

1预备知识 线性方程组消息传递MIMD算法是20世纪90年代至今的活跃课题，但尚无此问题 的通用有效算法发表.用!.}.}表示矩阵列分块划分，记AX=b为[AI司.定理1、2是文 {l]、[s]成果综述和推广. 定理i[‘]设有线性方程组!e}己l，e〔尺”“m，d〔R”“‘，rank(e)=r.当且仅当rank(!     

How to Express a Parallel Sum of k Matrices

We present an alternative expression for the parallel sum of k Hermitian nonnegative definite matrices by using the Moore-Penrose inverse of a block matrix.