Efficient design of SIW filters with knowledge‐embedded space mapping technique

This article presents an optimization technique for the design of substrate‐integrated waveguide (SIW) filters using knowledge‐embedded space mapping. An effective coarse model is proposed to represent the SIW filter. The proposed coarse model can be analyzed in the available commercial software ADS. The embedded knowledge includes not only formulas but also extracted design curves, which help to build the mapping between the coarse and fine models. The effectiveness of the proposed method is demonstrated through a design example of a six‐pole SIW filter. © 2012 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2012.     

SVM-based ontology matching approach

There are a lot of heterogeneous ontologies in semantic web, and the task of ontology mapping is to find their semantic relationship. There are integrated methods that only simply combine the similarity values which are used in current multi-strategy ontology mapping. The semantic information is not included in them and a lot of manual intervention is also needed, so it leads to that some factual mapping relations are missed. Addressing this issue, the work presented in this paper puts forward an ontology matching approach, which uses multi-strategy mapping technique to carry on similarity iterative computation and explores both linguistic and structural similarity. Our approach takes different similarities into one whole, as a similarity cube. By cutting operation, similarity vectors are obtained, which form the similarity space, and by this way, mapping discovery can be converted into binary classification. Support vector machine (SVM) has good generalization ability and can obtain best compromise between complexity of model and learning capability when solving small samples and the nonlinear problem. Because of the said reason, we employ SVM in our approach. For making full use of the information of ontology, our implementation and experimental results used a common dataset to demonstrate the effectiveness of the mapping approach. It ensures the recall ration while improving the quality of mapping results.     

Polynomial approximation of functions of matrices and applications

In solving a mathematical problem numerically, we frequently need to operate on a vector by an operator that can be expressed asf(A), whereA is anN ×N matrix [e.g., exp(A), sin(A), A^–-]. Except for very simple matrices, it is impractical to construct the matrixf (A) explicitly. Usually an approximation to it is used. This paper develops an algorithm based upon a polynomial approximation tof (A). First the problem is reduced to a problem of approximatingf (z) by a polynomial in z, where z belongs to a domainD in the complex plane that includes all the eigenvalues ofA. This approximation problem is treated by interpolatingf (z) in a certain set of points that is known to have some maximal properties. The approximation thus achieved is almost best. Implementing the algorithm to some practical problems is described. Since a solution to a linear systemAx=b isx=A ^–1 b, an iterative solution algorithm can be based upon a polynomial approximation tof (A)=A ^–1. We give special attention to this important problem.     

Parallel heap: An optimal parallel priority queue

We describe a new parallel data structure, namely parallel heap, for exclusive-read exclusive-write parallel random access machines. To our knowledge, it is the first such data structure to efficiently implement a truly parallel priority queue based on a heap structure. Employing p processors, the parallel heap allows deletions of (p) highest priority items and insertions of (p) new items, each in O(log n) time, where n is the size of the parallel heap. Furthermore, it can efficiently utilize processors in the range 1 through n.This work was supported by U.S. Army's PM-TRADE contract N61339-88-g-0002, Florida High Technology and Industry grant 11-28-716, and Georgia State University's internal research support during spring and summer quarters, 1991.     

一种改进的人脸纹理映射方法

识别人脸图像优化问题,由于人脸纹理映射时容易出现的纹理扭曲和畸变现象,影响图像的真实性,提出一种改进的纹理图像映射方法。根据人脸特征点信息,利用特征块匹配法配准正侧面人脸图像,并使用加权平滑算法和金字塔方法对图像进行双重融合实现图像的平滑过渡;然后利用一种特殊的定位方法来计算三维人脸模型上顶点对应的纹理坐标;最后根据纹理坐标将纹理图像映射到三维特定人脸模型表面上,可得到具有真实感的三维人脸模型。实验结果表明,纹理合成方法简捷有效,纹理映射结果生动逼真,有效的避免了纹理图像的扭曲和畸变现象,具有较高的鲁棒性。     

太阳风粒子数据映射模型的设计与实现

