• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.87-90
• /
• 1988

This paper reports a simple posteriori error estimate method for adaptive finite element mesh generation using quadratic shape function especially for the magnetic field problems. The elements of quadratic shape function have more precise solution than those of linear shape function. Therefore, the difference of two solutions gives error quantity. The method uses the magnetic flux density error as a basis for refinement. This estimator is tested on two dimensional problem which has singular points. The estimated error is always under estimated but in same order as exact error, and this method is much simpler and more convenient than other methods. The result shows that the adaptive mesh gives even better rate of convergence in global error than the uniform mesh.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.3
• /
• pp.141-145
• /
• 1988

This paper reports a new and simple posteriori error estimate method for adaptive finite element mesh genration especially for the magnetic field problems. To estimate local errors, we consider the interelement boundary conditions. Elements which violate much the conditions are considered to have great errors. Magnetic flux density errors are considered as a basis for refinement. This estimator is tested on two dimensional proplems with singular points. The estimated errors are always under estimated but in same order as exact errors, and this algorithm is much simpler and more convenient than other methods. The adaptive mesh gives much better rate of convergence in global errors than the uniform mesh.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.3
• /
• pp.63-73
• /
• 1997

For the practical applications of the EIT technology, it is essential to reconstruct sttic images iwth a higher spatial resolution in a reasonalble amount of processing time. Using the conventional EIT static image reconstruction algorithms, however, the processing time increases exponential with poor convergence characteristics as we try to get a higher spatial resolution. In order to overcome this problem, we developed a recursive mesh grouping method based on the Fuzzy-GA like algorithm. Computational simulation using the well-known improve dewton-raphson method with the proposed recursive mesh grouping algorithm shows a promising result that we can significantly reduce the processing time in the reconstruction of EIT static images of a higher spatial resolution.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.310-313
• /
• 2013

BitTorrent는 파일 공유를 위하여 가장 널리 사용되고 있는 P2P (Peer to Peer)프로토콜로서, Mesh-Pull 구조를 채용하여 라이브 스트리밍에 대한 연구가 꾸준히 이루어지고 있다. BitTorrent에서는 Peer Wire Protocol을 사용하여 피어들간에 파일조각들을 교환하게 되는데, 이를 위하여 주기적으로 버퍼맵 정보를 HAVE 메시지를 사용하여 브로드캐스트 하는데, 피어의 수가 증가할수록 이로 인한 시그널링 오버헤드가 크게 증가하는 문제를 갖고 있다. 본 논문에서는 이러한 문제를 극복하고 라이브 스트리밍의 성능을 개선하기 위하여 HAVE 메시지를 선택적으로 전송하는 방법을 제안한다. 실험을 통하여, 제안 방식은 기존의 BitTorrent 기반 Mesh-Pull 구조를 채용하는 라이브 스트리밍 방식과 비교하여 HAVE 메시지의 브로드캐스트로 인한 시그널링 오버헤드를 비약적으로 줄일 수 있음을 보였다.

• Communications of the Korean Mathematical Society
• /
• v.37 no.3
• /
• pp.939-955
• /
• 2022

In this paper, we study a first-order non-linear singularly perturbed Volterra integro-differential equation (SPVIDE). We discretize the problem by a uniform difference scheme on a Bakhvalov-Shishkin mesh. The scheme is constructed by the method of integral identities with exponential basis functions and integral terms are handled with interpolating quadrature rules with remainder terms. An effective quasi-linearization technique is employed for the algorithm. We establish the error estimates and demonstrate that the scheme on Bakhvalov-Shishkin mesh is O(N^-1) uniformly convergent, where N is the mesh parameter. The numerical results on a couple of examples are also provided to confirm the theoretical analysis.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.13 no.2
• /
• pp.11-20
• /
• 1993

