Web-Hotel

说明：  图像反投影重建算法，利用CT采集的数据在进行R_L_滤波后进行反投影得到检测图像。(Image reconstruction algorithm, using the projection of the data collected on CT after R_L_ filter back-projection get detection images.)

MUSIC Code in Matlab

用于桥梁结构动力响应信号的预处理，主要目的在于绘制互相关函数图形，以验证传感器监测的数据是否满足正态分布。(be use to plot brige figure)

京津冀产业转移过程中，产业互补能力计算；京津冀产业转移过程中，产业互补能力计算(Beijing, Tianjin and industrial transfer process, the ability to calculate the complementary industry)

最大信噪比的独立分量分析算法，包含CV、CA、Single、当前、恒转弯速率、转弯模型，可以实现模式识别领域的数据的分类及回归。( SNR largest independent component analysis algorithm, It contains CV, CA, Single, current, constant turn rate, turning model, You can achieve data classification and regression pattern recognition.)

THE SYNTAX OF A PROGRAMMING LANGUAGE tells you what code it is possible to write—what the machine will understand. Style tells you what you ought to write— what the humans reading the code will understand. Code written with a consistent, simple style will be maintainable, robust, and contain fewer bugs. Code written with no regard to style will contain more bugs. It may simply be thrown away and rewritten rather than maintained.(var OF THE PROGRAMMING LANGUAGE tells A. you what code it is possible to write-what the ma chine will understand. Style tells you what you ought to write-what the humans reading the code will understand. Code written with a consisten t, simple style will be maintainable, and robust. and contain fewer bugs. Code written with no reg ard to style will contain more bugs. It may simpl y be thrown away and rewritten rather than maint ained.)

提供一种求解最优哈密尔顿的算法---三边交换调整法，要求在运行jiaohuan3（三交换法）之前，给定邻接矩阵C和节点个数N，结果路径存放于R中。 bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。 (Provide an optimal algorithm Hamilton- trilateral exchange Adjustment Act, requiring running jiaohuan3 (c exchange) before a given adjacency matrix C and the node number N, the results of the path stored in the R in. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.)

说明：  一个基于MATLAB的生物芯片数据分析包(MATLAB-based data analysis of the bio-chip package)

分形的练习一 ①Koch曲线 用复数的方法来迭代Koch曲线 clear i 防止i被重新赋值 A=[0 1] 初始A是连接（0，0）与（1，0）的线段 t=exp(i*pi/3) n=2 n是迭代次数 for j=0:n A=A/3 a=ones(1,2*4^j) A=[A (t*A+a/3) (A/t+(1/2+sqrt(3)/6*i)*a) A+2/3*a] end plot(real(A),imag(A)) axis([0 1 -0.1 0.8]) ②Sierpinski三角形 A=[0 1 0.5 0 0 1] 初始化A n=3 迭代次数 for i=1:n A=A/2 b=zeros(1,3^i) c=ones(1,3^i)/2 A=[A A+[c b] A+[c/2 c]] end for i=1:3^n patch(A(1,3*i-2:3*i),A(2,3*i-2:3*i), b ) patch填充函数 end (Fractal Exercise One The ① Koch curve Plural iteration Koch curve clear i to prevent i is reassigned A = [0 1] initial A is a connection (0,0) and (1,0) of the segments t = exp (i* pi/3) n = 2 n is the number of iterations for j = 0: n A = A/3 a = ones (1,2* 4 ^ j) A = [A (t* A+ a/3) (A/t+ (1/2+ sqrt (3)/6* i)* a) A+2/3* a] end plot (real (A), imag (A)) axis ([0 1-0.1 0.8])   ② Sierpinski triangle A = [0 1 0.5 0 0 1] initialized A n = 3 the number of iterations. for i = 1: n A = A/2 b = zeros (1,3 ^ i) c = ones (1,3 ^ i)/2 A = [A A+ [c b] A+ [c/2 c]] end for i = 1:3 ^ n patch (A (1,3* i-2: 3* i), A (2,3* i-2: 3* i), b ) patch filled function end)

处理混合整数规划问题,可以方便计算整数规划问题(Handle mixed integer programming problem)