基于IOCC的定题Web信息发现机制研究

针对目前Web信息庞杂无序和半结构化特征所带来的信息搜索的难题,提出了一种信息对象特征码(IOCC)方法,将之结合定题信息搜索应用于机构对目标信息的发现和采集,能大大提高信息发现的能力和效率.其次从所采用的关键技术,策略和系统功能模块等方面对基于该方法的定题Web信息发现机制进行了分析和研究,并举例说明该机制是如何最大限度提高Web信息发现能力的.最后比较分析了该机制相对于传统信息搜索引擎的优势并提出了进一步研究的方向.     

Reasoning about programs in continuation-passing style

Plotkin's _v -calculus for call-by-value programs is weaker than the -calculus for the same programs in continuation-passing style (CPS). To identify the call-by-value axioms that correspond to on CPS terms, we define a new CPS transformation and an inverse mapping, both of which are interesting in their own right. Using the new CPS transformation, we determine the precise language of CPS terms closed under -transformations, as well as the call-by-value axioms that correspond to the so-called administrative -reductions on CPS terms. Using the inverse mapping, we map the remaining and equalities on CPS terms to axioms on call-by-value terms. On the pure (constant free) set of -terms, the resulting set of axioms is equivalent to Moggi's computational -calculus. If the call-by-value language includes the control operatorsabort andcall-with-current-continuation, the axioms are equivalent to an extension of Felleisenet al.'s _v -C-calculus and to the equational subtheory of Talcott's logic IOCC.This article is a revised and extended version of the conference paper with the same title [42]. The technical report of the same title contains additional material.The authors were supported in part by NSF grant CCR 89-17022 and by Texas ATP grant 91-003604014.