• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.1
• /
• pp.28-36
• /
• 2002

Regarding efficient development of computer graphic animations, lots of techniques for editing or transforming existing motion data have been developed. Basically, the motion transformation techniques follow optimization process. To make the animation be natural, almost all the techniques utilize kinematics and dynamics in constructing constraints for the optimization. Since the kinematic and dynamic structures of virtual characters to be animated are very complex, the most time-consuming part is known to the optimization process. In order to suggest some guide lines to engineers involved in the motion transformation, in this paper, we analyze the computational complexities for typical motion transformation in quantitative manner as well as the possibility for parallel computation.

• Structural Engineering and Mechanics
• /
• v.64 no.1
• /
• pp.45-58
• /
• 2017

This paper presents the application of topology optimization as a design tool for a steel railway bridge. The choice of a steel railway bridge is dictated by the particular situation that it is suitable for topology optimization design. On the one hand, the current manufacturing techniques for steel structures (additive manufacturing techniques not included) are highly appropriate for material optimization and weight reduction to improve the overall structural efficiency, improve production efficiency, and reduce costs. On the other hand, the design of a railway bridge, especially at higher speeds, is dominated by minimizing the deformations, this being the basic principle of compliance optimization. However, a classical strategy of topology optimization considers typically only one or a very limited number of load cases, while the design of a steel railway bridge is characterized by relatively concentrated convoy loads, which may be present or absent at any location of the structure. The paper demonstrates the applicability of considering multiple load configurations during topology optimization and proves that a different and better optimal layout is obtained than the one from the classical strategy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5614-5633
• /
• 2018

Mobile Edge Computing (MEC) and Wireless Power Transfer (WPT) are both recognized as promising techniques, one is for solving the resource insufficient of mobile devices and the other is for powering the mobile device. Naturally, by integrating the two techniques, task will be capable of being executed by the harvested energy which makes it possible that less intrinsic energy consumption for task execution. However, this innovative integration is facing several challenges inevitably. In this paper, we aim at prolonging the battery life of mobile device for which we need to maximize the harvested energy and minimize the consumed energy simultaneously, which is formulated as residual energy maximization (REM) problem where the offloading ratio, energy harvesting time, CPU frequency and transmission power of mobile device are all considered as key factors. To this end, we jointly optimize the offloading ratio, energy harvesting time, CPU frequency and transmission power of mobile device to solve the REM problem. Furthermore, we propose an efficient convex optimization and sequential unconstrained minimization technique based combining method to solve the formulated multi-constrained nonlinear optimization problem. The result shows that our joint optimization outperforms the single optimization on REM problem. Besides, the proposed algorithm is more efficiency.

• Journal of Korean Society of Steel Construction
• /
• v.16 no.6 s.73
• /
• pp.819-832
• /
• 2004

This study describes an efficient and facile method for configuration optimum design of structures. One of the ways to achieve numerical shape representation and the selection of design variables is using the design element concept. Using this technique, the number of design variables could be drastically reduced. Isoparametric mapping was utilized to automatically generate the finite element mesh during the optimization process, and this made it possible to easily calculate the derivatives of the coordinates of generated finite element nodes w.r.t. the design variables. For the structural analysis, finite element analysis was adopted in the optimization procedure, and two different techniques(the deterministic method, a modified method of feasible direction; and the stochastic method, a genetic algorithms) were applied to obtain the minimum volumes and section areas for an efficient configuration optimization procedure. Futhermore, spline interpolation was introduced to present a realistic optimum configuration that meet the manufacturing requirements. According to the results of several numerical examples(steel structures), the two techniques suggested in this study simplified the process of configuration optimum design of structures, and yielded improved objective function values with a robust convergence rate. This study's applicability and capability have therefore been demonstrated.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.369-375
• /
• 2001

For Optimization technology Was Developed in 1960, the Optimization Technology have grown into a full-featured, robust, highly rated and highly used. And Optimization techniques, having reached a degree of maturity over the past several years, are being used in a wide spectrum of industries, including aerospace, automotive, chemical, electrical, and manufacturing industries. With rapidly advancing computer technology, computers are becoming more powerful, and correspondingly, the size and the complexity of the problems being solved using Optimization techniques are also increasing. But Optimization techniques with analysis solver have many problems. For instance, the difficulties that a particular interface must be coded for each design problem and that the designer should be familiar with the optimization program as well as the analysis program. The purpose of this paper is Optimal Design Framework for Mechanical systems design. This Design Framework has two Optimizers, ADS (local optimizer) and RSM(Response Surface Method), and graphic user interfaces for formulation and optimum design problem and controlling the design process. Current Design Framework tested by two analysis solver, ADAMS and ANSYS. First this paper focused on the core Framework and their conception. In the second of the paper, I cover subjects such as Design Framework Operation. Next, The validity and effectiveness of Design Framework are shown by applying it to many practical design problems and obtaining satisfactory results. Finally, if you are an advanced Operator, you might want to use Response Surface Method, so that cover the result applied by RSM. here.

