The Factorial Minimum Spanning Tree as a Reference for a Synthetic Index of Complex Phenomena

This paper is aimed at combining both the properties of factorial subspaces and those of the Minimum Spanning Tree Algorithm (MST) to obtain a reference structure (the Maximum Path) in which the statistical units are in reduced subordering. The coordinates (factor scores) of the statistical units in a multi-factorial subspace through Principal Component Analysis are the basis for the Minimum Spanning Tree. In the MST, we single out a path of maximum length. On the Maximum Path each graduation obtained for the unit can be used as a Synthetic Index of the phenomenon analyzed. Two distinct strategies lead to the choice of the subspace in which we have the best representation of the units in the Maximum Path. The validity of the method is confirmed by results achieved in various applications to real data.     

谜题与棘题：两类不同性质的难题

难题是一类具有迷惑性、复杂性且不易解或无解的问题。在科学上和实践上存在两类不同性质的难题:谜题与棘题。这两类难题自古有之,但在理论上的概括和分析是在科学哲学和管理学中逐步出现的。谜题与棘题在问题确认、问题解答、问题评价等方面存在很大差异。廓清这两类难题有助于我们深刻理解理论科学与实践科学、自然科学与社会科学,进而深刻理解自然科学哲学和社会科学哲学,推动问题导向的科学哲学研究和问题哲学研究。     

Minimum sum of diameters clustering

The problem of determining a partition of a given set ofN entities intoM clusters such that the sum of the diameters of these clusters is minimum has been studied by Brucker (1978). He proved that it is NP-complete forM3 and mentioned that its complexity was unknown forM=2. We provide anO(N ³ logN) algorithm for this latter case. Moreover, we show that determining a partition into two clusters which minimizes any given function of the diameters can be done inO(N ⁵) time.Acknowledgments: This research was supported by the Air Force Office of Scientific Research Grant AFOSR 0271 to Rutgers University. We are grateful to Yves Crama for several insightful remarks and to an anonymous referee for detailed comments.     

Tree enumeration modulo a consensus

The number of trees withn labeled terminal vertices grows too rapidly withn to permit exhaustive searches for Steiner trees or other kinds of optima in cladistics and related areas Often, however, structured constraints are known and may be imposed on the set of trees to be scanned These constraints may be formulated in terms of a consensus among the trees to be searched We calculate the reduction in the number of trees to be enumerated as a function of properties of the imposed consensusThis work was supported in part by the Natural Sciences and Engineering Research Council of Canada through operating grant A8867 to D Sankoff and infrastructure grant A3092 to D Sankoff, R J Cedergren and G Lapalme We are grateful to William H E Day for much encouragement and many helpful suggestions     

Estimating the Cluster Tree of a Density by Analyzing the Minimal Spanning Tree of a Sample

runt pruning , a new clustering method that attempts to find modes of a density by analyzing the minimal spanning tree of a sample. The method exploits the connection between the minimal spanning tree and nearest neighbor density (e.g. normal mixture) or about the geometric shapes of the clusters, and is computationally feasible for large data sets.     

底线生命伦理证成的可能性:生命间性论

生命间性是指人类生命具有的不仅把自己思为生态的三重生命(生物性生命-社会性生命-精神性生命)而且用生命的理念看待、对待其他生命的一种生命特性。生命间性建基于主体间性又超越了主体间性,把主体间性思作人类生命与自然万物之间的生命间性。生命间性表明善待和敬畏他者生命实际上就是善待、敬畏自我生命的另一面。这种生命关系特性基本证成"善待和敬畏生命"这一"底线生命伦理"。     

Minimum spanning trees for tree metrics: abridgements and adjustments

Two properties of tree metrics are already known in the literature: tree metrics on a setX withn elements have 2n?3 degrees of freedom; a tree metric has Robinson form with regard to its minimum spanning tree (MST), or to any such MST if several of them exist. Starting from these results, we prove that a tree metrict is entirely defined by its restriction to some setB of 2n?3 entries. This set is easily determined from the table oft and includes then?1 entries of an MST. A fast method for the adjustment of a tree metric to any given metricd is then obtained. This method extends to dissimilarities.     

Minimum Sum of Squares Clustering in a Low Dimensional Space

