No description available.

According to the model free approach assumption four protein dynamic related parameters, the slow and fast local motion of the NH vector, the generalized order parameter, and the 15N shielding anisotropy can be estimated at each residue by the spectral density functions at the resonant frequencies of N (omega_N) and H (omega_H). In this work, we study the linear and nonlinear estimations of the aforementioned parameters of the two proteins C12A-p8^MTCPI and Pilin from strain K122-4. The principal components of the four parameters of C12A-p8^MTCPI are used to cluster the residues. The results show that the principle components provide useful information about the secondary structure of the protein. Finally, we propose a practical method to examine the model free assumption by characterizing the distribution of the transverse rate R_2 in multifield.

Robustness of a system has been defined in various ways and a lot of work has been done to model the system robustness , but quantifying or measuring robustness has always been very difficult. In this research we consider a simple system of a linear estimator and then attempt to model the system performance and robustness in a geometrical manner which admits an analysis using the differential geometric concepts of slope and curvature. We try to compare two different types of curvatures, namely the curvature along the maximum slope of a surface and the square-root of the absolute value of sectional curvature of a surface, and observe the values to see if both of them can alternately be used in the process of understanding or measuring system robustness. In this process we have worked on two different examples and taken readings for many points to find if there is any consistency in the two curvatures.

No description available.

Linear estimation is a fundamental branch of signal processing that deals with estimating the values of parameters from a corrupted measured data. Throughout the years, several optimization criteria have been used to achieve this task. The most astonishing attempt among theses is the linear least-squares. Although this criterion enjoyed a wide popularity in many areas due to its attractive properties, it appeared to suffer from some shortcomings. Alternative optimization criteria, as a result, have been proposed. These new criteria allowed, in one way or another, the incorporation of further prior information to the desired problem. Among theses alternative criteria is the regularized least-squares (RLS). In this thesis, we propose two new algorithms to find the regularization parameter for linear least-squares problems. In the constrained perturbation regularization algorithm (COPRA) for random matrices and COPRA for linear discrete ill-posed problems, an artificial perturbation matrix with a bounded norm is forced into the model matrix. This perturbation is introduced to enhance the singular value structure of the matrix. As a result, the new modified model is expected to provide a better stabilize substantial solution when used to estimate the original signal through minimizing the worst-case residual error function. Unlike many other regularization algorithms that go in search of minimizing the estimated data error, the two new proposed algorithms are developed mainly to select the artifcial perturbation bound and the regularization parameter in a way that approximately minimizes the mean-squared error (MSE) between the original signal and its estimate under various conditions. The first proposed COPRA method is developed mainly to estimate the regularization parameter when the measurement matrix is complex Gaussian, with centered unit variance (standard), and independent and identically distributed (i.i.d.) entries. Furthermore, the second proposed COPRA method deals with discrete ill-posed problems when the singular values of the linear transformation matrix are decaying very fast to a significantly small value. For the both proposed algorithms, the regularization parameter is obtained as a solution of a non-linear characteristic equation. We provide a details study for the general properties of these functions and address the existence and uniqueness of the root. To demonstrate the performance of the derivations, the first proposed COPRA method is applied to estimate different signals with various characteristics, while the second proposed COPRA method is applied to a large set of different real-world discrete ill-posed problems. Simulation results demonstrate that the two proposed methods outperform a set of benchmark regularization algorithms in most cases. In addition, the algorithms are also shown to have the lowest run time.

Progressive Type-II censoring was introduced by Cohen (1963) and has since been the topic of much research. The question stands whether it is sensible to use this sampling plan by design, instead of regular Type-II right censoring. We introduce an asymptotic progressive censoring model, and find optimal censoring schemes for location-scale families. Our optimality criterion is the determinant of the 2x2 covariance matrix of the asymptotic best linear unbiased estimators. We present an explicit expression for this criterion, and conditions for its boundedness. By means of numerical optimization, we determine optimal censoring schemes for the extreme value, the Weibull and the normal distributions. In many situations, it is shown that these progressive schemes significantly improve upon regular Type-II right censoring.

In this paper an overview is given on the application of directional basis functions, known under the name Curvelets/Contourlets, to various aspects of seismic processing and imaging. Key concepts in the approach are the use of (i) that localize in both domains (e.g. space and angle); (ii) non-linear estimation, which corresponds to localized muting on the coefficients, possibly supplemented by constrained optimization (iii) invariance of the basis functions under the imaging operators. We will discuss applications that include multiple and ground roll removal; sparseness-constrained least-squares migration and the computation of 4-D difference cubes.

In a large number of applications arising in various fields of study, time series are approximated using linear MMSE estimates. Such approximations include finite order moving average and autoregressive approximations as well as the causal Wiener filter. In this dissertation, we study two topics related to the estimation of wide sense stationary (WSS) time series using linear MMSE estimates. In the first part of this dissertation, we study the asymptotic behaviour of autoregressive (AR) and moving average (MA) approximations. Our objective is to investigate how faithfully such approximations replicate the original sequence, as the model order as well as the number of samples approach infinity. We consider two aspects: convergence of spectral density of MA and AR approximations when the covariances are known and when they are estimated. Under certain mild conditions on the spectral density and the covariance sequence, it is shown that the spectral densities of both approximations converge in L2 as the order of approximation increases. It is also shown that the spectral density of AR approximations converges at the origin under the same conditions. Under additional regularity assumptions, we show that similar results hold for approximations from empirical covariance estimates. In the second part of this dissertation, we address the problem of detecting interdependence relations within a group of time series. Ideally, in order to infer the complete interdependence structure of a complex system, dynamic behaviour of all the processes involved should be considered simultaneously. However, for large systems, use of such a method may be infeasible and computationally intensive, and pairwise estimation techniques may be used to obtain sub-optimal results. Here, we investigate the problem of determining Granger-causality in an interdependent group of jointly WSS time series by using pairwise causal Wiener filters. Analytical results are presented, along with simulations that compare the performance of a method based on finite impulse response Wiener filters to another using directed information, a tool widely used in literature. The problem is studied in the context of cyclostationary processes as well. Finally, a new technique is proposed that allows the determination of causal connections under certain sparsity conditions.

Progressive Type-II censoring was introduced by Cohen (1963) and has since been the topic of much research. The question stands whether it is sensible to use this sampling plan by design, instead of regular Type-II right censoring. We introduce an asymptotic progressive censoring model, and find optimal censoring schemes for location-scale families. Our optimality criterion is the determinant of the 2x2 covariance matrix of the asymptotic best linear unbiased estimators. We present an explicit expression for this criterion, and conditions for its boundedness. By means of numerical optimization, we determine optimal censoring schemes for the extreme value, the Weibull and the normal distributions. In many situations, it is shown that these progressive schemes significantly improve upon regular Type-II right censoring.