HARMONICS-3D

Matlab中的双馈发电系统模型，包括电机模型和控制部分，可以随意修改电机参数(Matlab DFIG)

是蛋白质二级结构优化（基于2维度非晶格模型）的优化代码，可直接运行，算法书写简单，高中生都能看懂。唯独一点，必须引用我们的两篇论文，否则算侵犯版权。( description : A self-organized matlab m file for protein structure optimization using 2D off-lattice model and ABC algorithm. Users MUST cite the following two articles if the codes are implemented in their studies (1) Li, B., Li, Y., & Gong, L. (2014). Protein secondary structure optimization using an improved artificial bee colony algorithm based on AB off-lattice model. Engineering Applications of Artificial Intelligence, 27, 70-79. (2) Li, B., Gong, L., & Yao, Y. (2013, October). On the performance of internal feedback artificial bee colony algorithm (IF-ABC) for protein secondary structure prediction. In Advanced Computational Intelligence (ICACI), 2013 Sixth International Conference on (pp. 33-38). IEEE.)

基本bp算法,实现函数的拟合,提供给大家分享(Bp basic algorithms, implementation of the fitting function, available to everyone to share)

codigo de encriptacion de la paltaforma de cesar asi mismo engoy

Application Applet GUI窗口型。。。。。。。。。。。。。。(Application Applet GUI window type)

（1）matlab入门第一步，基本的matlab操作，轻轻松松进阶matlab((1) matlab Getting a first step, the basic matlab operation, easily advanced matlab)

Matlab, Simulink Building a direct sequence spread spectrum model

INSAR合成孔径干涉雷达相位解缠经典算法 -质量图引导法(INSAR synthetic aperture radar interferometry phase unwrapping algorithm - classic quality map to guide law)

Matlab智能天线算法（包含电磁场基本原理、天线阵基本原理、随机过程、传播信道特性、到达角估计、自适应波束成形等的仿真代码）(Smart antennas for wireless communication(MATLAB))

自己编写的利用matlab实现无线自组织网AODV仿真的算法源码。 为由50个节点构成的网络。在50m×50m大小的区域内，随机的产生50个节点。由用户指定源节点和目的节点，程序负责给出从源节点到目的节点的最小路径和此路径的跳数。各个节点之间设定为只要在自己直接通信范围内的其它节点，均一跳可达。(Write your own realization of the use of matlab simulation of wireless self-organizing network algorithms AODV source. The grounds of a network of 50 nodes. Size of 50m × 50m in area, randomly generated 50 nodes. By the user to specify the source node and destination node, the program responsible for the given node from the source node to the destination path and this path is the minimum number of hops. Set between each node to communicate directly as long as within the scope of their other nodes, all jump up.)