• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.4
• /
• pp.637-644
• /
• 2019

This paper describes an implementation of a graph-based simultaneous localization and mapping(SLAM) method called the General Graph Optimization. The General Graph Optimization formulates the SLAM problem using nodes and edges. The nodes represent the location and attitude of a robot in time sequence, and the edge between the nodes depict the constraint between the nodes. The constraints are imposed by sensor measurements. The General Graph Optimization solves the problem by optimizing the performance index determined by the constraints. The implementation is verified using the measurement data sets which are open for test of various SLAM methods.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2004.04a
• /
• pp.317-324
• /
• 2004

Shape design optimization of shell structure is implemented on a basis of integrated framework of geometric modeling and finite element analysis which is constructed on the geometrically exact shell theory. This shell theory enables more accurate and robust analysis for complicated shell structures, and it fits for the nature of B-spline function which Is popular modeling scheme in CAD field. Shape of laminated composite shells is optimized through genetic algorithm and sequential linear programming, because there ire numerous optima for various configurations, constraints, and searching paths. Sequential adaptation of global and local optimization makes the process more efficient. Two different optimized results of laminated composite shell structures to minimize strain energy are shown for different layup sequence.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.1
• /
• pp.1-17
• /
• 1996

There have been considerable researches for solving large-scale separable convex optimization ptoblems. In this paper we present a method for large-scale nonseparable smooth convex optimization problems with block-angular linear constraints. One of them is occurred in reconfiguration of the virtual path network which finds the routing path and assigns the bandwidth of the path for each traffic class in ATM (Asynchronous Transfer Mode) network [1]. The solution is approximated by solving a sequence of the block-angular structured separable quadratic programming problems. Bundle-based decomposition method [10, 11, 12]is applied to each large-scale separable quadratic programming problem. We implement the method and present some computational experiences.

• Proceedings of the Korean Society For Composite Materials Conference
• /
• 2003.04a
• /
• pp.103-107
• /
• 2003

The objective of this thesis is to develop the optimal design of composite links containing complicated cross-section. To accomplish this objective, a composite links structural analysis program was developed. The method of calculating effective modulus of composite beam containing complicated cross-section is proposed. Genetic algorithm was implemented for the optimization method to manipulate the discrete ply angles as the design variables and to utilize its high reliability to find the global optimum. The design variables were the number of plies, the fiber orientations and the stacking sequence. The optimal design of composite links was performed by genetic algorithm to minimize the weight of the structure and to constrain ply failure

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.3
• /
• pp.775-787
• /
• 1996

An optimization procedure is proposed for the design of cylindrically laminated composite shell having midplane symmetry and subjected to axial force, torsion and internal pressure. Tsai-Wu and Tsai-Hill failure criteria are taken as objective functions. The stacking sequence represents the design variable. The optimal design formulation based on state space method is adopted and solution proccedure is described with the emphasis on the method of calculations of the design sensitivities. A gradient projection algorithm is employed for the optimization process. Numerical results are presented for the several test problems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.3
• /
• pp.110-117
• /
• 2009

This paper introduces a case study for efficient generation of production schedules in a tube manufacturing system. The considered scheduling problem consists of two sub problems : lot sizing for a job and Job sequencing. Since these problems require simulation optimization in which the performance measures are obtained by simulation execution, the trade-off between solution quality and computation time is an important issue. In this study, the optimal lot size for every product type is determined from simulation experiments. Then, target production quantity for each product type is transformed to several jobs such that a Job consists of determined lot size. To obtain the good solution for a Job sequence in a reasonable time, a number of alternatives are generated from heuristic rules developed by intuition and analysis of the considered system, and a job sequence is selected from simulation experiments.

• ETRI Journal
• /
• v.28 no.6
• /
• pp.721-731
• /
• 2006

A fast intra skip detection algorithm based on the ratedistortion (RD) cost for an inter frame (P-slices) is proposed for H.264/AVC video encoding. In the H.264/AVC coding standard, a robust rate-distortion optimization technique is used to select the best coding mode and reference frame for each macroblock (MB). There are three types of intra predictions according to profiles. These are $16{\times}16$ and $4{\times}4$ intra predictions for luminance and an $8{\times}8$ intra prediction for chroma. For the high profile, an $8{\times}8$ intra prediction has been added for luminance. The $4{\times}4$ prediction mode has 9 prediction directions with 4 directions for $16{\times}16$ and $8{\times}8$ luma, and $8{\times}8$ chrominance. In addition to the inter mode search procedure, an intra mode search causes a significant increase in the complexity and computational load for an inter frame. To reduce the computational load of the intra mode search at the inter frame, the RD costs of the neighborhood MBs for the current MB are used and we propose an adaptive thresholding scheme for the intra skip extraction. We verified the performance of the proposed scheme through comparative analysis of experimental results using joint model reference software. The overall encoding time was reduced up to 32% for the IPPP sequence type and 35% for the IBBPBBP sequence type.

• Korean Journal of Computational Design and Engineering
• /
• v.20 no.4
• /
• pp.367-374
• /
• 2015

Sandwich panels consisting of various materials have widely been applied for mitigating dynamic impacts such as ballistic and blast impacts. Especially, the selection of materials for different core set-ups can directly influence its performance. In this study, we design the sandwich panels for alleviating ballistic and blast impacts by controlling the stacking sequence of core materials and their thicknesses. FEM studies are performed to simulate the dynamic behavior of sandwich panels subjected to ballistic and blast impacts. Delamination between the core layers is also considered in the FEM studies for feasible design. Based on the FEM data, kriging models are generated for approximating design space and quickly predicting the FEM outputs. Finally, design optimizations are implemented to find the optimum stacking sequence of core materials and thicknesses with given impact situations.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.4
• /
• pp.631-641
• /
• 2011

We consider a history-dependent Parrondo game in which the winning probability of the present trial depends on the results of the last two trials in the past. When a fraction of an infinite number of players are allowed to choose between two fair Parrondo games at each turn, we compare the blind strategy such as a random sequence of choices with the short-range optimization strategy. In this paper, we show that the random sequence of choices yields a steady increase of average profit. However, if we choose the game that gives the higher expected profit at each turn, surprisingly we are not supposed to get a long-run positive profit for some parameter values.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.3
• /
• pp.633-652
• /
• 2024

Software testing is an important phase as it ensures the software quality. The software testing process comprises of three steps: generation, execution, and evaluation of test cases. Literature claims the usage of single and multiple 'Unified Modeling Language' (UML) diagrams to generate test cases. Using multiple UML diagrams increases test case coverage. However, the existing approaches show limitations in test case generation from UML diagrams. Therefore, in this research study, we propose an approach to generate the test cases using UML State Chart Diagram (SCD), Activity Diagram (AD), and Sequence Diagram (SD). The proposed approach transforms UML diagrams into intermediate forms: SCD Graph, AD Graph, and SD Graph respectively. Furthermore, by integrating these three graphs, a System Testing Graph (STG) is formed. Finally, test cases are identified from STG by using a traversal algorithm such as Depth First Search (DFS) that is an optimization method. The results show that the proposed approach is better compared to existing approaches in terms of coverage and performance. Moreover, the generated test cases have the ability to detect faults at the unit level, integration, and system level testing.