• Journal of Korea Society of Industrial Information Systems
• /
• 제11권5호
• /
• pp.163-169
• /
• 2006

In order to use parallel computers in specific applications, algorithms need to be developed and mapped onto parallel computer architectures. Main memory access for shared memory system or global communication in message passing system deteriorate the computation speed. In this paper, it is found that the m-step generalization of the block Lanczos method enhances parallel properties by forming in simultaneous search direction vector blocks. QR factorization, which lowers the speed on parallel computers, is not necessary in the m-step block Lanczos method. The m-step method has the minimized synchronization points, which resulted in the minimized global communications and main memory access compared to the standard methods.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
• /
• pp.13-16
• /
• 2005

It would be desirable to have methods for specific problems, which have low communication costs compared to the computation costs, and in specific applications, algorithms need to be developed and mapped onto parallel computer architectures. Main memory access for shared memory system or global communication in message passing system deteriorate the computation speed. In this paper, it is found that the m-step generalization of the block Lanczos method enhances parallel properties by forming m simultaneous search direction vector blocks. QR factorization, which lowers the speed on parallel computers, is not necessary in the m-step block Lanczos method. The m-step method has the minimized synchronization points, which resulted in the minimized global communications compared to the standard methods.

• Journal of the Korean Association of Geographic Information Studies
• /
• 제20권1호
• /
• pp.137-151
• /
• 2017

The space between urban buildings becomes a waterway during rain events and requires a boundary condition in numerical calculations on grids to separate overland storm flows from building areas. Minimization of the building data distortion as a boundary condition is a necessary step for generating accurate calculation results. A building generalization is used to reduce the distortion of building shapes and areas during a raster conversion. The objective of this study was to provide the appropriate threshold value for building generalization and grid size in a numerical calculation. The impact of building generation on the connectivity of urban storm waterways were analyzed for a general residential area. The building generalization threshold value and the grid size for numerical analysis were selected as the independent variables for analysis, and the number and area of sinks were used as the dependent variables. The values for the building generalization threshold and grid size were taken as the optimal values to maximize the building area and minimize the sink area. With a 3 m generalization threshold, sets of $5{\times}5m$ to $10{\times}10m$ caused 5% less building area and 94.4% more sink area compared to the original values. Two sites representing general residential area types 2 and 3 were used to verify building generalization thresholds for improving the connectivity of storm waterways. It is clear that the recommended values are effective for reducing the distortion in both building and sink areas.

• Honam Mathematical Journal
• /
• 제32권3호
• /
• pp.481-491
• /
• 2010

In this paper, we investigate a generalization of the Adams-Bashforth method by using the Taylor's series. In case of m-step method, the local truncation error can be expressed in terms of m - 1 coefficients. With an appropriate choice of coefficients, the proposed method has produced much smaller error than the original Adams-Bashforth method. As an application of the generalized Adams-Bashforth method, the accuracy performance is demonstrated in the satellite orbit prediction problem. This implies that the generalized Adams-Bashforth method is applied to the orbit prediction of a low-altitude satellite. This numerical example shows that the prediction of the satellite trajectories is improved one order of magnitude.

• Smart Structures and Systems
• /
• 제29권1호
• /
• pp.153-166
• /
• 2022

Identifying fine cracks in steel bridge facilities is a challenging task of structural health monitoring (SHM). This study proposed an end-to-end crack image segmentation framework based on a one-step Convolutional Neural Network (CNN) for pixel-level object recognition with high accuracy. To particularly address the challenges arising from small object detection in complex background, efforts were made in loss function selection aiming at sample imbalance and module modification in order to improve the generalization ability on complicated images. Specifically, loss functions were compared among alternatives including the Binary Cross Entropy (BCE), Focal, Tversky and Dice loss, with the last three specialized for biased sample distribution. Structural modifications with dilated convolution, Spatial Pyramid Pooling (SPP) and Feature Pyramid Network (FPN) were also performed to form a new backbone termed CrackDet. Models of various loss functions and feature extraction modules were trained on crack images and tested on full-scale images collected on steel box girders. The CNN model incorporated the classic U-Net as its backbone, and Dice loss as its loss function achieved the highest mean Intersection-over-Union (mIoU) of 0.7571 on full-scale pictures. In contrast, the best performance on cropped crack images was achieved by integrating CrackDet with Dice loss at a mIoU of 0.7670.

• Communications of the Korean Mathematical Society
• /
• 제31권1호
• /
• pp.147-161
• /
• 2016

In this paper, we study the strong convergence and stability of a new two step random iterative scheme with errors for accretive Lipschitzian mapping in real Banach spaces. The new iterative scheme is more acceptable because of much better convergence rate and less restrictions on parameters as compared to random Ishikawa iterative scheme with errors. We support our analytic proofs by providing numerical examples. Applications of random iterative schemes with errors to variational inequality are also given. Our results improve and establish random generalization of results obtained by Chang [4], Zhang [31] and many others.