迷宫最短通路的反应扩散搜索

本文探索迷宫最短通路的搜索方法。在传统反应扩散方法的理论基础和算法思路基础上，本文利用扩散波在反应介质中并行性、无衰减性的特点，提出将迷宫转换为用二维数组描述的数字图像、设计出通过波的并行性扩散传导与回溯法来确定迷宫最短路径的新方法。计算机模拟证明此方法的快速和有效性。     

Multi-Deme Parallel FGAs-Based Algorithm for Multitarget Tracking

For data association in multisensor and multitarget tracking, a novel parallel algorithm is developed to improve the efficiency and real-time performance of FGAs-based algorithm. One Cluster of Workstation （COW） with Message Passing Interface （MPI） is built. The proposed Multi-Deme Parallel FGA （MDPFGA） is run on the platform. A serial of special MDPFGAs are used to determine the static and the dynamic solutions of generalized m-best S-D assignment problem respectively, as well as target states estimation in track management. Such an assignment-based parallel algorithm is demonstrated on simulated passive sensor track formation and maintenance problem. While illustrating the feasibility of the proposed algorithm in multisensor multitarget tracking, simulation results indicate that the MDPFGAs-based algorithm has greater efficiency and speed than the FGAs-based algorithm.     

对手抑制式模糊C-均值算法

从竞争学习的角度提出模糊C-均值算法中隶属度的新解释,并基于隶属度的新解释提出对手抑制式模糊C-均值算法.理论分析和实验表明:对手抑制式模糊C-均值算法提高了模糊C-均值算法的收敛速度.     

System reliability estimation using simulation combined with network reductions

This paper proposes a dynamic Monte Carlo sampling method, called the conditional minimal cut set (COMICS) algorithm, where all arcs are not simulated at each trial and all minimal cut sets need not be given in advance. The proposed algorithm repeats simulating a minimal cut set composed of the arcs which originate from the (new) source node and reducing the network on the basis of the states of simulated arcs until the s-t connectedness is confirmed. We develop the importance sampling estimator, the total hazard estimator and the hazard importance sampling estimator which are all based on the proposed algorithm, and compare the performance of these simulation estimators. It is found that these estimators can significantly reduce the variance of the raw simulation estimator and the usual importance sampling estimator.     

Hierarchical stochastic image grammars for classification and segmentation.

We develop a new class of hierarchical stochastic image models called spatial random trees (SRTs) which admit polynomial-complexity exact inference algorithms. Our framework of multitree dictionaries is the starting point for this construction. SRTs are stochastic hidden tree models whose leaves are associated with image data. The states at the tree nodes are random variables, and, in addition, the structure of the tree is random and is generated by a probabilistic grammar. We describe an efficient recursive algorithm for obtaining the maximum a posteriori estimate of both the tree structure and the tree states given an image. We also develop an efficient procedure for performing one iteration of the expectation-maximization algorithm and use it to estimate the model parameters from a set of training images. We address other inference problems arising in applications such as maximization of posterior marginals and hypothesis testing. Our models and algorithms are illustrated through several image classification and segmentation experiments, ranging from the segmentation of synthetic images to the classification of natural photographs and the segmentation of scanned documents. In each case, we show that our method substantially improves accuracy over a variety of existing methods.     

基于模糊最大散度差判别准则的自适应特征提取模糊聚类算法

