平面冗余并联机器人的综合性能优化设计

对平面二自由度冗余并联机器人的综合性能优化设计进行了探讨.基于运动学模型,给出了该机器人的雅可比矩阵和最优拓扑构形,分析了结构参数对工作空间和奇异性的影响规律.提出了衡量机器人运动精度、力传递性能、结构刚度和工作空间利用率的综合评价指标,建立了以综合评价指标为目标函数,以任务空间和无奇异位形为约束条件的数学优化模型,并采用自适应遗传算法求解.研究为同类机器人的优化设计提供了参考.     

基于贝叶斯正则化 BP 神经网络的 GPS 高程转换

为了改善BP神经网络在GPS高程转换过程中过拟合的现象,提出了用贝叶斯正则化算法的BP神经网络转换GPS高程的新方法,并利用区域GPS/水准数据,将新方法和未采用正则化算法的BP神经网络进行GPS高程转换的比较.结果表明:在较大区域和高程异常呈不规则的情况下,新方法不仅可以有效提高GPS高程转换的精度,而且通过贝叶斯正则化算法可以改善网络结构,抑制过拟合现象.在约10 km的GPS基线尺度上,新方法可以得到精度达0.050 m的正常高.     

基于头脑风暴优化的PCNN路面裂缝分割算法

为提升裂缝检测的分割精度和鲁棒性,基于头脑风暴优化（brainstorming optimization,BSO）和脉冲耦合神经网络（pulse coupled neural network,PCNN）,提出了一种路面裂缝图像分割算法（BSO-PCNN）. 该算法采用最大熵准则作为BSO算法的适应度函数,并依据适应度值决定参与次轮迭代的个体;BSO具有强收敛性,可快速确定最优个体解;结合图像特征,获得PCNN模型的最优参数,将其代入PCNN模型实现对裂缝图像的分割. 试验结果表明:算法可在20次迭代内取得不同类型路面裂缝图像的最大适应值,从而确定最佳分割参数;与Sobel边缘检测算法、PCNN图像分割算法、基于最大熵的遗传算法（genetic algorithm based on the maximun entropy of the histogram,GA-KSW）、基于遗传算法参数优化的PCNN分割算法（genetic algorithm based on the pulse coupled neural network,GA-PCNN）相比,BSO-PCNN算法取得了0.9924的区域一致性与0.0900的区域对比度.      

公交线网优化的算法研究

为缩短居民乘车出行时间以及减少公交运营投入,在公交线网优化过程中通常采用具有全局最优的遗传算法。针对基本遗传算法自身的一些缺点,提出了一种改进的遗传算法。该算法在公共交通路线优选过程中运用减少搜索空间、加入最佳保留策略和修正策略的方法,对基本遗传算法中的选择、交叉、变异算子及中止条件进行改进。改进遗传算法能够在保证种群多样性的同时加快收敛速度,较好地避免了基本遗传算法前期容易早熟和后期进化缓慢等现象。实例仿真计算表明,该算法具有比基本遗传算法更高的效率,是优化公交线网的一个有效途径。     

一种新型多核判别分析方法

为了给模式分类和维度约简提供有效的手段,在综合L1-MKDA和L2-MKDA两种多核KDA优点的基础上,提出一种以预定内核函数的线性组合,并结合混合范数正则化函数实现核权重的稀疏性和非稀疏性平衡的新型弹性多核判别分析方法(semi-infinite-programming-based flexible multi-kernel discriminant analysis, S-FMKDA).该方法用半无限规划方法求解弹性多核判别分析算法,并通过混合正则化实现核的自学习.在不同数据集上的实验结果表明:S-FMKDA比目前常见的KDA、KDAP、KDAG、L1-MKDA、L2-MKDA、UMKDA核判别分析方法的精度提高5%.      

基于随机重复爬山法的交通状态预测

合理构造影响交通状态网络结构,是实现交通状态预测的前提条件.为克服爬 山法易陷入局部最优的缺陷,提出一种基于随机重复爬山法的交通状态预测方法.对随机 生成的有向无环图迭代运行爬山法得到多网络结构;通过有向边置信度的定义和置信度 阈值的计算,确定了最优贝叶斯网络结构中节点和有向边选取准则;利用最优贝叶斯网 络结构,实现了畅通、平稳、拥挤和阻塞等4 种交通状态的预测并综合评价.分析结果表 明,该方法仅选取时段、节假日等两变量时,对交通状态预测总体准确率超过85%,能够 为高速公路运行状态监测预警和决策分析提供有效方法和数据支撑.     

IMPLEMENTATION OF GRADIENT-BASED ESTIMATION OF HMM PARAMETERS

IntroductionIn Hidden Markov Model ( HMM) - basedspeech recognition systems,it is very importanttoset the parameters of HMMs correctly.Conven-tional training algorithms such as Baum- Welch al-gorithm,are based on the criterion of maximumlikelihood( ML) .The strength of Baum- Welch al-gorithm lies in its fast convergence andmonotonous improvement[1] . For other criteriasuch as maximum mutual information,however,such an algorithm does not exist.In this case,acommon resort is a gradient- b…     

