一种大尺度二维直线度精密测量的新方法

本文提出了一种远距离、大范围二维直线度测量的新方法．该方法采用特殊设计的十字线准直激光器及线阵CCD，通过特殊的光学系统结构设计，能在0-20m距离内连续测量，直线度范围可达70mm，精度优于0．1mm，实际测量结果表明，该方法可适应野外作业环境。     

Wavelength and Waveband Assignment for Ring Networks Based on Parallel Multi‐granularity Hierarchical OADMs

In this paper we study the optimization issues of ring networks employing novel parallel multi‐granularity hierarchical optical add‐drop multiplexers (OADMs). In particular, we attempt to minimize the number of control elements for the off‐line case. We present an integer linear programming formulation to obtain the lower bound in optimization, and propose an efficient heuristic algorithm called global bandwidth resource assignment that is suitable for the design of large‐scale OADM networks.     

MIMO系统的约束广义预测控制

讨论了输出终端带不等式约束情形的多输入多输出系统，说明了这些约束可以通过修改输入柔化系数而使其得以满足，在柔化系数的选择范围确定过程中，为了避免矩阵求逆，采用利用已知数据辨识参数的方法来确定柔化系数，从而使得问题简化。降低了计算量且加快了收敛速度。     

用DSP实现多目标实时跟踪

介绍了在 TMS3 2 0 C62 0 3上实现 4个目标的快速跟踪技术。为了提高实时性和精确度 ,采用线性汇编优化实现。1个 3 2 0× 160主窗口的 DSP平均处理时间为 2 m s,3个 60× 60副窗口的 DSP平均处理时间各为 0 .4ms,实现了复杂背景下低对比度目标的快速跟踪。实验结果证明跟踪效果良好 ,解决了以前窗口开不大、跟踪速度慢的问题     

Impulsive Noise Suppression from Highly Distorted Images with Triangular Interpolants

In this paper a new filter, Triangular Interpolant Based Impulsive Noise Suppression Filter (SF), is proposed to restore images corrupted by fixed valued impulsive noise (IN). The proposed filter comprises two main stages: detection of noise and restoration of corrupted pixels. The SF achieves the restoration of the detected noisy pixels by using one of the Triangular Interpolant techniques and leaves the other pixels unaltered. Simulation results reveal that the proposed filter shows better performance than the highly approved IN suppression filters across a wide noise density ranging from 10% to 90%. The proposed filter also perfectly achieves the robustness anddetail preservation with reduced computational complexity.     

卷积码的线性系统

介绍了卷积码的线性离散时不变系统模型。从建立卷积码的状态变量方程出发,研究了卷积码的代数结构,并详细论述了基于状态变量方程描述的迭代译码算法。     

Approximate inverse computation using Frobenius inner product

Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, min_M∈??∥AM?I∥ _F and matrix M₀∈?? corresponding to this minimum (?? being any vectorial subspace of ??_n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.     

SPECTRUM-PRESERVING ELEMENTARY OPERATORS ON B（X）

1.IntroductionLetXbeaninfinitedimensionalcomplexBanachspaceandB(X)theBanachalgebraofallboundedlinearoperatorsonX.ForTEB(X),a(T),asusual,willdenotethespectrumofT.Let4bealinearmapfromB(X)intoitself.4isspectrum-preservingifa(di(T))=a(T)forallTEB(X);4isspectrum-compressingifa(4(T))ga(T)forallTEB(X).Itisclearthatif4isunital(i.e.,ac(I)=I),thenacisspectrum-preserving(spectrum-compressing)ifandonlyif4preservesinvertibilityinbothdirections(preservesinvertibility),i.e.,4(T)isinvertibleifando…     

Recursive partition and amalgamation with the exponential family: Theory and applications

The theory of tree-growing (RECPAM approach) is developed for outcome variables which are distributed as the canonical exponential family. The general RECPAM approach (consisting of three steps: recursive partition, pruning and amalgamation), is reviewed. This is seen as constructing a partition with maximal information content about a parameter to be predicted, followed by simplification by the elimination of ‘negligible’ information. The measure of information is defined for an exponential family outcome as a deviance difference, and appropriate modifications of pruning and amalgamation rules are discussed. It is further shown how the proposed approach makes it possible to develop tree-growing for situations usually treated by generalized linear models (GLIM). In particular, Poisson and logistic regression can be tree-structured. Moreover, censored survival data can be treated, as in GLIM, by observing a formal equivalence of the likelihood under random censoring and an appropriate Poisson model. Three examples are given of application to Poisson, binary and censored survival data.     

COMPACT COUPLED LINEAR TAPERED LINE BANDPASS FILTER WITH TWO TRANSMISSION ZEROS

A new compact bandpass filter composed of two coupled linear tapered line resonators (LTLRs) is designed. The two resonators are arranged in different layers. The filter has two transmission zeros on both sides of the passband. It has small size and steep response below its passband. It is also shown that this filter has 0.6 dB low insertion loss at the centre frequency and 10.5% 3dB bandwidth. This work was supported by the Development Foundation of Shanghai Educational Committee (217608) and Shanghai Leading Academic Discipline Project (T0102).