hp自适应伪谱法在滑翔弹道快速优化中的应用

基于一种求解最优控制问题的新方法——hp自适应伪谱法对滑翔弹道快速优化设计问题进行了研究;该方法将全局伪谱法与有限元法的思想进行结合,采用双层优化策略对细化单元上的配点数和插值多项式的阶次进行自适应调节以满足快速性及精度要求;对滑翔弹道优化问题进行了数值仿真计算,用极小值原理验证了仿真所得的弹道是最优弹道,并与Guass伪谱法的仿真结果进行了对比分析;结果表明该优化方法在求解周期性跳跃滑翔弹道时具有更合理的配点分布及更少的计算时间,对初始控制量不敏感、鲁棒性强,具有一定的工程应用价值。     

基于FPGA的光纤陀螺信号采集处理卡设计

光纤陀螺姿态测量系统中的信号采集和处理是系统的一个重要环节;文章介绍了基于FPGA的光纤陀螺信号采集处理卡的设计过程,采用Verilog HDL实现FPGA内部逻辑电路设计,选用AD7846完成信号的数模转换,通过FPGA编程实现光纤陀螺的标定和误差补偿,设计了RS232/422通用异步串口通信硬件电路并在FPGA上实现了串口通信;实验结果表明:该卡能够准确实时地采集并按预定的设计处理光纤陀螺信号。     

某型飞行模拟器火控控制台设计与实现

为增强某型飞行模拟器火控系统的人机交互体验,提高飞行模拟训练质量,设计实现了一种基于数据采集卡的某型飞行模拟器火控控制台;通过VC++6.0调用数据采集卡的函数库,采集控制台开关量状态和旋钮输出模拟信号电压值,并输出模拟器内部部分标志位供控制台数字显示电路进行数据显示;实际应用表明,该控制台稳定性好、响应速度快,可准确模拟火控系统操作程序,满足了某型飞机火控系统的训练需要。     

Optimal tracking performance of MIMO discrete‐time systems with communication constraints

The optimal tracking problem for multiple‐input multiple‐output linear‐time‐invariant discrete‐time systems with communication constraints in the feedback path is studied in this paper. The tracking performance is measured by the energy of the error signal between the output of the plant and the reference signal. The objective is to obtain an optimal tracking performance, attainable by all possible stabilizing compensators. It is shown that the optimal tracking performance consists of two parts, one depends on the nonminimum phase zeros and zero direction of the given plant, as well as the reference input signal direction, and the other depends on the nonminimum phase zeros, unstable poles, and pole direction of the given plant, as well as the bandwidth and additive white Gaussian noise of the communication channel. It is also shown that, if the constraint of the communication channel does not exist, the optimal tracking performance reduces to the existing tracking performance of the control system without communication constraints. A typical example is given to illustrate the theoretical results. Copyright © 2011 John Wiley & Sons, Ltd.     

Stability analysis and H∞ control for hybrid complex dynamical networks with coupling delays

This paper formulates and studies a model of complex dynamical networks with switching topology and coupling delays. Based on the hybrid control and Lyapunov function, the stability and robust H_∞ control of such networks with impulsive and switching effects, which have not been studied before, are addressed with some criteria derived. Examples are given to illustrate the effectiveness of the theoretical results. Copyright © 2011 John Wiley & Sons, Ltd.     

LD3320的嵌入式语音识别系统的应用

语音交互系统是比较人性化的人机操作界面,它需要语音识别系统的支持。LD3320就是这样一款语音识别芯片。介绍了该芯片的工作原理及应用,给出了LD3320与微处理器的硬件接口电路及软件程序。随着高档MCU的不断出现,以MCU为核心的嵌入式语音交互系统会有非常好的应用前景。     

Simple method of characterizing the spatial luminance distribution at the user position for autostereoscopic 3‐D display

Abstract— The image quality of autostereoscopic 3‐D displays strongly depends on the user position. So, characterization of the spatial luminance distribution at the user position is important. For the measurement of the spatial luminance distribution, a method that places a diffuser screen at the user position and is illuminated by a 3‐D display has been investigated. By placing the diffuser screen and 3‐D display non‐parallel, the luminance distribution at the various distances can be determined. Though the accuracy of this measurement method is somewhat limited, the measuring procedure is fast and simple, compared with other time‐consuming methods.     

ANDES: efficient evaluation of NOT-twig queries in relational databases

Despite a large body of work on XPath query processing in relational environment, systematic study of queries containing not-predicates have received little attention in the literature. Particularly, several xml supports of industrial-strength commercial rdbms fail to efficiently evaluate such queries. In this paper, we present an efficient and novel strategy to evaluate not -twig queries in a tree-unaware relational environment. not -twig queries are XPath queries with ancestor–descendant and parent–child axis and contain one or more not-predicates. We propose a novel Dewey-based encoding scheme called Andes (ANcestor Dewey-based Encoding Scheme), which enables us to efficiently filter out elements satisfying a not-predicate by comparing their ancestor group identifiers. In this approach, a set of elements under the same common ancestor at a specific level in the xml tree is assigned same ancestor group identifier. Based on this scheme, we propose a novel sql translation algorithm for not-twig query evaluation. Experiments carried out confirm that our proposed approach built on top of an off-the-shelf commercial rdbms significantly outperforms state-of-the-art relational and native approaches. We also explore the query plans selected by a commercial relational optimizer to evaluate our translated queries in different input cardinality. Such exploration further validates the performance benefits of Andes.     

gbase: an efficient analysis platform for large graphs

Graphs appear in numerous applications including cyber security, the Internet, social networks, protein networks, recommendation systems, citation networks, and many more. Graphs with millions or even billions of nodes and edges are common-place. How to store such large graphs efficiently? What are the core operations/queries on those graph? How to answer the graph queries quickly? We propose Gbase, an efficient analysis platform for large graphs. The key novelties lie in (1) our storage and compression scheme for a parallel, distributed settings and (2) the carefully chosen graph operations and their efficient implementations. We designed and implemented an instance of Gbase using Mapreduce/Hadoop. Gbase provides a parallel indexing mechanism for graph operations that both saves storage space, as well as accelerates query responses. We run numerous experiments on real and synthetic graphs, spanning billions of nodes and edges, and we show that our proposed Gbase is indeed fast, scalable, and nimble, with significant savings in space and time.     

Evaluating a color-based active basis model for object recognition

Wu and coworkers introduced an active basis model (ABM) for object recognition in 2010, in which the learning algorithm tends to sketch edges in textures. A grey-value local power spectrum was used to find a common template and deformable templates from a set of training images and to detect an object in new images by template matching. In this paper, we propose a color-based active basis model (color-based ABM for short), which incorporates color information. We adopt the framework of Wu et al. in the learning, detection, and classification of the color-based ABM. However, in order to improve the performance in object recognition, we modify the framework of Wu et al. by using different color-based features in both the learning and template matching algorithms. In this color-based ABM approach, two types of learning (i.e., supervised learning and unsupervised learning) are also explored. Moreover, the usefulness of the color-based ABM for practical object recognition in computer vision applications is demonstrated and its significant improvement in recognizing objects is reported.