- Windows_core_programming jeffrey richter第五版windows核心编程
- 1 We present a genetic algorithm which is distributed in two novel ways: along genotype and temporal axes. Our algo
- RemObjects skd 文档翻译
- static-I 恒流电子负载
- classification 识别分类算法 matlab程序 PLSDA SIMCA等 机器学习 application 直接运行 带入分类数据 建立模型后运行(Recognition and Classification Algorithms
- 核Fisher鉴别分析方法(KFDA) 基于核函数的Fisher分类判别
文件名称:Dichotomy
介绍说明--下载内容来自于网络,使用问题请自行百度
Dichotomy Methods
Successive dichotomy uses a totally different approach to the problem of indexing. The constants A to F in the equation
Q = A h2 + B k2 + C l2 + D kl + E hl + F hk
are assigned minimum and maximum values so that for a given hkl triplet values of Qmin and Qmax can be calculated. All of the input lines must lie within one of these Q ranges, but with no more than one line per range. The program then successively halves the range of the constants into an upper and lower range and again Q ranges are calculated. Now if some of the lines do not fall into the smaller Q ranges, then either the upper or lower range can be rejected. Thus the constants A to F are successively decreased, thus increasing their precision. The method is potentially exhaustive, but is extremely time consuming for the lowest-symmetry crystal systems.-Dichotomy Methods
Successive dichotomy uses a totally different approach to the problem of indexing. The constants A to F in the equation
Q = A h2 + B k2 + C l2 + D kl + E hl + F hk
are assigned minimum and maximum values so that for a given hkl triplet values of Qmin and Qmax can be calculated. All of the input lines must lie within one of these Q ranges, but with no more than one line per range. The program then successively halves the range of the constants into an upper and lower range and again Q ranges are calculated. Now if some of the lines do not fall into the smaller Q ranges, then either the upper or lower range can be rejected. Thus the constants A to F are successively decreased, thus increasing their precision. The method is potentially exhaustive, but is extremely time consuming for the lowest-symmetry crystal systems.
Successive dichotomy uses a totally different approach to the problem of indexing. The constants A to F in the equation
Q = A h2 + B k2 + C l2 + D kl + E hl + F hk
are assigned minimum and maximum values so that for a given hkl triplet values of Qmin and Qmax can be calculated. All of the input lines must lie within one of these Q ranges, but with no more than one line per range. The program then successively halves the range of the constants into an upper and lower range and again Q ranges are calculated. Now if some of the lines do not fall into the smaller Q ranges, then either the upper or lower range can be rejected. Thus the constants A to F are successively decreased, thus increasing their precision. The method is potentially exhaustive, but is extremely time consuming for the lowest-symmetry crystal systems.-Dichotomy Methods
Successive dichotomy uses a totally different approach to the problem of indexing. The constants A to F in the equation
Q = A h2 + B k2 + C l2 + D kl + E hl + F hk
are assigned minimum and maximum values so that for a given hkl triplet values of Qmin and Qmax can be calculated. All of the input lines must lie within one of these Q ranges, but with no more than one line per range. The program then successively halves the range of the constants into an upper and lower range and again Q ranges are calculated. Now if some of the lines do not fall into the smaller Q ranges, then either the upper or lower range can be rejected. Thus the constants A to F are successively decreased, thus increasing their precision. The method is potentially exhaustive, but is extremely time consuming for the lowest-symmetry crystal systems.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Лаб 1/dihotomia.m
Лаб 1/Lab1.xmcd
Лаб 1/лаб 1.doc
Лаб 1/лаб1.теория.docx
Лаб 1
Лаб 1/Lab1.xmcd
Лаб 1/лаб 1.doc
Лаб 1/лаб1.теория.docx
Лаб 1