单片机软件模拟SPI接口的解决方案

SPI接口是一种同步串行通讯接口，具备SPI接口的外围芯片十分丰富，应用非常广泛。但是，具备SPI接口的单片机种类较少。介绍了一种基于单片机的模拟SPI接口的方法，使没有SPI接口的单片机扩展带有SPI接口的外围芯片成为现实。     

Robustness issues in optimal control of unstable plants

This paper presents a robustness analysis of the optimal solution of the step tracking problem in a one-degree of freedom control architecture, for the discrete-time multivariable (MIMO) case. It is shown that the resulting closed loop becomes arbitrarily fragile, i.e. the sensitivity peak becomes arbitrarily large, for certain reference directions. The cause of this problem is that the optimal controller depends on the reference direction. The paper shows that this dependence can be eliminated with an alternative formulation of the optimal problem where the cost is averaged over all reference directions.     

Robust图像跟踪：强度—特征混合式目标定位

在像平面上确定目标的位置(由它的瞄准点位置表示)是图像跟踪技术的核心.目前研究的目标是图像定位方法多偏重于单一的工作模式,因而难以适应变化较大的使用环境.本文提出一种旨在综合利用强度相关和特征匹配的混合式目标图像定位方法.假定当前帧图像已经过预处理并完成分割,首先通过一种自适应门限SSDA并辅之以投影排序搜索,尽可能快速地剔除与参考图差别较大的子区;再用一种简便可靠并可具一定记忆能力的特征匹配法,在保留的子区集内,为目标精确定位——宣布瞄准点位置.利用实际序列图像所作实验表明:上述方法较之通常采用的单一工作模式的定位方法,有明显增强的Robust性以及更广的适应性,而增加的计算代价不大.     

极大代数意义下幂矩阵的周期性特征

在分析一类离散事件动态系统的运行周期性及稳定性时,必须求解极大代数意义下矩阵的特征值。这一直被认为是十分困难的工作。直至目前为止,尚无一种能确定任一方阵全部特征值及特征向量的简易方法。本文对极大代数意义下任一方阵的幂矩阵的周期性特征进行了深入分析。本文的结果为寻求计算特征值及特征向量的新算法提供了十分有效的途径。     

A digital secure image communication scheme based on the chaotic Chebyshev map

In this paper, a simple image secure communication scheme based on the chaotic Chebyshev map and chaos synchronization is proposed. The scheme relies on the excellent correlation property of chaotic sequences, which is very desirable for secure image communication. The results obtained by computer simulation indicate that the transmitted source image can be correctly and reliably recovered using the proposed scheme, even through a noisy channel. Notably, the scheme possesses relatively high security and can be easily implemented. Moreover, the quality of the recovered image is satisfactory, quantified by such common criteria as the bit‐error rate performance. Copyright © 2004 John Wiley & Sons, Ltd.     

自适应RBF神经网络在CDMA移动通信上行链路功率控制中的应用研究

提出了一种自适应RBF神经网络功率控制方案。详细研究了该网络在DS-CDMA通信中，进行上行链路闭环功率控制(基于信扰比(SIR))的应用理论，给出了该网络参数的计算方法。最后用计算机仿真法模拟出该控制器的运行性能。结果表明基于SIR的自适应RBF神经网络功率控制器能自适应地调整移动台的发射功率，使基站接收信号的信扰比始终非常接近于一个常数，且有比定步长功率控制更小的SIR跟踪误差，从而可以降低接收信号的中断概率、提高信道容量。     

腐蚀算法在重建一类特殊管道中的应用

针对一类特殊而不能直接对其观察的管道（如动物的血管），为了准确了解其内部特征和形态，借助计算机给出了一种用腐蚀算法来重建管道原形的方法。这种方法简单易行，而且精确度高。     

Bubble-point pressures and liquid densities of binary R-125 + R-143a System

Bubble-point pressures and saturated-liquid densities of the binary R-135 (pentafuoroethane) + R- 143a ( 1, 1, 1-trifluoroethane) system have been measured for several compositions at temperatures from 280 to 330 K by means of a magnetic densimeter coupled with a variable-volume cell mounted with a metallic bellows. The experimental uncertainties of the temperature, pressure. and density measurements and the composition determination were estimated to be within ±15 mK, ±13 k Pa, ±0.2%, and ±0.1 wt%, respectively. The purities of the samples used throughout the measurements are 99.98 wt% for R-125 and 99.0 mol % for R- 143a. Based on the present data, the thermodynamic behavior of the vapor-liquid equilibria of this binary refrigerant mixture has been evaluated by using the Peng-Robinson equation for the bubble-point pressures, and the modified Hankinson-Brobst-Thomson equation for the saturated-liquid densities. This was done to identify the optimized binary interaction parameters.Paper presented at the Twelfth Symposium on Thermophysical Properties, June 19–24, 1994, Boulder, Colorado, U.S.A.     

气象图数据的提取与转换

对气象图中等值线数据的提取与转化问题进行了研究 ,其中包括图像的二值化、细化、矢量化以及提取数据的转换和还原。它为从已有的气象图像资料中获得数据资料提供了一条有效的途径     

Locked discrete event systems: How to model and how to unlock

To model qualitative aspects of discrete event systems, i.e., the order of the events is of sole importance, we use a triple consisting of the set of all possible events (the alphabet), the set of all behavior (possible strings of events), and the set of all tasks (completed behavior). We use this view to model synchronous as well as asynchronous connection of systems. Moreover, it is easy to define notions like deadlock and livelock in this view. We give a method to construct a second system that, in connection with the original system, gets rid of its deadlock and/or livelock. A state-space representation is introduced. In this representation computations can be done effectively.