CH13

Antenna Beam with angle direction in Matlab

The model used for creating the reference voltage is shown in Fig. 4. First, photovoltaic output current (Ipv) and output voltage (Vpv) are passed through a first order low pass filter with a magnitude of G = 1 and a time constant of T = 0.01 seconds in order to filter out the high frequency components or harmonics from these signals as shown in Fig. 5 and Fig. 6. The filtered current and voltage signals (Ipv_F and Vpv_F) are then fed into the MPPT control block that uses the Incremental Conductance Tracking Algorithm. An algorithm that is based on the fact the slope of the PV array power curve shown in Fig. 7 is zero at the Maximum Power Point (MPP), positive on the left of the MPP, and negative on the right. The MPP can thus be tracked by comparing the instantaneous conductance (I/V) to the incremental conductance (∆ I/∆ V) [11] as in (1):

专家系统方面的文章，主要介绍故障诊断，欢迎大家下载(Expert system diagnostic aspects of the article, you can, you can have a look, welcome to download, thank you for sharing.)

fast fourier transform (FFT) code in MatLab

本文对视频运动目标跟踪算法进行研究。在视频运动目标的提取中，介绍常用的图像差分算法、光流算法和主动轮廓模型算法。(In this paper, the video moving target tracking algorithm study. Video moving target in the extraction, the introduction of images commonly used differential algorithm, optical flow algorithm and active contour model algorithm.)

Matlab source codes for a book: Quarteroni Saleri 2006 Scientific Computing with MATLAB and Octave

matlab code for leach protocol

说明：  该算例是利用蒙特卡罗算法来实现对pi的估值，压缩包中有运行结果图及程序说明，程序是用matlab代码实现(The study is the use of Monte Carlo algorithm to achieve the valuation of pi, compressed package in the results map and description of the procedures, the program code with matlab)

基于TOA测量的Newton-Raphson定位算法仿真 基于TOA测量的Gauss-Newton定位算法仿真 基于TOA测量的Steepest Descent定位仿真(TOA-based localization algorithm simulation based on TOA measurements Gauss-Newton measured TOA measurements based on the Newton-Raphson localization algorithm simulation Steepest Descent positioning simulation)

一个小而有效的程序来执行的K -近邻搜索算法，此算法利用JIT 理论加速循环，比向量化有效解决了大量数据的精度问题。甚至比kd-tree效果要佳(A small and effective procedures to implement the K- nearest neighbor search algorithm, this algorithm uses JIT acceleration cycle theory, than to solve a lot of data to quantify the accuracy of the problem. Even more than the kd-tree effect has to be good)