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í)代電子小智
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ù)據(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í)間： 2017-05-07
上傳用戶：JIUSHICHEN
Novell.Press.Linux.Kernel.Development linux內(nèi)核開(kāi)發(fā)的經(jīng)典書籍之一 The Linux kernel is one of the most interesting yet least understood open-source projects. It is also a basis for developing new kernel code. That is why Sams is excited to bring you the latest Linux kernel development information from a Novell insider in the second edition of Linux Kernel Development. This authoritative, practical guide will help you better understand the Linux kernel through updated coverage of all the major subsystems, new features associated with Linux 2.6 kernel and insider information on not-yet-released developments. You ll be able to take an in-depth look at Linux kernel from both a theoretical and an applied perspective as you cover a wide range of topics, including algorithms, system call interface, paging strategies and kernel synchronization. Get the top information right from the source in Linux Kernel Development
標(biāo)簽： Linux Development interes Novell
上傳時(shí)間： 2017-06-06
上傳用戶：songyue1991
/*請(qǐng)分別定義圖形類Shape（抽象基類），繼承類矩形類Rectangle、正方形類Square、 圓形類Circle；它們具有的方法是計(jì)算周長(zhǎng)和面積。在另一個(gè)類的main函數(shù)中分別創(chuàng)建矩形、 正方形和圓形對(duì)象，設(shè)置所需的屬性值，打印其周長(zhǎng)和面積。*/
上傳時(shí)間： 2014-01-16
上傳用戶：lili123
Beamforming thesis describing Study of a various Beamforming Techniques And Implementation of the Constrained Least Mean Squares (LMS) algorithm for Beamforming
標(biāo)簽： Beamforming Implementation describing Techniques
上傳時(shí)間： 2013-12-25
上傳用戶：wuyuying
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
