2 resultados para hidden semi-Markov model

em CaltechTHESIS


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Within a wind farm, multiple turbine wakes can interact and have a substantial effect on the overall power production. This makes an understanding of the wake recovery process critically important to optimizing wind farm efficiency. Vertical-axis wind turbines (VAWTs) exhibit features that are amenable to dramatically improving this efficiency. However, the physics of the flow around VAWTs is not well understood, especially as it pertains to wake interactions, and it is the goal of this thesis to partially fill this void. This objective is approached from two broadly different perspectives: a low-order view of wind farm aerodynamics, and a detailed experimental analysis of the VAWT wake.

One of the contributions of this thesis is the development of a semi-empirical model of wind farm aerodynamics, known as the LRB model, that is able to predict turbine array configurations to leading order accuracy. Another contribution is the characterization of the VAWT wake as a function of turbine solidity. It was found that three distinct regions of flow exist in the VAWT wake: (1) the near wake, where periodic blade shedding of vorticity dominates; (2) a transition region, where growth of a shear-layer instability occurs; (3) the far wake, where bluff-body oscillations dominate. The wake transition can be predicted using a new parameter, the dynamic solidity, which establishes a quantitative connection between the wake of a VAWT and that of a circular cylinder. The results provide insight into the mechanism of the VAWT wake recovery and the potential means to control it.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

The brain is perhaps the most complex system to have ever been subjected to rigorous scientific investigation. The scale is staggering: over 10^11 neurons, each making an average of 10^3 synapses, with computation occurring on scales ranging from a single dendritic spine, to an entire cortical area. Slowly, we are beginning to acquire experimental tools that can gather the massive amounts of data needed to characterize this system. However, to understand and interpret these data will also require substantial strides in inferential and statistical techniques. This dissertation attempts to meet this need, extending and applying the modern tools of latent variable modeling to problems in neural data analysis.

It is divided into two parts. The first begins with an exposition of the general techniques of latent variable modeling. A new, extremely general, optimization algorithm is proposed - called Relaxation Expectation Maximization (REM) - that may be used to learn the optimal parameter values of arbitrary latent variable models. This algorithm appears to alleviate the common problem of convergence to local, sub-optimal, likelihood maxima. REM leads to a natural framework for model size selection; in combination with standard model selection techniques the quality of fits may be further improved, while the appropriate model size is automatically and efficiently determined. Next, a new latent variable model, the mixture of sparse hidden Markov models, is introduced, and approximate inference and learning algorithms are derived for it. This model is applied in the second part of the thesis.

The second part brings the technology of part I to bear on two important problems in experimental neuroscience. The first is known as spike sorting; this is the problem of separating the spikes from different neurons embedded within an extracellular recording. The dissertation offers the first thorough statistical analysis of this problem, which then yields the first powerful probabilistic solution. The second problem addressed is that of characterizing the distribution of spike trains recorded from the same neuron under identical experimental conditions. A latent variable model is proposed. Inference and learning in this model leads to new principled algorithms for smoothing and clustering of spike data.