顶封封隔管柱的研制与应用

中原油田近年来注水压力不断升高，井况恶化严重，为此开发了顶封封隔管柱，主要阐述了管柱工况受力特点、结构、工作原理及现场使用效果。经现场较大面积的应用证明，各项性能、技术指标达到了现场要求。     

On regular drawn symbolic picture languages

Drawn symbolic pictures are an extension of drawn pictures obtained by associating a symbol from an alphabet to each point of the picture. In the paper we will address some new interesting issues derived from the introduction of the symbols and we will identify the conditions, which ensure the preservation of properties holding for drawn pictures in the setting of the proposed extension.     

Shift-or string matching with super-alphabets

Given a text T[1…n] and a pattern P[1…m] over some alphabet Σ of size σ, we want to find all the (exact) occurrences of P in T. The well-known shift-or algorithm solves this problem in time O(n⌈m/w⌉), where w is the number of bits in machine word, using bit-parallelism. We show how to extend the bit-parallelism in another direction, using super-alphabets. This gives a speed-up by a factor s, where s is the number of characters processed simultaneously. The algorithm is implemented, and we show that it works well in practice too. The result is the fastest known algorithm for exact string matching for short patterns and small alphabets.     

模糊串匹配算法及其应用

本文分析了模糊字符串几种类型和它的表示方法，并给出模糊匹配的算法及Ｃ语言的源程序，同时也指出了在文枉编辑器的应用例子。     

Covering a string

We consider the problem of finding the repetitive structures of a given stringx. The periodu of the stringx grasps the repetitiveness ofx, sincex is a prefix of a string constructed by concatenations ofu. We generalize the concept of repetitiveness as follows: A stringw covers a stringx if there is a superstring ofx which is constructed by concatenations and superpositions ofw. A substringw ofx is called aseed ofx ifw coversx. We present anO(n logn)-time algorithm for finding all the seeds of a given string of lengthn.Partially supported by SERC Grants GR/F 00898 and GR/J 17844, NATO Grant CRG 900293, ESPRIT BRA Grant 7131 for ALCOMII, and MRC Grant G 9115730.Partially supported by MRC Grant G 9115730 and S.N.U. Posco Research Fund 94-15-1112.     

字符串近似匹配查询技术综述

字符串匹配是计算机科学中最经典、研究最广泛的问题之一,并且已经被应用到了众多领域当中。然而随着计算机和网络技术的飞速发展以及新问题的不断提出,人们逐渐发现在实际应用中有时更需要进行近似字符串匹配。因此,研究高效的近似字符串匹配算法具有重要的理论价值和实际意义。     

String analysis by sliding positioning strategy

Discovering frequent factors from long strings is an important problem in many applications, such as biosequence mining. In classical approaches, the algorithms process a vast database of small strings. However, in this paper we analyze a small database of long strings. The main difference resides in the high number of patterns to analyze. To tackle the problem, we have developed a new algorithm for discovering frequent factors in long strings. We present an Apriori-like solution which exploits the fact that any super-pattern of a non-frequent pattern cannot be frequent. The SANSPOS algorithm does a multiple-pass, candidate generation and test approach. Multiple length patterns can be generated in a pass. This algorithm uses a new data structure to arrange nodes in a trie. A Positioning Matrix is defined as a new positioning strategy. By using Positioning Matrices, we can apply advanced prune heuristics in a trie with a minimal computational cost. The Positioning Matrices let us process strings including Short Tandem Repeats and calculate different interestingness measures efficiently. Furthermore, in our algorithm we apply parallelism to transverse different sections of the input strings concurrently, speeding up the resulting running time. The algorithm has been successfully used in natural language and biological sequence contexts.     

基于改进的特征图串法识别人体行为

视频的有效表达是识别行为关键与难点。本文提出了一种改进的特征图串的视频表达方法,在动态规划框架下,利用子模优化方法和图匹配技术实现了行为的识别。首先,利用近年来被广泛应用的时空特征点探测器获取视频序列中的关键点;接着引入子模优化方法完成视频在时域上的划分;然后在每个时域区间内以关键点为节点形成图结构,使得行为视频的特征表示转化为有序的特征图串;最后基于重加权随机游走的图匹配方法和动态时间规整实现成对视频的匹配与对齐。通过两组公开数据集（KTH和UT-interaction）上的实验及与其他方法的比较,验证了本文方法是有效的、可行的。     

机械捞砂作业管柱设计数学模型及应用研究

坪北油田由于地层水敏、地层负压亏空的限制,常用的水力冲砂法易造成油层污染。机械捞砂作业与水力冲砂法相比具有两大优势:一是无洗井冲砂液,有利于油层保护,能满足特殊作业的需要;二是工艺结构简单,使用维护方便,成本低。为提高坪北油田机械捞砂作业的有效率,借助于对"机械捞砂作业管柱设计数学模型"的研究,设计出捞砂管柱及捞砂趟数,并应用于生产实践,收到了良好的效果,为完善油井清砂提供了新的工艺方法。     

KR字符串匹配算法的研究与实现

字符串匹配是判断模式串(短串)是否是文本串(长串)的子串。KR算法是一种随机串匹配算法,详细介绍KR串匹配算法的算法描述及代码实现过程,并对该算法进行测试,讨论该算法的实现效率。