project(i)

了一些资料，都没有说这个仿真平台是什么，是matlab还是直接在VC++的编译环境编程？还是有专门的仿真环境呢？ 3、如果用实物验证的话，我觉得有两种方式：一是用摄像头来采集整个地图信息，智能车的位置也有摄像头来反馈；二是，整个地图保存在内存中，小车根据传感器信息自我定位，然后和保存的地图比较。(You can download the current points to 1, the source download get points one day, you can download up to 20 times. [View your upload log] [continue to upload source to increase points] You have recently downloaded the 240 source code, you should contribute something new other friends 【Source】 it? Joined the group】 【QQ, blowing boasting a chat. You can also create a QQ group you join the union,)

粒子滤波的经典例程，MATLAB环境。好好理解其思想，对于其它环境下粒子滤波程序的编写也是很有好处的！(paticle filter!quite classical codes!)

最优化实验，用的是MATLAB，题目不是很难主要是练习用，学会对实际问题进行数学抽象。 掌握常用的最优化算法。 运用相关数学软件设计程序进行求解。 (optimization experiments, using the MATLAB, the main topic is not difficult to practice with. learn to practical issues abstract mathematics. Master of the most commonly used optimization algorithm. Related to the use of mathematical software for the design process.)

matlab power electronics program

张量工具箱，提供张量分解等功能，附上安装说明文件，经测试很好用。(tensor decomposition and install readme)

说明：  泰勒阵列综合算法，能够计算出点源激励以及最终的方向图等等(Taylor array synthesis algorithm)

gold序列的产生。随机产生gold序列。(gold sequence generation. Randomly generated sequence of gold.)

分数阶小波，文章加源代码，好用，也很全面，文章是pdf格式的。(Fractional Wavelet, articles plus source code, easy to use, very comprehensive article in pdf format.)

GMF（Graphical Modeling Framework）是Eclipse的一个开源项目，它在结合了EMF和GEF的 基础上，为基于模型的图形化编辑器的开发提供了一个功能强大的框架，开发人员可以采用建 模的方式很容易的生成高质量的代码框架。(GMF (Graphical Modeling Framework) Eclipse is an open source project, it combines the foundation on EMF and GEF, provides a powerful graphical editor framework for model-based development, developers can adopt the modeling approach easily generate high-quality code framework.)

k-means clustering is a method of vector quantization, originally signal processing, that is popular for cluster analysis in data mining. k-means clustering aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean, serving as a prototype of the cluster. This results in a partitioning of the data space into Voronoi cells.