usub-TEE-ECM

ANSYS教程，《ANSYS有限元分析实用教程》源代码("ANSYS finite element analysis of practical course," the source code)

This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen. Usage for KMEANS is: KMEANS SOURCEFILE <enter> The format of the source file is: NPat - Number of patterns (int) SizeVect - Size of vector (int) NClust - Number of cluster centers(int) vect[1,1] ... vect[1,SizeVect] - vector 1 (real) vect[2,1] ... vect[2,SizeVect] - vector 2 (real) . . . . . . vect[NPat,1] ... vect[NClust,SizeVector] - vector N (real) To compile: ICC KMEANS.CPP <enter> (This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen. Usage for KMEANS is: KMEANS SOURCEFILE <enter> The format of the source file is: NPat - Number of patterns (int) SizeVect - Size of vector (int) NClust - Number of cluster centers(int) vect[1,1] ... vect[1,SizeVect] - vector 1 (real) vect[2,1] ... vect[2,SizeVect] - vector 2 (real) . . . . . . vect[NPat,1] ... vect[NClust,SizeVector]- vector N (real) To compile: ICC KMEANS.CPP <enter> )

说明：  本程序可计算二维光子晶体的带隙，并得出带隙图，和带隙位置及宽度(This procedure computable two-dimensional photonic bandgap crystals, and came to the band-gap maps, and the band-gap position and width)

说明：  应用改进的CC法求取时间延迟和嵌入维数，效果不错(The modified CC method to strike a time delay and embedding dimension, good results)

流体力学SIMPLE算法（C语言编程实现）需自己设定边界条件(SIMPLE algorithm)

There is an algorithm that converts RGB Color to YCbCr

计算热轧中的单机架的轧制压力，采用的是SIMS公式，(rolling force calculation)

在轨迹给定长度范围内，各个waypoint给定确定的速度范围约束，规划处平滑的速度变化曲线(Within the given length range of the trajectory, each waypoint is given a determined velocity range constraint and a smooth velocity variation curve at the planning point)

序列二次规划(SQP)方法被认为是解决非线性约束优化最有效的方法之一，传统的SQP算法每一步迭代都要求解QP子问题。 　　(Sequential two times programming (SQP) is considered to be one of the most effective ways to solve nonlinear constrained optimization. The traditional SQP algorithm requires QP iteration for every iteration.)

滑动轴承接触滑块的计算方法，给定雷诺方程和膜厚方程，然后用迭代方法计算压力分布和膜厚分布，以及承载能力(The calculation method of the sliding bearing contact with the slider, a given Reynolds equation and the film thickness of the equation, and then calculated using iterative methods pressure distribution and film thickness distribution, as well as carrying capacity)