光学移相干涉仪抗振系统的鲁棒μ控制器设计

将结构奇异值μ综合鲁棒控制技术应用于主动抗振控制系统中,并用于解决光学移相干涉仪抗振系统的不确定性问题.采用小波分析方法将随机振动信号进行时频分析后得到低频全局信息,随后运用μ综合D-K迭代法设计鲁棒μ控制器对低频振动进行抑制.该方法克服了由模型自身和外部干扰所引起的不确定性,使得控制系统能够有效地抑制抗振模型的不确定性和外部振动的干扰,同时也具有很高的控制准确度和灵敏度.仿真结果表明,该方法使光学移相干涉仪在外部振动的干扰下具有较好的鲁棒稳定性和控制准确度,同时也能较好地抑制低频振动.     

自控液晶光阀组式光刻快门研究

通过理论推导,构建了抗蚀剂的感光特性、光源的光效与曝光量之间的数学模型,为液晶光阀代替穿孔带提供了理论依据.结合液晶光阀的工作原理和光刻快门的控制原理,对液晶光阀组的控制进行了研究并给出了其控制电路图.通过实际光刻试验,自控液晶光阀组光刻快门机构可以完成编码图案的控制,通光控制达到了预计要求,刻出的图案清晰,线条陡直.证明液晶光阀组替代穿孔带用作光刻快门是完全可行的.     

Remote preparation of an entangled two-qubit state with three parties

We present a scheme for probabilistic remote preparation of an entangled two-qubit state with three parties from a sender to either of two receivers. The quantum channel is composed of a partially entangled two-qubit state and a partially entangled three-qubit state. We calculate the successful total probabilities of the scheme in general and particular cases, respectively. We also calculate total classical communication cost in a general case and two particular cases, respectively.     

干涉型光纤传感器相位生成载波技术研究与改进

对干涉型光纤传感器的相位生成载波解调技术进行了研究.对PGC算法进行了数学推导和仿真计算,对数字低通滤波器进行了详细分析,给出了其影响PGC解调性能的原因及数字滤波器的设计方法.讨论了传感器干涉光强对PGC算法输出结果的影响,提出了改进的PGC算法,该算法可以有效的实现自动增益控制,消除干涉光强漂移对解调的影响,并大大减小由干涉光强引入的系统噪音;还可以在有限阶数低通滤波器的情况下,极大的增加系统可解调的大信号幅度,提高系统动态范围12 dB以上.     

Performance of a 4×10 Gbit/s optical time domain multiplexed system using SMZ switching

Optical time division multiplexing (OTDM) is emerging and promising alternative for future high-speed photonic networks because of its ability to accommodate higher bit rate and flexible bandwidth. Among other factors the performance of an OTDM system largely depends upon the switching characteristics of a de-multiplexer (DEMUX). Symmetric Mach-Zehnder (SMZ) have been found to be most suitable than all the available de-multiplexing switches because of compact size, thermal stability, and low power operation. In this paper, we simulate four-channel OTDM systems (all channel multiplexer (MUX) and DEMUX) with a Mach-Zehnder modulator and SMZ DEMUX to investigate the impact of signal power, pulse width and control signal power on BER.     

Optimal allocation and processing time decisions on non-identical parallel CNC machines: ϵ-constraint approach

When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance. A well known example for such a case that this paper specifically deals with is the turning operation on a CNC machine. Manufacturing cost of a turning operation is a nonlinear convex function of its processing time. In this paper, we deal with making optimal machine-job assignments and processing time decisions so as to minimize total manufacturing cost while the makespan being upper bounded by a known value, denoted as ?-constraint approach for a bicriteria problem. We then give optimality properties for the resulting single criterion problem. We provide alternative methods to compute cost lower bounds for partial schedules, which are used in developing an exact (branch and bound) algorithm. For the cases where the exact algorithm is not efficient in terms of computation time, we present a recovering beam search algorithm equipped with an improvement search procedure. In order to find improving search directions, the improvement search algorithm uses the proposed cost bounding properties. Computational results show that our lower bounding methods in branch and bound algorithm achieve a significant reduction in the search tree size that we need to traverse. Also, our recovering beam search and improvement search heuristics achieve solutions within 1% of the optimum on the average while they spent much less computational effort than the exact algorithm.     

