正则表达式在Word中的应用

微软在Word 2000及后续所有版本中,提供基于正则表达式的查找替换功能,可对文中符合正则表达式规则的文字实现一次定位选中,并可对查找到的文字按照替换表达式进行批量替换。Word正则表达式提供包括转义符、限定符、定位符、字符集合、分组符、反向引用等元字符功能。Word正则表达式可结合文本格式功能实现联合查找。     

Word文档的规范化输入

现在许多网上申报系统提供了离线填报的方式,这种方式不受在线时间限制,对于那些需要仔细斟酌、不能在短时间内完成的报表尤为适合。离线填报文档以Word文档为多,用户填写完下载的Word文档模板后上传即可,申报系统自动提取Word文档中的信息写入数据库。因为是程序自动提取信息,填报的信息要规范化。本文介绍了一些Word文档规范化输入的方法。     

正规文法与有限自动机的等价构造

在功能上,正规文法与有限自动机描述和识别语言是等价的,它们之间也存在等价构造算法,但这些构造算法有些复杂.对其算法进行了简化且给以了证明,并提出了一个从有限自动机构造等价左线性正规文法的算法,同时也进行了证明,最后给出了该算法的一个实例.     

正则表达式的强大功能

该文简略地介绍了正则表达式以及DB2中可用的字符串比较和匹配功能。还描述了为什么正则表达式的强大功能是如此有用。     

新疆勘探生产经营管理系统中正则表达式的应用

本文主要介绍了一个关于正则表达式在勘探生产管理系统中的应用,通过正则表达式的规范提高整个系统的安全性。本文对正则表达式的应用提出了一种新的构架,该构架不仅优化了整个系统而且也为系统工作带来了更高的效率。通过油田对该软件的使用证实了该方法在此系统中起到了很大的作用,也为日后的维护带来了方便。     

Approximate regular expression pattern matching with concave gap penalties

Given a sequenceA of lengthM and a regular expressionR of lengthP, an approximate regular expression pattern-matching algorithm computes the score of the optimal alignment betweenA and one of the sequencesB exactly matched byR. An alignment between sequencesA=a₁a₂ ... a_M andB=b₁b₂... b_N is a list of ordered pairs, (i₁,j₁), (i₂j₂), ..., (i_t,j_tt) such that i_k < i_k+1 and j_k < j_k+1. In this case the alignmentaligns symbols a_ik and b_jk, and leaves blocks of unaligned symbols, orgaps, between them. A scoring schemeS associates costs for each aligned symbol pair and each gap. The alignment's score is the sum of the associated costs, and an optimal alignment is one of minimal score. There are a variety of schemes for scoring alignments. In a concave gap penalty scoring schemeS={, w}, a function (a, b) gives the score of each aligned pair of symbolsa andb, and aconcave function w(k) gives the score of a gap of lengthk. A function w is concave if and only if it has the property that, for allk > 1, w(k + 1) –w(k) w(k) –w(k –1). In this paper we present an O(MP(logM + log² P)) algorithm for approximate regular expression matching for an arbitrary and any concavew. This work was supported in part by the National Institute of Health under Grant RO1 LM04960.     

On filter theory of residuated lattices

The aim of this paper is to develop the filter theory of general residuated lattices. First, we extend some particular types of filters and fuzzy filters in BL-algebras and MTL-algebras naturally to general residuated lattices, and further enumerate some relative results obtained in BL-algebras or MTL-algebras, which still hold in general residuated lattices. Next, we introduce the concepts of regular filters and fuzzy regular filters to general residuated lattices, which are two new types of filters and fuzzy filters, and derive some of their characterizations. Finally, we discuss the relations between (fuzzy) regular filters and several other special (fuzzy) filters, and also characterize some special classes of residuated lattices by filters or fuzzy filters.     

Theory of one-tape linear-time Turing machines

A theory of one-tape two-way one-head off-line linear-time Turing machines is essentially different from its polynomial-time counterpart since these machines are closely related to finite state automata. This paper discusses structural-complexity issues of one-tape Turing machines of various types (deterministic, nondeterministic, reversible, alternating, probabilistic, counting, and quantum Turing machines) that halt in linear time, where the running time of a machine is defined as the length of any longest computation path. We explore structural properties of one-tape linear-time Turing machines and clarify how the machines’ resources affect their computational patterns and power.     

Checking determinism of XML Schema content models in optimal time

We consider the determinism checking of XML Schema content models, as required by the W3C Recommendation. We argue that currently applied solutions have flaws and make processors vulnerable to exponential resource needs by pathological schemas, and we help to eliminate this potential vulnerability of XML Schema based systems. XML Schema content models are essentially regular expressions extended with numeric occurrence indicators. A previously published polynomial-time solution to check the determinism of such expressions is improved to run in linear time, and the improved algorithm is implemented and evaluated experimentally. When compared to the corresponding method of a popular production-quality XML Schema processor, the new implementation runs orders of magnitude faster. Enhancing the solution to take further extensions of XML Schema into account without compromising its linear scalability is also discussed.     

基于二维混合模型和状态观测器的重复控制设计

针对一类正则线性系统, 提出一种基于状态观测器和二维混合模型的重复控制系统设计方法. 首先, 通过构造一个状态观测器来重构系统的状态, 建立基于重构状态的线性控制律. 然后, 通过独立地考虑重复控制系统的连续控制过程与离散学习行为, 给出基于状态观测器和重构状态反馈的连续/离散二维混合模型. 针对这个混合模型, 运用二维Lyapunov泛函方法, 以线性矩阵不等式(Linear matrix inequality, LMI)的形式给出重复控制系统存在重复控制器和状态观测器的充分条件, 所给条件可用Matlab工具箱方便地求解. 数值仿真验证了本文所提方法的有效性.