• Korean Journal of Computational Design and Engineering
• /
• v.6 no.4
• /
• pp.271-276
• /
• 2001

A geometric kernel is the library of core mathematical functions that defines and stores 3D shapes in response to users'commands. We developed a light geometric kernel suitable to develop CAD/CAM application systems. The kernel contains geometric objects, such as points, curves and surfaces and a minimal set of functions for each type but does not contain lots of modeling and handling functions that are useful to create and maintain complex shapes from an idea sketch. The kernel was developed on MS-Windows NT using C++ with STL(Standard Template Library) but it is compatible with UNIX environments. This paper describes the structure of the kernel including several components: base, math, point sequence curve, geometry, translators. The base kernel gives portability to applications and the math kernel contains basic arithmetic and their classes, such as vector and matrix. The geometry kernel contains points, parametric curves, and parametric surfaces. A neutral fie format and programming and document styles are also presented in this paper.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.1
• /
• pp.301-309
• /
• 1995

Shape optimal design of an excavator boom to minimize weight can be formulated as a nonlinear programming problem with an automesh refinement carried out by using the finite element method. The design variables are the radii and the coordinates of the circle to describe the excavator boundary shape. In addition to the displacement and stress constraints, geometric constraints are imposed such that the nodes cannot cross the certain range. The optimum design is obtained by using the PLBA nonlinear programming code. The sensitivity derivatives are calculated using the semi-analytical scheme. Numerical results of an excavator boom show potential for weight reduction of 4.4%(65.6 kgf) when considering the displacement, stress and geometric constraints.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.12 no.1
• /
• pp.75-87
• /
• 2012

A design paradigm using sequential geometric programming is presented to accurately design CMOS op amps with BSIM3. It is based on new adaptive modeling of transistor parameters through the operating point simulation. This has low modeling cost as well as great simplicity and high accuracy. The short-channel dc, high-frequency small-signal, and short-channel noise models are used to characterize the physical behavior of submicron devices. For low-power and low-voltage design, this paradigm is extended to op amps operating in the subthreshold region. Since the biasing and modeling errors are less than 0.25%, the characteristics of the op amps well match simulation results. In addition, small dependency of design results on initial values indicates that a designed op amp may be close to the global optimum. Finally, the design paradigm is illustrated by optimizing CMOS op amps with accurate transfer function.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.3
• /
• pp.248-256
• /
• 2005

In this paper, we compare two EOQ based inventory models under total cost minimization and profit maximization to investigate the difference in the optimal solutions. First of all, optimal solutions for both models through geometric programming (GP) techniques are found considering production (lot sizing) as well as marketing (pricing) decisions. An investigation of the effects of the changes in the optimal solutions according to varied parameters is performed by studying optimality conditions as well as by performing numerical analysis. We then conduct comparative analysis between the models to show the relationships between the optimal solutions of the models where certain conditions in the cost per unit and the demand per unit time are given. Several interesting economic implications and managerial insights are observed from this analysis.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.311-311
• /
• 2000

We propose a DP-based formulation for matching line patterns by defining a robust and stable geometric representation that is based on the conceptual organizations. Usually, the endpoint proximity and collinearity of image lines, as two main conceptual organization groups, are useful cues to match the model shape in the scene. As the endpoint proximity, we detect junctions from image lines. We then search for junction groups by using geometric constraint between the junctions. A junction chain similar to the model chain is searched in the scene, based on a local comparison. A Dynamic Programming-based search algorithm reduces the time complexity for the search of the model chain in the scene. Our system can find a reasonable matching, although there exist severely distorted objects in the scene. We demonstrate the feasibility of the DP-based matching method using both synthetic and real images.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.406-412
• /
• 1996

Optimal trajectory for a robot manipulator minimizing actuator torques or energy consumption in a fixed traveling time is obtained in the presence of obstacles. All joint displacements are represented in finite terms of Fourier cosine series and the coefficients of the series are obtained optimally by nonlinear programming. Thus, the geometric path need not be prespecified and the full dynamic model is employed. To avoid the obstacles, the concept of penalty area is newly introduced and this penalty area is included in the performance index with an appropriate weighting coefficient. This optimal trajectory will be useful as a geometric path in the minimum-time trajectory planning problem.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.29 no.4
• /
• pp.73-92
• /
• 1987

Formulation of the geometric optimization for truss structures based on the elasticity theory turn out to be the nonlinear programming problem which has to deal with the cross-sectional area of the member and the coordinates of its nodes simultaneously. A few techniques have been proposed and adopted for the analysis of this nonlinear programming problem for the time being. These techniques, however, bear some limitations on truss shapes, loading conditions and design criteria for the practical application to real structures. A generalized algorithm for the geometric optimization of the truss structures, which can eliminate the above mentioned limitations, is developed in this study. The algorithm proposed utilizes the two-levels technique. In the first level which consists of two phases, the cross-sectional area of the truss member is optimized by transforming the nonlinear problem into SUMT, and solving SUMT utilizing the modified Newton Raphson method. In the second level, which also consists of two phases the geometric shape is optimized utillzing the unindirectional search technique of the Powell method which make it possible to minimize only the objective functlon. The algorithm proposed in this study is numerically tested for several truss structures with various shapes, loading conditions and design criteria, and compared with the results of the other algorithms to examine its applicability and stability. The numerical comparisons show that the two- levels algorithm proposed in this study is safely applicable to any design criteria, and the convergency rate is relatively fast and stable compared with other iteration methods for the geometric optimization of truss structures. It was found for the result of the shape optimization in this study to be decreased greatly in the weight of truss structures in comparison with the shape optimization of the truss utilizing the algorithm proposed with the other area optimum method.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.3 no.2
• /
• pp.31-44
• /
• 1983

This paper applies an optimization algorithm for the elastic truss structures. The acceleration technique utilized in this study is the geometric programming method developed by the Operation Research or the applied methematics. The applicability and the efficiency of the algorithm applied in this study are tested for four different trusses. Test results show that the optimum solutions are obtained after only one or seven iterations which is very small compared with other techniques and no oscillation is needed for the convergency. Test rusults also show that the Geometric Programming Method is also effective algorithm for the convergency of the Optimum Solution in case of only being compared with the number of iteration.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.11
• /
• pp.57-65
• /
• 2014

This paper presents a framework that is based on a reconfigurable macro-model of current-mode logic (CML) high-speed digital circuits enabling equation-based design optimization. The proposed macro-model is compatible with geometric programming, thereby enabling constraint-driven top-level power optimization. The proposed optimization framework is applied to a design of CML based serial-link transmitter with user-defined design specifications as an example of high speed digital circuits using 45nm and 90nm CMOS technology. The proposed optimization framework can derive a design with optimal power efficiency for given transistor technology nodes.

• Proceedings of the KIEE Conference
• /
• 2001.07b
• /
• pp.590-592
• /
• 2001

We introduce a technique for designing homogeneous magnets using linear programming. The method has several advantages over existing techniques including: it allows complete flexibility in arbitrary geometric constraints on both the coil locations and the shape of the homogeneous volume; it guarantees a globally optimal solution, and it automatically choose the minimum number of coils necessary for the constraints.