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.     

基于PC机群的大地电磁Occam反演并行计算研究

Occam反演以其稳定收敛和不依赖于初始模型的特性被广泛应用于大地电磁数据的处理，但偏导数矩阵的计算和拉格朗日乘子的求取导致大量的模型正演，使得反演速度较低。为此，研究了用基于PC机群的并行计算来解决这一问题的方法。首先对Occam反演方法进行了阐述；然后，分析了反演方法中各计算耗费的时间，提出对约占计算量90％的偏导数和拉格朗日乘子进行并行计算的思想，即偏导数计算采用频点计算一级的大粒度并行，拉格朗日乘子扫描和一维搜索分别采用弘值计算一级的大粒度并行和频点计算一级的小粒度并行；给出了并行计算的实现方法，即在PC机群上，利用主一从编程模式实现Occam反演的整体并行计算。在计算中，采用任务组合方式，减少了通信量，较好地实现了负载均衡。在4节点PC机群上，对应于拉格朗日乘子的扫描和一维搜索方式，整体加速比分别达到3．36和2．83。     

The Two-Dimensional Clifford-Fourier Transform

Recently several generalizations to higher dimension of the Fourier transform using Clifford algebra have been introduced, including the Clifford-Fourier transform by the authors, defined as an operator exponential with a Clifford algebra-valued kernel. In this paper an overview is given of all these generalizations and an in depth study of the two-dimensional Clifford-Fourier transform of the authors is presented. In this special two-dimensional case a closed form for the integral kernel may be obtained, leading to further properties, both in the L ₁ and in the L ₂ context. Furthermore, based on this Clifford-Fourier transform Clifford-Gabor filters are introduced. AMS subject classification numbers: 42B10, 30G35 Fred Brackx received a diploma degree in mathematics from Ghent University, Belgium, in 1970 and a Ph.D. degree in mathematics from the same university in 1973. Since 1984 he is professor for mathematical analysis at Ghent University and currently he is leading the Clifford Research Group. His main interests are function theory and functional analysis for functions with values in quaternion and Clifford algebras. The research covers Clifford distributions, generalized Fourier, Radon and Hilbert transforms, orthogonal polynomials and multi-dimensional wavelets. Nele De Schepper received a diploma degree in mathematics from Ghent University, Belgium, in 2001. Since then she holds an assistantship at the Department of Mathematical Analysis of Ghent University and is a member of the Clifford Research Group. Her main interests are function theory and functional analysis for functions with values in Clifford algebras. The research covers generalized Fourier transforms, orthogonal polynomials and multi-dimensional wavelets. Frank Sommen received a diploma degree in mathematics from Ghent University, Belgium, in 1978, a Ph.D. degree in mathematics from the same university in 1980, and a habilitation degree in mathematical analysis in 1984. From 1978 until 1999 he was at the National Fund for Scientific Research (Flanders). Since 2000 he holds a Research professorship at Ghent University. His main interests are function theory and functional analysis for functions with values in quaternion and Clifford algebras. The research covers Clifford distributions, generalized Fourier, Radon and Hilbert transforms, orthogonal polynomials and multi-dimensional wavelets, algebraic analysis, hyperfunctions and radial algebra.     

一种有效的并行汉字／字符串相似检索技术

本文提出了一种有效的并行汉字／字符串相似检索技术．通过引入搜索状态向量及字符一模式匹配向量，该技术将字符串匹配比较转化为简单的整数字位运算，通过对字符串方向相反的搜索有效地实现了多处理机对汉字／字符串的并行相似检索．文中也给出了并行实现算法，同时分析了算法的复杂性．     

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

一种基于模式搜索的大尺寸测量移站坐标转换方法

针对空间大尺寸测量的移站坐标转换，提出了最小二乘坐标转换数学模型和基于模式搜索的参数求解方法，实验证明该方法具有理论正确性和实际可行性。     

基于可变大小模板的改进图像修复算法

Criminisi等人提出的基于模板的图像修复算法是该领域最重要的贡献之一。在保持Criminisi基本算法框架不变的基础上,本文提出了一些改进思想。主要贡献是设计了基于可变大小模板的块匹配程序以使模板搜索更准确灵活。此外,对信度更新方式进行了修正,并结合局部搜索以提高算法的综合性能。实验结果证实了改进的有效性。     

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

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