GANNT

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

用于通过C实现李氏指数的计算,分析生理数据(For C to achieve through the calculation of Lyapunov exponent analysis of physiological data)

Digital image processing using matlab - Rafael C. Gonzalez, Richard E. Woods, Steven L. Eddins - 0130085197(Digital image processing using matlab- Rafael C. Gonzalez, Richard E. Woods, Steven L. Eddins- 0130085197)

说明：   有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。 现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。 可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入： 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数，每组有一对数字。 输出： 可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)

qQq QqQ qQ<WXWXC qQSQSQ

12行：host= gatest ％在matlab的安装盘，例如c:下设置的程序源码运行结果目录。 源代码完整 ">

请用多层感知器（MLP）神经网络误差反向传播（BP）算法实现异或问题（输入为，要求可以判别输出为0或1），并画出学习曲线。其中，非线性函数采用S型Logistic函数。(Please use the Multilayer Perceptron (MLP) back propagation neural network (BP) algorithm XOR problem (input is required to determine the output is 0 or 1), and draw the learning curve. Among them, the non-linear function using S-type Logistic functions. )

本文件为基于OMNeT_的Leach协议的仿真改进与研究(This document is based on the improvement and simulation of Leach agreement OMNeT_)

关于copulas相关的比较齐全的编程代码，能够简单地将相应程序运行(About copulas related to the relatively complete programming code, can simply be the corresponding program to run)

Matlab interface for the image segmentation algorithm of Efficient Graph-Based Image Segmentation Pedro F. Felzenszwalb and Daniel P. Huttenlocher International Journal of Computer Vision, 59(2) September 2004.