STED z

基于AGV小车运行时的路线仿真软件，在不相撞情况下考虑投入数量(Based on AGV car running route simulation software, consider the number of inputs in the case of no collision)

线性自适应预测滤波算法，用于扩频通信中的窄带干扰信号的抑制，对搞窄带干扰抑制的朋友会有所帮助！-linear adaptive filter algorithm forecast for the spread spectrum communication signals in the narrow band interference suppression to engage narrowband interference suppression friends will help!

高频实验Multisim仿真：一、混频器（原理图、信号输入输出波形与频率）二、调幅波的解调（原理图及全载波调幅信号的解调）三、惰性失真及底部切削失真(Multisim simulation of high frequency experiment: 1. Mixer (schematic diagram, signal input and output waveform and frequency) 2. Demodulation of amplitude modulation wave (schematic diagram and demodulation of full-carrier amplitude modulation signal) 3. Inert distortion and bottom cutting distortion)

一个关于多重纹理映射的源代码，这是nehe教程的一个经典例子！-a multi-texture mapping of the source code, which is one of the guidebook nehe classic example!

说明：  粒子群优化极限学习机的参数。最佳粒子位置即为最优输入权值和隐层阈值。自己跑过的，放数据匹配一下就可以用(PSO optimizes the parameters of extreme learning machine. The optimal particle position is the optimal input weight and hidden layer threshold. Run their own, put data matching can be used)

解决金山词霸与卡巴斯基冲突的，只要替换了词霸下面的XdictGrb.dll就可以了-Solution PowerWord conflict with Kaspersky, so long as the replacement of the PowerWord XdictGrb.dll the following can be a

最近进步的无线通信和电子设备已启用低成本传感器网络的发展。传感器网络可以用于各种应用领域 (例如，卫生、 军事、 家)。对于不同的应用程序的区域，有不同的研究人员目前正在解决的技术问题。传感器网络当前艺术状态是 在这篇文章，解决办法根据其相关的协议堆栈层各节讨论了中捕获。这篇文章还指出，开放研究问题，并打算引发新的兴趣和在这一领域的事态发展。

这算法实现了插入排序，快速排序，shell，堆排序，还有它们的性能比较！-insertion sort, quick sort, shell, heap sort, and compare their performance!

本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.

资源描述6603仿670网站模块！是.NET源码哦！6603仿670网站模块！是.NET源码哦！6603仿670网站模块！是.NET源码哦！6603仿670网站模块！是.NET源码哦！6603仿670网站模块！是.NET源码哦！