JQ-BP

Edge detection using gradient and laplacian operator

结合于遗传算法的偏最小二乘 光谱数据与非光谱数据均可使用(Combination of genetic algorithm in the partial least-squares spectral data with non-spectral data can be used)

层次分析方法，用于有多个方案和多个准则的情况下，选择出其中的最优方案(AHP, for there are more programs and a number of criteria in the case, choose the optimal solution which)

自动车床管理、数学建模大赛。最好的换刀方案,最好的检查周期,以降低成本。 (Automatic lathe management, mathematical modeling competition. The best solution for the sword, best check cycle, in order to reduce costs. )

各种music算法，远场线阵 近场线阵 近场圆阵 远场圆阵，正确估计DOA角和俯仰角 方位角(Various music algorithm, the far-field line array line array of near-field circular array of near-field far-field circular array correctly estimated the the DOA angle and pitch angle azimuth)

说明：   该程序在matlab-simulink环境下执行，名为classpiddistb2.mdl，(经典PID的扰动测试)，本人发前期发.m格式文件(NNPIDDistub2.m为神经网络动态pid抗绕程序)，本程序为前期程序的比较程序，已发于本人论文，可供借鉴和学习。(The program matlab-simulink environment, implementation, called classpiddistb2.mdl, (classical PID disturbance test), I made pre-made. M format (NNPIDDistub2.m for the neural network dynamic pid anti-around program), this procedure pre- The Comparative procedures have been made in my paper, for reference and learning.)

image fusion using DCT

对川渝电网中太白火电机组进行的simulink仿真，励磁等发电机控制部分采用实际的参数，此仿真为单机无穷大系统。(Simulink simulation of the Sichuan Chongqing power grid in Taibai thermal power unit, excitation generator parameters using the actual control, the simulation for single machine infinite bus system.)

canny算子源代码用于关于边缘检测的毕业论文，可以以此为基础进行修改。(canny operator source code for a thesis on the edge detection can be modified on this basis.)

Particle swarm optimization has been used to solve many optimization problems since it was proposed by Kennedy and Eberhart in 1995 [4]. After that, they published one book [9] and several papers on this topic [5][7][13][15], one of which did a study on its performance using four nonlinear functions adopted as a benchmark by many researchers in this area. In PSO, each particle moves in the search space with a velocity according to its own previous best solution and its group’s previous best solution. The dimension of the search space can be any positive integer.