用联合变换相关器实现灰阶图像绝对差度量光学匹配

将绝对差度量（ＡＤＭ）引入联合变换相关器（ＪＴＣ）,实现了灰阶图像光学匹配的计算机模拟实验,利用循环编码方法,通过联合变换相关器一步绝对差度量,相关后的图像通过取高阈值的分割方法来实现对目标的准确判断,针对高斯噪声干扰情况,分析了阈值选择问题,提高了灰阶目标识别抵抗器材怕畸变干扰的能力。     

Pb0.50Sr0.75Y0.70Ca0.25Cu1.70Oy单晶的磁阻研究

对低掺杂区非超导的Pb_(6.56)Sr_(?)Y_(?)Ca_(?)Cu_(?)O_y单晶样品进行了电阻和磁阻的测量,发现在低温下电阻温度关系遵从变程跳跃传导的R=R_(?)exp[(T_(?)/T)~(?)]的变化规律,这说明该样品处于强局域化区域.在低温下的磁阻为负并有明显的各向异性,这表明这类体系的磁阻主要来自于轨道效应的贡献,并且可能受到自旋-轨道散射的影响. 关键词：     

τ质量测量方案的Monte Carlo研究

在τ质量实验测量之前对多种测量方案进行了细致的Monte Carlo研究,并进行了比较.确定τ质量测量实验采用最大似然法,并给出可能的测量精度.研究了包括探测效率、束流能散等诸多因素对实验的影响,同时对实验的实现提出要求.     

北京谱仪中性径迹测量误差的确定

首先检查了北京谱仪(BES)桶部簇射计数器(BSC)对γ光子电磁簇射形成的中性径迹的沉积能量和空间位置的测量值;然后,利用辐射Bhabha事例修正了BSC的沉积能量及其误差δE;利用e⁺e^－→γγ(γ)过程确定了BSC测量中性径迹的空间位置的误差,这些研究结果可以减小用运动学拟合方法分析包含中性径迹的物理事例的系统误差,提高BES的测量精度.     

A Single-Ridged Coaxial Hybrid TE011 Coupler with High Mode Purity

We design a single-ridged coaxial hybrid coupler which excites a TE₀₁₁ mode of high mode content in a cylindrical cavity, resonating at 28.2GHz. The coupler consists of a WR-28 rectangular waveguide, a coaxial TE_n11 cavity, and a cylindrical TE₀₁₁ cavity. Both TE₃₁₁ coaxial cavity and TE₄₁₁ single-ridged coaxial cavity are analyzed to examine the TE₀₁₁ mode purity in the central cavity. Mode purity analysis is performed by a field expansion method using Fourier-Bessel orthonormal basis functions. Numerical calculations predict that the TE₄₁₁ single-ridged coaxial cavity excites the TE₀₁₁ mode with mode purity of 98.6%, which is improved by 3% higher compared with the TE₃₁₁ coaxial cavity. Measurements on the single-ridged coaxial coupler show a resonant frequency at 28.078GHz and ohmic and external Qs of 1560, 473 respectively, which are in good agreement with the simulated results of a 3-D finite element electromagnetic code.     

周期分析法在棉红蜘蛛发生程度预测中的应用

本文应用周期分析方法对江陵县棉红蜘蛛—朱砂叶螨的预测预报技术作了新的尝试．经对江陵县３６年历史资料拟合，符合率高达９４．４％．运用这一技术对该县１９８７—１９９６年棉红蜘蛛发生程度进行了１０年长期预测预报．     

Two-machine flow shop scheduling problem with an outsourcing option

We consider a two-machine flow shop problem in which each job is processed through an in-house system or outsourced to a subcontractor. A schedule is established for the in-house jobs, and performance is measured by the makespan. Jobs processed by subcontractors require paying an outsourcing cost. The objective is to minimize the sum of the makespan and total outsourcing costs. We show that the problem is NP-hard in the ordinary sense. We consider a special case in which each job has a processing requirement, and each machine a characteristic value. In this case, the time a job occupies a machine is equal to the job’s processing requirement plus a setup time equal to the characteristic value of that machine. We introduce some optimality conditions and present a polynomial-time algorithm to solve the special case.