脉冲序列的快速搜索法及可信度分析

对于周期脉冲序列的信号分选识别，可采用序列搜索的时域方法[1，2]。本文将大周期内完全重复的脉冲序列分解为多个“单周期信号”．并把它们均定义为周期性信号．同时，提出了序列搜索的一种软件实现方法及密集视频脉冲信号分选的变步长、信步长快速搜索法．在此基础上，本文针对序列搜索分选法的可信度计算公式进行了推导和分析，证实了这种方法的可行性和有效性．     

质量矩导弹变质心姿态控制规律研究

针对质量矩导弹变质心控制问题,提出一种基于模糊逻辑的姿态控制规律.首先建立了姿态运动模型;其次设计了滑块位置对应的模糊规则表,并通过分析角加速度和遍历隶属函数的关系,对滑块位置进行协调,同时利用遗传算法对控制参数进行校正;再次,通过分析滑块运动特性得到滑块可行的响应时间选取范围;最后讨论了系统的稳定性,对弹体相关参数进行约束,并对单通道扰动模型进行了分析.仿真结果表明,该控制律能有效实现导弹的姿态调整.     

Controller certification

A modern problem from aerospace control involves the certification of a large set of potential controllers with either a single plant or a fleet of potential plant systems, with both plants and controllers being MIMO and, for the moment, linear. Experiments on a limited number of controller/plant pairs should establish the stability and a certain level of margin of the complete set. We consider this certification problem for a set of controllers and provide algorithms for selecting an efficient subset for testing. This is done for a finite set of candidate controllers and, at least for SISO plants, for compact infinite set. In doing this, the ν-gap metric will be the main tool. Computational examples are given, including one of certification of an aircraft engine controller. The overarching aim is to introduce truly MIMO margin calculations and to understand their efficacy in certifying stability over a set of controllers and in replacing legacy single-loop gain and phase margin calculations.     

从示例中获取结构化描述的知识一过程

文章提出了适合结构化知识获取的一种思想方法,并结合在一种简明而典型的应用领域内实现的过程获取系统ＫＢＭＬ,详细地阐述了这种思想的有关方面。它采用分级分阶段的匹配、归纳策略逐步从示教实例中获取一个完整的过程;把匹配和归纳有机地结合在一起是 ＫＢＭＬ的核心内容。     

同行评议管理系统的设计与实现

本文介绍了国家自然科学基金委建筑与环境学科行同评议系统的设计思想、数据结构的设计原则、系统的要求与实现方法以及如何利用ＶｉｓｕａｌＦｏｘＰｒｏ的各种功能实现用户的特殊要求。     

国内信息导航系统中搜索引擎Robot的设计与实现

本文讨论了信息导航系统中搜索引擎Robot的不同搜索策略,根据各种策略的不同特点及国内信息导航系统的信息搜索要求,给出一种适用于国内信息导航系统的搜索策略及其具体实现方法,并指出了在实现Robot时应引起注意的一些问题。     

Web智能信息服务系统的设计与实现*

Web信息的快速增长和人们对信息需求的不断提高,使得用户越来越难获得其需要的信息。为了解决这些问题,介绍了一个智能化的Web信息服务系统的设计及其实现,它能够使用户更好地获得并使用信息。对系统的基本框架、主要功能模块的实现等进行了详细的介绍。     

On-Line Approximate String Searching Algorithms: Survey and Experimental Results

The problem of approximate string searching comprises two classes of problems: string searching with k mismatches and string searching with k differences. In this paper we present a short survey and experimental results for well known sequential approximate string searching algorithms. We consider algorithms based on different approaches including dynamic programming, deterministic finite automata, filtering, counting and bit parallelism. We compare these algorithms in terms of running time against pattern length and for several values of k for four different kinds of text: binary alphabet, alphabet of size 8, English alphabet and DNA alphabet. Finally, we compare the experimental results of the algorithms with their theoretical complexities.