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.     

p-Median and p-dispersion problems: A bi-criteria analysis

Given a collection of n locations and a symmetric measure of distance (difference) between each pair of locations, we seek to identify (select) a subset of p locations so as to achieve two distinct objectives. The first objective is to use the selected locations as centers (medians) of p groups that would partition the entire collection and minimize the total distance between the locations and their respective group medians. The second objective is to maximize the minimum distance (diversity) among the selected locations themselves. We study this problem as a multi-objective optimization problem and propose an iterative algorithm to obtain its non-dominated frontier. At each iteration we construct and solve a 0–1 integer programming problem. Through a computational experiment we show that this algorithm is computationally effective for small to medium size instances of the problem. We also propose a Lagrangian heuristic algorithm for solving larger instances of this problem.     

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

基于启发式规则优化的网页元素提取方法

网页信息提取方法中的启发式规则,是识别网页标签信息、利用网页节点分析结果、针对网页不同内容、完成信息提取的重要手段。本研究在对现有启发式规则进行研究分析的基础上,提出了几种优化的启发式规则,实现对网页标题、发布时间、来源以及正文内容等元素信息的精准提取。本研究进一步提出了运用编辑距离算法实现正文内容提取准确率的判定,并提出阙值优化方法,克服了正文提取中噪声节点多、内容识别不完全的缺陷,大大提高了提取的准确度。     

Probabilistic heuristic estimates

Though they constitute the major knowledge source in problem-solving systems, no unified theory of heuristics has emerged. Pearl [15] defines heuristics as criteria, methods, or principles for deciding which among several alternative courses of action promises to be the most effective in order to achieve some goal. The absence of a more precise definition has impeded our efforts to understand, utilize, and discover heuristics. Another consequence is that problem-solving techniques which rely on heuristic knowledge cannot be relied upon to act rationally — in the sense of the normative theory of rationality.To provide a sound basis for BPS, the Bayesian Problem-Solver, we have developed a simple formal theory of heuristics, which is general enough to subsume traditional heuristic functions as well as other forms of problem-solving knowledge, and to straddle disparate problem domains. Probabilistic heuristic estimates represent a probabilistic association of sensations with prior experience — specifically, a mapping from observations directly to subjective probabilities which enables the use of theoretically principled mechanisms for coherent inference and decision making during problem-solving. This paper discusses some of the implications of this theory, and describes its successful application in BPS.This research was made possible by support from Heuristicrats, the National Aeronautics and Space Administration, and the Rand Corporation.     

Heuristic collision-free path planning for an autonomous platform

In this paper, a heuristic and learning, algorithmic scheme for collision-free navigation is presented. This scheme determines an optimum collision-free navigation path of an autonomous platform by using a trial and error process, past navigation knowledge and current information extracted from the generated surrounding environment.     

A heuristic 0–1 integer programming method

Summary In this paper, we present a novel relaxation method for the integer programming problem:Ax=b,A {–1,0,+1}^m×N,x {0,1}^N, N>m. The report includes experimental results of problems with up tom=100 equations andN=400 variables.