fzerotx1

说明：  最短路径的通用程序，matlab，在网上整理的，有些问题，需要进一步调整。(The shortest path of the general program, matlab, online finishing, some issues require further adjustment.)

自回归模型得到的谱与yulear法、burg法、协方差法、改进协方差法等方法得到的谱进行对比 (Autoregression model spectra obtained with yulear method, burg method, covariance method, modified covariance method and other methods to compare the obtained spectrum)

曲线模型的半自适应交互多模型跟踪方法 我存的一篇论文，拿来与大家共享(When using interactive multiple model (IMM) to track targets,to select smallermodel set to better cover the move- ment property and the maneuvering level of various targets and meanwhile to reduce computation complexity are both worthwhile and also necessary research tasks to project implementation.The main work is done through the IMM algorithm of curvilinear model,the construction of angle velocity estimation model and the extension of it to state equations,whichmake it possible for normal acceleration to be self-adaptively adjusted,hence it reduces the model setto associate onlywithMcurvilinearmodels selatingtotangential acceler- ation.Computation burden is reduced and algorithm’s applying range is extended.The simulation further proves the conclusion )

是基于LeventCodes平台作的。BivaShrink方法、模型1、模型2、模型3（TrivaShrink方法）、BayesShrink方法、 LAWMLShrink方法的DWT实现和DT_CWT实现。 (Is made based on LeventCodes platform. BivaShrink method, model 1, model 2, model 3 (TrivaShrink method), BayesShrink method, LAWMLShrink method of DWT implementation and DT_CWT achieve.)

MATLAB仿真60个目标直线运动，采用基于航迹隶属度的航迹关联算法仿真目标正确关联概率(60 targets ,the correct probility of the algrithm based on track )

matlab advance tutorial for students.

说明：  马尔可夫链可被应用于蒙特卡罗方法中，形成马尔可夫链蒙特卡罗（Markov Chain Monte Carlo, MCMC） ，也被用于动力系统、化学反应、排队论、市场行为和信息检索的数学建模。(Markov Chain Monte Carlo, MCMC)

lsb的基于图像的信息隐藏，水印嵌入和信息的提取(lsb Information Hiding)

说明：  图论算法及其MATLAB 程序代码 1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法 2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法 3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法 6.(Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6.)

This code is for a simple channel equalization using the simplest LMS algorithm