基于正交小波变换的超指数迭代联合盲均衡算法

为了克服超指数迭代盲均衡算法稳态误差大、不能纠正相位旋转的问题,在分析正交小波变换理论和超指数迭代盲均衡算法的基础上,利用正交小波变换对SEI算法的权向量迭代公式进行修正,同时引入一阶锁相环(PLL)技术,并将其以软切换的方式与判决引导算法相结合,得到一种基于正交小波变换的超指数迭代联合盲均衡算法.该算法利用正交小波变换良好的去相关性,来加快收敛速度,利用PLL技术来快速纠正相位旋转,并用其来初始化判决引导算法,有效地减小了稳态误差.水声信道的仿真结果验证了算法的有效性.     

基于异构体系结构的路桥收费管理系统的实现

为了实现在收费所内、外和收费站3个地点的机动车辆资料管理和收费系统收费,应用异构软件体系结构,将大型软件系统按功能的可扩展性分层。完成最基本的公共操作,融合层次式和正交式两种异构软件体系结构,使得系统结构清晰,具有可扩展性,易维护,显著提高了编程效率。     

利用参数表示任意维数正交矩阵的ICA新算法

在独立分量分析 (Independent component analysis, ICA) 中, 寻找去除高阶相关的正交矩阵成为问题关键, 而正交矩阵具有特殊的空间结构, 组成它的每个列向量可视作 RN 中单位超球表面上一点, 当这些点彼此垂直时, 整体就组成一个正交矩阵. 自然地, 这些点可以用其球坐标来参数化. 本文通过观察正交矩阵的几何结构, 找到了任意维数的随机正交矩阵的参数表示方法, 且论证了这种表示的完备性; 同时, 对随机正交矩阵参数表示的随机性做了定量分析; 然后, 利用遗传算法对参数化正交矩阵中的参数进行搜索, 得到了分离结果. 本文称这种算法为 OICA 算法, 并给出了该算法的仿真实验.     

基于子带的AOFDM系统自适应调制方式选择

提出了一种基于子带的自适应正交频分复用(AOFDM)系统的调制方式的自适应选择方法,不同于传统AOFDM系统采用固定的门限,该方法基于子带中所有子载波的后验信噪比(SNR),计算得到当前信道状况下不同调制方式该子带的误码率(BER),并与系统所要求的目标BER对比从而确定子带所采用的调制方式。理论分析和计算机仿真表明,该方法能够同时兼顾系统可靠性和有效性,并在保证系统BER性能的前提下较大地提升了AOFDM系统的吞吐量。     

Using simulation and multi-criteria methods to provide robust solutions to dispatching problems in a flow shop with multiple processors

Dispatching rules are important to the performance of a manufacturing system. Selective applications of different priority rules at different processing stages in a multiple workstation manufacturing system have a positive impact on shop performance. This type of problem is a combinatorial dispatching decision. However, no dispatching rule can consistently produce better performance than all other rules under a variety of operating conditions and criteria. It is the purpose of this study to provide a robust solution for a dispatching decision that will have ‘good’ performance under different operating scenarios. In this paper a simulation case of a flow shop with multiple processors is proposed, specifically a multi-layer ceramic capacitor manufacturing system. Two multiple criteria decision-making methods – techniques for order preference by similarity to ideal solution (TOPSIS) and an analytic hierarchy process (AHP) – in combination with Taguchi orthogonal array are used to find the most suitable dispatching rule for every workstation. The results show that for 15 production scenarios and 4 criteria this combinatorial dispatching rule is robust, in the sense that it outperforms other commonly employed strategies.     

基于十字链表的多刚体系统的数据存储

针对多刚体系统数据存储的不足,对多刚体系统的结构图与图论的有向图之间的关系进行了研究,提出了一种新的基于十字链表的链式存储模型.该存储模型不但较好地解决了复杂多刚体系统的存储问题,而且充分满足了在存储物理多刚体系统时的结构正确性和数据完备性要求,避免了非树形多刚体向树形多刚体的回路切除转换,使多刚体系统在数学建模与数据存储方面达到高度一致.     

基于正交调制的IP-over-WDM光标记交换网络

详细阐述了基于正交调制格式的IP-over-WDM光标记交换网络的网络体系结构,给出了边缘路由器的结构图与核心路由器的实现方法,最后给出了基于正交调制格式的IP-over-WDM光标记传输实验,实验中的标记信号速率为312 Mb/s,净荷速率10Gb/s,在标准单模光纤(SMF)上实现了88km传输,实验结果表明了所述方案的可行性.     

基于快速回归算法的RBF神经网络及其应用

针对径向基神经网络(RBFNN)中存在的径向基函数中心的数F1及其位置难以确定的问题,提出了一种新型的基于快速回归算法(FRA)的RBFNN.采用快速回归算法,不但能够确定RBF的中心和中心个数,而且能够求出隐含层到输出层的权重.通过一元函数拟合和Mackey-Glass混沌时间序列预测的仿真,验证了该网络的有效性与实用性.     

Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems

Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional ant algorithms are designed for combinatorial optimization, they have shown great potential in solving a wide range of optimization problems, including continuous optimization. Aimed at solving continuous problems effectively, this paper develops a novel ant algorithm termed ＂continuous orthogonal ant colony＂ （COAC）, whose pheromone deposit mechanisms would enable ants to search for solutions collaboratively and effectively. By using the orthogonal design method, ants in the feasible domain can explore their chosen regions rapidly and efficiently. By implementing an ＂adaptive regional radius＂ method, the proposed algorithm can reduce the probability of being trapped in local optima and therefore enhance the global search capability and accuracy. An elitist strategy is also employed to reserve the most valuable points. The performance of the COAC is compared with two other ant algorithms for continuous optimization -API and CACO by testing seventeen functions in the continuous domain. The results demonstrate that the proposed COAC algorithm outperforms the others.     

A Class of Key Predistribution Schemes Based on Orthogonal Arrays

Pairwise key establishment is a fundamental security service in sensor networks; it enables sensor nodes to communicate securely with each other using cryptographic techniques. In order to ensure this security, many approaches have been proposed recently. One of them is to use key predistribution schemes (KPSs) by means of combinatorial designs. In this paper, we use the Bush’s construction of orthogonal arrays to present a class of key predistribution schemes for distributed sensor networks. The secure connectivity and resilience of the resulting sensor network are analyzed. This KPS constructed in our paper has some better properties than those of the existing schemes.