Effects of extended dislocations on charge distribution in GaN epilayer

We have investigated the effect of extended dislocations (0.5-3 μm) on charge distribution in GaN epilayer grown by metalorganic chemical vapor deposition on (0001) sapphire using atomic force microscopy (AFM) and scanning surface potential microscopy (SSPM). It has been observed for the surface at the extended dislocations present in undoped GaN film to be negatively charged showing 0.04-0.2 V higher potential relative to regions that contain no dislocations. In addition to the higher potential at the dislocation core, the surrounding surfaces, including the edge of the dislocations, are also negatively charged in a symmetric way around the dislocations revealing crater-shaped higher potential regions (∼0.04 V) relative to surrounding dislocation-free area. The experimental results show that the protrusion-type of dislocation is also negatively charged and its potential is dependent on the size of dislocation.     

基于公钥加密算法和PPCT动态图编码的软件指纹方案

提出了一种综合PPCT动态图编码方法和椭圆曲线加密算法的软件指纹方案,该方案将公钥加密技术和软件水印技术综合应用于软件版权的保护和验证过程中,充分利用两者的优势,具有安全性高和抗恶意篡改能力强的特点.     

在LabVIEW程序运行中实现控件的动态移动

通过两种在LabVIEW程序运行中实现控件移动的方法的对比,着重介绍了结合了VI Sever技术的动态注册事件结构的用法,从而总结出其具有优化程序、减少内存、提高CPU利用率等方面的优点.     

A new iterative order reduction (IOR) method for eigensolutions of large structures

Order reduction is a computationally efficient method to estimate some lowest eigenvalues and the corresponding eigenvectors of large structural systems by reducing the order of the original model to a smaller one. But its accuracy is limited to a small range of frequencies that depends on the selection of the retained degrees of freedom. This paper proposes a new iterative order reduction (IOR) technique to obtain accurately the eigensolutions of large structural systems. The technique retains all the inertia terms associated with the removed degrees of freedom. This hence leads to the reduced mass matrix being in an iterated form and the reduced stiffness matrix constant. From these mass and stiffness matrices, the eigensolutions of the reduced system can be obtained iteratively. On convergence the reduced system reproduces the eigensolutions of the original structure. A proof of the convergence property is also presented. Applications of the method to a practical GARTEUR structure as well as a plate have demonstrated that the proposed method is comparable to the commonly used Subspace Iteration method in terms of numerical accuracy. Moreover, it has been found that the proposed method is computationally more efficient than the Subspace Iteration method. Copyright © 2003 John Wiley & Sons, Ltd.     

基于μCLinux的NAT设备的设计与开发

NAT(网络地址翻译)技术有效地解决了IP地址紧缺的问题,为实现IPv4到IPv6的平滑过渡发挥了巨大的作用.在一个体积小、重量轻、价格低廉的嵌入式平台上实现NAT设备具有很好的实际意义.文中介绍了NAT技术的原理和实现过程,在自行设计的ARM7嵌入式硬件平台上基于μCLinux操作系统实现了NAT的功能,并通过实现其他相关功能,构建了完整的NAT设备,完成了小型网络接入Internet的方案.     

我国风机盘管技术现状分析

介绍了近年来我国在风机盘管技术领域的最新成果，在结构形式、强化传热、提高室内空气品质、降低噪音和提高自动控制水平等方面的技术进展情况，分析了目前风机盘管中存在的问题，并对今后的发展方向进行了展望。     

Mode Matching Analysis of a Tapered Coaxial Tip in a Parallel-Plate Waveguide

A tapered coaxial tip in a parallel plate waveguide is investigated. A boundary-value problem of electromagnetic scattering from a tapered coaxial monopole is solved rigorously based on the Fourier transform, eigenfunction expansion, and mode matching. Scattering parameters are represented in a series and computed to understand the behavior of the scattering in terms of the coaxial tip geometry.     

用于实时数据传输的滑动帧方法及其实现

根据某雷达系统对测量信号的快速传输要求,提出采用滑动帧的处理方法并在FPGA中实现,克服了传统帧处理难以满足快速传输要求的不足。阐述了滑动帧结构的构造思想,详述了滑动帧结构的特点及具体功能模块的实现。根据实际应用需求构造了滑动帧结构处理器,试验和应用结果表明设计可行有效,能充分满足实时数据传输的要求。     

Average consensus in networks of dynamic agents with switching topologies and multiple time-varying delays

In this paper, we discuss average consensus problem in undirected networks of dynamic agents with fixed and switching topologies as well as multiple time-varying communication delays. By employing a linear matrix inequality method, we prove that all the nodes in the network achieve average consensus asymptotically for appropriate communication delays if the network topology is connected. Particularly, several feasible linear matrix inequalities are established to determine the maximal allowable upper bound of time-varying communication delays. Numerical examples are given to demonstrate the effectiveness and the sharpness of the theoretical results.