fdtd

说明：  不带像素操作的机器视觉代码-The brain transforms and discards pixels. The transformation is a smoothing and differencing filter. The output of an individual filter is ambiguous.The output of 5 filters lets us find edges and corners. A small number of filters covers the entire image. This method is fast and discards irrelevant information(Without pixel machine vision operation code-The brain transforms and discards pixels. The transformation is a smoothing and differencing filter. The output of an individual filter is ambiguous.The output of 5 filters lets us find edges and corners. A small number of filters covers the entire image. This method is fast and discards irrelevant information)

An automated method for estimating reliability of grid systems

说明：  用MATLAB实现了多相滤波器的仿真(Using MATLAB realize the polyphase filter simulation)

MATLAB实现ELM算法，并附带UCI经典数据。(MATLAB realization ELM algorithm, along with the classic UCI data.)

STC波形处理方法，提取波列慢度，应用于地震资料处理与测井资料处理中(STC waveform processing method to extract wave train slow degrees, applied to seismic data processing and logging data processing)

ADRC自抗扰控制simulink仿真程序。(ADRC(Active Disturbance Rejection Control))

深度图生成，基于立体匹配获取的深度图质量较好(Depth map, depth map based on good quality stereo matching Being)

功能描述：测试Levinson-Durbin算法 文件名：L_D_sim.m 测试用例： (1)x(n)+0.81*x(n-2)=u(n)，u(n)为高斯白噪声 (2)x(n)=u(n)+u(n-1)+u(n-2),u(n)为高斯白噪声 文件输出：两种测试用例情况下的功率谱 调用函数：function [A,E] = Levinson_Durbin_Algo(R,P) 被调用：无 作者：mingcheng 编写时间：2009-11-13 修改时间：2009-11-13 版本：V1.0 ( Function Description: Test Levinson-Durbin algorithm file name: L_D_sim.m test case: (1) x (n)+0.81* x (n-2) = u (n), u (n) is Gaussian white noise (2) x (n) = u (n)+ u (n-1)+ u (n-2), u (n) is Gaussian white noise file output: two tests use case in case of power spectrum call the function: function [A, E] = Levinson_Durbin_Algo (R, P) is called: No of: mingcheng write time :2009-11-13 modified :2009-11-13 version: V1.0 )

模拟计算迈克尔逊干涉仪产生的强度曲线，及其对波长和夹角的依赖性。(Ring pattern of intensity of the Michelson interferometer)

山上有m只猴子要选大王,选举办法如下：所有猴子从1到m进行编号并围坐一圈,从第一号开始按顺序1,2,...n继续报数,凡是报n号的猴子都退出到圈外,照此循环报数,直到圈内只剩下一只猴子时,这只猴子就是大王.输出大王的编号。 (Mountains have m of the monkeys to elect king, method of election are as follows: All monkeys are numbered from 1 to m, and sitting around a circle, to begin from the first order 1,2, ... n continue to report the number of those who reported that n No. The monkeys are out to outsiders the basis of this report the number of cycles until the circle only one monkey, the monkey is king. Output King number.)