DAOPUFA1234

资源分配网络的主要思想是当神经网络在学习过程中发现“未建模”的样本时，就分配新的计算节点。(The main idea of ​ ​ the network resource allocation is when the neural networks found in the learning process " is not modeling" of the samples, to assign a new compute nodes.)

光伏电池的matlab仿真模型，主要根据光伏电池的数学模型建立，可以仿真光伏电池随温度与光照条件变化的伏安特性。(Matlab simulation model for photovoltaic cells, photovoltaic cells based primarily on mathematical modeling, simulation of photovoltaic cells can be temperature and light conditions with changes in voltage characteristics.)

说明：  电路回溯计算，在MATLAB下实现电路回溯计算。一个本人的课程设计。(Back calculation circuit, the circuit in MATLAB to achieve countback. One of my course design.)

程序运行中要用到wedgelet工具包wavelet802工具包，在此文件中未包含此工具包，所以运行时候需要安装此包。 其中部分函数内有说明文档。">

controller for inverted pendulum

降低ofdm中峰均比的方法slm的matlab源码 (PAPR reduction method in ofdm slm of matlab source)

matlab optimization toolbox

说明：  从电脑中选择一个图片，本程序可对图片完成类型转换，几何运算，代数运算（平均法降噪和减数运算），傅里叶变换，图像增强（包括灰度值变换，直方图均衡化，邻域平均法和中值滤波波法），图像复原，图像分割等功能。(Choose a picture from the computer, this program can complete type conversion, geometric operation, algebraic operation (average noise reduction and reduction), Fourier transform, image enhancement (including gray value transformation, histogram equalization, neighborhood averaging and median filtering wave method), image restoration, image segmentation and other functions.)

OFDM同步Ls算法的MATLAB仿真程序，希望对你有帮助(OFDM synchronization Ls algorithm MATLAB simulation program, want to help you)

旅行商问题，即TSP问题（Travelling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) also translated as the traveling salesman problem, traveling salesman problem is one of the well-known problems in the field of mathematics. Suppose you have a travel business to visit n cities, he must choose which path to go, limiting the path is to visit each city only once, and the last to return to the original departure city. Select the destination path is the requirement for the minimum distance path was among all paths.)