• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.927-931
• /
• 2003

In this paper, a new Recursive Least-Squares(RLS) algorithm based on matrix pseudo-inverses is presented. The aim is to use the proposed new RLS algorithm for not only the over-determined but also the under-determined estimation problem. Compared with previous results, e.g., Jie Zhou et al., the derivation of the proposed recursive form is much easier, and the recursion form is also much simpler. Furthermore, it is shown by simulations that the proposed RLS algorithm is more efficient and numerically stable than the existing algorithms.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.7
• /
• pp.33-41
• /
• 1994

A single channel adaptive noise canceling (ANC) technique with a recursive time delay estimator (RTDE) is presented for removing effects of additive noise on the speech signal. While the conventional method makes a reference signal for the adaptive filter using the pitch estimated on a frame basis from the input speech, the proposed method makes the reference signal using the delay estimated recursively on a sample-by-sample basis. As the RTDEs, the recursion formulae of autocorrelation function (ACF) and average magnitude difference function (AMDF) are derived. The normalized least mean square (NLMS) and recursive least square (RLS) algorithms are applied for adaptation of filter coefficients. Experimental results with noisy speech demonstrate that the proposed method improves the perceived speech quality as well as the signal-to-noise ratio and cepstral distance when compared with the conventional method.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.9
• /
• pp.389-401
• /
• 2002

To complement the conventional fusion methodologies of state fusion and measurement fusion, a time-propagated measurement fusion methodology is proposed. Various aspects of common process noise are investigated regarding information preservation. Based on time-propagated measurement fusion methodology, four compression filters are derived. The derived compression filters are efficient in asynchronous sensor fusion and fault detection since they maintain correct statistical information. A new batch Kalman recursion is proposed to show the optimality under the time-propagated measurement fusion methodology. A simple simulation result evaluates estimation efficiency and characteristic.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.39-42
• /
• 2000

Extensible Markup Language(XML) is fast emerging as the dominant standard for representing data in the World Wide Web. Sophisticated query engines that allow users to effectively tap the data stored in XML documents will be crucial to exploiting the full power of XML. While there has been a great deal of activity recently proposing new semi-structured data models and query languages for this purpose, this paper explores the more conservative approach of using traditional relational database engines for processing XML documents conforming to Document Type Descriptors(DTDs). In this paper, we describe how to generate relational schemas from XML DTDs. The main issues that must be addressed inc]ode (a) dealing with the complexity of DTD element specifications (b) resolving the conflict between the two-level nature of relational schemas (table and attribute) vs. the arbitrary nesting of XML DTD schemas and (c) dealing with set-valued attributes and recursion. We now propose a set of transformations that can be used to "simplify" any arbitrary DTD without undermining the effectiveness of queries over documents conforming to that DTD.

• Journal for History of Mathematics
• /
• v.22 no.4
• /
• pp.115-128
• /
• 2009

In this paper, we modify the axiom of infinity of von Neumann's axioms modified by Pinter([5]), and then discuss an existence of an unknowable class in the system and a relationship between the unknowable class and the axiom of choice.

• Journal of the Korean Mathematical Society
• /
• v.38 no.4
• /
• pp.807-842
• /
• 2001

This paper summarizes recent development of analytical and algorithmical results for stationary FIFO queues with multiple Markovian arrival streams, where service time distributions are general and they may differ for different arrival streams. While this kind of queues naturally arises in considering queues with a superposition of independent phase-type arrivals, the conventional approach based on the queue length dynamics (i.e., M/G/1 pradigm) is not applicable to this kind of queues. On the contrary, the workload process has a Markovian property, so that it is analytically tractable. This paper first reviews the results for the stationary distributions of the amount of work-in-system, actual waiting time and sojourn time, all of which were obtained in the last six years by the author. Further this paper shows an alternative approach, recently developed by the author, to analyze the joint queue length distribution based on the waiting time distribution. An emphasis is placed on how to construct a numerically feasible recursion to compute the stationary queue length mass function.

• Kyungpook Mathematical Journal
• /
• v.55 no.4
• /
• pp.1053-1067
• /
• 2015

A two-direction multiscaling function ${\phi}$ satisfies a recursion relation that uses scaled and translated versions of both itself and its reverse. This offers a more general and flexible setting than standard one-direction wavelet theory. In this paper, we investigate how to find and normalize point values and derivative values of two-direction multiscaling and multiwavelet functions. Determination of point values is based on the eigenvalue approach. Normalization is based on normalizing conditions for the continuous moments of ${\phi}$. Examples for illustrating the general theory are given.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.98.6-98
• /
• 2001

In the double-talk situation where both the near-end and far-end signal present, the performance of echo cancellation using the conventional LMS algorithm is easily degraded because it freezes the adaptation in this situation. Recently CLMS and ECLMS algorithms were proposed to solve this problem. These algorithms could be used to adapt the filter´s parameters continuously even in the double-talk situation. In this paper, we propose new recursion formulas to calculate the ECLMS algorithm. And we compare and analyze the performances of double-talk echo canceller according to changing the value of channel tracking factors ${\alpha}$, ${\beta}$ and forgetting factor λ. The computer simulation was performed and the results showed that, ...

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2006.04a
• /
• pp.389-394
• /
• 2006

Fully flexible cell preserves Hamiltonian in structure, so the symplectic time integrator is applied to the equations of motion. Primarily, generalized leapfrog time integration (GLF) is applicable, but the equations of motion by GLF have some of implicit formulas. The implicit formulas give rise to a complicate calculation for coding and need an iteration process. In this paper, the time integration formulas are obtained for the fully flexible cell molecular dynamics simulation by using the splitting time integration. It separates flexible cell Hamiltonian into terms corresponding to each of Hamiltonian term, so the simple and completely explicit recursion formula was obtained. The explicit formulas are easy to implementation for coding and may be reduced the integration time because they are not need iteration process. We are going to compare the resulting splitting time integration with the implicit generalized leapfrog time integration.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2192-2195
• /
• 2003

This parer proposes a power-line phase measurement algorithm which is based on the recursive implementation of sliding-DFT. Usage of the single DFT coefficient in the conventional sliding-DFT based power-line phase measurement brings a significant error propagation when implemented in hardware with finite word-length arithmetic operations. The proposed algorithm utilizes all the N-point DFT coefficients in the recursion. Performance degradation caused by the finite word- length implementation of the algorithm is analyzed and verified with computer simulations. The robustness of the proposed phase measurement algorithm against the erroneous implementation is also confirmed by the performance analysis and simulation.