LinerChirp1

本文件包含了两个直扩和跳频的例子，用MATLAB语言实现，而且还包括例子的原文及大量注释，十分详细(This document contains two examples of DS and FH, with the MATLAB language, but also examples of the original and a lot of notes, very detailed)

ZF-SIC、MMSE-SIC检测算法实现，及误码率对比，带检测信道的所有行最小二范数的函数(ZF-SIC, MMSE-SIC detection algorithm, and the error rate compared with all the lines to detect the smallest two-channel function norm)

悬臂梁振动主动控制，包括悬臂梁振动动力学模型，悬臂梁振动力学分析，悬臂梁振动微分方程，悬臂梁的PID控制仿真 (Cantilever vibration control, including the dynamic model of the cantilever vibration, the cantilever vibration mechanical analysis, differential equations cantilever vibration, the cantilever PID control simulation)

说明：  :针对遗传算法易陷入局部最优的不足,在标准遗传算法基础上加入了三个新的操作- 复原、重构和录优操作,使改 进后的遗传算法收敛于全局最优,并在此基础上以路边约束、动态避障和路径最短作为适应度函数,提出了动态避障的路径 规划方法。通过实验仿真验证了算法的有效性、准确性和实时性,并与基于以往的遗传算法的路径规划方法进行比较,结果 表明本文提出的方法在产生的路径长度和算法运行时间上都具有更优的性能。(: Genetic algorithm for the lack of easy to fall into local optimum, in the standard genetic algorithm based on the insertion of three new operations- rehabilitation, reconstruction, and excellent operational record, so that the improved genetic algorithm converges to the global optimum, and in this by the roadside on the basis of constraints, dynamic obstacle avoidance and the shortest path as the fitness function is proposed dynamic obstacle avoidance path planning method. Simulation results through experiments the effectiveness of the algorithm, accuracy and real-time, and with previous genetic algorithm based path planning method to compare the results show that the method proposed in the resulting path length and algorithms have a running time better performance.)

矩形检测,基于MATLAB的利用霍夫变换，自己弄的，很实用(rectangular detection)

visa travellers cheques guidelines

通信中的TCM&16QAM源程序代码，开发环境matlab7.5 采用viterbi软判决译码(Communication TCM & 16QAM source code, development environment matlab7.5 using soft-decision viterbi decoding)

在一个具有几个顶点的连通图G中，如果存在子图G 包含G中所有顶点和一部分边，且不形成回路，则称G 为图G的生成树，代价最小生成树则称为最小生成树(If there subgraph G ' contains all vertices in G, and part of the side, and does not form a loop, then G' in a few vertices connected graph G is the spanning tree of a graph G consideration of the minimum spanning tree is called minimum spanning tree)

Common Mode Problematic of Solar Inverter Systems

this is one of the best satelite code in the world to find the different parameters