The last step in training phase is refinement of the clusters found above. Although DynamicClustering counters all the basic k-means disadvantages, setting the intra-cluster similarity r may require experimentation. Also, a cluster may have a lot in common with another, i.e., sequences assigned to it are as close to it as they are to another cluster. There may also be denser sub-clusters within the larger ones.
标签： DynamicClusteri refinement Although clusters
上传时间： 2014-01-04
上传用户：watch100
本书由知名的C++专家Matthew H．Austern执笔，引导你进入泛型编程思维模型，并将你带往此一模型的最重要成品：C++ Standard Template Library(STL)。本书揭示STL的奥秘，告诉你STL不仅仅是一组方便运用的容器类(container classes)。对于泛型组件和可交互作用的组件而言，STL是一个具备扩充能力的框架(framework)、 《泛型编程与STL》阐述了泛型编程的中心思想：concepts、modeling、refinement，并为你展示这些思想如何导出STL的基础概念：iterators、containers、function objects。循此路线，你可以把STL想像为一个由concepts(而非明确之functions或classes)组成的程序库：、你将学习其正式结构并因此获得其潜在威力所带来的完整优势。本书使你能够： ●以你自己的“可移植组件”及“可交互作用之泛型组件”扩充STL； ●产生一些算法，让它们和它们所处理之型别(types)及数据结构彻底划清界线； ●撰写更精致、更高效、更有效力的代码，可跨平台重复使用。
上传时间： 2014-01-06
上传用户：Avoid98
Handles Hexahedral, Tetrahedral, Quadrilateral, and Triangle meshes. Lagrangian, Hierarchic, and Monomial finite elements. Interface to PETSc solvers, adaptive mesh refinement, and extreme portablility.
标签： Quadrilateral Tetrahedral Hexahedral Lagrangian
上传时间： 2013-12-03
上传用户：咔乐坞
做网格的好程序，PARAMESH is a package of Fortran 90 subroutines designed to provide an application developer with an easy route to extend an existing serial code which uses a logically cartesian structured mesh into a parallel code with adaptive mesh refinement(AMR).
上传时间： 2014-01-06
上传用户：坏坏的华仔
SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations on high performance machines. The library is written in C and is callable from either C or Fortran. The library routines will perform an LU decomposition with partial pivoting and triangular system solves through forward and back substitution. The LU factorization routines can handle non-square matrices but the triangular solves are performed only for square matrices. The matrix columns may be preordered (before factorization) either through library or user supplied routines. This preordering for sparsity is completely separate from the factorization. Working precision iterative refinement subroutines are provided for improved backward stability. Routines are also provided to equilibrate the system, estimate the condition number, calculate the relative backward error, and estimate error bounds for the refined solutions.
标签： nonsymmetric solution SuperLU general
上传时间： 2017-02-20
上传用户：lepoke
