• Journal of Computational Design and Engineering
• /
• v.3 no.4
• /
• pp.295-311
• /
• 2016

This paper addresses to the flowshop scheduling problem with blocking constraints. The objective is to minimize the makespan criterion. We propose a hybrid combinatorial particle swarm optimization algorithm (HCPSO) as a resolution technique for solving this problem. At the initialization, different priority rules are exploited. Experimental study and statistical analysis were performed to select the most adapted one for this problem. Then, the swarm behavior is tested for solving a combinatorial optimization problem such as a sequencing problem under constraints. Finally, an iterated local search algorithm based on probabilistic perturbation is sequentially introduced to the particle swarm optimization algorithm for improving the quality of solution. The computational results show that our approach is able to improve several best known solutions of the literature. In fact, 76 solutions among 120 were improved. Moreover, HCPSO outperforms the compared methods in terms of quality of solutions in short time requirements. Also, the performance of the proposed approach is evaluated according to a real-world industrial problem.

• Bulletin of the Korean Chemical Society
• /
• v.28 no.10
• /
• pp.1705-1708
• /
• 2007

Geometric manipulation of molecules is an essential elementary component in computational modeling programs for molecular structure, stability, dynamics, and design. The computational complexity of transformation of internal coordinates to Cartesian coordinates was discussed before.1 The use of rotation matrices was found to be slightly more efficient than that of quaternion although quaternion operators have been widely advertised for rotational operations, especially in molecular dynamics simulations of liquids where the orientation is a dynamical variable.2 The discussion on computational efficiency is extended here to a more general case in which bond angles and sidechain torsion angles are allowed to vary. The algorithm of Thompson3 is derived again in terms of quaternions as well as rotation matrices, and an algorithm with optimal efficiency is described. The algorithm based on rotation matrices is again found to be slightly more efficient than that based on quaternions.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1999.04a
• /
• pp.50-57
• /
• 1999

Structural analysis of large-scale structures involving large amount of computational load and data storage requires high-performance computing resources. We have previously developed PC-level distributed structural analysis algorithms based on substructuring technique where each personal computer assigned to a slave node has been involved in the computations for single substructures. Recently, it has been proved by the authors that the performance of distributed structural analysis algorithm can be further enhanced by changing substructuring schemes. Therefore a new distributed structural analysis algorithm with one PC to multiple substructures scheme is presented in this paper. The algorithm is implemented on the network of multiple personal computers and applied to structural analysis of two dimensional frame structures.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.20-22
• /
• 2007

The H.264/AVC standard developed by the joint Video Team (JVT) provides better coding efficiency than previous standards. The new emerging H.264/AVC employs variable block size motion estimation using multiple reference frame with 1/4-pel MV(Motion Vector) accuracy. These techniques are a important feature to accomplish higher coding efficiency. However, these techniques are increased overall computational complexity. To overcome this problem, this paper proposes advanced fast mode decision suited for variable block size by classifying inter mode based on Rate Distortion Optimization(RDO) technique. Proposed algorithm is going to use to implement H/W structure for fast mode decision. The experimental results shows that the proposed algorithm provides significant reduction computational complexity without any noticeable coding loss and additional computation. Entire computational complexity is decreased about 30%.

• Journal of Korea Multimedia Society
• /
• v.21 no.1
• /
• pp.18-25
• /
• 2018

In High Efficiency Video Coding (HEVC), integer motion estimation (IME) requires a large amount of computational complexity because HEVC adopts the high flexible and hierarchical coding structures. In order to reduce the computational complexity of IME, this paper proposes the search range reduction algorithm, which takes advantage of motion vectors similarity between different layers. It needs only a few modification for HEVC reference software. Based on the experimental results, the proposed algorithm reduces the processing time of IME by 28.1% on average, whereas its the $Bj{\emptyset}ntegaard$ delta bitrate (BD-BR) increase is 0.15% which is negligible.

• Journal of Computational Design and Engineering
• /
• v.2 no.3
• /
• pp.137-147
• /
• 2015