指出皋军等人提出的基于模糊最大散度差判别准则(Fuzzy Maximum Scatter Difference Discriminant Criterion,FMSDC)的聚类算法(Fuzzy Maximum Scatter Difference Diseriminant Criterion Based Cluster...     

An Improved Algorithm for Performance Analysis of Networks with Unreliable Components

A new approach for analyzing the performance of communication networks with unreliable components was given in a recent paper [2]. An algorithm was developed to generate the most probable states of a network, and an analysis of those states gave a good approximation of the network performance. In this paper, we present a new algorithm for generating the most probable states. This new algorithm is a major improvement over the previous one in terms of efficiency and flexibility.     

径向基函数网络的ABS投影学习算法

Broomhead(1988),Chen(1991)等人提出的RBF网络的学习算法都是基于传统的LMS算法,因此具有一定的局限性。本文提出了一种新的RBF网络的学习算法ABS投影学习算法,它是一种直接的学习算法。计算机模拟的结果表明,它具有学习效率高,识别率高和适用范围广的优点。     

Application of Fuzzy Genetic Algorithm to the Problem of Synthesizing Circular Microstrip Antenna Elements with Thick Substrates

Fuzzy genetic algorithm (FGA) is applied to the problem of synthesizing a probe-fed circular microstrip antenna element with thick substrate taking resonant frequency, gain, bandwidth and input impedance of the antenna element into consideration simultaneously. The results obtained by FGA are compared with the results obtained by classical genetic algorithm (CGA).     

QoS单播路由算法的研究

本文在综合烽务QoS和网络性能参数的基础上,提出了一个新的路由度量标准BHD,然后提出了一种优化的QoS单播路由算法BHDR,仿真研究表该算法在满足业务连接时延要求的同时提高了网络的吞吐量,较好的改善了网络的性能。     

最大--乘积型模糊联想记忆网络的最大最小编码学习算法

提出了最大─乘积型模糊联想记忆网络的最大最小编码学习算法,新算法可以记忆任意多个自联想模式。对于异联想模式,给出了一种以最大最小编码算法为基础,近似求解网络连接权阵的梯度下降学习算法,这种方法可用于解最大乘积型模糊关系方程。计算机模拟实验证实了算法的有效性。     

计算通信网络整体概率连通性的一种新算法

本文提出了一种计算网络整体概率连通性的新算法。该算法首先构造了一种多级状态空间分解法,对网络状态空间进行了分解,并对分解所得的生成事件提出了一种提出了一种特殊的生成子网构造法,从而有效减少了网络状态空间集。新算法通过迭代运算用上下界来逼近网络概率连通性的值,与传统算法相比,具有运算速度快、收敛性能好,很适合近似计算的特点。     

Decoding algorithms for noncoherent trellis coded modulation

Noncoherent decoding of trellis codes using multiple-symbol overlapped observations was shown previously to achieve close to the coherent performance. Optimal decoding by the Viterbi algorithm for L-symbol observations requires a number of states which grows exponentially with L. Two novel suboptimal algorithms are presented, for which the number of states is the same as the original code, yielding a complexity depending weakly on L. For practical values of L, both algorithms are substantially less complex than the optimal algorithm. The first algorithm, the basic decision feedback algorithm (BDFA), is a low complexity feedback decoding scheme, based on the Viterbi algorithm. This algorithm is shown to suffer from increased error probability and from error propagation. A slight modification to this algorithm can, in most cases, reduce these effects significantly. The second algorithm uses the BDFA as a basic building block. This algorithm is based on a novel concept called “estimated future” and its performance is very close to optimum for most practical eases with some additional complexity and memory requirements as compared to the first algorithm. Performance analysis and simulation results are also given     

A NEW ALGORITHM FOR THE GENERATION OF k-AKY M SEQUENCES

A new algorithm for generating k-ary M sequences is given. In the algorithm a new method is used that the main cycle is extended by joining to it a subset of cycles instead of the classical one in which the main cycle is extended by joining to it one cycle. The algorithm reduces the times of choosing bridging states and accelerates the speed of joining cycles.     

PIC24单片机在轧机液压缸行程检测上的应用

介绍了一种代替传统轧机液压缸行程测量的新方法,并以一款PIC24单片芯片为例,配合涡街流量计,详细描述了系统的工作原理、主要特点和软硬件设计,总结了现场实际使用情况。     

Pseudostep orthogonalization: A new threshold-decoding algorithm (Corresp.)

In this correspondence a new decoding algorithm using majority logic is proposed. This scheme, called "pseudostep orthogonalization," is basically a hybrid version of the existing majority-logic decoding methods, namely, Reed-Massey's algorithm and Rudolph's algorithm. An example is given for the (21, 5) binary cyclic code, which can correct up to four independent errors.     

基于模糊聚类的雷达信号分选方法

随着新体制、新技术雷达的不断出现，雷达侦察接收机接收到的雷达信号更加密集和复杂，传统的分选方法已不能对其进行有效分选，模糊聚类法能够利用雷达信号的特征参数有效地分选出常规和非常规雷达信号。文中采用了一种新的模糊聚类分析算法一跟踪法，该方法易实现编程，适用于处理大量数据，仿真实验证明分选结果较理想。     

移动证券业务中的安全机制研究

本文首先介绍了移动证券业务中对于敏感交易信息的加密和解密过程,提出了具体的安全性要求。然后,给出了一种可以用于移动证券业务的安全机制,该安全机制采用了两密钥的三重DES算法进行加解密;密钥分为传输密钥和交易密钥两种,每种密钥经过三级分散处理;同时引入了动态密钥下载、密钥版本更新等新功能,很好地满足了移动证券业务对于安全性的要求。接着,给出了该安全机制的一个具体实现过程,最后是安全性分析和结论。     

图像模糊信息粒的适应性度量及其在边缘检测中的应用

关于模糊信息粒的研究现在已逐渐成为一个新的热点.本文就依靠模糊信息粒处理图像的有效性问题做了深入的讨论,提出了模糊信息粒相对于图像的适应性度量问题,并给出了一种度量的定义;另外,我们将这种度量思想应用到图像的边缘检测中,得到了一种新的基于模糊信息粒的边缘检测方法.该方法有很强的物理背景,实验表明它的效果很好,是一种实用的、有前途的检测算法.     

模糊线性时序逻辑的可实现性

模糊线性时序逻辑（fuzzy linear temporal logic）被应用于刻画模糊系统的规范语言,其可实现性（realizability）用于判断满足该时序逻辑公式的开放系统模型是否存在.模糊线性时序逻辑可实现性和系统合成（synthesis）的基本思想是：给定模糊线性时序逻辑公式,判断是否存在满足该公式的系统.如果存在,则构造满足该公式的最优系统.为了检验模糊线性时序逻辑的可实现性,首先引入模糊Büchi博弈的定义,作为检验模糊线性时序逻辑公式是否可实现的模型.其次通过归约的方法,研究模糊Büchi博弈的性质（最优无记忆策略存在性.最后验证模糊线性时序逻辑的可实现性并且给出其系统合成的过程,并说明它们的时间复杂度.