• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.18 no.4
• /
• pp.305-316
• /
• 2014

The Hodge-Helmholtz decomposition splits a vector field into the unique sum of a divergence-free vector field (solenoidal part) and a gradient field (irrotational part). In a bounded domain, a boundary condition needs to be supplied to the decomposition. The decomposition with the non-penetration boundary condition is equivalent to solving the Poisson equation with the Neumann boundary condition. The Gibou-Min method is an application of the Poisson solver by Purvis and Burkhalter to the decomposition. Using the $L^2$-orthogonality between the error vector and the consistency, the convergence for approximating the divergence-free vector field was recently proved to be $O(h^{1.5})$ with step size h. In this work, we analyze the convergence of the irrotattional in the decomposition. To the end, we introduce a discrete version of the Poincare inequality, which leads to a proof of the O(h) convergence for the scalar variable of the gradient field in a domain with general intersection property.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.45 no.1
• /
• pp.131-138
• /
• 1996

In this paper, we consider an iterative learning control system(ILCS) consisting of an iterative learning controller, a feedback controller and a controlled plant in the frequency domain. At first, we review the convergence of ILCS. And we give some design guidelines of the ILCS using a nominal model of the plant. Then we present the structured and the unstructured uncertainty bound which guarantees the convergence of the designed iterative learning controller. In particular, we analyze the relationship between the convergence and the magnitude and phase uncertainties. In order to show the usefulness of the proposed analysis and design guidelines, we present some simulation examples. (author). 13 refs., 5 figs.

• 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.

• Journal of information and communication convergence engineering
• /
• v.21 no.2
• /
• pp.139-144
• /
• 2023

Engineers prefer deep neural networks (DNNs) for solving computer vision problems. However, DNNs pose two major problems. First, neural networks require large amounts of well-labeled data for training. Second, the covariate shift problem is common in computer vision problems. Domain adaptation has been proposed to mitigate this problem. Recent work on adversarial-learning-based unsupervised domain adaptation (UDA) has explained transferability and enabled the model to learn robust features. Despite this advantage, current methods do not guarantee the distinguishability of the latent space unless they consider class-aware information of the target domain. Furthermore, source and target examples alone cannot efficiently extract domain-invariant features from the encoded spaces. To alleviate the problems of existing UDA methods, we propose the mixup regularization in adversarial discriminative domain adaptation (ADDA) method. We validated the effectiveness and generality of the proposed method by performing experiments under three adaptation scenarios: MNIST to USPS, SVHN to MNIST, and MNIST to MNIST-M.

• Smart Structures and Systems
• /
• v.8 no.4
• /
• pp.343-365
• /
• 2011

Structural system identification (SSI) is an inverse problem of difficult solution. Currently, difficulties lie in the development of algorithms which can cater to large size problems. In this paper, a parameter estimation technique based on evolutionary strategy is presented to overcome some of the difficulties encountered in using the traditional system identification methods in terms of convergence. In this paper, a non-traditional form of system identification technique employing evolutionary algorithms is proposed. In order to improve the convergence characteristics, it is proposed to employ immune algorithms which are proved to be built with superior diversification mechanism than the conventional evolutionary algorithms and are being used for several practical complex optimisation problems. In order to reduce the number of design variables, domain decomposition methods are used, where the identification process of the entire structure is carried out in multiple stages rather than in single step. The domain decomposition based methods also help in limiting the number of sensors to be employed during dynamic testing of the structure to be identified, as the process of system identification is carried out in multiple stages. A fifteen storey framed structure, truss bridge and 40 m tall microwave tower are considered as a numerical examples to demonstrate the effectiveness of the domain decomposition based structural system identification technique using immune algorithm.

• Bulletin of the Korean Mathematical Society
• /
• v.36 no.2
• /
• pp.363-370
• /
• 1999

A new and simple estimate using a convex function for convergence factors of Schwarz algorithms orthogonal spline collocation method is presented. The estimated convergence factors in this context depend only on a way to split a given domain.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.12
• /
• pp.6176-6186
• /
• 2012

Many research and case study for BIM have mainly been focused on architecture domain. However, it is insufficient to civil engineering domain. Although BIM will be applied to civil engineering domain. because national BIM standard and delivery system of BIM is not ready, these demands are increasing. First of all, this paper analyzed the current status of the IFC international standards and BIM of civil engineering domain. Second of all, we established the roadmap for BIM development for civil engineering domain. And this paper studied on the BIM application of road construction for a step by step development of civil engineering. Finally, we conduct case study about road project by applying to construction information classification.

• Journal of computational fluids engineering
• /
• v.3 no.1
• /
• pp.22-29
• /
• 1998

Parallel implementation is conducted for a SIMPLER finite volume model. The present parallelism is based on domain decomposition and explicit message passing using MPI and SHMEM. Two parallel solvers to tridiagonal matrix equation are employed. The implementation is verified on the Cray T3E system for a benchmark problem of natural convection in a sidewall-heated cavity. The test results illustrate good scalability of the present parallel models. Performance issues are elaborated in view of convergence as well as conventional parallel overheads and single processor performance. The effectiveness of a localized matrix solution algorithm is demonstrated.

• Journal of information and communication convergence engineering
• /
• v.15 no.1
• /
• pp.37-42
• /
• 2017

The constrained application protocol (CoAP) can be used for remotely controlling various sensor devices in Internet of Things (IoT) networks. In CoAP, to support the handover of a mobile sensor device, service discovery and message transmission needs to be repeated, although doing so would increase the handover delay significantly. To address this limitation of CoAP, a centralized CoAP scheme has been proposed. However, it tends to result in performance degradation for an inter-domain handover case. In this letter, we propose a distributed CoAP handover scheme to support the inter-domain handover. In the proposed scheme, a distributed mobility agent (DMA) is used for managing the location of mobile sensors in a domain and performing handover control operations with its neighboring DMAs in a distributed manner. A performance comparison reveals that the proposed scheme offers a performance improvement of up to 29.5% in terms of the handover delay.

• Journal of Korea Multimedia Society
• /
• v.21 no.1
• /
• pp.61-68
• /
• 2018

In this paper, we present an effective encryption algorithm for 3D printing models in the frequency domain of discrete cosine transform to prevent illegal copying, access in the secured storage and transmission. Facet data of 3D printing model is extracted to construct a three by three matrix that is then transformed to the frequency domain of discrete cosine transform. The proposed algorithm is based on encrypting the DC coefficients of matrixes of facets in the frequency domain of discrete cosine transform in order to generate the encrypted 3D printing model. Experimental results verified that the proposed algorithm is very effective for 3D printing models. The entire 3D printing model is altered after the encryption process. The proposed algorithm is provide a better method and more security than previous methods.