• Journal of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.495-505
• /
• 1996

Let $\Omega$ be a bounded domain in $R^d, d \geq 1$, with smooth boundary $\partial\Omega$, and let $0 < T < \infty$ be given.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.760-765
• /
• 1993

A multivariable learning control is designed in frequency domain. A general to of feedback assisted learning scheme is considered and an inverse model based learning algorithm is derived through convergence analysis in frequency domain. Performance of the proposed control method is evaluated through numerical simulation.

• Electronics and Telecommunications Trends
• /
• v.35 no.3
• /
• pp.85-97
• /
• 2020

In the maritime industry, the convergence of information and communication technology (ICT) occurs in two areas. The first one is the convergence of e-navigation technology to apply ICT to the maritime domain. This was led by EU's initiative and is also being promoted in our country. The other one is the convergence of autonomous ship technology to apply various ICT technologies for commercial purposes. This initiative is being led by maritime industries. In this paper, we describe trends of e-navigation and maritime autonomous surface ship technology convergence. Subsequently, we explain the standardization status of performance and technical standard bodies, international standardization organizations, and related standard-developing organizations to provide the interoperability of these technologies. Finally, we examine ongoing projects in Korea and suggest future directions for their R&D and standardization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.10 no.6
• /
• pp.308-316
• /
• 1985

A new implementation of Block Adaptive filter in frequency domain is presented in this paper. Block digital filtering involves the calculation of a block or finite set of filter out put from a block of input values. A fast convergence algorithm of block adaptive filter is developed using Gordar theory and compared with the performance results of Satio algorithm and BLMS algorithm. Form the result we can be shown that the convergence state of given algorithm is not only faster than BLMS algorithm but also the resulting convergence error is less than the convergence error of Satio algorithm.

• Journal of information and communication convergence engineering
• /
• v.5 no.3
• /
• pp.265-268
• /
• 2007

In previous papers [1] and [2], we proposed two improved methods protecting mobile users from active attacks[3,4] of network providers in mobile communication environment. But they were the case that mobile users were located in only home domain. In [5], we proposed protocol extending the method of [1] in case of roaming from the home domain to the remote domain. The purpose of this paper is to propose new mobile terminated protocol extending the method of [2] and analyze its security.

• Journal of information and communication convergence engineering
• /
• v.8 no.3
• /
• pp.312-316
• /
• 2010

Conformal mapping has been a familiar tool of science and engineering for generations. The methods of numerical mapping are usually classified into those which construct the map from standard domain such as the unit disk onto the 'problem domain', and those which construct the map in the reverse direction. We treat numerical conformal mapping from the unit disk onto the Jordan regions as the problem domain in this paper. The traditional standard methods of this type are based on Theodorsen integral equation. Wegmann's method is well known as a Newton-like efficient one for solving Theodorsen equation. An improved method for convergence by applying low frequency pass filter to the Wegmann's method was proposed. In this paper we propose an effective algorithm for numerical conformal mapping based on the improved method. This algorithm is able to determine the discrete numbers and initial values automatically in accordance with the given region and the required accuracy. This results come from analyzing the shape of given domain as seen in the Fourier Transform.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.240-240
• /
• 2000

This paper presents two algorithms based on the concept of the frequency domain adaptive filter(FDAF). First the frequency domain recursive least squares(FRLS) algorithm with the overlap-save filtering technique is introduced. This minimizes the sum of exponentially weighted square errors in the frequency domain. To eliminate discrepancies between the linear convolution and the circular convolution, the overlap-save method is utilized. Second, the sliding method of data blocks is studied Co overcome processing delays and complexity roads of the FRLS algorithm. The size of the extended data block is twice as long as the filter tap length. It is possible to slide the data block variously by the adjustable hopping index. By selecting the hopping index appropriately, we can take a trade-off between the convergence rate and the computational complexity. When the input signal is highly correlated and the length of the target FIR filter is huge, the FRLS algorithm based on the block processing technique has good performances in the convergence rate and the computational complexity.

• Transactions of Materials Processing
• /
• v.8 no.3
• /
• pp.284-293
• /
• 1999

The rigid-plastic finite element analysis requires a large amount of computation time due to its non-linearity. For economic computation, mismatching refinement, and efficient domain decomposition method with different mesh density for each sub domain, is developed. A modified velocity alternating scheme for the interface treatment is proposed in order to obtain good convergence and accuracy. As a numerical example, the axisymmetric extrusion process is analyzed. The results are discussed for the various velocity update schemes form the viewpoint of convergence and accuracy. The three-dimen-sional extrusion process with rectangular section is analyzed in order to verify the effectiveness of the proposed method. Comparing the results with those of the conventional method of full region analysis, the accuracy and the computational efficiency of the proposed method are then discussed.

• Communications of the Korean Mathematical Society
• /
• v.11 no.2
• /
• pp.495-501
• /
• 1996

There is currently a regain of interest in ADI (Alternating Direction Implicit) method as a preconditioner for iterative Method for solving large sparse linear systems, because of its suitability for parallel computation. However the classical ADI is not applicable to FE(Finite Element) matrices. In this paper wer propose a Block-ADI method, which is applicable to Finite Element metrices. The new approach is a combination of classical ADI method and domain decompositi on. Also, we provide a partial proof of the convergence based on the results from the regular splittings, in case the discretization metrix is symmetric positive definite.

• Journal of Mechanical Science and Technology
• /
• v.14 no.9
• /
• pp.913-919
• /
• 2000

The purpose of this study was to develop a new element removal method for ESO (Evolutionary Structural Optimization), which is one of the topology optimization methods. ESO starts with the maximum allowable design space and the optimal topology emerges by a process of removal of lowly stressed elements. The element removal ratio of ESO is fixed throughout topology optimization at 1 or 2%. BESO (bidirectional ESO) starts with either the least number of elements connecting the loads to the supports, or an initial design domain that fits within the maximum allowable domain, and the optimal topology evolves by adding or subtracting elements. But the convergence rate of BESO is also very slow. In this paper, a new element removal method for ESO was developed for improvement of the convergence rate. Then it was applied to the same problems as those in papers published previously. From the results, it was verified that the convergence rate was significantly improved compared with ESO as well as BESO.