regiongrowing

STBC-ofdm程序源文件，可以供初学者学习交流使用(STBC-ofdm program source files, can be used for beginners to learn to share their)

分析粒子群算法在求解组合优化问题中的运行原理并与遗传算法和 改进的粒子群算法仿真比较． 结果表明 混合优化算法在收敛速度和精度上均有明显的提高(Ｔｈｅ 　 ｍｅｃｈａｎｉｓｍ 　 ｏｆ 　 ｐ ａｒｔｉｃｌｅ 　 ｓｗａｒｍ 　 ｏ ｐ ｔｉｍｉｚａｔｉｏｎ ＰＳＯ ｉｎ 　 ｓｏｌｖｉｎ ｇ 　 ｃｏｍｂｉｎａｔｏｒｉａｌ 　 ｏ ｐ ｔｉｍｉｚａｔｉｏｎ ｐ ｒｏｂｌｅｍｓ 　 ｗａｓ 　 ａｎａｌ ｙ ｚｅｄ．Ｓｉｍｕｌａｔｉｏｎｓ 　 ｃｏｍ ｐ ａｒｉｓｏｎ ｗｉｔｈ 　 ＧＡ 　 ａｎｄ 　 ｉｍ ｐ ｒｏｖｅｄ 　 ＰＳＯ 　 ｓｈｏｗｓ 　 ｔｈａｔ 　 ｔｈｅ 　 ｈ ｙ ｂｒｉｄ 　 ｏ ｐ ｔｉｍｉｚａｔｉｏｎ 　 ａｌ ｇ ｏｒｉｔｈｍ 　 ｈａｓ 　 ｏｂｖｉｏｕｓ 　 ｉｍ ｐ ｒｏｖｅｍｅｎｔｓ 　 ｉｎ ｃｏｎｖｅｒ ｇ ｅｎｃｅ 　 ｓ ｐ ｅｅｄ 　 ａｎｄ 　 ａｃｃｕｒａｃ ｙ)

该代码是粒子滤波实现弱小目标的检测前跟踪。(The code is particle filter to implementation the weak target track before detection.)

CN0150-GBR-C.GTL Top Copper CN0150-GBR-C.GL2 Inner Layer 1 CN0150-GBR-C.GL3 Inner Layer 2 CN0150-GBR-C.GBL Bottom Copper CN0150-GBR-C.GTO Top Overlay CN0150-GBR-C.GBO Bottom Overlay CN0150-GBR-C.GTS Top Soldermask CN0150-GBR-C.GBS Bottom Soldermask CN0150-GBR-C.GTP Top Solderpaste CN0150-GBR-C.GBP Bottom Solderpaste CN0150-GBR-C.GFD Fabrication Drawing CN0150-GBR-C.GAT Top Assembly CN0150-GBR-C.GDD Drill Drawing CN0150-GBR-C.GML Milling CN0150-GBR-C.TXT NC Drill File (2.4 Format) CN0150-NET-C.IPC IPC-D-356 Netlist

采用遗传算法进行多目标优化问题的求解，具体为两个目标优化问题(genetic algorithm solve multi-objective problem)

说明：  对网上现有的产生m序列的线性反馈移位寄存器代码进行了修改，可以通过输入本原多项式向量，生成相应m序列(The existing linear feedback shift register code for m-sequence generation on the Internet is modified. The corresponding m-sequence can be generated by inputting the primitive polynomial vector)

说明：  平面上排布不同旋转角的纳米天线产生不同几何相位调制用生成涡旋光(The vortex is generated by the different geometric phase modulation of the nanometer antenna with different rotation angles arranged on the plane)

鲁棒性好，性能优越，是一种双隐层反向传播神经网络，部分实现了追踪测速迭代松弛算法，包括 MUSIC算法，ESPRIT算法 ROOT-MUSIC算法，BP神经网络用于函数拟合与模式识别，包含位置式PID算法、积分分离式PID。

“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。 (" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)

经验模态分解，依据数据自身的时间尺度特征来进行信号分解，给出本征函数。(Empirical mode decomposition, based on the data itself characteristic time scale for signal decomposition, given the intrinsic function.)