Mn位W掺杂对La0.3Ca0.7MnO3体系磁结构的影响

通过对La0.3Ca0.7Mn1-xWxO3(x=0.00,0.04,0.08,0.12,0.15)多晶样品M-T曲线、M-H曲线及ESR谱的测量,研究了Mn位W掺杂对电荷有序体系La0.3Ca0.7MnO3磁结构的影响.结果表明,当掺杂量为0.00≤x≤0.08时,体系存在电荷有序(CO)相,AFM/CO态共存于相变温度以下,电荷有序温度TCO随着W掺杂量的增加而增加;x=0.04时,样品在低温下为FM相与AFM/CO相共存,在CO相建立前、后均有FM从PM中分离出来;当x≥0.12时,CO态融化,在极低温度下存在顺磁-铁磁(PM-FM)相变.     

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

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

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.     

T-C模型中虚光子过程对光场压缩效应的影响

利用全量子理论,研究非旋波近似下TC模型中受激场的压缩效应.结果表明:非旋波近似下,由于虚光场的影响,Q的演化曲线出现了“小锯齿状”,表现为系统的量子噪声,随着ω和n的增大,量子噪声分别减小和增大,虚光子过程使光场的压缩程度明显加深;研究结果还揭示了原子场耦合系数λ及原子间耦合系数g与光场压缩效应的关系. 关键词： T-C模型 非旋波近似 压缩效应 量子噪声     

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.     

Bulk Sn1−xMnxO2 magnetic semiconductors without room-temperature ferromagnetism

Polycrystalline Sn_1−xMn_xO₂ (0≤x≤0.05) diluted magnetic semiconductors were prepared by solid-state reaction method and their structural and magnetic properties had been investigated systematically. The three Mn-doped samples (x=0.01, 0.03, 0.05) undergo paramagnetic to ferromagnetic phase transitions upon cooling, but their Curie temperatures are far lower than room temperature. The magnetization cannot be attributed to any identified impurity phase. It is also found that the magnetization increases with increasing Mn doping, while the ratio of the Mn ions contributing to ferromagnetic ordering to the total Mn ions decreases.     

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.