In this study, a new methodology in predicting a system output has been investigated by applying a data mining technique and a hybrid type II fuzzy system in CNC turning operations. The purpose was to generate a supplemental control function under the dynamic machining environment, where unforeseeable changes may occur frequently. Two different types of membership functions were developed for the fuzzy logic systems and also by combining the two types, a hybrid system was generated. Genetic algorithm was used for fuzzy adaptation in the control system. Fuzzy rules are automatically modified in the process of genetic algorithm training. The computational results showed that the hybrid system with a genetic adaptation generated a far better accuracy. The hybrid fuzzy system with genetic algorithm training demonstrated more effective prediction capability and a strong potential for the implementation into existing control functions.

• Korean Journal of Computational Design and Engineering
• /
• v.7 no.4
• /
• pp.211-218
• /
• 2002

Swept volumes have been used in a wide variety of applications, and the literature contains much discussion of methods for computing the swept volumes in many situations. However, the commercially available CAD systems do not support the operations of generating the swept volumes enough to satisfy a variety of users' needs. In this paper, we present a new, simple and efficient algorithm for computing the swept volume of moving a polyhedron in 3-D region. The screw motion is used to describe the sweep motion of a polyhedron, because of its simplicity and computational advantages. The boundary of a swept volume is the result of combining the envelope surfaces and the partial boundaries at the initial and final position of a polyhedron. Some portions of these boundaries are inside the swept volume. We develop the algorithm to remove these interior portions. Then, to implement our algorithm, it is performed to integrate our program with the commercial CAD software, CATIA.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.2
• /
• pp.457-464
• /
• 2010

The haze removal algorithm using dark channel prior, which was proposed by He et al., is an efficient algorithm and presents impressive results. But its high memory and computational requirements limit its applications. In this paper, we propose a method to improve the memory usage and calculation speed. We notice that the matting process accounts for most calculation time, so we replace the matting process with a fast bilateral filtering scheme. Using the bilateral filter, we can reduce the memory usage, but its computational complexity is still high. To reduce the computational complexity as well, we adapt a hierarchical structure for the bilateral filtering. Experimental results show that the proposed algorithm can remove haze in a picture effectively, while requiring much less computations than the He et al.'s method.

• The Mathematical Education
• /
• v.58 no.2
• /
• pp.319-335
• /
• 2019

In this paper, we examine the effectiveness of calculation according to automation, which is one of Computational Thinking, by coding the conceptual process into Python language, focusing on the concept of divisibility in elementary school textbooks. The educational implications of these considerations are as follows. First, it is possible to make a field of learning that can revise the new mathematical concept through the opportunity to reinterpret the Conceptual Thinking learned in school mathematics from the perspective of Computational Thinking. Second, from the analysis of college students, it can be seen that many students do not have mathematical concepts in terms of efficiency of computation related to the divisibility. This phenomenon is a characteristic of the mathematics curriculum that emphasizes concepts. Therefore, it is necessary to study new mathematical concepts when considering the aspect of utilization. Third, all algorithms related to the concept of divisibility covered in elementary mathematics textbooks can be found to contain the notion of iteration in terms of automation, but little recursive activity can be found. Considering that recursive thinking is frequently used with repetitive thinking in terms of automation (in Computational Thinking), it is necessary to consider low level recursive activities at elementary school. Finally, it is necessary to think about mathematical Conceptual Thinking from the point of view of Computational Thinking, and conversely, to extract mathematical concepts from computer science's Computational Thinking.

• Journal of applied mathematics & informatics
• /
• v.3 no.2
• /
• pp.129-148
• /
• 1996

This paper propose the inference mechanism for handling linear polynomial constraints called consistency checking algorithm based on the feasibility checking algorithm borrowed from linear pro-gramming. in contrast with other approaches proposed algorithm can efficiently and coherented by linear polynomial forms. The developed algorithm is successfully applied to the symbolic simulation that offers a convenient means to conduct multiple simultaneous exploration of model behaviors.