MATLAB_learning

第三版天线经典教材的源代码，让大家一起学习了！！！！(Third edition of the antenna, the source code of the classic textbook, so that we learn together! ! ! !)

ANPC三电平逆变器损耗计算的Simulink仿真模型(ANPC three-level inverter loss computing Simulink models)

matlab实现共轭梯度法源代码，有助于初学者学习最优化课程(matlab conjugate gradient method to achieve source code.)

此为基于四元素法，角增量法的捷连惯导系统程序算法(This is based on the four-element method, the angle increment method Jielian Inertial Navigation System program algorithm)

Training Artificial Neural Network. XOR Problem. Summation Units, Log-Sigmoid Neurons with Biases. Input Layer: 2, Hidden Layer: 2, Output Layer: 1 neurons. Returns mean square error between desired and actual outputs. Reference Papers: D. Karaboga, B. Basturk Akay, C. Ozturk, Artificial Bee Colony (ABC) Optimization Algorithm for Training Feed-Forward Neural Networks, LNCS: Modeling Decisions for Artificial Intelligence, 4617/2007, 318-329, 2007. D. Karaboga, C. Ozturk, Neural Networks Training by Artificial Bee Colony Algorithm on Pattern Classification, Neural Network World, 19(3), 279-292, 2009. */

同上，学习matlab的好教程，呵呵，大家不要骂我亚(ibid., Matlab good learning guides, huh, I do not criticize Asia)

创建了为主成分分析所需的数据矩阵，并通过主成分分析完成对所得数据的处理。(Analysis of the main ingredients to create the required data matrix, and principal component analysis of the data to complete the deal.)

说明：  复杂网络中社区划分算法中利用边介数的经典GN算法(Complex network community partitioning algorithm using edge betweenness classic GN algorithm)

This paper addresses the problem of segmenting an image into regions. We defi ne a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an effi cient segmentation algorithm based on this predicate, and show that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties. We apply the al-gorithm to image segmentation using two diff erent kinds of local neighborhoods in constructing the graph, and illustrate the results with both real and synthetic images. The algorithm runs in time nearly linear in the number of graph edges and is also fast in practice. An important characteristic of the method is its ability to preserve detail in low-variability image regions while ignoring detail in high-variability regions.

ofdm dechewngxu ofdm 的程序(ofdm dechewngxu ofdm program)