TOFED_Dataflow

this program do qam modulation and upsampling and downsampling and use raised cosine filteroj

这是一个关于BP神经网络反演数据的一个实例。(an example of data retrieval using BP neural network.)

说明：  Q学习算法的一个基础例子 可以从这上面进行修改满足自身要求(A basic example of Q-learning algorithm can be modified to meet its own requirements)

DMC Algorythm in SIMULINK

2013年全国大学生数学建模本科组B题：采用Matlab软件编程，程序易理解，类似C(2013 National Undergraduate Students' Mathematical Modeling Group B title: using Matlab software programming, the program is easy to understand, similar to the C)

Reweighted Lp algorithm

遗传算法tsp问题 针对题目中物流配送路径优化问题，本文引入0-1规划思想，建立了带约束条件的物流配送问题的数学模型。求解时，引入遗传算法的编码方式，并针对分区数与客户数量相差较小的情况，灵活运用分区配送算法确定包含最优解的分区序列组，紧密结合枚举法使得其算法兼顾简单、快速的优点。应用Matlab软件可执行得到最短路径。兼顾时间因素导致的复杂影响，我们引入了惩罚函数，并通过设定惩罚系数，进一步由最短路径求得最优路径。(Genetic algorithm tsp problem of logistics distribution routing optimization problem subject, this paper introduces 0-1 programming ideas, a mathematical model with the constraints of logistics and distribution problems. Solving, introducing genetic algorithm encoding, and the number of partitions and the number of customers for a small difference, the flexible use of the partition containing the partition algorithm to determine the distribution of the optimal solution sequence group, closely enumeration method allows both the algorithm is simple, fast advantages. Matlab software application executable to get the shortest path. Complex factors affecting both the time, we introduce a penalty function, and by setting the penalty coefficient, and further obtain the optimal path from the shortest path.)

模拟机器人路径规划,采用强化学习中的Q学习算法来实现,最后会返回机器人选择路径的坐标位置(code for path searching)

说明：  关于功率放大器非线性建模和线性化的两篇论文资料，详细介绍了所采用的模型和相关算法，很有参考价值。(Those papers are related with pa modeling and linearization, which introduce the pa models and algorithms for those models.)

Dynamic job shop scheduling problem is one form of a job shop scheduling problem with varying arrival time job or not concurrent. This problem can be represented in graph form, which is to seek the shortest path from start point to destination point. One solution that can be used is with the ant colony optimization algorithm. There are three method to input the job : xls file, matriks, and atrractive dialog.