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.
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.
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.
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.
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.
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.
伸展樹，基本數據結構，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.
Novell.Press.Linux.Kernel.Development
linux內核開發的經典書籍之一
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
Beamforming thesis describing Study of a various Beamforming Techniques And Implementation of the Constrained Least Mean Squares (LMS) algorithm for Beamforming
