matlab-help-file-in-chinese

Converts 3D and 2D MATLAB plots to the scalable vector format (SVG)

说明：  Matlab教程，初学者很好的学习材料。拿来分享。(Matlab tutorial for beginners good learning materials. To be shared.)

FixedLoad simulation in matlab simulink

TLD是英国Surrey大学的Zdenek Kalal发表在PAMI2012年七月刊的一篇文章，主要贡献在于将跟踪与检测结合在一起，实现了工程上可应用的实时跟踪程序(TLD is Zdenek Kalal at the University of Surrey, UK, published in the July issue of PAMI2012 in an article, the main contribution is the tracking and detection together to achieve real-time tracking program on the project can be applied)

说明：  Throughput optimization in wireless networks with multiple channels and multiple radio interfaces

基于MATLAB 的带阻滤波器设计,是我自己做的，的确还不错，带宽是200HZ(JI YU MATLAB DE DAI ZU LV BO QI SHE JI)

说明：  能够用来求解部分关利用遗传算法的优化模型。。(Relations can be used to solve some of the optimization model using genetic algorithms. .)

基于互功率谱的时延估计，这个有中文注释，看得明白，光纤陀螺输出误差的allan方差分析。( Based on the time delay estimation of power spectrum, The Chinese have a comment, understand it, allan FOG output error variance analysis.)

完成对双正交信号数字通信系统的蒙特卡洛仿真(Complete pairs of orthogonal signal Monte Carlo simulation of digital communication systems)

说明：  C++源代码，递归实现。原问题描述：鼓上蚤时迁到一个山洞里去盗宝，里面有n件宝贝，价值分别是a1,a2......an，并且满足ai大于a1+a2+....+a(i-1)的和。他身上有一个背包，能装的东西最大价值是K，他只能进洞一次，请问他最多能带出多少？ 要求：输入K，n，a1，a2......an 输出：他能最多带出的宝物价值 (C++ Source code Recursive achieve. The original problem description: drum when flea盗宝going to move in a cave, there are n pieces of treasure, valued are a1, a2 ...... an, and to meet ai than a1+ A22B !....+ a (i-1) and. Him to have a backpack, things can hold the greatest value is K, he could only hole once, to ask him to bring out the maximum number of? Requirements: Enter K, n, a1, a2 ...... an output: he can bring out the maximum value of the treasures)