Applicability of medium-size basis sets in calculations of molecular dynamic polarisabilities

Static and dynamic average polarisabilities and polarisability anisotropies of seven linear non-polar and polar molecules are calculated within the CCS, CC2, and CC3 approximations using a range of medium-sized basis sets: the polarised LPol-n (n = ds, dl, fs, fl), the aug-pc-n (n = 1, 2), the def2-SVPD, and -TZVPD basis sets. Reference values are obtained using a hierarchy of Dunning's (d-)aug-cc-pVXZ (X = D, T, Q, 5) basis sets. The results are discussed together with the available CCSD values in terms of basis set and correlation method errors, and their ratio. Detailed analysis shows that already the def2-SVPD basis set can be used in CCS polarisability calculations. When affordable, the slightly larger aug-pc-1 basis set is recommended, as it leads to significant reduction of basis set error. The def2-TZVPD, LPol-ds, and aug-pc-2 basis sets are optimal choice within the CC2 approximation, with the latter allowing to approach the CC2 basis set limit. The LPol-ds, -dl, and def2-TZVPD sets outperform the aug-cc-pVTZ set in average polarisability CCSD calculations, with the def2-TZVPD being competitive to other reduced-size sets also in determination of polarisability anisotropy. The aug-pc-2 basis is a particularly attractive choice for CCSD, giving the accuracy of aug-cc-pVQZ at a significantly reduced computational cost. The polarisability anisotropy is shown to be more computationally demanding than the average polarisability, in particular with respect to the accuracy of the correlation method and an accurate evaluation of this property requires at least the CCSD model.     

工程施工中运输网络优化方案

施工工地运输方案的优化设计可以归结为 :按施工期要求设计运输线路或验证已有线路通行能力 ,计算总线路中影响提高流量的关键路段 ,取得最小费用最大流 .本文运用图论理论这一数学工具把实际问题抽象为有向网络 ,进而建立数学模型 .此方法理论上严密 ,解题步聚直观清晰 ,对水利、公路、水路、铁路等其它运输系统有普遍意义 .     

Single machine group scheduling with ordered criteria

The single machine group scheduling problem is considered. Jobs are classified into several groups on the basis of group technology, i.e. jobs of the same group have to be processed jointly. A machine set-up time independent of the group sequence is needed between each two consecutive groups. A schedule specifies the sequence of groups and the sequence of jobs in each group. The quality of a schedule is measured by the criteriaF ₁, ...,F _m ordered by their relative importance. The objective is to minimize the least important criterionF _m subject to the schedule being optimal with respect to the more important criterionF _m–1 which is minimized on the set of schedules minimizing criterionF _m–2 and so on. The most important criterion isF ₁, which is minimized on the set of all feasible schedules. An approach to solve this multicriterion problem in polynomial time is presented if functionsF ₁, ...,F _m have special properties. The total weighted completion time and the total weighted exponential time are the examples of functionsF ₁, ...,F _m–1 and the maximum cost is an example of functionF _m for which our approach can be applied.The research of the authors was partially supported by a KBN Grant No. 3 P 406 003 05, the Fundamental Research Fund of Belarus, Project N 60-242, and the Deutsche Forschungsgemeinschaft, Project Schema, respectively. The paper was completed while the first author was visiting the University of Melbourne.     

上市公司资本成本面板数据模型与实证分析

本文利用我国上市公司1997至2002年的有关财务数据,建立了我国上市公司资本成本面板数据模型,运用该模型分析了我国上市公司资本成本与财务杠杆、企业规模的关系.结果表明,财务杠杆的提升、企业规模的扩大将使资本成本下降.该结论对我国上市公司优化资本结构、提高企业价值具有一定的参考价值.