精密外罩的成形工艺及模具

分析了外罩的工艺性能和材料性能,叙述了精密外罩的成形工艺及其模具结构.     

μC/OS-Ⅱ在51系列单片机上的移植

介绍了嵌入式实时操作系统内核μC/OS-Ⅱ在51系列单片机上的移植的详细步骤.     

绝热层粘接检测图像的多分辨率融合

基于固体火箭发动机绝热层超声C扫描粘接检测时高分辨率探头检测易受噪声干扰、低分辨率探头检测精度不高的矛盾,提出了将两种不同分辨率探头检测图像融合的方法,讨论了利用二维小波多分辨率分析法进行图像融合的步骤与算法,并将其用于实际检测的粘接图像的处理,实验表明采用所提出的方法完全可以获得高分辨率、高信噪比的粘接检测图像.     

基于自适应粒子群算法的目标定位方法研究

针对现有定位求解算法复杂和标准粒子群算法易陷入局部最优的缺点,提出了一种基于自适应粒子群算法的目标定位方法.该方法在迭代过程中指数更新惯性权重,择优选择粒子,并根据种群适应度方差值自适应地调整变异概率的大小,增强算法跳出局部最优的能力.仿真结果表明该方法能有效地提高目标的定位精度,在随机噪声干扰方差为0.5的条件下,定位均方误差不超过0.8m.     

双语法规则程序依赖性分析

为了提高传统程序依赖性分析的应用范围和灵活性,提出一种新的程序分析方法。该方法分为不完整性分析和完整性分析两部分。在gcc3.2和Linux内核2.4.20-8的编译环境下,利用不同的词法和语法分析模块对程序结构、数据依赖和控制信息进行提取,加快了程序分析的速度,并有效降低了程序数据流依赖分析和控制流依赖分析中算法的复杂度。最后用具体的程序实现证明了该算法的可行性。     

低相干光干涉法延时测量中的误差分析

低相干光干涉法通过测量宽谱光通过待测器件之后的相位变化得到其相对延时量。采集宽谱光时域干涉数据,利用傅里叶变换提取出频域相位信息后再进行相位展开、多项式拟合处理,所得相位曲线对频率求导可得待测延时曲线。延时测量误差来源于干涉信号强度误差和纯相位误差。理论分析和仿真计算表明,延时误差与相位误差成正比;强度噪声引起的相位误差与噪声强度成正比,且该类噪声可通过曲线拟合算法得到有效抑制。实验表明,温度等环境因素引起的纯相位误差是延时测量误差的主要因素。实验上,对约19 m光子晶体光纤于1540~1560 nm波段的相对延时进行了测量,达到了0.14 ps的精度。     

退火工艺对Al离子注入的4H-SiC表面形貌的影响

通过应用多次Al离子注入和CVD中的高温退火技术,在SiC片表面形成了p型层。p型层中各深度下Al的浓度均为110¹⁹cm^-3,层厚为550nm。本文应用三种不同的退火工艺对注入后的SiC进行退火。通过测量和比较表面粗糙度,发现通过石墨层覆盖来保护表面的退火工艺可以很好的阻止SiC表面在高温退火下的粗化,粗糙度保持在3.8nm。通过其他两种(在氩气保护下、在SiC保护片的覆盖下)退火工艺退火所得到的表面有明显的台阶,粗糙度分别为12.2nm和6.6nm。     

A performance metric for codes with a high-order spectral at zero frequency

Sum-variance is a well-known metric for assessing the performance of dc-free codes (first-order spectral- codes), however, as we show in this paper, it is unsuitable for comparing the magnitude of spectral components of high-order spectral- (HOSN) codes at low frequencies. In this paper, we introduce a new performance metric for evaluating the spectrum compression of arbitrarily HOSN codes around zero frequency; we call this metric the low-frequency spectrum weight (LFSW). We show that the asymptotic low-frequency spectral components of Kth-order spectral- codes (K/spl ges/1) are exclusively determined by the order K and the LFSW, and that the LFSW equals the zero-frequency value in the spectrum of the corresponding sequence of Kth-order running digital sum values. We derive this result for symbol-by-symbol encoding, and then extend it to block HOSN codes. We then derive a closed-form expression for the LFSW of HOSN codes constructed through state-independent encoding. Closed-form expressions for LFSW of first-order zero-disparity codes and for the asymptotic LSFW of maxentropic dc-free sequences are also given.     

Blind feedforward cyclostationarity-based timing estimation for linear modulations

By exploiting a general cyclostationary (CS) statistics-based framework, this letter develops a rigorous and unified asymptotic (large sample) performance analysis setup for a class of blind feedforward timing epoch estimators for linear modulations transmitted through time nonselective flat-fading channels. Within the proposed CS framework, it is shown that several estimators proposed in the literature can be asymptotically interpreted as maximum likelihood (ML) estimators applied on a (sub)set of the second- (and/or higher) order statistics of the received signal. The asymptotic variance of these ML estimators is established in closed-form expression and compared with the modified Crame/spl acute/r-Rao bound. It is shown that the timing estimator proposed by Oerder and Meyr achieves asymptotically the best performance in the class of estimators which exploit all the second-order statistics of the received signal, and its performance is insensitive to oversampling rates P as long as P/spl ges/3. Further, an asymptotically best consistent estimator, which achieves the lowest asymptotic variance among all the possible estimators that can be derived by exploiting jointly the second- and fourth-order statistics of the received signal, is also proposed.     

Detection of buried targets via active selection of labeled data: application to sensing subsurface UXO

When sensing subsurface targets, such as landmines and unexploded ordnance (UXO), the target signatures are typically a strong function of environmental and historical circumstances. Consequently, it is difficult to constitute a universal training set for design of detection or classification algorithms. In this paper, we develop an efficient procedure by which information-theoretic concepts are used to design the basis functions and training set, directly from the site-specific measured data. Specifically, assume that measured data (e.g., induction and/or magnetometer) are available from a given site, unlabeled in the sense that it is not known a priori whether a given signature is associated with a target or clutter. For N signatures, the data may be expressed as {x/sub i/,y/sub i/}/sub i=1,N/, where x/sub i/ is the measured data for buried object i, and y/sub i/ is the associated unknown binary label (target/nontarget). Let the N x/sub i/ define the set X. The algorithm works in four steps: 1) the Fisher information matrix is used to select a set of basis functions for the kernel-based algorithm, this step defining a set of n signatures B/sub n//spl sube/X that are most informative in characterizing the signature distribution of the site; 2) the Fisher information matrix is used again to define a small subset X/sub s//spl sube/X, composed of those x/sub i/ for which knowledge of the associated labels y/sub i/ would be most informative in defining the weights for the basis functions in B/sub n/; 3) the buried objects associated with the signatures in X/sub s/ are excavated, yielding the associated labels y/sub i/, represented by the set Y/sub s/; and 4) using B/sub n/,X/sub s/, and Y/sub s/, a kernel-based classifier is designed for use in classifying all remaining buried objects. This framework is discussed in detail, with example results presented for an actual buried-UXO site.