T01

C#的手写汉字识别程序，小程序用来参考一下(C#, handwritten Chinese character recognition program)

planovanie trajektorie mobilneho robota

shi te zheng pailei de daima

telecommunication lab manual

results than conventional LBP based schemes.Several observations can be made for CLBP. First, LBP is aspecial case of CLBP by using only CLBP_S. Second, we willshow that the sign component preserves more image localstructural information than the magnitude component. Thisexplains why the simple LBP (i.e. CLBP_S) operator worksmuch better than CLBP_M for texture classification. Third, theproposed CLBP_S, CLBP_M and CLBP_C code maps have

SPECFEM2D，模拟二维各向异性粘弹性介质的地震波传播。(SPECFEM2D simulates seismic wave propagation in two-dimensional anisotropic viscoelastic or coupled viscoelastic-acoustic media.)

针对提出的故障信号，利用awgn加噪，对其进行小波软硬阈值降噪，提出一种改进阈值，利用五种自适应阈值函数sqtwolog、rigrsure、heursure、minimaxi和ddencmp中阈值选取原则，对软阈值、硬阈值和改进阈值进行降噪效果对比。(In view of the proposed fault signal, the wavelet soft and hard threshold de-noising is carried out by AWGN adding noise, and an improved threshold is proposed. The threshold selection principle of five adaptive threshold functions, sqtwolog, rigrsure, heursure, minimaxi and ddencmp, is used to compare the soft threshold, hard threshold and threshold value.)

数字图像处理中的有关频域滤波的代码，希望对大家能有所帮助 matlab(Digital image processing in the frequency domain filtering code, and hope we can help matlab)

单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解,再鉴别；若仍不是，则再转换,按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination. )

说明：  在2d不光滑曲面上的射线跟踪算法，效果比较好，希望可以帮助到大家(2d surface is not smooth in the ray-tracing algorithm, the effect is good, hope you can help to)