plotmark

Calculates a time-window based cross-correlation for two real input vectors.

if you would like bpsk costas

说明：  使用matlab实现希尔伯特黄变换中的经验模态分解，可以抑制信息处理中的端点问题(pelease keep it ,it is useful!)

V_BLAST flading channel 的一个实例，可供了解V-Blast系统的同仁参考！(V_BLAST flading channel an example of V-Blast system for understanding colleagues reference!)

matlab图像处理实例详解chap3——matlab图像处理基础(matlab image processing example explanation chap3- matlab image processing based on)

设计一个视频监控软件，完成对运动目标的检测及视频存储功能。(Design a video surveillance software to complete the moving target detection and video storage.)

【转】协同过滤代码，用于推荐系统，包括基于项目和基于用户两种情况。实现基于用户和基于项目的协同过滤算法。 实验所用数据为MovieLens – a web-based movies recommender system with 43,000 users & over 3500 movies. 保存在ga.mat文件用，由于ga.test测试集过于庞大，全部用来计算的话耗时庞大，所以每次计算时随机选择部分，具体函数的使用请参照probar.m。我所得到的实验结果保存在results1-results8.mat里面。([Turn] collaborative filtering code for the recommended system, including project-based and user-based two cases. User-based and project-based collaborative filtering algorithm. Experimental data for MovieLens- a web-based movies recommender system with 43,000 users & over 3500 movies. Saved in ga.mat file with Because ga.test test set is too large, all used to calculate the time-consuming massive, so every time The calculated random selection portion, the use of the specific function, please refer to probar.m. I obtained experimental results are saved inside results1-results8.mat.)

为了解决考虑生产总成本的车间调度问题，对引入加工成本、库存管理成本和拖期惩罚成 本的车间调度问题进行了研究，提出了一种改进的遗传算法求解该问题。论述了改进遗传算法的 编码、初始化、选择、交叉和变异操作，通过与基本遗传算法的仿真比较，验证了该算法在收敛速度 和最优解值上的优越性。 (In order to solve the job shop scheduling problem considering the total production cost, the process cost, inventory management cost and delay penalty are introduced. This job shop scheduling problem is studied, and an improved genetic algorithm is proposed to solve this problem. The improved genetic algorithm is discussed. Encoding, initialization, selection, crossover and mutation operation, the convergence speed of the algorithm is verified through simulation comparison with the basic genetic algorithm. And the superiority of the optimal solution. )

说明：  双层优化模型，求解思路是：首先对上层的决策变量编码，代人下层规划模型，通过求解下层模型的决策变量值，代入上层模型计算适应度值，然后进行交叉、变异、选择操作，最后求出最优解(two-layer optimization)

emd.m经验模态分解的程序，这个是学习希尔伯特黄变换（hht）的重要部分(emd.m EMD program, this is the study of Hilbert-Huang Transform (hht) important part of the)