Positive <Emphasis Type="Italic">L</Emphasis><Subscript>1</Subscript>-gain filter design for positive continuous-time Markovian jump systems with partly known transition rates

The paper is concerned with the problem of positive L ₁-gain filter design for positive continuous-time Markovian jump systems with partly known transition rates. Our aim is to design a positive full-order filter such that the corresponding filtering error system is positive and stochastically stable with L ₁-gain performance. By applying a linear co-positive Lyapunov function and free-connection weighting vectors, the desired positive L ₁-gain filter is provided. The obtained theoretical results are demonstrated by numerical examples.     

公交车的远卡自动收费系统设计

在对公交收费系统的发展和无线射频识别技术进行研究的基础上,分析了现行公交收费系统的优缺点与局限性,并提出了一种公交车远卡自动收费系统的设计思路.主要使用ARM核芯片STM32、射频芯片nRF24LE1等器件,完成了硬件设计.在软件设计上实现了自动计算票价的扣费机制.该系统创新性地将远距离射频技术应用在公交收费系统中,不仅方便了乘客,而且大大提高了乘客上下车的效率.     

基于 ATE 的 FPGA 器件测试方案研究磁

在 FPGA 器件的测试领域,由于通用 ATE 的局限性,需要为 ATE 设计 FPGA 配置板。然而目前行业内通用的配置方案测试效率低、可移植性差,给 FPGA 器件测试程序的开发和测试都带来了很多不便。论文提出了一种新的 FP‐GA 多重自动配置技术,设计采用 FPGA 作为主控制器,大容量 FLASH 芯片用于存储目标 FPGA 的配置数据,具有大量存储、调取灵活、配置快速等优点,实现了 Xilinx 公司绝大部分不同型号的 FPGA 器件的多重、自动、快速重配置,有效地解决了原配置方案的弊端,提高了 FPGA 测试的效率。     

Uncertain term structure model of interest rate

Term structure models describe the evolution of the yield curve through time, without considering the influence of risk, tax, etc. Recently, uncertain processes were initialized and applied to option pricing and currency model. Under the assumption of short interest rate following uncertain processes, this study investigates the term-structure equation. This equation is first derived for valuing zero-coupon bond. Finally, analytic solutions of the uncertain interest rate equation are given when the process of interest rate is assumed to be the uncertain counterparts of the Ho-Lee model and Vasicek model, respectively.     

大同市“十二五”水利发展前景分析

介绍了大同市水利发展的现状与面临的形势,分析其发展中存在的主要问题,并针对这些问题全面地提出了大同市"十二五"水利发展的建议与对策。     

A novel artificial bee colony algorithm with Powell's method

Artificial bee colony (ABC) algorithm is a relatively new optimization technique which has been shown to be competitive to other population-based algorithms. However, there is still an insufficiency in ABC regarding its solution search equation, which is good at exploration but poor at exploitation. To address this concerning issue, we first propose a modified search equation which is applied to generate a candidate solution in the onlookers phase to improve the search ability of ABC. Further, we use the Powell's method as a local search tool to enhance the exploitation of the algorithm. The new algorithm is tested on 22 unconstrained benchmark functions and 13 constrained benchmark functions, and are compared with some other ABCs and several state-of-the-art algorithms. The comparisons show that the proposed algorithm offers the highest solution quality, fastest global convergence, and strongest robustness among all the contenders on almost all test functions.