• Journal of Multimedia Information System
• /
• v.8 no.3
• /
• pp.191-196
• /
• 2021

Computational thinking refers to the process and method of solving everyday problems using computers. When teaching a computational thinking class for computer majors and non-majors at university, the easiest example to deliver the concept of computational thinking is sorting. Sorting is the concept of arranging given data in order. In this work, we have implemented four visualized sorting algorithms that anyone can easily use. In particular, it helps to understand the difference between the algorithms by showing the number of comparisons and exchanges between elements, which are the criteria for evaluating the performance of the sorting algorithm in real time. It was confirmed that the practice of using the sorting visualization app developed in this research contributed to the improvement of students' understanding of computational thinking.

• Korean Journal of Computational Design and Engineering
• /
• v.15 no.2
• /
• pp.106-114
• /
• 2010

The swept volume, the region of a moving object, is applied in many fields such as valid paths for motions of tools, visualization in robot paths and interference tests for parts assembling or disjointing. The shape of a swept volume depends on an generators computed with normal vectors of an object and velocity vectors of a motion. Although free-from surfaces are widely used to represent geometric models in CAD, computing the generators for a free-form object is a formidable task. Previous approaches exploit the closed form expressions of generators but limited to planer or quadric faces. In this paper, we propose the algorithm to compute swept volumes generated by free-form objects in screw motions. For the algorithm a tracing method is applied to the computation of generators. It considers curvatures of surfaces of an object to increase the computational accuracy. We implemented our algorithm in the CATIA V.5 environment to test the validity of our algorithm and to generate examples.

• Korean Journal of Computational Design and Engineering
• /
• v.21 no.4
• /
• pp.443-452
• /
• 2016

This paper proposes a method for expensive black box optimization using radial basis functions (RBFs). The proposed algorithm is a computational strategy that uses a RBF model approximating the expensive black box function to predict an optimum. First, a RBF-based approximation technique is introduced and a sampling plan for estimation of the black box function is described. Then the proposed algorithm is explained, which presents the pseudo-codes for implementation and the detailed description of each step performed in the optimization process. In addition, numerical experiments will be given to analyze the performance of the proposed algorithm, by investigating computation accuracy, number of function evaluations, and convergence history. Finally, geometric distance problem as application example will be also presented for showing the algorithm applicability to different engineering problems.

• IE interfaces
• /
• v.17 no.spc
• /
• pp.97-102
• /
• 2004

AGV flowpath layout design is one of the most important steps for efficient AGV systems design. Since it was formulated by Gaskins & Tanchoco (1987), a unidirectional AGV flowpath layout design problem has been tackled by many researchers. However, the solution methods were traded off between the solution quality and the computational time. In this paper, a tabu search technique is applied to obtain a good solution for a relatively large problem in reasonable computational time. Specifically, fast construction algorithm for feasible initial solutions, long-term memory structure and neighbor solutions generation are adapted to the problem characteristics and embedded in the tabu search algorithm. Also, sets of computational experiments show that the proposed tabu search algorithm outperforms to the Ko and Egbelu's algorithm (2003).

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.2
• /
• pp.303-311
• /
• 1996

The Self Healing Ring (SHR) is one of the most Intriguing schemes which provide survivability for telecommunication networks. To design a cost effective SONET ring it is necessary to consider load balancing problems by which the link capacity is determined. The load balancing problem in SONET ring when demand splitting is not allowed is considered in this paper. An efficient algorithm is presented which provides the best solution starting from various Initial solutions. The initial solution is obtained by routing ell demands such that no demands pass through an are In the ring. The proposed algorithm iteratively improves the Initial solution by examining each demand and selecting the maximum load are in its path. The demand whose maximum arc load is biggest is selected to be routed in opposite direction. Computational results show that the proposed algorithm is excellent both in the solution quality and in the computational time requirement. The average error bound of the algorithm is 0.11% of the optimum and compared to dual-ascent approach which has good computational results than other heuristics.

• Journal of Computing Science and Engineering
• /
• v.6 no.4
• /
• pp.310-319
• /
• 2012

Next generation wireless receivers demand low computational complexity algorithms with high computing power in order to perform fast signal detections and error estimations. Several signal detection and estimation algorithms have been proposed for next generation wireless receivers which are primarily designed to provide reasonable performance in terms of signal to noise ratio (SNR) and bit error rate (BER). However, none of them have been chosen for direct implementation as they offer high computational complexity with relatively lower computing power. This paper presents a low-complexity power-efficient algorithm that improves the computing power and provides relatively faster signal detection for next generation wireless multiuser receivers. Measurement results of the proposed algorithm are provided and the overall system performance is indicated by BER and the computational complexity. Finally, in order to verify the low-complexity of the proposed algorithm we also present a formal mathematical proof.

• 한국전산유체공학회:학술대회논문집
• /
• 1997.10a
• /
• pp.86-91
• /
• 1997

This paper describes analysis of complex flow around Car-like body using Chimera grid technique. As a computational algorithm, Pullboat and Chaussee's Diagonal algorithm is selected to reduce computational time. Introducing hole points flag to this Diagonal algorithm, an algorithm for Chimera grid is generated easily. This study solves 3-D unsteady incompressible Navier-Stokes equations on a non-orthogonal curvilinear coordinate system using second-order accurate schemes for the time derivatives, and third/second-order scheme for the spatial derivatives. The Marker-and-Cell concept is applied to efficiently solve continuity equation. The fourth-order artificial damping is added to the continuity equation for numerical stability, It has concluded that the results of present study properly agree with physical flow phenomena.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2007.04a
• /
• pp.327-332
• /
• 2007

An engineering design problem involving Multi-Disciplinary Analysis(MDA) generally requires a large amounts of CPU time for the entire design process, and therefore Multiple Processing System (MPS) are essential to reduce the completion time. However, when applying conventional parallel processing techniques, all of the CAE S/W required for the MDA should be installed on all the servers making up NIPS because of characteristic of MDA and it would be a great expense in CAE S/W licenses. To solve this problem, we propose a Weight-based Multiqueue Load Balancing algorithm for a heterogeneous MPS where performance of servers and CAE S/W installed on each server are different of each other. To validate the performance, a computational experiments comparing the First Come First Serve algorithm and our proposed algorithm was accomplished.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.4
• /
• pp.217-224
• /
• 2009

Most divide-and-conquer implementations for Delaunay triangulation utilize quad-edge or winged-edge data structure since triangles are frequently deleted and created during the merge process. How-ever, the proposed divide-and-conquer algorithm utilizes the array based data structure that is much simpler than the quad-edge data structure and requires less memory allocation. The proposed algorithm has two important features. Firstly, the information of space partitioning is represented as a permutation vector sequence in a vertices array, thus no additional data is required for the space partitioning. The permutation vector represents adaptively divided regions in two dimensions. The two-dimensional partitioning of the space is more efficient than one-dimensional partitioning in the merge process. Secondly, there is no deletion of edge in merge process and thus no bookkeeping of complex intermediate state for topology change is necessary. The algorithm is described in a compact manner with the proposed data structures and operators so that it can be easily implemented with computational efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.148-154
• /
• 2010

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen 802.11n for wireless local access network(WLAN) standard are required a large number of computation due to large size of coded block and iteration. Therefore, we presented three kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algorithm. Secondly, we have apply early stop algorithm. This method is reduced number of unnecessary iteration. Third, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and early stop algorithm is reduced more than one iteration and computational complexity of early detected method is about 30% offs in case of check node update, 94% offs in case of check node update compared to conventional scheme.