为了能够快速获得第三级太阳风粒子可分析处理的结构化数据,本文采用将数据映射到内存和采用语言集成查询技术解决数据的完整映射和快速访问。通过设计数据映射模型,将用PDS数据的数据标签和数据产品分别映射到模型的值域和属性域,解决本地或网络数据内存映射的问题。为测试这个实例,采用双倍缓冲和贝塞尔插值技术对数据能谱进行了实时绘制。结果表明该模型具有高效性、完备性和高吻合度。这个基于内存映射的模型能够较好地解决异构数据快速结构化数据访问的数据源动力不足问题,为进一步处理和分析太阳高能粒子的频谱、成份和通量及随时间、空间变化的分布特征等提供了基础。     

Photothermal radiometric detection and imaging of surface cracks

This paper discusses surface crack detection by photothermal radiometric imaging (PRI). In PRI, also called dynamic infrared scanning, a surface is scanned with a spot of heat. Imperfections are detected by radiometrically sensing changes in the surface temperature of a small area in the vicinity of this spot. In the work described, cracks narrower than 25 µm (0.001 in.) in a lightly rusted steel surface have been detected. Indiscrete scanning an amplitude modulated heating beam is moved in steps, remaining at each location long enough to measure amplitude and phase of the AC temperature. Incontinuous scanning a constant intensity heating beam is moved continuously while the temperature deviations are measured. This paper presents methods of calculating amplitude and phase of surface temperature for discrete scanning and instantaneous temperature for continuous scanning across a surface crack. For a steel surface scanned by a watt-level laser beam, predicted surface temperature deviations when crossing the crack are several degrees Celsius, with expected radiometrically detected power several orders of magnitude above the detector noise. In experiments performed, both techniques easily detected narrow cracks in a smooth, clean surface. Discolorations and pits, on the other hand, generate a disturbing type of surface noise. This noise was minimized by differential detection. Based on results obtained, continuously scanned PRI with a fan-type heating beam and array detection could become a viable way of mapping surface cracks at practical scanning speeds.     

On mapping processes to processors in distributed systems

This paper is concerned with the implementation of parallel programs on networks of processors. In particular, we study the use of the network augmenting approach as an implementation tool. According to this approach, the capabilities of a given network of processors can be increased by adding some auxiliary links among the processors. We prove that the minimum set of edges needed to augment a line-like network so that it can accommodate a parallel program is determined by an optimal path cover of the graph representation of the program. Anoptimal path cover of a simple graphG is a set of vertex-disjoint paths that cover all the vertices ofG and has the maximum possible number of edges. We present a linear time optimal path covering algorithm for a class of sparse graphs. This algorithm is of special interest since the optimal path covering problem is NP-complete for general graphs. Our results suggest that a cover and augment scheme can be used for optimal implementation of parallel programs in line-like networks.A preliminary version of this paper was presented at the 6th IEEE Conference on Computer Communications (INFOCOM '87).This reseach is supported in part by National Semiconductor (Israel), Ltd.     

低碳钢显微结构的EBSD表征

近年来,新开发的电子背散射衍射技术将多晶材料的显微组织、微区成分与结晶学数据分析联系起来,能对晶界类型、取向、位向差和结构及其分布进行观察、统计测定和定量分析,从而建立了晶界结构、取向和织构等与多晶材料性能的定量和半定量关系,成为现代材料研究的重要实验技术。笔者结合低碳钢生产中的一些实际问题,扼要介绍了电子背散射衍射技术中的晶体取向图在多晶材料显微结构表征中的应用。     

基于红外检测的变电站设备热状态诊断

提出了一种基于红外检测的变电站设备热状态诊断方案。首先基于变电站设备的红外图像,采用局部方差映射函数和遗传算法阈值提取了变电站设备的热状态数据,以用于对异常区域进行分割。然后构建了红外图像灰度数与变电站设备温度两者之间的关系。最后采用改进的相对温差法达到了对设备热状态进行分类和诊断的目标,并捕获定位了变电站设备的热状态异常区域。实验结果表明,该方法提高了异常热区提取的精度和效率,提升了变电站设备热状态诊断的容错能力,进一步保证了变电站和整个电力系统的运行稳定性。