piD_MPC

所谓阶梯式控制，就是对未来控制量的变化加以约束，强迫未来控制量以一阶指数响应曲线的形式变化。在这种控制策略下，可以避免求解控制律时的矩阵求逆，且在处理约束限制时，可方便将 和 的约束转化为对 的约束，减少了算法计算量。(The so-called ladder-type control, is the change in the future to control the amount of bound, forced to the future control the amount of the first order exponential response curve in the form of change. In this control strategy, the control law can be avoided when solving the matrix inversion, and the limit in dealing with constraints, and constraints can easily be translated into constraints, reducing the computational algorithm.)

神经元mass模型tonic 放电例子，并给出了相图(a example of neural mass model in tonic firing, and give its phase portrait)

matlab中GUI实现删除声音短，声音中插入声音(the matlab GUI delete voice short, insert voice sound)

matlab下filter程序，有脉冲响应法和双线性变换法生成filter，各参数有详细注释，有信号滤波前后的图形、频谱及相位对比。(Under filter matlab procedures, generate filter impulse response method and bilinear transformation method, various parameters are detailed notes, graphics, spectrum and phase contrast signal before and after filtering.)

BPSO 二进制粒子群优化算法matlab源代码实现 (Binary particle swarm optimization algorithm)

TimeIntegrationMethods usin Molecular Dynamics

Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code (sometimes called prefix-free codes , that is, the bit string representing some particular symbol is never a prefix of the bit string representing any other symbol). Huffman coding is such a widespread method for creating prefix codes that the term Huffman code is widely used as a synonym for prefix code even when such a code is not produced by Huffman s algorithm.

AMI码的功率谱,通过仿真产生AMI码并且绘制其功率谱图。(AMI code power spectrum, generated by simulation AMI code and mapping of its power spectrum.)

ActiveMng.cpp MuOnline,DataServer,SourceCode for MuOnline DataServer (zTeam_24.10.13_S6_3)

The travelling salesman problem (TSP) or travelling salesperson problem asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.