• Computers and Concrete
• /
• v.2 no.5
• /
• pp.411-421
• /
• 2005

A linear programming problem of the optimal proportioning of concrete aggregates is discussed; and a self-adaptive genetic algorithm is developed to solve this problem. The proposed method is based on changing a range of variables for capturing the feasible region of the optimum solution. A computational verification of this method is compared with the results of the linear programming.

• International conference on construction engineering and project management
• /
• 2007.03a
• /
• pp.777-786
• /
• 2007

This paper presents a modified simulated annealing algorithm to optimize linear scheduling projects with multiple resource constraints and its effectiveness is verified with a proposed problem. A two-stage solution-finding procedure is used to model the problem. Then the simulated annealing and the modified simulated annealing are compared in the same condition. The comparison results and the reasons of improvement by the modified simulated annealing are presented at the end.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.1
• /
• pp.46-53
• /
• 2007

NC (Numerical Control) code for the tool path needs to be generated efficiently for machining of free form pockets with arbitrary wall geometry on a three axis CNC machine. The unified rough and finish cut algorithm and the tool motion is graphically simulated in Part 1. In this paper, a grid based 3D navigation algorithm simulated in Part 1 for generating NC tool path data for both linear interpolation and a combination of linear and circular interpolation for three-axis CNC milling of general pockets with sculptured bottom surfaces is experimentally performed and verified.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.16 no.3
• /
• pp.301-309
• /
• 2003

The non linear control algorithm with actuator saturation for a randomly excited oscillator has been widely explored and has shown promising results, but the probabilistic analysis of the algorithm has been rarely made due to its non-linear nature and the fact that the analytical solution of probability density function (PDF) for controlled responses does not exist. In this paper, a method for the probabilistic analysis on the non linear control algorithm with actuator saturation is proposed based on the equivalent non linear system method. Numerical examples are given to verify the approximation solution of PDF comparing to a statistically obtained PDF using a Gaussian white noise and a Kanai - Tagimi filtered Gaussian white noise.

• Journal of the Korean Geographical Society
• /
• v.40 no.4 s.109
• /
• pp.441-453
• /
• 2005

This study aims to generalize the stream network developing algorithm of the geographic hierarchy Stream networks with hierarchy system should be spatially hierarchized in linear features. The generalization procedure of the stream networks are composed of the hierarchy of stream, selection and elimination, and algorithm. Working of stream networks is composed by the decision of direction on stream networks, ranking of stroke segments, and ordering by the strahler method, using geographic data query for controlling selection and elimination of the linear feature by scale. Improved Simoo algorithm was effective in enhancement and decreasing curvature of linear features. Resultantly, it is expected to improve generalization of features with various spatial hierarchy.

• Journal of the Korean Magnetic Resonance Society
• /
• v.9 no.2
• /
• pp.93-102
• /
• 2005

Purpose: To develop an advanced non-linear curve fitting (NLCF) algorithm for dynamic susceptibility contrast study of brain. Materials and Methods: The first pass effects give rise to spuriously high estimates of $K^{trans}$ in voxels with large vascular components. An explicit threshold value has been used to reject voxels. Results: By using this non-linear curve fitting algorithm, the blood perfusion and the volume estimation were accurately evaluated in T2*-weighted dynamic contrast enhanced (DCE)-MR images. From the recalculated each parameters, perfusion weighted image were outlined by using modified non-linear curve fitting algorithm. This results were improved estimation of T2*-weighted dynamic series. Conclusion: The present study demonstrated an improvement of an estimation of kinetic parameters from dynamic contrast-enhanced (DCE) T2*-weighted magnetic resonance imaging data, using contrast agents. The advanced kinetic models include the relation of volume transfer constant $K^{trans}\;(min^{-1})$ and the volume of extravascular extracellular space (EES) per unit volume of tissue $\nu_e$.

• Proceedings of the KSRS Conference
• /
• 1999.11a
• /
• pp.177-181
• /
• 1999

This paper presents an algorithm for building detection from aerial image using segment measure function and line relation. In the detection algorithm proposed, edge detection, linear approximation and line linking are used and then line measure function is applied to each line segment in order to improve the accuracy of linear approximation. Parallelisms, orthogonalities are applied to the extracted liner segments to extract building. The algorithm was applied to aerial image and the buildings were accurately detected.

• Korean Management Science Review
• /
• v.15 no.1
• /
• pp.77-85
• /
• 1998

In this paper a face optimization algorithm is developed for solving the problem (P) of optimizing a linear function over the set of efficient solutions of a multiple objective linear program. Since the efficient set is in general a nonconvex set, problem (P) can be classified as a global optimization problem. Perhaps due to its inherent difficulty, relatively few attempts have been made to solve problem (P) in spite of the potential benefits which can be obtained by solving problem (P). The algorithm for solving problem (P) is guaranteed to find an exact optimal or almost exact optimal solution for the problem in a finite number of iterations.

• Transactions of Materials Processing
• /
• v.6 no.5
• /
• pp.416-424
• /
• 1997

In the present study, a contact search and check algorithm for general tool surface described by triangular FE patch is proposed. To improve numerical stability, SEAM element using the linear Coons interpolation has been used. To check the proposed algorithm, both clover cup and L-shape cup deep drawing processes are calculated. The computed results shows that the proposed contact algorithm can be successfully applied for sheet metal forming processes with general shaped tools.

• Journal of the Chungcheong Mathematical Society
• /
• v.6 no.1
• /
• pp.139-155
• /
• 1993

A new sequential algorithm and computational results for large-scale linear programs with a special structure were presented in the previous paper [9]. In this paper, a parallel version of the algorithm was developed for a hypercube multiprocessor architecture NCUBE2. Computational results using 128 processors are presented for a randomly generated large-scale sparse or dense problems with the number of variables up to 256 and constraints up to 5 million.