• Journal of Korean Association for Spatial Structures
• /
• v.9 no.3
• /
• pp.75-82
• /
• 2009

This paper investigates the variation of post-buckling behaviours of spatial structures after sizing optimization with linear assumptions. The mathematical programming technique is used to produce the optimum member size of spatial structures against external load. Total weight of structure is considered as the objective function to be minimized and the displacement occurred at loading point and member stresses of structures are used as the constraint functions. The finite difference method is used to calculate the design sensitivity of objective function with respect to design variables. The post-buckling analysis carried out by using the geometrically nonlinear finite element analysis code ISADO-GN. It is found to be that there is a huge difference between the post buckling behaviours of the initial and optimized structures. Therefore, the stability of optimized spatial structures with linear assumption should be throughly checked by appropriate nonlinear analysis techniques. Finally, the present numerical results are provided as benchmark test suite for future study of large spatial structures.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.43 no.5 s.311
• /
• pp.10-18
• /
• 2006

We propose a new approach to compute possible acceleration boundary, so is called dynamic manipulability, for multiple robotic systems with frictional contacts between robot end-effectors and object. As the frictional contact condition which requires each contact force to lie within a friction cone is based on the nonlinear inequality formalism is not easy to handle the constraint in manipulability analysis. To include the frictional contact condition into the conventional manipulability analysis we approximate the friction cone to a pyramid which is described by linear inequality constraints. And then achievable acceleration boundaries of manipulated object are calculated conventional linear programming technique under constraints for torque capability of each robot and the approximated contact condition. With the proposed method we find some solution to which conventional approaches did not reach. Also, case studies are Presented to illustrate the correctness of the proposed approach for two robot systems of simple planar robots and PUMA560 robots.

• Proceeding of KASS Symposium
• /
• 2008.05a
• /
• pp.107-112
• /
• 2008

This paper investigates the variation of post-buckling behaviours of 2-dimensional shallow arch type truss after sizing optimization. The mathematical programming technique is used to produce the optimum member size of 2D arch truss against a central point load. Total weight of structure is considered as the objective function to be minimized and the displacement occurred at loading point and member stresses of truss are used as the constraint functions. The finite difference method is used to calculate the design sensitivity of objective function with respect to design variables. The postbuckling analysis carried out by using the geometrically nonlinear finite element analysis code ISADO-GN. It is found to be that there is a huge change of post-buckling behaviour between the initial structure and optimum structure. Numerical results can be used as useful information for future research of large spatial structures.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.385-390
• /
• 2005

Set constraints logic language is a language that adopts `set theory` in programming. In this paper, we introduce the procedure for solving set constraints proposed by A. Dovier and show how the procedure can be implemented in logic language Prolog. The procedure is represented in `rewriting rules` and this representation is characterized by having nondeterministic rule applicationsand mathematical variables that is difficult to be implemented in general programming languages. In this paper, we show that the representation can be easily implemented by using nondeterministic control, logical variables and data structure `list` provided in Prolog. Our implementation has following advantages.First we have implemented the full features of the language. Second we have described the implementation detail in thisresearch. Third other used the commercial Prolog called SICStus, but we are using CIAO Prolog with GNU GPL(General Public License) and anyone can use it freely. Forth the software of our implementation is open source so anyone can use, modify, and distribute it freely.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.10
• /
• pp.123-131
• /
• 1999

In this paper, we proposed stereo matching algorithm by dynamic programming with edges emphasized. Existing algorithms show blur generally at depth discontinuities owing to smoothness constraint and non-existence of matching pixel in occlusion regions. Also it accompanies matching error by lackness of matching information in the untextured regions. This paper defines new cost function to make up for the problems occurred to existing algorithms. It is possible through deriving matching of edges in left and right images to be carried out between edge regions anf deriving that in the other regions to be peformed between the other regions. In case of the possibility that edges can be Produced in a large amount, matching between edge information adds weight to cost function in proportion to Path distance. Proposed algorithm was applied to various images obtained by convergent camera model as well as parallel camera model. As the result, proposed algorithm showed improved performance in the aspect of matching error and processing in the occlusion regions compared to existing algorithms. Also it could improve blur especially in discontinuity regions.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.3
• /
• pp.427-437
• /
• 2017

Impossible differential characteristics distinguish the corresponding block cipher from random substitution and can also be used for key recovery attack. Recently Cui et al. proposed an automatic method for searching impossible differential characteristics of several ARX - based block ciphers using Mixed Integer Linear Programming(MILP). By optimizing the method proposed by Cui et al., It was possible to find new impossible differential characteristics which could not be founded by the method by using less linear constraint expression than the existing method. It was applied to the SPECK family and LEA using the modified method. We found 7-rounds for SPECK32, SPECK48, SPECK64, SPECK96 and 8-rounds impossible differential characteristics of SPECK128. These impossible differential characteristics are all newly found. We also found existing 10-rounds of impossible differential characteristic and new 10-rounds of impossible differential characteristics of LEA.

