LTE-system-fangzhen

说明：  matlab 中很实用的源代码3：13.直方图阈值法 16 14. 自动阈值法：Otsu法 18 15.膨胀操作 19 16.腐蚀操作 20(Practical source code of matla)

说明：  车牌识别的MATLAB程序 含多个M文件及图片 运行有图片演示(License plate recognition program MATLAB language)

计算空间几何距离的MATLAB计算机算法(Spatial geometric distance calculation algorithm MATLAB computer)

此程序为VC与matlab图像处理与识别实用案例精选的源码，内容详实，与大家分享。(This program is VC with matlab image processing and recognition of practical cases of selected source code, content, informative, and to share.)

C++大作业，编写一个account类实现基类派生类之间的各种关系。主要用于初学者对于类的理解。(C++ big job, write a class that implements account the various relationships between the base class derived class. The main class for beginners to understand.)

在二维空间里有两个点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.)

How C# calls Matlab? This is the solution

用镜像矩阵求出矩阵的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.)

说明：  phone book for add or remove telephone numbers in text file

说明：  matlab书籍很好 很好 的文章 (matlab books very good very good article)