离散粒子群算法DPSO

说明：  solar mppt control algo with p&o method

说明：  克里金(Kriging)插值法又称空间自协方差最佳插值法，它是以南非矿业工程师D．G．Krige的名字命名的一种最优内插法。克里金法广泛地应用于地下水模拟、土壤制图等领域，是一种很有用的地质统计格网化方法。它首先考虑的是空间属性在空间位置上的变异分布．确定对一个待插点值有影响的距离范围，然后用此范围内的采样点来估计待插点的属性值。该方法在数学上可对所研究的对象提供一种最佳线性无偏估计(某点处的确定值)的方法。(Kriging interpolation, also known as spatial autocorrelation optimal interpolation, is named after d.g.krige, a mining engineer in South Africa. Kriging method is widely used in groundwater simulation, soil mapping and other fields. It is a very useful geostatistical grid method. Firstly, it considers the variation distribution of spatial attributes in spatial position, determines the range of distance that affects the value of a point to be inserted, and then estimates the attribute value of the point to be inserted with the sampling points in this range. This method can provide the best linear unbiased estimation (the determined value at a certain point) for the studied object mathematically.)

电子购物网站Flash产品图片展示fla源文件，下面可显示9个图片名称，响应鼠标做出变化，鼠标悬停于标题上，上面的图片就自动切换为对应的大图片，特别适合购物网站、网店上面做产品图片的展示效果，也可修改成焦点图幻灯片使用。

光孤子传输特性模拟 在光纤通信中，光脉冲信号在光纤中传输的过程中会受到色散、损耗和非线性等作用的影响而不断地发生演化和畸变。脉冲演化的规律遵循非线性薛定谔方程（NLSE）。由于NSLE 在一般情况下无法求得它的解析解，因此通常需采要用数值方法来求解，最终归结于求解归一化的NLSE。本文使用了分步傅里叶方法对归一化NLSE 进行了求解，并模拟了输入为一到三阶双曲正割光脉冲条件下光脉冲传输演变情况。(soliton In optical fiber communications, the optical pulse signals in fiber-optic transmission process will be subject to dispersion, loss and non-linear effects, such as constant evolution and distortion occurs. Pulse to follow the evolution of the law of nonlinear Schrö dinger equation (NLSE). Because NSLE under normal circumstances can not achieve its analytical solution, it normally takes mining use numerical methods to solve, and ultimately attributed to solving normalized NLSE. This article uses the step-by-step Fourier method and normalized NLSE was solved, and analog input for the first-order,second-order and third-order hyperbolic secant optical pulses under the conditions of the evolution of optical pulse transmission.)

说明：  在传统的蚁群算法上实现了改进，排序蚁群算法实现路劲规划(The traditional ant colony algorithm is improved, and the sorting ant colony algorithm is used to realize the road stiffness planning)

在采用vs2010开发程序，添加该工具包构成免安装系统(Using the VS2010 development program, the toolkit is added to form an installation free system)

UWB信道的仿真程序，是一个比较经典和难得的程序！-UWB channel simulation program, is a more classic and rare procedure!

游戏代码包含两部分，常规的C/S模式(C代表客户端，S代表服务端) 下载代码后先启动服务器，服务器正常启动后，你会在控制台看到相关的日志(这里注意，服务器是没有做界面管理的)，接着启动客户端(可以启动多个客户端)，连接服务器后点击菜单栏联网、对战、匹配等操作(The game code consists of two parts, the conventional C/S mode (C represents the client, S represents the server) After downloading the code, start the server first. After the server starts normally, you will see the relevant logs in the console (note that the server does not do interface management), then start the client (can start multiple clients), connect the server and click on the menu bar to connect, fight, match and other operations.)

约瑟夫问题是一个经典的问题，我们不妨将这个经典问题进行扩展，变成一个双向的约瑟夫问题。 已知n个人（不妨分别以编号1，2，3，…，n 代表 ）围坐在一张圆桌周围，首先从编号为 k 的人从1开始顺时针报数，1, 2, 3, ...，记下顺时针数到 m 的那个人，同时从编号为 k 的人开始逆时针报数，1, 2, 3, ...，数到 m 后，两个人同时出列。然后从出列的下一个人又从 1 开始继续进行双向报数，数到m的那两个人同时出列，…；。依此重复下去，直到圆桌周围的人全部出列。直到圆桌周围只剩一个人为止。  　　如果双向报数报到 m 时落在同一个人身上，那本次出列的只有一个人。 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

说明：  在笛卡尔空间中或者关节空间中的轨迹规划简单例程，输出速度加速度曲线。(Simple routines for trajectory planning in Cartesian space or joint space to output velocity and acceleration curves.)