Clustering with a criterion which minimizes the sum of squared distances to cluster centroids is usually done in a heuristic way. An exact polynomial algorithm, with a complexity in O(N ^p+1 logN), is proposed for minimum sum of squares hierarchical divisive clustering of points in a p-dimensional space with small p. Empirical complexity is one order of magnitude lower. Data sets with N = 20000 for p = 2, N = 1000 for p = 3, and N = 200 for p = 4 are clustered in a reasonable computing time.     

中国古代牡丹谱录研究

牡丹在中国传统名花中独领群芳,在中华民族的心目中占有很高的地位。在中国悠久的花文化历史长河中产生了众多的牡丹谱录。本文在总结前人对中国古代牡丹谱录研究状况的基础上,通过查阅古籍文献进一步考证了中国古代牡丹谱录的数量和存世状况。结果表明,中国历史上有记载的牡丹谱录共计41部,现尚存世16部,按内容可以将其分为品种谱和综合谱两大类。中国古代牡丹谱录的体例历代各不相同,主要包含序、正文、附记和跋四个部分。现尚存于世的16部古代牡丹谱录的内容和形式丰富多样,对中国古代牡丹文化的研究以及现代牡丹的育种与栽培技术研究具有重要参考价值。     

Data Model and Classification by Trees: The Minimum Variance Reduction (MVR) Method

O (n ⁴), where n is the number of objects. We describe the application of the MVR method to two data models: the weighted least-squares (WLS) model (V is diagonal), where the MVR method can be reduced to an O(n ³) time complexity; a model arising from the study of biological sequences, which involves a complex non-diagonal V matrix that is estimated from the dissimilarity matrix Δ. For both models, we provide simulation results that show a significant error reduction in the reconstruction of T, relative to classical agglomerative algorithms.     

宋代牡丹谱考释

中国宋代涌现了众多谱录类著作,其中牡丹谱共计17种,几乎占花卉谱录总数的一半,它们也是其他花卉谱录出现的前导性著作。目前,仅7部牡丹谱存世,而其他因失传已经难以确切知其具体内容。文章对包括已佚在内的17种牡丹谱进行了详细考释,包括作者经历、成书时间、书中记述的内容和结构。新颖之处在于:(1)通过对作者经历的调查,不仅明确了作者的社会地位、官位和著书环境等问题,还探明了一些作者之间的人际关系。(2)更精确推定成书年代,并按时间顺序将牡丹谱进行排序,从而解析出牡丹的品种以及栽培地域的变化。其结果显示,牡丹谱所载牡丹的品种和数量并不是单纯按照时间的推移而递增的,但考察各种谱录所载的品种名称时,可以了解到各种谱录总载有新的品种。宋代人不断地追求新品牡丹的同时,遗弃旧的品种,因此,各种谱录所载的品数并没有明显的增加。(3)通过研究现存7部牡丹谱的结构及内容,可以大致了解到各种谱录除了大多记载当时的名品之外,还记录了花圃、风俗、栽培技术等内容,以便传于后代。另外,谱录作者主要为宋代士大夫,他们对于出现新品种等问题怀有个人的哲学性思考。这种思考往往涉及到掌管自然现象的造物和造化,并相信它影响了牡丹的变异。文章还从文献学角度介绍了现存7部牡丹谱的早期版本,并指出最可靠的善本。     

最低环境代价生存是人类可持续发展的原动力

本文从科学的实在主义研究方法论出发 ,对当今可持续发展理论提出质疑。研究结果发现了许多关于可持续发展的悖论。得出可持续发展的科学哲学语言———可持续发展就是“不可持续发展” ,不可持续发展就是“最好的可持续发展” ;进一步证实 :最低限度的环境代价生存可以使人类社会获得可持续发展的原动力。     

论科技创新下的产学合作——从交易成本的视角看

产学合作是一种存在于企业和学界间的交易架构。是交易朝向降低总成本的方式进行的必然结果。产学合作通过如下途径来实现交易成本的节约：专属性资产的共享、降低不确定性、降低组织成本和获得良好形象及声望。与完全市场和垂直一体化不同，作为合约式管理架构，在产学合作过程中，往往行为管理比产出管理更有效。