Solving Non-Uniqueness in Agglomerative Hierarchical Clustering Using Multidendrograms

In agglomerative hierarchical clustering, pair-group methods suffer from a problem of non-uniqueness when two or more distances between different clusters coincide during the amalgamation process. The traditional approach for solving this drawback has been to take any arbitrary criterion in order to break ties between distances, which results in different hierarchical classifications depending on the criterion followed. In this article we propose a variable-group algorithm that consists in grouping more than two clusters at the same time when ties occur. We give a tree representation for the results of the algorithm, which we call a multidendrogram, as well as a generalization of the Lance andWilliams’ formula which enables the implementation of the algorithm in a recursive way. The authors thank A. Arenas for discussion and helpful comments. This work was partially supported by DGES of the Spanish Government Project No. FIS2006–13321–C02–02 and by a grant of Universitat Rovira i Virgili.     

Homology Priority Task Scheduling in μC/OS-Ⅱ Real-Time Kernel

μC/OS-Ⅱ is an open source real-time kernel adopting priority preemptive schedule strategy. Aiming at the problem of μC/OS-Ⅱ failing to support homology priority tasks scheduling, an approach for solution is proposed. The basic idea is adding round-robin scheduling strategy in its original scheduler in order to schedule homology priority tasks through time slice roundrobin. Implementation approach is given in detail. Firstly, the Task Control Block （TCB） is extended. And then, a new priority index table is created, in which each index pointer points to a set of homology priority tasks. Eventually, on the basis of reconstructing μC/OS-Ⅱ real-time kernel, task scheduling module is rewritten. Otherwise, schedulability of homology task supported by modified kernel had been analyzed, and deadline formula of created homology tasks is given. By theoretical analysis and experiment verification, the modified kernel can support homology priority tasks scheduling, meanwhile, it also remains preemptive property of original μC/OS-Ⅱ.     

冷冲模凸模零件分类编码系统设计

应用成组技术对冷冲模凸模的特征进行了分析 ,采用特征代码设计了其零件分类编码系统。该设计具有一定的通用性 ,可扩展到冷冲模其它零部件 ,为冷冲模CAD提供了一种方法     

高阶相关调制分类原理、判决门限与仿真研究

信号的自相关函数由傅里叶变换与其功率谱相联系。Beidas和Weber揭示了自相关函数与似然函数的关系 ,并建立了高阶相关调制分类方法。推导了用信号高阶相关代替似然比进行MFSK调制分类的基本原理 ,推导了截断似然比检测性能分析的基本公式 ,研究了高阶相关调制分类门限设置方法 ,进行了MFSK调制分类计算机仿真试验。结果表明该方法是可行的 ,并可望用于其它问题中。     

WDC-D地球化学数据分类与编码的初步研究

首先以地球化学实体为基本分类对象,运用线分类法进行数据分类.作者共把地球化学数据分为四个层次,从第一到第四层次的数据量分别为9、40、192和604.然后作者采用层次码编码方法对数据进行编码.码长共有9位,第1位用“J”表示地球化学数据分类在WDC-D中的顺序;第2位用“1~9”表示第一层次数据;第3、4位,第5、6位,第7、8位均用“00~99”分别表示第二、三、四层次数据,第9位用“1~3”表示数据的共享级别.     

关于Erdoes猜想的证明

文章对Erdoes猜想中正整数n的值进行分类．除了n为4m-3（m=6R＋1）形的奇数外，逐类直接给出了具体表示。对于n为4m-3形的奇数，文章采用命题转化法及反证法．并用自变量与函数值的一一对应关系证明了Erdoes猜想成立。     

Progress of Soil Research in China

Soil,as a survival natural resource for the existent of human beings,is always highly concerned by contemporary scientists.Being a tag to symbolize the development level of soil science,research in soil classification is a focus in today's international soil science.     

关于Sauer引理的一个推广

Sauer引理是统计学习理论中的基本结论．在许多实际问题中，需要研究N类模式识别问题．本文将Sauer引理推广到N类分类问题．     

高Tc超导材料Bi_2Sr_2CuO_6和Bi_2Sr_2CaCu_2O_8的晶格振动对称性分析

本文运用群论方法,对高T_c Bi 系超导体中的Bi_2Sr_2CuO_(?)和Bi_2Sr_2CaCu_2O_8的晶格振动模进行了系统的对称性分类.给出了其布里渊区中(?)点,X 点和△线振动模式的对称分解和对称化基.