• Journal of Korea Multimedia Society
• /
• v.8 no.11
• /
• pp.1556-1564
• /
• 2005

Various optimization techniques are deployed in the compilation process of a source program for improving the program's execution speed and reducing the size of the source code. Of the optimization pattern matching techniques, the string pattern matching technique involves finding an optimal pattern that corresponds to the intermediate code. However, it is deemed inefficient due to excessive time required for optimized pattern search. The tree matching pattern technique can result in many redundant comparisons for pattern determination, and there is also the disadvantage of high cost involved in constructing a code tree. The objective of this paper is to propose a table-driven code optimizer using the DFA(Deterministic Finite Automata) optimization table to overcome the shortcomings of existing optimization techniques. Unlike other techniques, this is an efficient method of implementing an optimizer that is constructed with the deterministic automata, which determines the final pattern, refuting the pattern selection cost and expediting the pattern search process.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3512-3528
• /
• 2016

A network with high mobility nodes or vehicles is vehicular ad hoc Network (VANET). For improvement in communication efficiency of VANET, many techniques have been proposed; one of these techniques is vehicular node clustering. Cluster nodes (CNs) and Cluster Heads (CHs) are elected or selected in the process of clustering. The longer the lifetime of clusters and the lesser the number of CHs attributes to efficient networking in VANETs. In this paper, a novel Clustering algorithm is proposed based on Ant Colony Optimization (ACO) for VANET named ACONET. This algorithm forms optimized clusters to offer robust communication for VANETs. For optimized clustering, parameters of transmission range, direction, speed of the nodes and load balance factor (LBF) are considered. The ACONET is compared empirically with state of the art methods, including Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO) based clustering techniques. An extensive set of experiments is performed by varying the grid size of the network, the transmission range of nodes, and total number of nodes in network to evaluate the effectiveness of the algorithms in comparison. The results indicate that the ACONET has significantly outperformed the competitors.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.18 no.9
• /
• pp.36-43
• /
• 2019

Turning, a main machining process, is a widespread process in metal cutting industries. Many researchers have investigated the effects of process parameters on the machining process. In the turning process, input variables including cutting speed, feed, and depth of cut are generally used. Surface roughness and electric current consumption are used as output variables in this study. We construct a simulation model for the turning process using a neural network, which predicts the output values based on input values. In the neural network, obtaining the appropriate set of weights, which is called training, is crucial. In general, back propagation (BP) is widely used for training. In this study, techniques such as ant colony optimization (ACO) and particle swarm optimization (PSO) as well as BP were used to obtain the weights in the neural network. Particularly, two combined techniques of ACO_BP and PSO_BP were utilized for training the neural network. Finally, the performances of the two techniques are compared with each other.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.288-304
• /
• 2019

The growth of telemedicine-based wireless communication for images-magnetic resonance imaging (MRI) and computed tomography (CT)-leads to the necessity of learning the concept of image compression. Over the years, the transform based and spatial based compression techniques have attracted many types of researches and achieve better results at the cost of high computational complexity. In order to overcome this, the optimization techniques are considered with the existing image compression techniques. However, it fails to preserve the original content of the diagnostic information and cause artifacts at high compression ratio. In this paper, the concept of histogram based multilevel thresholding (HMT) using entropy is appended with the optimization algorithm to compress the medical images effectively. However, the method becomes time consuming during the measurement of the randomness from the image pixel group and not suitable for medical applications. Hence, an attempt has been made in this paper to develop an HMT based image compression by utilizing the opposition based improved harmony search algorithm (OIHSA) as an optimization technique along with the entropy. Further, the enhancement of the significant information present in the medical images are improved by the proper selection of entropy and the number of thresholds chosen to reconstruct the compressed image.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.3
• /
• pp.234-241
• /
• 1996

Recently, Genetic Algorithms(GAs), which consist of genetic operators named selection crossover and mutation, are widely adapted into a search procedure for structural optimization. Contrast to traditional optimal design techniques which use design sensitivity analysis results, GAs are very simple in their algorithms and there is no need of continuity of functions(or functionals) any more in GAs. So, they can be easily applicable to wide territory of design optimization problems. Also, virtue to multi-point search procedure, they have higher probability of convergence to global optimum compared with traditional techniques which take one-point search method. The introduction of basic theory on GAs, and the application examples in combination optimization of ten-member truss structure are presented in this paper.