PV_modle

Matlab 编程所用 很好的一本书,如果你想学好Matlab的编程开发，这本书是一个不错的帮手，下载来看看吧。(This book is very useful for the people who want to learn Matlab well.)

说明：  ex2_1 利用Z变换求系统输出 ex2_2 求DFT ex2_3 求序列的圆周移位 ex2_4 求序列的圆周卷积 ex2_5 简单的DFT实例 (ex2_1 the use of Z transform ex2_2 demand for system output DFTex2_3 seeking ex2_4 shift sequence for the circumference of the circular convolution sequence ex2_5 simple example DFT)

robot control method

读取激光雷达点云数据的头文件数据块，将点云数据的基本信息记录在相应的变量中。(Read lidar point cloud data header file data block, the basic information of the point cloud data recorded in the corresponding variable.)

Matlab实现的带通滤波器(Matlab the band-pass filter)

该程序用于读取GTOPO30. GTOPO30 是一个全球的数字高程模型，它覆盖西经180度至东经180度，南纬90至北纬90度的所有区域。它的分辨率为30秒（即0.00833333度），生成 一个21,600（行）×43,200（列）的DEM。其高程值范围在-407至8752米。在数字高程模型中，海洋地区被指定为-9999 。 低地沿海一带，海拔至少有1米。(GTOPO30 is a digital elevation model for the world, developed by USGS. It has a 30-arc second resolution (approximately 1 km) and is split into 33 tiles stored in the USGS DEM file format.)

一些MATLAB实例,大家可以看一看,都是一些简单的框架,大家可以扩充(some examples, we can see are some simple framework, we can expand)

2文件包括：calcnbins，计算出的“理想”的若干箱使用直方图，用三种可能的方法。（freedman-diaconis ，史葛和斯特奇斯 的方法。）histx是一个包装中的直方图函数历史，使用calcnbins选择若干箱如果不提供。(2 file include: calcnbins, calculate the " ideal" box using the histogram, with three possible ways. The method (freedman-diaconis ' , Scott and Sturges' .) Histx is a packaging the histogram function history, use calcnbins select certain box if you do not provide.)

六种基于CDMA的多用户检测的matlab代码(six m-files about Multi-User Detection based on CDMA system)

⑴.设计游乐平面图，所含景点不少于10个。以图中顶点表示游乐园各景点，存放景点名称、代号、等信息；以边表示路径，存放路径长度等相关信息。 ⑵．为游人提供图中任意景点的问路查询，及查询任意两个景点之间的一条最短的简单路径。 (⑴. Designed to play plan, contained less than 10 scenic spots. To graph vertices, said the amusement park attractions, attractions store names, codes, and other information to edges, said path, the path length of storage of information. ⑵. To provide the figure for the visitors ask for directions any spots, queries, and query any two attractions of a shortest simple path.)