OPTIMAL PUNCTURING OF TURBO CODES BASED ON ADS CRITERION

IntroductionTurbo codes[1] has been shown to yield re-markable coding gains close to theoretical limits,yetadmitting a relatively simple iterative decordingtechnique,which are attracting the attention ofmany researchers.Owing to the parallel concate-nation,the code rate ofturbo codes,denoted as R,is low.Puncturing is the predominant strategy toconstruct high code rate turbo codes[2 ,3 ] .Punctur-ing schemes are crucial to the performance ofpunc-tured turbo codes( PTC) .Since any puncturingsc…     

Algorithm based on morphological component analysis and scale-invariant feature transform for image registration

In this paper, we proposed a registration method by combining the morphological component analysis (MCA) and scale-invariant feature transform (SIFT) algorithm. This method uses the perception dictionaries, and combines the Basis-Pursuit algorithm and the Total-Variation regularization scheme to extract the cartoon part containing basic geometrical information from the original image, and is stable and unsusceptible to noise interference. Then a smaller number of the distinctive key points will be obtained by using the SIFT algorithm based on the cartoon part of the original image. Matching the key points by the constrained Euclidean distance, we will obtain a more correct and robust matching result. The experimental results show that the geometrical transform parameters inferred by the matched key points based on MCA+SIFT registration method are more exact than the ones based on the direct SIFT algorithm.     

An Effective Hybrid Heuristic Algorithm for the Hub Location Problems of Small-Scale Uncapacitated Hub-and-Spoke Network

The key factors for designing a successful hub-and-spoke network are to determine the optimal number of hubs, to properly locate hubs, and to allocate the non-hubs to the hubs.This paper proposed a hybrid heuristic based on genetic algorithm (GA) to resolve the uncapacitated single allocation hub location problem with fixed cost (USAHLPFC), according to the upper bound of the ratio of the number of hubs to the number of nodes.Computational experiments were conducted using the Civil Aeronautics Board (CAB) data set.Results indicate that, applying the proposed heuristic, one can obtain the optimal solutions for all small-scaled problems very efficiently.A comparison between the proposed hybrid heuristic method and the GA presented by Topcuoglu et al.shows that the former outperforms the latter when the discount factor α is less.     

Fault Diagnosis of Rolling Element Bearing Using Multi-Scale Lempel-Ziv Complexity and Mahalanobis Distance Criterion

A new fault diagnosis technique for rolling element bearing using multi-scale Lempel-Ziv complexity (LZC) and Mahalanobis distance (MD) criterion is proposed in this study. A multi-scale coarse-graining process is used to extract fault features for various bearing fault conditions to overcome the limitation of the single stage coarse-graining process in the LZC algorithm. This is followed by the application of MD criterion to calculate the accuracy rate of LZC at different scales, and the best scale corresponding to the maximum accuracy rate is identified for fault pattern recognition. A comparison analysis with Euclidean distance (ED) criterion is also presented to verify the superiority of the proposed method. The result confirms that the fault diagnosis technique using a multi-scale LZC and MD criterion is more effective in distinguishing various fault conditions of rolling element bearings.     

�����Ŵ��㷨�Ż���·����·��

公路运输路径问题已被证明是高维非线性完全问题,实际中还会增加非流通图约束,使求解更复杂,研究价值较高.鉴于传统遗传算法在求解过程中容易出现早熟收敛、冗余迭代的缺陷,在初始种群生成、交叉变异及搜索操作方面提出改进,设计混沌遗传算法.采用遍历城市顺序的染色体编码,结合随机法与贪心法生成较优初始种群,避免出现大量非可行染色体,提高了后续的遗传效率.接着,执行优先保留交叉和平移变异操作,依次引入局部邻域搜索以及混沌搜索以加快算法收敛,还给出最优解的非连通公路约束满足判据.最后,实验结果验证了新算法的有效性,不但取得了较优解,而且子代种群离散程度较小,收敛性更好.     

Switching between antenna subset selection and quasi-orthogonal space-time block code in presence of correlation

We address the problem of adaptive modulation and coding scheme (AMCS) for a multi-input multioutput (MIMO) system in presence of time-varying transmitting correlation. Antenna subset selection and quasiorthogonal space-time block code (QOSTBC) have different error performances with different signal-to-noise ratios (SNRs) and in different spatial correlation scenarios. The error performance can be improved by selecting an appropriate transmission scheme to adapt to various channel conditions. The maximum distance criterion is the simplest and very effective algorithm for the antenna subset selection without needs of complex calculation and channel state information at transmitter (CSIT). The minimum error performance criteria and the simplified linear decision strategy are developed for constant transmission rate traffic to select the optimal transmission scheme. It can dramatically decrease algorithm complexity for obtaining error probability according to the known quantities comparing with using instant CSIT. Simulation results show that, remarkable performances including low SNR and weak spatial correlation at the expense of simple calculation and almost no bandwidth loss by adopting AMCS can be achieved. The proposed AMCS improves robustness of slowly varying spatial correlated channels.     

