Design and validation of robotic bionic eye with multiple flexible ropes parallel mechanism inspired by oculomotor law

Producing a stable and agile bionic eye for visual image acquisition in robotics is a challenging task. In this paper, we design a bionic eye with mirror-symmetric distribution and cross-connection of flexible ropes. This mechanism is based on oculomotor law and the physiological structure of the extraocular muscles (EOMs). Specifically, the basic structural parameters are determined by Listing’s law, and the unique connection of the flexible ropes can realize the functions of the recti and oblique muscles. Furthermore, to mimic the trochlea structure, a pulley mechanism is constructed to permit the free movement of the flexible ropes. Through simulation and physical experiments, it is demonstrated that the bionic eye mechanism can move with agility under the structural parameters. The experimental results indicate that the proposed bionic eye mechanism has a superior motion accuracy of 2.798 mm, which is 6.7% of the maximum motion distance, and the repeatable accuracy of the mechanism can up to 0.210 mm.     

Distributed learning consensus control based on neural networks for heterogeneous nonlinear multiagent systems

This paper considers a novel distributed iterative learning consensus control algorithm based on neural networks for the control of heterogeneous nonlinear multiagent systems. The system's unknown nonlinear function is approximated by suitable neural networks; the approximation error is countered by a robust term in the control. Two types of control algorithms, both of which utilize distributed learning laws, are provided to achieve consensus. In the provided control algorithms, the desired reference is considered to be an unknown factor and then estimated using the associated learning laws. The consensus convergence is proven by the composite energy function method. A numerical simulation is ultimately presented to demonstrate the efficacy of the proposed control schemes.     

嵌入式RISC核MPEG2/AC3解码器

介绍了在一个嵌入RISC核的AC3／MPEG2音／视频解码器中，通过增加特殊指令及其相应的硬件逻辑，对AC3的音频解码进行了一定的改进，不仅达到了AC3解码的实时性要求，而且降低了对存储器的要求。     

初至走时层析成像的一个应用实例

利用基于最短路径树弯曲射线追踪的联合迭代重建层析成像(SIRT)技术进行井间地震层析成像,对胜利油田的一对井间实际资料进行了处理。层析成像结果表明,层析成像算法可靠稳定,收敛性好,层析成像结果的精度较高。     

带参数的一阶脉冲微分方程边值问题

利用上下解和单调迭代法。讨论了带参数的一阶脉冲微分方程。获得了单边Lipschitz条件下这类方程边值问题的解的存在性。     

用软件实现曼彻斯特编译码方法的研究

介绍了在测井仪器中如何用单片机软件编程将井下仪测试数据实现曼彻斯特编码、发送传输 ,及地面解码等方法 ;阐述了井下仪实现双极性曼彻斯特码差分化的技术原理 ,地面译码时同步识别、数据采集、数据串 /并转换等技术方法 ,以及该方法在实践中应用情况。实际应用表明 ,该技术传 /收数据稳定可靠 ,智能化程度高 ,大大地简化了仪器硬件电路 ,提高了仪器性能价格比 ,在生产测井领域具有良好的推广应用前景。     

Sequential Decoding of Convolutional Codes for Rayleigh Fading Channels

The performance of sequential decoding of long constraint length convolutional codes is evaluated for Rayleigh fading channels. Sequential decoding is not practical below a certain theoretical signal-to-noise ratio, and these theoretical limits are calculated for a number of modulation methods and code rates. As an example, with BPSK modulation, soft decisions and code rate 1/2, the theoretical signal-to-noise ratio per information bit is 5.7 dB. Above this limit the bit error rate can be made arbitrarily small by increasing the constraint length at no significant complexity cost. Furthermore, it is shown that with carefully chosen quantization steps, 8 level uniform quantization gives a negligible loss also for sequential decoding on a Rayleigh fading channel. Simulation results using 8 level quantization correspond well with the theoretical performance bounds. Also, the performance on a correlated channel with finite interleaving has been obtained. With an interleaver depth of 50×50 and a normalized doppler frequency equal to 0.01 we are only 0.5 dB away from the performance with perfect interleaving. Finally, bit error rate results show this scheme to compete well with Turbo codes.     

网络行为建模环境的实现及网络混沌性状分析

设计并实现了一种用于网络行为研究的网络行为建模环境，将网络环境的监测功能和网络行为的分析功能相互结合，为网络系统行为的研究奠定了基础。在这一环境下，归纳了四种有普遍意义的网络突发流量模型，并用混沌分形理论中的迭代函数系统和相空间重构方法对它们进行描述、分析、计算和重构，得到了它们的分形维以及能体现网络流量行为特性的宏观参数。     

利用框架理论对信号进行重建

在Hilbert空间中讨论了框架的一些重要的性质,定义了一个框架算子,并讨论了该算子的性质。根据实际问题构造了一框架,使信号在此框架下的投影正好为非均匀采样值。给出了一种框架界的估计方法和重建原信号的迭代算法,最后,用仿真验证了此算法的有效性。     

A new iterative order reduction (IOR) method for eigensolutions of large structures

Order reduction is a computationally efficient method to estimate some lowest eigenvalues and the corresponding eigenvectors of large structural systems by reducing the order of the original model to a smaller one. But its accuracy is limited to a small range of frequencies that depends on the selection of the retained degrees of freedom. This paper proposes a new iterative order reduction (IOR) technique to obtain accurately the eigensolutions of large structural systems. The technique retains all the inertia terms associated with the removed degrees of freedom. This hence leads to the reduced mass matrix being in an iterated form and the reduced stiffness matrix constant. From these mass and stiffness matrices, the eigensolutions of the reduced system can be obtained iteratively. On convergence the reduced system reproduces the eigensolutions of the original structure. A proof of the convergence property is also presented. Applications of the method to a practical GARTEUR structure as well as a plate have demonstrated that the proposed method is comparable to the commonly used Subspace Iteration method in terms of numerical accuracy. Moreover, it has been found that the proposed method is computationally more efficient than the Subspace Iteration method. Copyright © 2003 John Wiley & Sons, Ltd.