Geometric quadrisection in linear time, with application to VLSI placement

We consider the following problem: given a set of points in the plane, each with a weight, and capacities of the four quadrants, assign each point to one of the quadrants such that the total weight of points assigned to a quadrant does not exceed its capacity, and the total distance is minimized.

This problem is most important in placement of VLSI circuits and is likely to have other applications. It is NP-hard, but the fractional relaxation always has an optimal solution which is “almost” integral. Hence for large instances, it suffices to solve the fractional relaxation. The main result of this paper is a linear-time algorithm for this relaxation. It is based on a structure theorem describing optimal solutions by so-called “American maps” and makes sophisticated use of binary search techniques and weighted median computations.

This algorithm is a main subroutine of a VLSI placement tool that is used for the design of many of the most complex chips.     

Experimental design and the optimization of a polymer supported palladium complex for use in the Heck reaction

Optimization of the Heck reaction of 4-bromoacetophenone with styrene by a polymer supported, sulfur-containing palladacycle, varying 6 factors at a total of 28 different levels, corresponding to 5760 different possibilities was undertaken. Conversion improved from 34%, with large observable leaching to 88% with no leaching. This was accomplished using a Design of Experiments approach facilitated by the Statistical Design Package, MODDE 7.0^TM.     

Standardization of BSE rapid test performances and experiences gathered during the implementation of large-scale testing

The accumulation of pathological prion protein is used as a diagnostic marker for transmissible spongiform encephalopathies. According to European Union (EU) regulations cattle older than 30 months of age (Germany, France, Italy, and Spain by national law >24 months) and slaughtered for human consumption must be tested by using rapid tests for bovine spongiform encephalopathy (BSE). Likewise fallen stock and clinically affected animals must be tested. This article gives a short overview of the incidence of BSE in Europe. The diagnostic hierarchy, i.e., the officially approved methodology for the confirmation of suspect rapid test cases, and the organization of the numerous laboratories involved in this large-scale testing for BSE are described. Special emphasis is given to necessary quality control measures currently in place for BSE rapid testing laboratories and to measures intended to assure a consistent performance of the commercially available rapid test kits.Presented at BERM-9—Ninth International Symposium on Biological and Environmental Reference Materials, 15–19 June 2003, Berlin, Germany.     

切伦柯夫相互作用中分段式慢波结构与均匀慢波结构的比较研究

 分析了切伦柯夫束波相互作用中使用单段慢波结构的缺点。指出在分段式慢波结构中，漂移段及其两端的慢波结构组成一Bragg谐振腔，当漂移段长度合适时，根据渡越时间效应理论，这种结构能减小调制束中电子的速度分散，提高束波转化效率。通过粒子模拟方法，比较了均匀慢波结构与分段式慢波结构中束波相互作用的物理图像，验证了理论分析结果，并说明了后者有束密度群聚充分，束电子速度分散小，产生微波功率高、频谱质量好，最佳工作电流大，输入电功率高等优点。     

混合位级正交试验设计的极差分析方法

本文指出，在混合位级的正交试验设计中，以往的极差分析方法存在着不足。本文给出了极差的修正方法，并用大量实例做了数值验证，说明这个修正确实很有效     

Scheduling orders for multiple product types to minimize total weighted completion time

We consider the problem of scheduling orders for multiple different product types in an environment with m dedicated machines in parallel. The objective is to minimize the total weighted completion time. Each product type is produced by one and only one of the m dedicated machines; that is, each machine is dedicated to a specific product type. Each order has a weight and may also have a release date. Each order asks for certain amounts of various different product types. The different products for an order can be produced concurrently. Preemptions are not allowed. Even when all orders are available at time 0, the problem has been shown to be strongly NP-hard for any fixed number (?2) of machines. This paper focuses on the design and analysis of efficient heuristics for the case without release dates. Occasionally, however, we extend our results to the case with release dates. The heuristics considered include some that have already been proposed in the literature as well as several new ones. They include various static and dynamic priority rules as well as two more sophisticated LP-based algorithms. We analyze the performance bounds of the priority rules and of the algorithms and present also an in-depth comparative analysis of the various rules and algorithms. The conclusions from this empirical analysis provide insights into the trade-offs with regard to solution quality, speed, and memory space.     

A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times.     

关于解椭圆型问题的多子域D-N交替算法

构造一个求解椭圆型边值问题的多子域D—N交替算法，导出对应的容度方程和等价的迭代法，证明算法的收敛性。     

Structural optimization design for large mirror

The system design must be started from the concept with low cost and high performance. In this point, the topological shape of the structure is very important in the view of the structural rigidities and light-weight design.In this paper, the optimization methodology is presented in the design stage of the large optical mirror. We obtain the optimal layout through the topology optimization and then design the details through the size or shape optimization for structural rigidity.     

A Degenerate Stefan Problem with Two Free Boundaries

ＡＤｅｇｅｎｅｒａｔｅＳｔｅｆａｎＰｒｏｂｌｅｍｗｉｔｈＴｗｏＦｒｅｅＢｏｕｎｄａｒｉｅｓ￥（李辉来）ＬｉＨｕｉｌａｉ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＪｉｌｉｎＵｎｉｖｅｒｓｉｔｙ，Ｃｈａｎｇｃｈｕｎ，１３００２３）Ａｂｓｔｒａｃｔ...