• Journal of the Korea Society for Simulation
• /
• v.21 no.3
• /
• pp.79-88
• /
• 2012

Recently, the study in efficient operation, maintenance, and equipment-design have been growing rapidly in military industry to meet the required missions. Through out these studies, the importance of Concurrent Spare Parts(CSP) are emphasized. The CSP, which is critical to the operation and maintenance to enhance the availability, is offered together when a equipment is delivered. Despite its significance, th responsibility for determining the range and depth of CSP are done from administrative decision rather than engineering analysis. The purpose of the paper is to optimize the number of CSP per item using simulation and multiple regression. First, the result, as the change of operational availability, was gained from changing the number of change in simulation model. Second, mathematical regression was computed from the input and output data, and the number of CSP was optimized by multiple regression and linear programming; the constraint condition is the cost for optimization. The advantage of this study is to respond with the transition of constraint condition quickly. The cost per item is consistently altered in the development state of equipment. The speed of analysis, that simulation method is continuously performed whenever constraint condition is repeatedly altered, would be down. Therefore, this study is suitable for real development environment. In the future, the study based on the above concept improves the accuracy of optimization by the technical progress of multiple regression.

• Industrial Engineering and Management Systems
• /
• v.9 no.1
• /
• pp.10-19
• /
• 2010

This paper presents an extended computing procedure for the global optimization of the triple response system (TRS) where the response functions are nonconvex (nonconcave) quadratics and the input factors satisfy a radial region of interest. The TRS arising from response surface modeling can be approximated using a nonlinear mathematical program involving one primary (objective) function and two secondary (constraints) functions. An optimization algorithm named triple response surface algorithm (TRSALG) is proposed to determine the global optimum for the nondegenerate TRS. In TRSALG, the Lagrange multipliers of target (secondary) functions are computed by using the Hooke-Jeeves search method, and the Lagrange multiplier of the radial constraint is located by using the trust region (TR) method at the same time. To ensure global optimality that can be attained by TRSALG, included is the means for detecting the degenerate case. In the field of numerical optimization, as the family of TR approach always exhibits excellent mathematical properties during optimization steps, thus the proposed algorithm can guarantee the global optimal solution where the optimality conditions are satisfied for the nondegenerate TRS. The computing procedure is illustrated in terms of examples found in the quality literature where the comparison results with a gradient-based method are used to calibrate TRSALG.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.5
• /
• pp.272-281
• /
• 1988

The problem of optimal transmission system planning is to find the most economical locations and time of transmission line construction under the various constraints such as available rights-of-way, finances, the technical characteristics of power system, and the reliability criterion of power supply, and so on. In this paper the constraint of right-of-way is represented as a finite set of available rights-of-way. And the constructed for a unit period. The electrical constraints are represented in terms of line overload and steady state stability margin. And the reliability criterion is dealt with the suppression of failure cost and with single-contingency analysis. In general, the transmission planning problem requires integer solutions and its objective function is nonlinear. In this paper the objective function is defined as a sum of the present values of construction cost and the minimum operating cost of power system. The latter is represented as a sum of generation cost and failure cost considering the change of yearly load, economic dispatch, and the line contingency. For the calculation of operating cost linear programming is adopted on the base of DC load flow calculation, and for the optimization of main objective function nonlinear Branch-and-Bound algorithm is used. Finally, for improving the efficiency of B & B algorithm a new sensitivity analysis algorithm is proposed.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.738-743
• /
• 1991

A multiobjective analysis technique was applied for the optimum operation of pumps and reservoirs in service water transmission systems. Three major objectives were identified and assessed on the normally operating service water transmission systems. They are, 1) stability of pump operation; 2) economic point of view in minimizing the energy cost for pumping; 3) reliability in meeting the stochasticaly varying demands. The measures of these objectives were required times of pump on-offs in stability, required total energy cost in economics, and minimum required storage during the operating horizon in reliability. In order to find the best meeting solution to the decision maker, a set of non-dominated solutions which show the tradeoff relationships between the considering objectives were generated. The DM selects the best solution from this explicit tradeoff relationships using his heuristic decision rules or experience. The theory was verified by applying to the Kumi Service Water System. A combined technique of the ${\varepsilon}-constraint$ and the weighting methods was used to generate the nondominated solutions, and the dynamic programming algorithm was applied to find the optimal solution for the discretized multi-objective analysis problems.