各類聚類算法程序包，包含各種經(jīng)典的聚類算法，例如：k-mean聚類等
上傳時(shí)間： 2017-02-06
上傳用戶：liglechongchong
observable distribution grid are investigated. A distribution grid is observable if the state of the grid can be fully determined. For the simulations, the modified 34-bus IEEE test feeder is used. The measurements needed for the state estimation are generated by the ladder iterative technique. Two methods for the state estimation are analyzed: Weighted Least Squares and Extended Kalman Filter. Both estimators try to find the most probable state based on the available measurements. The result is that the Kalman filter mostly needs less iterations and calculation time. The disadvantage of the Kalman filter is that it needs some foreknowlegde about the state.
標(biāo)簽： distribution observable grid investigated
上傳時(shí)間： 2014-12-08
上傳用戶：ls530720646
This is GPS in matlab calculatePseudoranges finds relative pseudoranges for all satellites listed in CHANNELLIST at the specified millisecond of the processed signal. The pseudoranges contain unknown receiver clock offset. It can be found by the least squares position search procedure.
標(biāo)簽： calculatePseudoranges pseudoranges satellites relative
上傳時(shí)間： 2017-03-09
上傳用戶：時(shí)代電子小智
The Kalman filter is a set of mathematical equations that provides an efficient computational [recursive] means to estimate the state of a process, in a way that minimizes the mean of the squared error. The filter is very powerful in several aspects: it supports estimations of past, present, and even future states, and it can do so even when the precise nature of the modeled system is unknown.
標(biāo)簽： computational mathematical equations efficient
上傳時(shí)間： 2014-06-02
上傳用戶：yd19890720
In computer vision, sets of data acquired by sampling the same scene or object at different times, or from different perspectives, will be in different coordinate systems. Image registration is the process of transforming the different sets of data into one coordinate system. Registration is necessary in order to be able to compare or integrate the data obtained from different measurements. Image registration is the process of transforming the different sets of data into one coordinate system. To be precise it involves finding transformations that relate spatial information conveyed in one image to that in another or in physical space. Image registration is performed on a series of at least two images, where one of these images is the reference image to which all the others will be registered. The other images are referred to as target images.
標(biāo)簽： different computer acquired sampling
上傳時(shí)間： 2013-12-28
上傳用戶：來(lái)茴
In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the shortest path. Given this metric, you have find out the shortest path between a given pair of vertices in the input graph. The output should be the number of edges on the path, the cost of the shortest path, and the path itself. Input is the adjacency matrix and the two vertices.
標(biāo)簽： optimizing different the shortest
上傳時(shí)間： 2014-10-25
上傳用戶：1159797854
Basic function to locate and measure the positive peaks in a noisy data sets. Detects peaks by looking for downward zero-crossings in the smoothed third derivative that exceed SlopeThreshold and peak amplitudes that exceed AmpThreshold. Determines, position, height, and approximate width of each peak by least-squares curve-fitting the log of top part of the peak with a parabola.
標(biāo)簽： peaks function positive Detects
上傳時(shí)間： 2017-04-26
上傳用戶：彭玖華
he basic idea of the method of bisection is to start with an initial interval, [a0,b0], that is chosen so that f(a0)f(b0) < 0. (This guarantees that there is at least one root of the function f(x) within the initial interval.) We then iteratively bisect the interval, generating a sequence of intervals [ak,bk] that is guaranteed to converge to a solution to f(x) = 0.
標(biāo)簽： bisection interval initial method
上傳時(shí)間： 2017-04-29
上傳用戶：zsjinju
伸展樹(shù)，基本數(shù)據(jù)結(jié)構(gòu)，The tree is drawn in such a way that both of the edges down from a node are the same length. This length is the minimum such that the two subtrees are separated by at least two blanks.
標(biāo)簽： 樹(shù)
上傳時(shí)間： 2017-05-07
上傳用戶：JIUSHICHEN
使用INTEL矢量統(tǒng)計(jì)類庫(kù)的程序,包括以下功能: Raw and central moments up to 4th order Kurtosis and Skewness Variation Coefficient Quantiles and Order Statistics Minimum and Maximum Variance-Covariance/Correlation matrix Pooled/Group Variance-Covariance/Correlation Matrix and Mean Partial Variance-Covariance/Correlation matrix Robust Estimators for Variance-Covariance Matrix and Mean in presence of outliers
標(biāo)簽： 61623 and Kurtosis central
上傳時(shí)間： 2017-05-14
上傳用戶：yzy6007
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
