• The Pure and Applied Mathematics
• /
• v.10 no.2
• /
• pp.103-118
• /
• 2003

We estimate the stable rank of twisted crossed products of $C^{*}-algebras$ by topological Abelian groups. As an application we estimate the stable rank of twisted crossed products of $C^{*}-algebras$ by solvable Lie groups. In particular, we obtain the stable rank estimate of twisted group $C^{*}-algebras$ of solvable Lie groups by the (reduced) dimension and (generalized) rank of groups.

• Communications for Statistical Applications and Methods
• /
• v.9 no.1
• /
• pp.101-113
• /
• 2002

In this paper we introduce a new score generating (unction for the rank regression in the linear regression model. The score function compares the $\gamma$'th and s\`th power of the tail probabilities of the underlying probability distribution. We show that the rank estimate asymptotically converges to a multivariate normal. further we derive the asymptotic Pitman relative efficiencies and the most efficient values of $\gamma$ and s under the symmetric distribution such as uniform, normal, cauchy and double exponential distributions and the asymmetric distribution such as exponential and lognormal distributions respectively.

• Kyungpook Mathematical Journal
• /
• v.47 no.2
• /
• pp.203-219
• /
• 2007

We estimate the stable rank and connected stable rank of group $C^*$-algebra of certain disconnected solvable Lie groups such as semi-direct products of connected solvable Lie groups by the integers.

• Kyungpook Mathematical Journal
• /
• v.48 no.2
• /
• pp.223-232
• /
• 2008

We estimate the real rank of CCR C*-algebras under some assumptions. A applications we determine the real rank of the reduced group C*-algebras of non-compac connected, semi-simple and reductive Lie groups and that of the group C*-algebras of connected nilpotent Lie groups.

• Communications of the Korean Mathematical Society
• /
• v.17 no.3
• /
• pp.475-485
• /
• 2002

We estimate the stable rank, connected stable rank and general stable rank of the multiplier algebras of $C^{＊}$-algebras under some conditions and prove that the ranks of them are infinite. Moreover, we show that for any $\sigma$-unital subhomogeneous $C^{＊}$-algebra, its stable rank is equal to that of its multiplier algebra.

• The Pure and Applied Mathematics
• /
• v.17 no.4
• /
• pp.333-340
• /
• 2010

We estimate the real rank of a composition series of closed ideals of a $C^*$-algebra such that its subquotients have continuous trace, which is equivalent to that the $C^*$-algebra is of type I.

• Communications for Statistical Applications and Methods
• /
• v.24 no.6
• /
• pp.673-683
• /
• 2017

The least absolute shrinkage and selection operator (LASSO) has been a popular regression estimator with simultaneous variable selection. However, LASSO does not have the oracle property and its robust version is needed in the case of heavy-tailed errors or serious outliers. We propose a robust penalized regression estimator which provide a simultaneous variable selection and estimator. It is based on the rank regression and the non-convex penalty function, the smoothly clipped absolute deviation (SCAD) function which has the oracle property. The proposed method combines the robustness of the rank regression and the oracle property of the SCAD penalty. We develop an efficient algorithm to compute the proposed estimator that includes a SCAD estimate based on the local linear approximation and the tuning parameter of the penalty function. Our estimate can be obtained by the least absolute deviation method. We used an optimal tuning parameter based on the Bayesian information criterion and the cross validation method. Numerical simulation shows that the proposed estimator is robust and effective to analyze contaminated data.

• Journal of Korea Multimedia Society
• /
• v.12 no.1
• /
• pp.26-30
• /
• 2009

We propose an adaptive Recursive Least Rank(RLR) L-filter which uses an L-estimator in order statistics and is based on rank estimate in robust statistics. The proposed RLR L-filter is a non-linear adaptive filter using non-linear adaptive algorithm and adapts itself to optimal filter in the sense of least dispersion measure of errors with non-homogeneous step size. Therefore the filter may be suitable for applications when the transmission channel is nonlinear channels such as Gaussian noise or impulsive noise, or when the signal is non-stationary such as image signal.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12A
• /
• pp.1296-1302
• /
• 2007

In this paper, we propose joint estimation methods of carrier offset and channel estimation for MB-OFDM system with low complexity. The proposed methods estimate the channel by using low-rank LMMSE channel estimation which reduces the system complexity by applying the optimal number of rank to evaluate the frequency offset and additionally using the simple algorithm using the auto-correlation property of the estimated channel. We simulate the proposed algorithms under the IEEE 802.15 TG3a UWB channel model.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.23 no.1
• /
• pp.66-71
• /
• 2018

We propose an online parameter estimation method for surface-mounted permanent-magnet synchronous motor (SPMSM) using an affine projection algorithm (APA). The proposed method estimates parameters with two APAs based on the discrete-time model equation of SPMSM during motor operation. The first APA is designed to estimate inductance, and the second APA is designed to estimate resistance and flux linkage. However, in case when the d-axis current is controlled to 0A, the second APA cannot estimate resistance and flux linkage simultaneously because the matrix rank in APA becomes deficient. To overcome this problem, we temporarily inject a negative reference current input to the d-axis control loop, and the matrix in the APA then becomes full rank, which enables the simultaneous estimation of resistance and flux linkage. The proposed method is verified by PSIM simulation and an actual experiment, and the results reveal that SPMSM parameters can be estimated online during motor operation.