• Journal of the Korean Society of Industry Convergence
• /
• v.9 no.3
• /
• pp.173-178
• /
• 2006

For the design of multivariable fuzzy control systems decomposition of control rules is a efficent inference method since it alleviates the complexity of the problem. In some systems, however, inference error of the Gupta's decomposition method is inevitable because of its approximate nature. In this paper we define indices of applicability which decides whether the decomposition method can be applied to a multivariable fuzzy system or not.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.18 no.3
• /
• pp.209-224
• /
• 2014

In this paper, the solution of time fractional telegraph equation is obtained by using Adomain decomposition method and compared with various other method to determine the efficiency of Adomain decomposition method. These methods are used to obtain the series solutions. Finally, results are analysed by plotting the solutions for various fractional orders.

• Korean Journal of Mathematics
• /
• v.25 no.3
• /
• pp.323-334
• /
• 2017

In this paper, we propose a combined form for solving nonlinear interval Volterra-Fredholm integral equations of the second kind based on the modifying Laplace Adomian decomposition method. We find the exact solutions of nonlinear interval Volterra-Fredholm integral equations with less computation as compared with standard decomposition method. Finally, an illustrative example has been solved to show the efficiency of the proposed method.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.3
• /
• pp.13-20
• /
• 2013

In this paper, we propose a multi-scale crack detection method. This method uses decomposition, composition, and shape properties. It is based on morphology algorithm, crack features. We use a morphology operator which extracts patterns of crack. It segments cracks and background using opening and closing operations. Morphology based segmentation is better than existing integration methods using subtraction in detecting a crack it has small width. However, morphology methods using only one structure element could detect only fixed width crack. Thus, we use decomposition and composition methods. We use a decimation method for decomposition. After decomposition and morphology operation, we get edge images given by binary values. Our method calculates values of properties such as the number of pixels and the maximum length of the segmented region. We decide whether the segmented region belongs to cracks according to those data. Experimental results show that our proposed multi-scale crack detection method has better results than those of existing detection methods.

• Journal of Information Processing Systems
• /
• v.19 no.3
• /
• pp.275-288
• /
• 2023

Many image edge details are easily lost in the image denoising process, and the smooth image regions are prone to produce jagged. In this paper, we propose a wavelet-based image global k- singular value decomposition variational method to remove image noise. A layer of wavelet decomposition is applied to the noisy image first. Then, the image global k-singular value decomposition (IGK-SVD) method is used to remove the random noise of low-frequency components. Furthermore, a constructed variational denoising method (VDM) removes the random noise in the high-frequency component. Finally, the denoised image is obtained by wavelet reconstruction. The experimental results show that the proposed method's peak signal-to-noise ratio (PSNR) value is higher than other methods, and its structural similarity (SSIM) value is closer to one, indicating that the proposed method can effectively suppress image noise while retaining more image edge details. The denoised image has better denoising effects.

• East Asian mathematical journal
• /
• v.40 no.1
• /
• pp.109-118
• /
• 2024

This paper proposes a numerical method based on domain decomposition to find approximate solutions for one-dimensional convection-diffusion equations with Neumann boundary conditions. First, the equations are transformed into convection-diffusion equations with Dirichlet conditions. Second, the author introduces the Prediction/Correction Domain Decomposition (PCDD) method and estimates errors for the interface prediction scheme, interior scheme, and correction scheme using known error estimations. Finally, the author compares the PCDD algorithm with the fully explicit scheme (FES) and the fully implicit scheme (FIS) using three examples. In comparison to FES and FIS, the proposed PCDD algorithm demonstrates good results.

• International Journal of Automotive Technology
• /
• v.2 no.3
• /
• pp.117-122
• /
• 2001

For a dynamic analysis of a constrained multibody system, it is necessary to have a routine for satisfying kinematic constraints. LU decomposition scheme, which is used to divide coordinates into dependent and independent coordinates, is efficient but has great difficulty near the singular configuration. Other method such as the projection matrix, which is more stable near a singular configuration, takes longer simulation time due to the large amount of calculation for decomposition. In this paper, the row space and the null space of the Jacobian matrix are proposed by using the pseudo-inverse method and the projection matrix. The equations of the motion of a system are replaced with independent acceleration components using the null space of the Jacobian matrix. Also a new hybrid method is proposed, combining the LU decomposition and the projection matrix. The proposed hybrid method has following advantages. (1) The simulation efficiency is preserved by the LU method during the simulation. (2) The accuracy of the solution is also achieved by the projection method near the singular configuration.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.8
• /
• pp.3384-3390
• /
• 2011

This paper describes a domain decomposition method of parallel finite element analysis for elasto-plastic structural problems. As a parallel numeral algorithm for the finite element analysis, the authors have utilized the domain decomposition method combined with an iterative solver such as the conjugate gradient method. Here the domain decomposition method algorithm was applied directly to elasto-plastic problem. The present system was successfully applied to three-dimensional elasto-plastic structural problems.

• The Korean Journal of Ecology
• /
• v.26 no.4
• /
• pp.203-208
• /
• 2003

Losses in the dry weight of leaf litter from six tree species were studied during 16 months on the forest floor in temperate deciduous forest of Mt. Cheonma in the vicinity of Seoul in Korea by using litter bag method. The decomposition rate of each leaf litter varies with each species. After 16 months elapsed, the leaf litter of Acer pseudo-sieboidianum showed the highest decomposition constant (0.82) as Olson´s decomposition constant, while that of Pinus densiflora showed the lowest decomposition constant (0.33). The decomposition constant of Quercus mongolica, Q. serrata, Betula ermani and Carpinus laxiflora showed 0.43, 0.37, 0.66 and 0.75, respectively. The decomposition constant of leaf litter was considered with temperature and precipitation which accumulated daily during each term of litter bag collection. The decomposition constant of leaf litter showed closely positive correlation with daily accumulative temperature and precipitation. The relationships between decomposition constant and the daily accumulative temperature and precipitation at each period of litter bag collection were analyzed through multi-regression analysis. The correlation coefficients as a result of multi-regression analysis in Q. mongolica, Q. serrata, P densiflora, B. ermani, C. laxiflorais and A. pseudo-sieboldianum were 0.83, 0.81, 0.69, 0.77, 0.77 and 0.62, respectively. The precipitation showed higher effect, about 10 times, on the leaf litter decomposition than the daily accumulative temperature.

• Communications of the Korean Mathematical Society
• /
• v.10 no.3
• /
• pp.735-750
• /
• 1995

We present a domain decomposition algorithm for solving large sparse linear systems of equations arising from queuing networks. Such techniques are attractive since the problems in subdomains can be solved independently by parallel processors. Many of the methods proposed so far use some form of the preconditioned conjugate gradient method to deal with one large interface problem between subdomains. However, in this paper, we propose a "nested" domain decomposition method where the subsystems governing the interfaces are small enough so that they are easily solvable by direct methods on machines with many parallel processors. Convergence of the algorithms is also shown.lso shown.