Learning keyword phrases from query logs of USPTO patent examiners for automatic query scope limitation in patent searching

Professional search in patent repositories poses several unique challenges. One key requirement is to search the entire affected space of concepts, following well-defined procedures to ensure traceability of results obtained. Several techniques have been introduced to enhance query generation, preferably via automated query term expansion, to improve retrieval effectiveness. Currently, these approaches are mostly limited to computing additional query terms from patent documents based on statistical measures. For conceptual search to solve the limitation of traditional keyword search standard dictionaries are used to provide synonyms and keyword phrases for query refinement. Studies show that these are insufficient in such highly specialized domains. In this paper, we present an approach to extract keyword phrases from query logs created during the validation procedure of the patent applications. This creates valuable domain-specific lexical databases for several specific patent classes that can be used to both expand as well as limit the scope of a patent search. This provides a more powerful means to guide a professional searcher through the search process. We evaluate the lexical databases based on real query sessions of patent examiners.     

一种自动布线方法：多级线探索法

本文介绍了一种在微机上实现的印制板自动布线方法──多级线探索法及其编程方法。这种方法是基于完备布线算法的概念，通过分析李氏算法和传统线探索法的不足之处而得到的。虽然它也是一种线探索法，但有较传统线探索法更强的探索能力，不需要结合李氏算法而能单独完成布线任务，是一种较理想的算法，通过实验获得了较为满意的效果。     

Prolonged poststrike elevation in tongue-flicking rate with rapid onset in gila monster,Heloderma suspectum: Relation to diet and foraging and implications for evolution of chemosensory searching

Experimental tests showed that poststrike elevation in tongue-flicking rate (PETF) and strike-induced chemosensory searching (SICS) in the gila monster last longer than reported for any other lizard. Based on analysis of numbers of tongue-flicks emitted in 5-min intervals, significant PETF was detected in all intervals up to and including minutes 41–45. Using 10-min intervals, PETF lasted though minutes 46–55. Two of eight individuals continued tongue-flicking throughout the 60 min after biting prey, whereas all individuals ceased tongue-flicking in a control condition after minute 35. The apparent presence of PETF lasting at least an hour in some individuals suggests that there may be important individual differences in duration of PETF. PETF and/or SICS are present in all families of autarchoglossan lizards studied except Cordylidae, the only family lacking linguallly mediated prey chemical discrimination. However, its duration is known to be greater than 2-min only in Helodermatidae and Varanidae, the living representatives of Varanoidea. That prolonged PETF and SICS are typical of snakes provides another character supporting a possible a varanoid ancestry for Serpentes. Analysis of 1-min intervals showed that PETF occurred in the first minute. A review of the literature suggests that a pause in tongue-flicking and delay of searching movements are absent in lizards and the few nonvenomous colubrid snakes tested. The delayed onset of SICS may be a specific adaptation of some viperid snakes to allow potentially dangerous prey to be rendered harmless by venom following voluntary release after envenomation and preceding further physical contact with the prey.     

Algorithm for finding all k nearest neighbors

A very simple algorithm for computing all k nearest neighbors in 2-D is presented. The method does not rely on complicated forms of tessellation, it only requires simple data binning for fast range searching. Its applications range from scattered data interpolation to reverse engineering.     

一种有机化合物名称编码与亚结构检索方法

本文以 IUPAC 为基础,考虑有机化合物母体和取代基的关联,采用库中已有的化合物名称进行亚结构检索,这种检索方法,由于由化合物名称所劈裂的编码数量较少,所以索引文件小,检索速度较快。另外,这种方法是侧重在化学上有意义的母体和宫能团,它可以和碎片编码亚结构检索方法互相补充。     

The Horace Method for Error-Correcting Codes

Here we apply the so-called Horace method for zero-dimensional schemes to error-correcting codes on complete intersections. In particular, we obtain sharper estimates on the minimum distance.     

折线链节点标注技术

针对传统多边形位置关系计算比较烦琐,以及简单多边形的理论难以拓展到一般多边形的问题,提出标注节点状态的方法.通过定义11种位置来描述折线链上每个节点的状态,再采用"线段端点与线段"和"线段端点与邻折线"的标注方法来实现任意折线链的标注,同时利用两线段分割预处理使相交仅发生在端点处,从而使算法更高效;然后给出折线链基本位置关系的节点特征,并且探讨了三维顶点的标注方法.该方法的标注原理简单、方法实用,算法空间和时间复杂度分别为O(n)和O(n2).实验结果表明,该方法对任意形状的折线链都能实现稳定标注;通过搜索节点状态特征可以求解折线链间的相互关系,还可以实现一般折线链的碰撞检测、相交区域计算以及多边形简单化分解等.     

穷举法在程序设计中的应用

穷举法是程序设计中经常用到的一种算法,用来解决一些用常规的数学方法无法解决的问题.文章通过两个典型的例子对穷举法的思路和有关注意事项进行了分析,供编程学习者参考.     

超声波压力检测中回波搜索算法

通过对超声波压力测量中回波信号特征的分析，提出了回波自动搜索算法。该方法把快速傅立叶变换方法和小波多分辨率信号分解相结合，精确地检测出回波的包络信号，从而准确地搜索到回波，为后续的压力信号处理及提高压力测量的精度奠定了基础。     

一种限制搜索区域的多比例尺最优路径规划算法*

针对现有大区域范围路径规划算法存在的一些问题,提出一种限制搜索区域的多比例尺最优路径规划算法。该算法在进行路径规划时,一方面根据路网的多比例尺信息对路网进行分级,另一方面对搜索区域进行合理限制。测试实验表明此算法可以提高路径规划的效率。