FUNC1

，建立车体6个自由度加上前轮转向系统1个自由度的汽车数学模型；该汽车数学模型不需引入很多的人为假设；可以实现给定汽汽车前轮转角，也可以不给定前轮转角；不依赖需要复杂测定的侧向力函数及相关模型参数；考虑了轮胎的滚动特性 已通过测试。 (Vehicle mathematical model of one degree of freedom, the establishment of the body' s six degrees of freedom coupled with front-wheel steering system mathematical model of the car does not need to introduce a lot of people assume front wheel angle can be achieved given steam can also be given front wheel angle does not depend on the complex determination of the lateral force function and model parameters consider rolling characteristics of the tire has been tested.)

用镜像矩阵求出矩阵的QR分解（正交三角分解），并求解线性方程组，该方法不必选主元，但其计算过程非常稳定。也可用于求矩阵的广义逆和求解线性最小二乘问题。子过程QRDCMP用镜像矩阵求m*n矩阵A的QR分解，A=Q^TR,其中Q是m*m正交矩阵，R为m*n上三角矩阵；子过程QRBKSB用矩阵的QR分解求解线性方程组Ax=b，其中A为n阶非奇异方阵。(Matrix obtained with the mirror matrix QR decomposition (orthogonal triangular decomposition), and solving linear equations, the method does not have to choose the main element, but its calculation process is very stable. Can also be used to find the generalized inverse matrix and solving linear least squares problems. Sub-process of the mirror matrix QRDCMP m* n matrix A QR decomposition, A = Q ^ TR, wherein Q is a m* m orthogonal matrix, R is m* n upper triangular matrix subprocess QRBKSB a QR decomposition to solve the matrix linear equations Ax = b, where A is non-singular square matrix of order n.)

心电信号处理，滤波与计算 之：数据的读取(ECG signal processing, filtering and calculation of: reading data)

Huffan codein and decoding

用蒙特卡洛法对建立起的DF数学模型实现复合材料特性边界的估计(Monte Carlo method to establish mathematical models of DF characteristics of composite materials to achieve the estimated boundary)

基于LMS算法的均衡技术在matlab上的仿真应用(Equalization technique based on the LMS algorithm in matlab simulation applications)

一个VC与MATLAB混合编程的简单示例，需用到ibmatpm.lib libmmfile.lib libmcc.lib libmatlb.lib libmx.lib libmat.lib(VC++ and Matlab mix-program demo ，must include ibmatpm.lib libmmfile.lib libmcc.lib libmatlb.lib libmx.lib libmat.lib)

在二维空间里有两个点A=(X1，Y1)和B=(X2，Y2)，如果X1>X2并且Y1>Y2 ，我们认为A优于B，A是这个集合的最大极值点，在给定的二维空间里的N个点的集合S中，找出最大极值点。(In two-dimensional space, there are two points = A = (X1, Y1) and B (X2, Y2), if the X1 and Y1 > X2 > Y2, we think that A is superior to B, A is the biggest extreme value point of the set, in A given set of N points in the two-dimensional space S, find out the most extreme value point.)

说明：  Running test programming

Queen problem is solved