Wavelet De-noising of Speech Using Singular Spectrum Analysis for Decomposition Level Selection

The problem of speech enhancement using threshold de-noising in wavelet domain was considered.The appropriate decomposition level is another key factor pertinent to de-noising performance.This paper proposed a new wavelet-based de-noising scheme that can improve the enhancement performance significantly in the presence of additive white Gaussian noise.The proposed algorithm can adaptively select the optimal decomposition level of wavelet transformation according to the characteristics of noisy speech.The experimental results demonstrate that this proposed algorithm outperforms the classical wavelet-based de-noising method and effectively improves the practicability of this kind of techniques.     

基于矩阵分析的公共交通网络最优路径算法

为了更符合实际情况，即充分考虑换乘次数是乘客选择公共交通网络的决定因素，运行时问是其重要因素，分析了乘客心理特征，用CIS技术建立了公共交通网络模型，构建了适合公共交通分析的直达矩阵和最小换乘矩阵．在此基础上，结合路段、节点运行时间，提出了公共交通网络最优路径算法，并用一个简单的算例对算法进行了说明．     

Capacity and QoS based codebook construction for MIMO precoded spatial multiplexing systems with limited feedback

This paper deals with the design and performance analysis of transmit precoder optimization for multiple input multiple output (MIMO) systems with limited feedback of channel state information. A capacity criterion based optimal codebook construction algorithm for MIMO precoded spatial multiplexing systems is pre-sented. The optimal precoder structure combining precoding and power allocation is employed. Simulation results show that the capacity criteria based codebook can achieve higher capacity than that of equally power allocation based codebook of previous research.     

Optimal linear phase finite impulse response band pass filter design using craziness based particle swarm optimization algorithm

An efficient method is proposed for the design of finite impulse response (FIR) filter with arbitrary pass band edge, stop band edge frequencies and transition width. The proposed FIR band stop filter is designed using craziness based particle swarm optimization (CRPSO) approach. Given the filter specifications to be realized, the CRPSO algorithm generates a set of optimal filter coefficients and tries to meet the ideal frequency response characteristics. In this paper, for the given problem, the realizations of the optimal FIR band pass filters of different orders have been performed. The simulation results have been compared with those obtained by the well accepted evolutionary algorithms, such as Parks and McClellan algorithm (PMA), genetic algorithm (GA) and classical particle swarm optimization (PSO). Several numerical design examples justify that the proposed optimal filter design approach using CRPSO outperforms PMA and PSO, not only in the accuracy of the designed filter but also in the convergence speed and solution quality.     

预制装配式板梁桥的模型修正方法

为反映在役桥梁的实际状况,提出了板梁桥的模型修正方法.假设铰缝相对位移与铰缝剪力成正比,并将铰缝刚度、板梁抗弯刚度和板梁抗扭刚度均作为未知量进行修正.基于板梁边实测位移建立位移方程,并采用QR分解法得到矛盾方程组的最优解.模型考虑了多个静载试验工况、多个荷载及荷载偏心的特点,可以直接应用于桥梁荷载试验.对有防撞护栏和有损伤的板梁桥进行了数值模拟,结果表明:无论是板梁有较大损伤,还是有复杂附属结构,该修正方法均可给出准确的修正系数;试验应尽可能采用多个试验工况,并将荷载布置在被测试的铰缝和板梁附近.      

The Cooperative Multi-agent Learning with Random Reward Values

This paper investigated how to learn the optimal action policies in cooperative multi-agent systems if the agents‘ rewards are random variables, and proposed a general two-stage learning algorithm for cooperative multiagent decision processes. The algorithm first calculates the averaged immediate rewards, and considers these learned rewards as the agents‘ immediate action rewards to learn the optimal action policies. It is proved that the learning algorithm can find the optimal policies in stochastic environment. Extending the algorithm to stochastic Markov decision processes was also discussed.     

A rate-distortion based quantization level adjustment algorithm in block-based video compression

In this paper, a rate-distortion based quantization level adjustment (RDQLA) algorithm is presented. Based on the rate-distortion criterion, the quantization level adjustment algorithm effectively improves coding efficiency by adaptively optimizing quantization levels of the signals near the boundaries of quantization cells and adjusting quantization levels per block. In addition, it has no overhead and is fully compatible with the existing compression standards. The proposed algorithm can be applied in any block based image and video coding method. In particular, the algorithm has been verified on the platform of H.264. Experimental results show that the proposed algorithm improves objective and subjective performances substantially. It is shown that the proposed algorithm has a gain of several dB comparing with the newest H.264 standard for high bit rates. Foundation item: the Special Foundation of Outstanding Young Teacher of Shanghai