重建硬盘分区表时相关参数的使用

本文说明 了硬盘分区表与硬盘参数和磁盘Ｉ／Ｏ参数表之间的关系太部分 参数的获取方法,彰如何利用这些参数肋分区表     

面向社团结构划分的最短路径相异性指数算法

用最短路径距离取代网络中用布朗微粒衡量的两节点之间的距离,在此基础上提出了基于最短路径的相异性指数算法.对算法实现过程进行描述,并将算法应用于存在的研究算法分析实例上,说明该算法可行性.把该算法应用于本文构造的虚拟企业网络的社团划分上,划分结果与预期相符.     

大容量硬盘的限权使用

详细介绍了大容量硬盘分区管理以及限权使用的基本方法，为保护硬盘上信息提供了另一种途径。     

计算机教学机房的建设、管理与维护

针对计算机教学机房的建设、管理与维护,介绍了一些有效可行的保证机房正常、稳定运行的“软”保护方法,不需任何投资、不存在兼容性问题,且快速、方便。     

硬盘数据存储格式与系统区域的备份

该文详细描述了计算机硬盘数据存储格式，并提供了实用的系统区域的备份及恢复的程序。     

关于C^n中有界域上光滑函数的一个积分公式

应用积分表示中核函数的构造理论，得到Ｃｎ空间中有界域上光滑函数的一个抽象的积分公式．根据这个抽象公式，可以得到至今许多区域上光滑函数种种已有的积分公式（包括抽象的和具体的）以及它们的拓广式．     

A DOMINANCE APPROACH FOR PLANE PARTITIONS

By developing the dominance technique of nondecreasing integer sequences into a multifoldform,we introduce a new approach for the enumeration of plane partitions,which can be used togenerate most of classical theorems in this field.The treatment presented here may be more accessibleto readers than the earlier methods of algebra,analysis and algorithm.     

A Binary Integer Program to Maximize the Agreement Between Partitions

This research note focuses on a problem where the cluster sizes for two partitions of the same object set are assumed known; however, the actual assignments of objects to clusters are unknown for one or both partitions. The objective is to find a contingency table that produces maximum possible agreement between the two partitions, subject to constraints that the row and column marginal frequencies for the table correspond exactly to the cluster sizes for the partitions. This problem was described by H. Messatfa (Journal of Classification, 1992, pp. 5–15), who provided a heuristic procedure based on the linear transportation problem. We present an exact solution procedure using binary integer programming. We demonstrate that our proposed method efficiently obtains optimal solutions for problems of practical size. We would like to thank the Editor, Willem Heiser, and an anonymous reviewer for helpful comments that resulted in improvements of this article.     

双凹规划的一种单纯形剖分算法

给出了双凹函数的一个很重要的性质。利用此性质,借助分枝定界技术,提出了双凹函数在有界凸集上整体最小问题(及双凹规划问题)的一种单纯形部分算法,并进行了收敛分析。     

On the use of ordered sets in problems of comparison and consensus of classifications

Ordered set theory provides efficient tools for the problems of comparison and consensus of classifications Here, an overview of results obtained by the ordinal approach is presented Latticial or semilatticial structures of the main sets of classification models are described Many results on partitions are adaptable to dendrograms; many results on n-trees hold in any median semilattice and thus have counterparts on ordered trees and Buneman (phylogenetic) trees For the comparison of classifications, the semimodularity of the ordinal structures involved yields computable least-move metrics based on weighted or unweighted elementary transformations In the unweighted case, these metrics have simple characteristic properties For the consensus of classifications, the constructive, axiomatic, and optimization approaches are considered Natural consensus rules (majoritary, oligarchic, ) have adequate ordinal formalizations A unified presentation of Arrow-like characterization results is given In the cases of n-trees, ordered trees and Buneman trees, the majority rule is a significant example where the three approaches convergeThe authors would like to thank the anonymous referees for helpful suggestions on the first draft of this paper, and W H E Day for his comments and his significant improvements of style