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

对于周期脉冲序列的信号分选识别，可采用序列搜索的时域方法[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时应引起注意的一些问题。     

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.     

On the structure of systematic prefix codes

Systematic prefix codes play an important role in coding theory, we relate them with the problem of the partition of a free (sub-) monoid into two free sub-monoids. We show too that among the dual codes of a systematic prefix code A there exists one and only one which appears in the automaton recognizing A ^*. The characterization of this automaton and some corollaries stated here will allow us to show in further note that systematic prefix codes are involved in the structure of any regular prefix code. Work done under CNR contract No. R-l7-02-417-0-A.     

网络信息搜集工具分析之CNKI与重庆维普的比较

作为网络信息搜集工具,CNKI与重庆维普是高校使用率最高的两大文献信息检索数据库,在文献收录范围、文献来源、检索界面、目标用户、检索方式等方面有诸多特点。本文旨在分析对比两大数据库的异同与各自优劣,并为用户使用数据库及检索行为提供一些建议。