基于CORBA和TLl的STP网元集中管理系统实现

设计了STP网元集中管理系统,阐述了该系统的体系结构和各模块的功能以及各模块间的通信方式.通过使用CORBA构建技术、IDL接口描述语言以及文本描述语言TLl,使得系统具有灵活性、可维护性和可扩展性的特点.该系统的实现,使得对信令网中的STP设备进行集中管理和统一维护成为可能,为进一步对信令网的检测和历史数据的采集分析提供了基础.     

基于专家系统的回转窑窑头工况识别

针对新型干法水泥生产线窑头环节非线性、多变量、强耦合、大时滞等特性导致的工况复杂,控制难度大的问题,在深入分析窑头工况特点的基础上,提出了一种基于专家系统的工况智能识别方法.该方法首先对从集散控制系统中采集的现场参数实时值进行数据预处理,运用ART-2神经网络算法对关键参数的变化趋势进行在线辨识,并输出趋势类别,同时对主要参数的实时值进行模糊化处理,输出模糊档位.基于专家规则的工况识别系统根据参数的辨识结果,通过精确推理输出当前工况.工况识别软件采用c++编写,现场实际运行表明了该方案的正确性和实用性.     

WindowsCE.NET中断延迟测试与分析

嵌入式系统对实时性能一般要求较高,中断延迟是评估嵌入式操作系统实时性能的重要指标。利用ILTiming测试工具对WinCE4.2和5.0进行中断延迟测量,分析了导致中断延迟的原因,同时针对PXA255处理器的BSP提出了测试WindowsCE系统中断延迟的方法。     

动态相位调整技术在FPGA中的设计与实现

提出一种基于FPGA的动态相位调整实现方案。在高速数据传输接口中,由于数据窗缩小以及传输路径不一致,造成数据和时钟信号在FPGA的接收端发生位偏移和字偏移。动态相位调整技术根据当前各数据线物理状态,对各信号线动态进行去偏移操作,克服了静态相位调整中参数不可再调的缺点,使接口不断适应外部环境的变化,从而保证数据的可靠传输。     

Embedding a fault-free hamiltonian cycle in a class of faulty generalized honeycomb tori

Generalized honeycomb torus (GHT) is recognized as an attractive alternative to existing torus interconnection networks in parallel computing systems. Assume that m and d are integers with m ? 2 and d ? 8. This paper addresses the fault-tolerant hamiltonicity of GHT(m, 2d, d) with fault set F = {(w, y), (x, y)}, where w < x, w + y is even and x + y is odd. We show that such a faulty GHT is hamiltonian by presenting a systematic method for constructing a fault-free hamiltonian cycle. This result reveals another appealing feature of GHTs.     

Topology optimization based on level set for a flexible multibody system modeled via ANCF

A topology optimization methodology is proposed for the flexible multibody system undergoing both large overall motion and large deformation. The system of concern is modeled via the absolute nodal coordinate formulation. The equivalent static load method is employed to transform the topology optimization of the nonlinear dynamic response of the system into a static one, and evaluated to adapt to the absolute nodal coordinate formulation by splitting the elastic deformations of the flexible components from the overall motions of those components. During the static topology optimization, the material interface is implicitly described as the zero level set of a higher-dimensional scalar function. Then, the semi-implicit level set method with the additive operator splitting algorithm is employed to solve the corresponding Hamilton-Jacobi partial differential equation. In addition, the expert evaluation method of weights based on the grey theory is utilized to define the objective function, and a modified augmented Lagrange multiplier method is proposed to treat the inequality volume constraint so as to avoid the oscillation and drift of the volume. Finally, two numerical examples are provided to validate the proposed methodology.     

μC/OS-II+LPC213x嵌入式开发平台的中断过程分析与优化方法

从ARM7中断处理机制入手,分析了ARM7+μC/OS-Ⅱ平台下的中断处理过程,提出了一套基于中断优先级的ARM中断优化方法。试验证明,此方法在不更改操作系统代码的情况下可以实现中断嵌套功能,有效提高了系统的实时性能,在工程应用中具有一定的实用价值。     

基于一次密钥的数据加密算法优化

介绍了关于DES算法的一些研究情况, 分析了DES了算法的加密原理以及实现过程, 通过内容分析, 简单介绍了DES算法的几种改进方案, 通过分析它的加密过程以及几种改进方案, 进而提出了自己的一个改进思想即一次密钥的加密方案, 通过这个方案为DES算法的优化作一个参考.     

一种基于码本聚类的低复杂度用户选择算法

现有块对角化(BD)预编码系统用户选择算法较少考虑利用已选用户与剩余用户之间的关系来排除不可选用户.针对这点不足,给出了一种采用码本聚类的低复杂度用户选择算法( CodeGreedy算法).该算法采用弦距离刻画用户信道的相关性,以此为依据将用户划分到不同码本空间中,聚集在同一码本空间的用户信道具有较强的相关性,形成互斥...     

A new neural network algorithm for planarization problems

To deal with the planarization problem widely used in many applications including routing very-large-scale integration （VLSI） circuits, this paper points out that only when its vertices are arranged in some specific order in a line can a planar graph be embedded on a line without any cross connections or cross edges. Energy function is proposed to meet the need of embedding a graph on a single line and route it correctly. A Hopfield network is designed according to the proposed energy function for such embedding and routing. The advantage of the proposed method is that it not only can detect if a graph is a planar one or not, but also can embed a planar graph or the maximal planar subgraph of a non-planar graph on a single line. In addition, simulated annealing is employed for helping the network to escape from local minima during the running of the Hopfield network. Experiments of the proposed method and its comparison with some existent conventional methods were performed and the results indicate that the proposed method is of great feasibility and effectiveness especially for the planarization problem of large graphs.