准直磨料射流在准直管内流动机理及切割应用研究

分析了准直磨料射流的工作原理、特点及高速多相流体介质在准直管内有阻运动时的磨粒运动方程式。研究表明,准直管管长在０．４ｍ～３ｍ范围内磨粒速度基本保持不变,准直管长度、直径、供料量和磨粒型号等参数之间存在最佳配合关系。本为使用准直磨料射流进行切割和冲蚀的工程应用提供了初步的理论基础。     

金刚石薄膜涂层刀具的破损机理研究

切削过程中金刚石薄膜从基体表面的破损剥落是金刚石薄膜涂层刀具的一种主要损坏形式.本文通过实验研究了金刚石薄膜涂层刀具的破损机理及刀具表面状态、切削用量对其损坏形式的影响.研究结果表明,较大的切削用量、机械冲击、交变切削载荷及积屑瘤频繁脱落等是导致金刚石薄膜涂层刀具破损剥落的主要原因.金刚石薄膜的破损剥落起始于薄膜与基体之间及薄膜底面金刚石晶粒之间的原始微小间隙缺陷,这些原始微小间隙缺陷是在沉积金刚石薄膜时,由于成核密度较低等原因而形成的.金刚石薄膜剥落时薄膜的断裂主要沿晶界发生.     

A cutting plane algorithm for the General Routing Problem

The General Routing Problem (GRP) is the problem of finding a minimum cost route for a single vehicle, subject to the condition that the vehicle visits certain vertices and edges of a network. It contains the Rural Postman Problem, Chinese Postman Problem and Graphical Travelling Salesman Problem as special cases. We describe a cutting plane algorithm for the GRP based on facet-inducing inequalities and show that it is capable of providing very strong lower bounds and, in most cases, optimal solutions. Received: November 1998 / Accepted: September 2000?Published online March 22, 2001     

Lensless Fourier holography for digital holographic interferometry on biological samples

Digital holography as a tool for highly sensitive, interferometric non-destructive testing has several advantages compared to holographic measurements based on conventional storage media like an all-digital processing and a direct access to the phase of the object wave. Experimental results of interferometric investigations of heart valve bio-prostheses with a setup for lensless Fourier holography are presented which demonstrate that this technique is applicable to such biological samples with their wet and unstable surfaces. Limitations on size and resolution of the reconstructed object caused by the properties of the CCD sensor are discussed.     

Enhanced intersection cutting-plane approach for linear complementarity problems

In this paper, we develop an enhanced intersection cutting-plane algorithm for solving a mixed integer 0–1 bilinear programming formulation of the linear complementarity problem (LCP). The matrixM associated with the LCP is not assumed to possess any special structure, except that the corresponding feasible region is assumed to be bounded. A procedure is described to generate cuts that are deeper versions of the Tuy intersection cuts, based on a relaxation of the usual polar set. The proposed algorithm then attempts to find an LCP solution in the process of generating either a single or a pair of such strengthened intersection cuts. The process of generating these cuts involves a vertexranking scheme that either finds an LCP solution, or else these cuts eliminate the entire feasible region leading to the conclusion that no LCP solution exists. Computational experience on various test problems is provided.This material is based upon work supported by the National Science Foundation under Grant No. DMII-9121419 to the first author and Grant No. DMII-9114489 to the third author. The authors gratefully acknowledge the constructive suggestions of a referee that helped focus the approach and its presentation.     

Gated magnetic resonance imaging of acute myocardial ischemia in dogs: application of multiecho techniques and contrast enhancement with GD DTPA

ECG gated magnetic resonance images were obtained in six canines prior to and immediately following occlusion of either the LAD or circumflex coronary artery using a surgically placed snare. Multiecho and single-echo acquisition techniques were utilized 0.25 mmol/kg Gd DTPA was injected as an IV bolus 1 hr following coronary artery ligation. In two animals, the region of ischemic myocardium was clearly visualized on multiecho technique without the use of intravenous contrast. The ischemic zone could be best identified on images with a long TE of 120 msec. Contrast enhancement with Gd DTPA enabled visualization of the ischemic myocardium in all six canines. Administration of Gd DTPA, a perfusion agent, improved both detectability and definition of the myocardial lesions.     

实用下料优化问题模型建立及解法

“下料问题(cuttingstockproblem)”是把相同形状的一些原材料分割加工成若干个不同规格大小的零件的问题,此类问题在工程技术和工业生产中有着重要和广泛的应用.本文首先以材料最省为原则建立模型,采用分层基因算法模型求解出模型的解,若此结果不符合时间限制条件,则通过以客户时间需求为第一目标的分组抽样模型处理后,再借助分层基因算法给出该模型的最优解.     

The Application of Preprocessing and Cutting Plane Techniques for a Class of Production Planning Problems

This paper investigates properties of integer programming models for a class of production planning problems. The models are developed within a decision support system to advise a sales team of the products on which to focus their efforts in gaining new orders in the short term. The products generally require processing on several manufacturing cells and involve precedence relationships. The cells are already (partially) committed with products for stock and to satisfy existing orders and therefore only the residual capacities of each cell in each time period of the planning horizon are considered. The determination of production recommendations to the sales team that make use of residual capacities is a nontrivial optimization problem. Solving such models is computationally demanding and techniques for speeding up solution times are highly desirable. An integer programming model is developed and various preprocessing techniques are investigated and evaluated. In addition, a number of cutting plane approaches have been applied. The performance of these approaches which are both general and application specific is examined.     

下料问题数学模型研究

本文讨论了关于合理下料问题线性规则模型的建立，给出了该问题正确的线性规划模型，用反例说明了某些模型的错误并进行了分析。     

An approximation algorithm for cutting out convex polygons

We provide an O(logn)-approximation algorithm for the following problem. Given a convex n-gon P, drawn on a convex piece of paper, cut P out of the piece of paper in the cheapest possible way. No polynomial-time approximation algorithm was known for this problem posed in 1985.