基于二代bandelets域HMT模型的图像分割

在小波域隐马尔可夫树模型(WHMT)图像分割算法的基础上,根据二代handelets系数的分布统计特性,提出一种新的bandelets域隐马树模型(BHMT)有监督图像分割算法.新算法试图利用二代bandelets能表示图像几何规律性的特点来改进分割效果.为证明算法的有效性,用合成纹理图像和真实的航空和遥感图像做分割实验,并和小波域隐马模型树分割算法作了对比,对合成纹理图像分割,用错分概率作为评价参数.实验结果表明,此方法错分概率低、分割效果理想.     

双马尔可夫决策过程联合模型

人类在处理问题中往往分为两个层次,首先在整体上把握问题,即提出大体方案,然后再具体实施.也就是说人类就是具有多分辨率智能系统的极好例子,他能够在多个层次上从底向上泛化(即看问题角度粒度变"粗",它类似于抽象),并且又能从顶向下进行实例化(即看问题角度变"细",它类似于具体化).由此构造了由在双层(理想空间即泛化和实际空间即实例化)上各自运行的马尔可夫决策过程组成的半马尔可夫决策过程,称之为双马尔可夫决策过程联合模型.然后讨论该联合模型的最优策略算法,最后给出一个实例说明双马尔可夫决策联合模型能够经济地节约"思想",是运算有效性和可行性的一个很好的折中.     

基于子空间方法的精馏塔系统辨识建模研究

子空间辨识方法作为一种有效的针对多输入-多输出系统(MIMO)的辨识建模方法近年来受到广泛的重视.目前主要采用的子空间辨识算法只能适用于白噪声环境,而实际的工业现场数据很多是受到较大有色噪声干扰的.针对问题采用了一种新的子空间辨识算法,利用马尔可夫参数用于处理随机性部分,同时引入辅助变量用以去除噪声的干扰,能够适用于存在较大有色噪声干扰情况下的辨识建模,并可得到对象的无偏模型,建模的精度优于通常所采用的子空间辨识算法.通过对精馏塔仿真模型的辨识结果证明了该方法的可行性和有效性,以及在实际工业过程对象建模中良好的应用前景.     

A method for diagnosis of current faults in antenna arrays using neural networks

A method for detection of faulty elements in antenna arrays from far‐field radiation pattern is presented. The proposed technique finds variation of current from correct values in the faulty elements. A step wise approach is proposed to determine magnitude and phase of current excitation and location of faulty element using neural networks. The results with radial basis function neural network and probabilistic neural network are compared. © 2008 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2009.     

Exponential stability for uncertain neutral systems with Markov jumps

This paper deals with the global exponential stability problems for stochastic neutral Markov jump systems （MJSs） with uncertain parameters and multiple time-delays. The delays are respectively considered as constant and time varying cases, and the uncertainties are assumed to be norm bounded. By selecting appropriate Lyapunov-Krasovskii functions, it gives the sufficient condition such that the uncertain neutral MJSs are globally exponentially stochastically stable for all admissible uncertainties. The stability criteria are formulated in the form of linear matrix inequalities （LMIs）, which can be easily checked in practice. Finally, two numerical examples are exploited to illustrate the effectiveness of the developed techniques.     

锰红柱石中Mn~（3＋）谱的分析

本文利用锰红柱石的吸收光谱,考虑到锰红柱石中Ｍｎ３＋处于一种Ｃ２ｖ（Ｃ２＇＇）的低对称晶位,采用一简化的强场方案,把单电子晶场矩阵元用自旋允许吸收带代替,克服了多参数的困难．计算出了锰红柱石中处于八面体配位的Ｍｎ３＋的电子能谱,对锰红柱石的分析首次获得了较为理想的理论计算结果,并对Ｍｎ３＋和Ｆｅ３＋谱带的识别提出了新的看法．     

Reconstructing design parameters of a rectangular resonator via peak signal-to-noise ratio and global optimization algorithms

This article proposes an approach for reconstructing physical parameters of a sample in a rectangular resonator during microwave radiation, knowing a priori, its electric field distribution. The inverse problem was solved using two global optimization algorithms and the peak signal-to-noise ratio (PSNR) criterion. First, the Self-regulated Fretwidth Harmony Search algorithm (SFHS) identified suitable resonant frequencies for a given configuration. Next, the unified Particle Swarm Optimization (UPSO) optimized said configuration. Together, they became a maximization strategy of the PSNR through a dual optimization process. Results showed the ability of the approach for estimating the height of each sample block and the resonating frequency of the cavity. This process takes longer to finish as a higher PSNR is demanded (mainly due to the aforementioned dual optimization). Even so, it allows for more similar electric field distributions between both, the direct and inverse problems.     

强磁场对硅锰铸钢于A_1点附近等温珠光体相变的影响

通过开展12 T强磁下硅锰铸钢(50Si_2Mn_3)于A_1点温度附近不同等温时间的热处理试验,并对比强磁场与无磁场条件下等温珠光体相变试验结果,研究了磁场对珠光体转变量及组织形貌的影响。研究表明,对于50Si_2Mn_3在A1点以下较高温度范围内,强磁场可缩短珠光体相变的孕育期,促进硅锰铸钢珠光体转变,使其转变量明显增加;强磁场能够提高珠光体转变临界点,使50Si_2Mn_3在A1点以上等温过程中能够发生珠光体相变。     

卷积积分和拉普拉斯变换在一阶电路中的应用

电路的任意激励的零状态响应,可以用卷积积分和拉普拉斯交换的方法求解。本文通过两个一阶电路的实例,阐述了两种方法的应用特点。     

A mildly exponential approximation algorithm for the permanent

A new approximation algorithm for the permanent of ann ×n 0,1-matrix is presented. The algorithm is shown to have worst-case time complexity exp(O(n ^1/2 log² n)). Asymptotically, this represents a considerable improvement over the best existing algorithm, which has worst-case time complexity exp((n)).Supported by SERC Grant GR/F 90363; work done in part while visiting DIMACS (Center for Discrete Mathematics and Computer Science).Supported by an NSF PYI grant, with matching equipment grant from the AT&T Foundation; work done in part while visiting DIMACS.