High training set size reduction by space partitioning and prototype abstraction

Instance-based learning methods like the nearest neighbour classifier generally suffer from the indiscriminate storage of all training instances, resulting in large memory requirements and slow execution speed. In this paper, new training set size reduction methods based on prototype generation and space partitioning are proposed. Experimental results show that the new algorithms achieve a very high reduction rate with still an important classification accuracy.     

分散剂FDN对G级油井水泥作用机理探讨

采用液相电导法和酸度法研究了分散剂FDN对G级油井水泥水化速度的影响。发现FDN促进水泥的早期水化,但吸附-络合作用及磺酸根离子对Ca(OH)_2核晶过程的“毒化”作用使后期水化速度减慢。本研究证实ζ电位升高是FDN广生分散作用的主要因素。当FDN的吸附达饱和时,ζ电位达最大值,水泥浆的分散程度最大。     

一种悬臂式钢管喷印装置及其控制系统

本文介绍了一种用于成品钢管生产线上的悬臂式钢管喷印装置，它是一台结构和功能都较复杂的大型机电一体化设备。文中简介了它的性能、特点和工作原理，对其各部分机械装置的构成及动作以及喷印控制系统的组成和功能进行了较为深入的描述。     

天然气管道燃压机组的性能试验及见证

结合西气东输管道工程燃气轮机驱动压缩机组设备订货及验收中对性能试验项目的确定、工厂试验及见证过程,介绍了燃压机组性能试验项目所涉及的主要内容、执行标准、需要达到的技术指标,各种性能试验的基本情况,买方参加工厂试验见证中需要重点处理好的问题等。以期为我国其他大型长输天然气管道机组订货及试验见证工作提供借鉴。     

基于Rough Set理论对原棉纱线强度的规则提取

纱线的强度和纤维的性能之间存在复杂的关系．利用纤维特性等级对实验所得的纱线强度和纤维性能的数据进行离散化处理，结合Rough Set理论知识，计算不同的纤维性能对纱线强度的影响因子，再基于约简后的离散化数据。提取数据中潜在的纱线强度和纤维性能之间的知识规则。     

小振幅驻波的数值计算

将快速行进法和源点扫描法的思想结合起来,改进了非结构网格下Level Set方法的实现策略,结合人工压缩法,求解小振幅驻波问题。对2种不同波幅的驻波分别进行了计算,结果和理论吻合较好。计算中Level Set策略很稳定,没有产生数值性的破碎,表明改进后的Level Set方法可用于不同幅度振幅波问题的计算。     

A New Approach to Abstract Syntax with Variable Binding

The permutation model of set theory with atoms (FM-sets), devised by Fraenkel and Mostowski in the 1930s, supports notions of ‘name-abstraction’ and ‘fresh name’ that provide a new way to represent, compute with, and reason about the syntax of formal systems involving variable-binding operations. Inductively defined FM-sets involving the name-abstraction set former (together with Cartesian product and disjoint union) can correctly encode syntax modulo renaming of bound variables. In this way, the standard theory of algebraic data types can be extended to encompass signatures involving binding operators. In particular, there is an associated notion of structural recursion for defining syntax-manipulating functions (such as capture avoiding substitution, set of free variables, etc.) and a notion of proof by structural induction, both of which remain pleasingly close to informal practice in computer science. Received October 2000 / Accepted in revised form April 2001     

基于粗糙集的一类彩色验证码识别研究

文章根据一类图片验证码的字符颜色、大小、字符间位置关系,使用粗糙集的方法将验证码图片中的字符分割出来,再使用AdaBoost算法进行训练,将分割得到的字符识别出来。经实验证明,该算法对该类彩色验证码,无需很高的训练样本,即具有很高的识别率和速率,基本可以满足实时应用、、     

A λ-unifiability test for set theory

We present a semi-decision algorithm for the unifiability of two set-theoretic formulas modulo -reduction. The algorithm is based on the approach developed by G. Huet for type theory, but requires additional measures because formulas in set theory are not all normalizable. We present the algorithm in an Ada-like pseudocode, and then prove two theorems that show the completeness and correctness of the procedure. We conclude by showing that -unification is not a complete quantifier substitution method for set theory-unlile first-order unification and first-order logic. In this respect set theory is similar to type theory (higher-order logic).This material is based upon work supported by the National Science Foundation under award number ISI-8560438. Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the author and do not necessarily reflect the views of the National Science Foundation.