示例学习的扩张矩阵理论

本文提出示例学习的一种计算理论,扩张矩阵论.根据这个理论,示例学习中一些主要最优化问题被证明是NP难题,并给出这些难题的近似解法及下界的估计.     

On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks

This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.

A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system.     

渐变填充的性质和算法

本文着重研究了Jordan数字流形上的渐变填充,设计了紧缩渐变填充算法和分裂渐变填充算法;并证明:如果D是离散网格空间上的Jordan凸集,那么存在O(|D||D|)时间的紧缩算法去做渐变填充.最后,我们对Jordan正方形区域、三角域和圆盘,分别给出了它们各自的O(|D|log_2|D|)时间的分裂渐变填充算法.     

Modified CIELAB formula tested using a textile pass/fail data set

The proposed new color-difference formula of CIE TC 129, which is a modified version of CIELAB, was tested with a recently published data set of textile pass/fail judgments. Goodness of fit is improved, if the parameter of lightness is set near 2, and if, additionally, a weight function for lightness is defined that reduces the weight of a lightness difference with lightness level in relation to chroma or hue scaling. © 1994 John Wiley & Sons, Inc.     

基于模糊度测度和改进遗传算法的图像分割

为了利用模糊集理论进行图像分割,本文提出了一种模糊度测度函数,它衡量了背景模糊集和某一个二值图像的相似性:模糊度越小,这种相似程度越大;并且对模糊度的计算只需要进行简单的比较运算和加法运算,便于硬件实现。本文利用遗传算法求取最佳阈值,针对遗传算法的某些不足之处.我们利用精英策略和模拟退火的思想,对其做了一些修正。实验结果表明:相对于Shannon熵方法和模糊熵方法,本文方法取得了较好的分割结果,并且具有较强的抗噪声能力。     

ZZ3200-14.5/28型支架快速倒装的实践

根据桃园矿单翼相邻工作面倒装的实践,从加快综采设备的搬家速度、提高劳动效率方面,简述桃园矿综采快速倒装的几点主要做法。     

Distinctive Features of Minimization of a Risk Functional in Mass Data Sets

A statistical learning model is considered within the framework of the theory of uniform convergence of frequencies of errors in the case where the convergence is violated as a result of increasing the informativeness of training examples. Drawbacks of nonconstructive refinements of Vapnik-Chervonenkis estimates based on an assumption on the distribution law of violations are shown. A new approach to obtaining constructive estimates for mass data sets is proposed.     

用Install Shield制作安装程序

简要介绍了用 Install Shield软件制作安装程序的必要性 ,结合实例阐述了应用 Install Shield制作安装程序的步骤 ,并给出了学习制作安装程序的基本思路和方法。     

化学计算与图形处理软件设计

近年来 ,化学计算与图形处理越来越受到重视 ,许多用于微机计算的精确公式也相继发表 .介绍了酸碱滴定曲线通用计算公式、络合滴定通用计算公式、氧化还原滴定通用计算公式、混合体系缓冲容量的通用算法以及这些公式在图形处理中的应用 .简要介绍了笔者以Delphi5.0为平台处理图形时的流程及思路 .     

基于粗糙集的生产环境数据挖掘系统方法

针对粗糙集确定性模型缺乏处理不确定信息的特点，Z．Pawlak等提出了粗糙集的概率模型，但该模型没有包括如何处理生产数据集纷繁复杂数据的方法，因此提出了应用粗糙集于生产环境数据挖掘的一种系统方法，并应用UCI的数据集对该方法进行了检验，实验结果体现了它的性能与有效性。