Nonlinear inelastic behavior of an HP saddle shell has been examined by a finite element computer program developed on a Cray Y-MP. The mesh convergence is studied using three progressively refined finite element mesh models, $16{\times}16$, $32{\times}32$ and $64{\times}64$, for the elastic and inelastic analyses. It is shown that the $32{\times}32$ mesh model gives a solution that is very close to that given by the $64{\times}64$ mesh model, thus, showing a convergence. The inelastic analysis shows that the shell has a tremendous capacity to redistribute the stresses. At the ultimate, the concrete cracks and the reinforcement yieldings are spread out all over the shell, indicating that the stress distribution in the shell is approaching that given by the classical membrane theory. The present computer program provides a very useful tool for evaluating the nonlinear ultimate behavior of concrete shells during the design process.

• Nuclear Engineering and Technology
• /
• v.46 no.6
• /
• pp.783-796
• /
• 2014

The coarse mesh finite difference (CMFD) method is applied to the discontinuous finite element method based discrete ordinate calculation for source convergence acceleration. The three-dimensional (3-D) DFEM-Sn code FEDONA is developed for general geometry applications as a framework for the CMFD implementation. Detailed methods for applying the CMFD acceleration are established, such as the method to acquire the coarse mesh flux and current by combining unstructured tetrahedron elements to rectangular coarse mesh geometry, and the alternating calculation method to exchange the updated flux information between the CMFD and DFEM-Sn. The partial current based CMFD (p-CMFD) is also implemented for comparison of the acceleration performance. The modified p-CMFD method is proposed to correct the weakness of the original p-CMFD formulation. The performance of CMFD acceleration is examined first for simple two-dimensional multigroup problems to investigate the effect of the problem and coarse mesh sizes. It is shown that smaller coarse meshes are more effective in the CMFD acceleration and the modified p-CMFD has similar effectiveness as the standard CMFD. The effectiveness of CMFD acceleration is then assessed for three-dimensional benchmark problems such as the IAEA (International Atomic Energy Agency) and C5G7MOX problems. It is demonstrated that a sufficiently converged solution is obtained within 7 outer iterations which would require 175 iterations with the normal DFEM-Sn calculations for the IAEA problem. It is claimed that the CMFD accelerated DFEM-Sn method can be effectively used in the practical eigenvalue calculations involving general geometries.

• Convergence Security Journal
• /
• v.11 no.1
• /
• pp.11-18
• /
• 2011

Wireless mesh network technology with transmission speeds similar to wired and wireless technology means to build, compared with wired networks, building a more efficient network to provide convenience and flexibility. The wireless mesh network router nodes in the energy impact of the mobility is less constrained and has fewer features entail. However, the characteristics of various kinds due to network configuration settings and the choice of multiple paths that can occur when the system overhead and there are many details that must be considered. Therefore, according to the characteristics of these network routing technology that is reflected in the design and optimization of the network is worth noting. In this paper, a multi-path setting can be raised in order to respond effectively to the problem of the router node data loss and bandwidth according to traffic conditions and links to elements of the hop count evaluation by using a genetic algorithm as a workaround for dynamic routing the routing metric for wireless mesh network scheme is proposed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.9
• /
• pp.1686-1692
• /
• 2015

This paper proposes a modified genetic algorithm that has the same beamforming performance and a fast convergence speed using general genetic algorithm in order to form a beam for the mobile node in a mesh network. The proposed beamforming genetic algorithm selects a part of chromosome a high fitness value in mating process to obtain fast convergence speed, and rest part of chromosome with longer fitness value in order to avoid local solution. Furthermore, the reference beam pattern with Gaussian shape reduces additional convergence speed. Simulation shows that the convergence speed of proposed algorithm improves 20% compared with that of conventional beamforming genetic algorithm.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.2
• /
• pp.154-158
• /
• 2008

Autonomous business card exchange system using ZigBee with low power and short range was configured In the autonomous business card exchange system characterized as full mesh network in which every node exchanges each information one by one, it is necessary to reduce the time taken for information to be exchanged. In this paper, the novel method where the node ID is exchanged based on CSMA/CA and then the information of each node is broadcast to other nodes according to the ID list based on FIFO. The time required for exchanging information using the proposed method was analyzed and compared with the direct exchange method based on CSMA/CA. The results show that it takes less time in the proposed method than the direct exchange time.