• 한국정보디스플레이학회:학술대회논문집
• /
• 2002.08a
• /
• pp.449-451
• /
• 2002

We reported the algorithm of driving scheme that enhances moving picture property by improving gray-to-gray response time. Here, we report result of simulation for estimation of driving voltage to reduce response time, and experimental result. We investigated optimization of algorithm so that minimum size of LUT can support to reducing the gray-to-gray response time within 1 frame period, and with single algorithm it is possible to apply the algorithm to various kinds of LC material. So in our system there is no external EEPROM.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1995.10a
• /
• pp.9-16
• /
• 1995

This study presents the applicable possibility of numerical optimization and Genetic Algorithm in the design of truss structures using discrete variables and real constraints. The introduction of Genetic Algorithm in the design of truss structures enables us to do easier formulation and handle discrete variables. To investigate these applicable possibility, the design of 15 - bar truss structures has been studied using GT/STRUDL and Genetic Algorithm and the results of Genetic Algorithm are compared with GT/STRUDL's.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2004.10a
• /
• pp.171-178
• /
• 2004

The purpose of optimum design for structures is to minimize the cost and to obtain the reasonable structural systems. This design algorithm have many objective functions including discrete variables as sections, weight, stiffness and shapes. Simulated annealing, Genetic algorithm and TABU algorithm are used search for these optimum values in the structural design. TABU algorithm is applied to many types structures to search for section and distribution optimization and compared with the results of Genetic algorithm for evaluating the efficiency of this algorithm. In this paper, the plane truss of 10 elements and the space truss of 25 element having 10 nodes, star dome and cable dome are analyzed as analytical models.

• Korean Journal of Computational Design and Engineering
• /
• v.15 no.1
• /
• pp.24-32
• /
• 2010

This paper introduces a B-spline based branch & bound algorithm for global optimization. The branch & bound is a well-known algorithm paradigm for global optimization, of which key components are the subdivision scheme and the bound calculation scheme. For this, we consider the B-spline hypervolume to approximate an objective function defined in a design space. This model enables us to subdivide the design space, and to compute the upper & lower bound of each subspace where the bound calculation is based on the LHS sampling points. We also describe a search tree to represent the searching process for optimal solution, and explain iteration steps and some conditions necessary to carry out the algorithm. Finally, the performance of the proposed algorithm is examined on some test problems which would cover most difficulties faced in global optimization area. It shows that the proposed algorithm is complete algorithm not using heuristics, provides an approximate global solution within prescribed tolerances, and has the good possibility for large scale NP-hard optimization.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.2
• /
• pp.145-152
• /
• 2004

This paper proposes a representation for the embodiment design of mechanical structures and a genetic algorithm suited for the representation. In order to represent early stages and latter stages of the embodiment design, the designs are modeled as simultaneous multi-objective optimization problems of parametric designs for parts and of layout generation for structures. The study, thus, involves genotypes that are adequate to represent phenotypes of the models for the genetic algorithm to solve the given problems. We demonstrate the implementation of the genetic algorithm with the result applied to the gear equipment design.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.10
• /
• pp.630-638
• /
• 2005

In FIR (Finite Impulse Response) filter applications, Nth-band F]U digital filters are known to be important due to their reduced computational requirements. The conventional methods for designing F]U filters use iterative approaches such as the well-known Parks-Mcclellan algorithm. The Parks-Mcclellan algorithm is also used to design Nth-band FIR digital filters. But a disadvantage of the Parks-Mcclellan algorithm is that it needs a good amount of design time. This paper describes a direct design method for Nth-band FIR Filters using Chebyshev polynomials, which provides a reduced design time over indirect methods such as the Parks-Mcclellan algorithm. The response of the resulting filter is equiripple in passband. Our proposed method produces a passband response that is equripple to within a minuscule error, comparable to that of the Parks-Mcclellan algorithm.

• Structural Engineering and Mechanics
• /
• v.45 no.5
• /
• pp.643-654
• /
• 2013

Optimum cost design of columns subjected to axial force and uniaxial bending moment is presented in this paper. In the formulation of the optimum design problem, the height and width of the column, diameter and number of reinforcement bars are treated as design variables. The design constraints are implemented according to ACI 318-08 and studies in the literature. The objective function is taken as the cost of unit length of the column consisting the cost of concrete, steel, and shuttering. The solution of the design problem is obtained using the artificial bee colony algorithm which is one of the recent additions to metaheuristic techniques. The Artificial Bee Colony Algorithm is imitated the foraging behaviors of bee swarms. In application of this algorithm to the constraint problem, Deb's constraint handling method is used. Obtained results showed that the optimum value of numerical example is nearly same with the existing values in the literature.

• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 1999.11a
• /
• pp.167-173
• /
• 1999

This paper suggests a method to design the deep groove ball bearing for high-load capacity by using a genetic algorithm. The design problem of ball bearings is a typical discrete/continuous optimization problem because the deep groove ball bearing has discrete variables, such as ball size and number of balls. Thus, a genetic algorithm is employed to find the optimum values from a set of discrete design variables. The ranking process is proposed to effectively deal with the constraints in genetic algorithm. Results obtained fer several 63 series deep groove ball bearings demonstrated the effectiveness of the proposed design methodology by showing that the average basic dynamic capacities of optimally designed bearings increase about 9~34% compared with the standard ones.

• Computers and Concrete
• /
• v.10 no.3
• /
• pp.295-306
• /
• 2012

Optimum cost design of a simply supported reinforced concrete beam is presented in this paper. In the formulation of the optimum design problem, the height and width of the beam, and reinforcement steel area are treated as design variables. The design constraints are implemented according to ACI 318-08 and studies in the literature. The objective function is taken as the cost of unit length of the beam consisting the cost of concrete, steel and shuttering. The solution of the design problem is obtained using the artificial bee colony algorithm which is one of the recent additions to metaheuristic techniques. The artificial bee colony algorithm is imitated the foraging behaviors of bee swarms. In application of this algorithm to the constraint problem, Deb's constraint handling method is used. Obtained results showed that the optimum value of numerical example is nearly same with the existing values in the literature.

• Journal of Industrial Technology
• /
• v.22 no.A
• /
• pp.19-28
• /
• 2002

The Nelder-Mead simplex algorithm has been one of the most widely used methods for the nonlinear unconstrained optimization, since 1965. Recently, the new algorithm, (so-called the Fuzzy Simplex Algorithm), with fuzzy logic controllers for the expansion, reflection and contraction process of this algorithm has been proposed. In this paper, this new algorithm is developed. And, the formulation for the optimum design of the power screw's efficiency is made. And then, the developed fuzzy simplex algorithm as well as the original one is applied to this optimum design problem. The Fuzzy simplex algorithm results in a faster convergence in this problem, as reported in other study, too.