资源列表
像元二分法计算植被覆盖度
- 使用像元二分法计算植被覆盖度。首先，基于掩模后的NDVI影像，统计5%和95%的像元值，带入像元二分法模型，进而计算植被覆盖度(Vegetation coverage was calculated by pixel dichotomy. Firstly, based on the masked NDVI images, 5% and 95% of the pixel values are counted, and then the pixel dichotomy model is introdu
tr069 java源码
- 实现了简单的TR069功能，可以作为TR069功能的参考(Simple TR069 function is realized, which can be used as a reference for TR069 function.)
SRF32.dll
- integrazione SRF32 CON SOFTWARE DI TERZE PARTI PER GESTIRE RFID IN VISUAL C++ E CON ALTRE PAROLE CHE NON SO COME OCCUPARE STO FORM
新建文件夹
- 利用复杂网络理论对主动配电网进行建模、故障定位技术研究与故障恢复的论文(Papers on Modeling, Fault Location and Fault Recovery of Active Distribution Network Based on Complex Network Theory)
查看更多图片代码
- jQuery点击商品查看更多图片代码城商品详情页面，支持触屏滑动切换效果代码。(JQuery clicks on merchandise to view more picture code City merchandise details page, which supports touch screen sliding switching effect code.)
神经网络
- 用matlab编程进行神经网络算法的运用。内部含有SVM及SVM的改进，PSO算法，BP算法等等。(Matlab programming for the use of neural network algorithm. Internal SVM and SVM improvement, PSO algorithm, BP algorithm and so on.)
gbym_v2014
- 娱乐娱乐娱乐，让你的表白拥有不一样的浪漫。(.hand{cursor:pointer;} .say{margin-left:5px;} .space{margin-right:150px;})
mpu6050
- 单片机采集mpu6050 数据没通过串口上传pc，pc上用MATLAB进行数据分析，卡尔曼滤波，融合算法，曲线实时显示(The MCU collects mpu6050 data without uploading the PC through the serial port, using MATLAB for data analysis, Kalman filtering, fusion algorithm, curve real-time display)
dayu_yuyuepay
- 自建预约主题、自定义预约表单模型，想到就能做到；自定义可预约日期、自定义预约时间段、时间段自定义预约人数限制(Build your own reservation topic, customize the reservation form model, and you can do it if you think of it; customize the appointment date, time period, and number limit)
酷客-Coidea970开发板用户手册(Linux) V2.00.pdf
- 一份关于nuc970 开发使用的资料，需要的可以下载(this is discribed the way to use nuc970 to do something!)
四输入四输出ELM
- 多输入多输出的极限学习机，被证明是可以使用的(Extreme Learning Machine with Multiple Input and Multiple Output has been proved to be usable)
gui遗传算法
- 实现了遗传算法的gui。 可实现图形化指定障碍物位置，然后用遗传算法实现最短路径规划。(GUI of genetic algorithm. It can specify the location of obstacles graphically, and then use genetic algorithm to realize the shortest path planning.)