高性能ZnO纳米块体材料的制备及其拉曼光谱学特征

利用六面顶高压设备制备了高密度、低脆性、纳米级的ZnO块体材料，用MDI/JADE5 X射线衍射仪(Cu靶)和XL30S-FEG场发射扫描电子显微镜对高压样品的相组成、晶粒尺寸及微观形貌进行了表征.利用E55+FRA106/5傅里叶变换激光拉曼光谱仪通过ZnO块体样品位于50—500cm^-1之内的拉曼光谱, 研究了极性半导体纳米材料的拉曼光谱学特征.发现在极性半导体ZnO纳米块体材料中，没有出现明显的尺寸限制效应. 关键词： ZnO纳米块体 拉曼光谱 尺寸限制效应     

长波长大应变InGaAs/InGaAsP分布反馈激光器的材料生长与器件制备

采用低压金属有机化合物气相沉积法(LP-MOCVD)生长并制作了1.6—1.7μm大应变InGaAs/InGaAsP分布反馈激光器.采用应变缓冲层技术，得到质量良好的大应变InGaAs/InP体材料.器件采用了4个大应变的量子阱，加入了载流子阻挡层改善器件的温度特性.1.66μm和1.74μm未镀膜的3μm脊型波导器件阈值电流低(小于15mA)，输出功率高(100mA时大于14mW).从10—40℃，1.74μm激光器的特征温度T₀=57K，和1.55μm InGaAsP分布反馈激光器的特征温度相当. 关键词： MOCVD InGaAs/InGaAsP 应变量子阱 分布反馈激光器     

Scheduling multi-stage parallel-processor services to minimize average response time

The problem of scheduling on a multi-stage parallel-processor architecture in computer centres is addressed with the objective of minimizing average completion time of a set of requests. The problem is modelled as a flexible flowshop problem for which few heuristics exist in the flowshop scheduling literature. A new three-phase heuristic is proposed in this paper. An extensive computational experiment has been conducted to compare the performance of the existing heuristics and the proposed heuristic. The results indicate that the proposed heuristic significantly outperforms the existing ones. More specifically, the overall average error of the best existing heuristic is about five times that of the proposed heuristic while the overall average CPU time of the proposed heuristic is about half of the best existing one. More importantly, as the number of requests increases, the CPU time of the proposed heuristic decreases considerably (compared to the best existing heuristic) while the ratio of the error (of the best existing to the proposed heuristic) of about five times remains almost the same.     

倒置结构锥形束计算机层析的精确成像与Grangeat算法实现

研究了一种新的圆加垂直单弧段的锥顶轨迹的锥形束计算机层析（CT）的完全性条件和精确重建的Grangeat方法，提出了倒置结构锥形束计算机层析的便于实现的圆加垂直多弧段的成像结构及进行精确重建的完全性条件。利用倒置成像结构与现有成像结构之间的等价关系，给出了倒置结构锥形束计算机层析的重建算法。最后，对上述几方面进行了计算机模拟。     

A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints

This paper considers the problem of determining the disassembly schedule (quantity and timing) of products in order to satisfy the demand of their parts or components over a finite planning horizon. The objective is to minimize the sum of set-up, disassembly operation, and inventory holding costs. As an extension of the uncapacitated versions of the problem, we consider the resource capacity restrictions over the planning horizon. An integer program is suggested to describe the problem mathematically, and to solve the problem, a heuristic is developed using a Lagrangean relaxation technique together with a method to find a good feasible solution while considering the trade-offs among different costs. The effectiveness of the algorithm is tested on a number of randomly generated problems and the test results show that the heuristic suggested in this paper can give near optimal solutions within a short amount of computation time.     

Surface functionalisation of polymer nanofibres by sputter coating of titanium dioxide

The surface properties of nanofibres are of importance in various applications. In this work, electrospun polyamide nanofibres were used as substrates for creating functional nanostructures on the nanofibre surfaces. A RF magnetron sputter coating was used to deposit the functional layer of titanium dioxide (TiO₂) onto the nanofibres. Atomic force microscopy (AFM), X-ray diffraction (XRD), X-ray photoelectron spectroscopy (XPS) and environmental scanning electron microscopy (ESEM) were employed to study the topography, grain structure and wetting of the nanofibre surfaces, respectively. The AFM results indicated a significant difference in the morphology of the nanofibres before and after the TiO₂ sputter coating. The XRD analysis showed the amorphous structures of the TiO₂ deposition layer. XPS spectra reflected the chemical features of the deposited nanostructures. The ESEM observation revealed that the surface wettability of TiO₂ sputter coated nanofibres was significantly improved after UV irradiation.     

Mappings of finite distortion: Hausdorff measure of zero sets

We prove that a for a mapping f of finite distortion , the -Hausdorff measure of any point preimage is zero provided is integrable, with , and the multiplicity function of f is essentially bounded. As a consequence for we obtain that the mapping is then open and discrete. Received: 18 June 2001 / Revised version: 31 January 2002 / Published online: 27 June 2002     

Local ν-Euler Derivations and Deligne's¶Characteristic Class of Fedosov Star Products¶and Star Products of Special Type

In this paper we explicitly construct local ν-Euler derivations , where the ξ_α are local, conformally symplectic vector fields and the are formal series of locally defined differential operators, for Fedosov star products on a symplectic manifold (M,ω) by means of which we are able to compute Deligne's characteristic class of these star products. We show that this class is given by , where is a formal series of closed two-forms on M the cohomology class of which coincides with the one introduced by Fedosov to classify his star products. Moreover, we consider star products that have additional algebraic structures and compute the effect of these structures on the corresponding characteristic classes of these star products. Specifying the constituents of Fedosov's construction we obtain star products with these special properties. Finally, we investigate equivalence transformations between such special star products and prove existence of equivalence transformations being compatible with the considered algebraic structures. Dedicated to the memory of Moshé Flato Received: 28 June 1999 / Accepted: 11 April 2002?Published online: 11 September 2002     

Local search algorithms for the min-max loop layout problem

In the min-max loop layout problem, machines are to be arranged around a loop of conveyor belt. The ordering of the machines dictates the number of circuits of the conveyor belt required to manufacture each of several products. The goal is to find an ordering of the machines that minimises the maximum number of circuits required for the manufacture of any of the products. Since the problem is strongly NP-hard, the study of heuristic methods is of interest. This paper proposes iterated descent and tabu search algorithms, and a randomised insertion algorithm. Results of extensive computational tests show that all of our algorithms outperform a previously known algorithm that applies a greedy heuristic to the solution of a linear programming relaxation. The best quality solutions are obtained with iterated descent. This adds further evidence to the belief that iterated descent can produce high quality solutions to a variety of combinatorial optimisation problems. Moreover, unlike some other local search algorithms, iterated descent does not require much tuning in order to be competitive.