• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.4
• /
• pp.826-832
• /
• 2007

A recurrent neural network has been frequently used in equalizing the channel for fast communication systems. The existing techniques, however, have mainly dealt with time-invariant chamois. The modern environments of communication systems such as mobile ones have the time-varying feature due to fading. In this paper, powerful decision feedback - recurrent neural network is used as channel equalizer for nonlinear and time-varying system, and two kinds of algorithms, such as extended Kalman filter (EKF) and sigma-point Kalman filter (SPKF), are proposed; EKF is for fast convergence and good tracing function, and SPKF for overcoming the problems which can be developed during the process of first linearization for nonlinear system EKF.

• ETRI Journal
• /
• v.30 no.6
• /
• pp.774-782
• /
• 2008

An operational orbit determination (OD) and prediction system for the geostationary Communication, Ocean, and Meteorological Satellite (COMS) mission requires accurate satellite positioning knowledge to accomplish image navigation registration on the ground. Ranging and tracking data from a single ground station is used for COMS OD in normal operation. However, the orbital longitude of the COMS is so close to that of satellite tracking sites that geometric singularity affects observability. A method to solve the azimuth bias of a single station in singularity is to periodically apply an estimated azimuth bias using the ranging and tracking data of two stations. Velocity increments of a wheel off-loading maneuver which is performed twice a day are fixed by planned values without considering maneuver efficiency during OD. Using only single-station data with the correction of the azimuth bias, OD can achieve three-sigma position accuracy on the order of 1.5 km root-sum-square.

• Journal of the Korean Physical Society
• /
• v.73 no.9
• /
• pp.1230-1239
• /
• 2018

We derive a factorization theorem for the jet mass distribution with a given $p^J_T$ for the inclusive production, where $p^J_T$ is a large jet transverse momentum. Considering the small jet radius limit ($R{\ll}1$), we factorize the scattering cross section into a partonic cross section, the fragmentation function to a jet, and the jet mass distribution function. The decoupled jet mass distributions for quark and gluon jets are well-normalized and scale invariant, and they can be extracted from the ratio of two scattering cross sections such as $d{\sigma}/(dp^J_TdM^2_J)$ and $d{\sigma}/dp^J_T $. When $M_J{\sim}p^J_TR$, the perturbative series expansion for the jet mass distributions works well. As the jet mass becomes small, large logarithms of $M_J/(p^J_TR)$ appear, and they can be systematically resummed through a more refined factorization theorem for the jet mass distribution.

• Journal of Sensor Science and Technology
• /
• v.18 no.4
• /
• pp.301-306
• /
• 2009

This paper describes the design and fabrication of 16$\times$16 microbolometer infrared focal plane arrays based on iMEMS technology. Amorphous silicon was used for infrared-sensitive material, and it showed the resistance of 18 Mohm and the temperature coefficient of resistivity of -2.4 %. The fabricated sensors exhibited responsivity of 78 kV/W and thermal time constant of 8.0 msec at a bias voltage of 0.5 V. The array performances had satisfactory uniformity less than 5 % within one-sigma. Also, 1/f noise of pixel was measured and the noise factor of $6\times10^{-11}$ was extracted. Finally, we obtained detectivity of $1.27\times10^9cmHz^{0.5}/W$ and noise equivalent temperature difference of 200 mK at a frame rate of 30 Hz.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.55-60
• /
• 2014

In this paper, we will obtain Marcinkiewicz's type limit laws for fuzzy random sets as follows : Let {$X_n{\mid}n{\geq}1$} be a sequence of independent identically distributed fuzzy random sets and $E{\parallel}X_i{\parallel}^r_{{\rho_p}}$ < ${\infty}$ with $1{\leq}r{\leq}2$. Then the following are equivalent: $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ a.s. in the metric ${\rho}_p$ if and only if $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ in probability in the metric ${\rho}_p$ if and only if $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ in $L_1$ if and only if $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ in $L_r$ where $S_n={\Sigma}^n_{i=1}\;X_i$.

• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.457-466
• /
• 2004

Let{$X_{ni}$\mid$\;1\;{\leq}\;i\;{\leq}\;k_n,\;n\;{\geq}\;1$} be an array of rowwise negatively associated random variables such that $P$\mid$X_{ni}$\mid$\;>\;x)\;=\;O(1)P($\mid$X$\mid$\;>\;x)$ for all $x\;{\geq}\;0,\;and\; \{k_n\}\;and\;\{r_n\}$ be two sequences such that $r_n\;{\geq}\;b_1n^r,\;k_n\;{\leq}\;b_2n^k$ for some $b_1,\;b_2,\;r,\;k\;>\;0$. Then it is shown that $\frac{1}{r_n}\;max_1$\mid${\Sigma_{i=1}}^j\;X_{ni}$\mid$\;{\rightarrow}\;0$ completely convergence and the strong convergence for weighted sums of N A arrays is also considered.

• Communications of the Korean Mathematical Society
• /
• v.13 no.1
• /
• pp.195-209
• /
• 1998

In this paper we present a new iteration method for solving optimization problems governed by partial differential equations. We generalize the existing methods such as simple gradient methods and pseudo-time methods to get an efficient iteration method. Numerical tests show that the convergence of the new iteration method is much faster than those of the pseudo-time methods especially when the parameter $\sigma$ in the cost functional is small.

• Journal of the Korean Statistical Society
• /
• v.28 no.2
• /
• pp.151-165
• /
• 1999

This paper considers the trimmed least squares estimator of the autoregression parameter in the unstable AR(1) model: X\ulcorner=ØX\ulcorner+$\varepsilon$\ulcorner, where $\varepsilon$\ulcorner are iid random variables with mean 0 and variance $\sigma$$^2$> 0, and Ø is the real number with │Ø│=1. The trimmed least squares estimator for Ø is defined in analogy of that of Welsh(1987). The limiting distribution of the trimmed least squares estimator is derived under certain regularity conditions.

• Journal for History of Mathematics
• /
• v.16 no.1
• /
• pp.63-72
• /
• 2003

This paper is a sequel to [11]. We introduce $\sigma$-coherent frames, stably countably approximating frames and strongly Lindelof frames, and show that a stably countably approximating frame is a strongly Lindelof frame. We also show that a complete chain in a Lindelof frame if and only if it is a strongly Lindelof frame by using the concept of strong convergence of filters. Finally, using the concepts of super compact frames and filter compact frames, we introduce an example of a strongly Lindelof frame which is not a stably countably approximating frame.

• Journal of the Korean Statistical Society
• /
• v.34 no.4
• /
• pp.263-272
• /
• 2005

Let {$X_n,\;n{\ge}1$} be a sequence of negatively associated random variables which are dominated randomly by another random variable. We discuss the limit properties of weighted sums ${\Sigma}^n_{i=1}a_{ni}X_i$ under some appropriate conditions, where {$a_{ni},\;1{\le}\;i\;{\le}\;n,\;n\;{\ge}\;1$} is an array of constants. As corollary, the results of Bai and Cheng (2000) and Sung (2001) are extended from the i.i.d. case to not necessarily identically distributed negatively associated setting. The corresponding results of Chow and Lai (1973) also are extended.