• Earthquakes and Structures
• /
• v.10 no.3
• /
• pp.563-588
• /
• 2016

In this study, solution models are proposed to obtain code-compatible ground motion record sets which can be used for both uni-directional and bi-directional dynamic analyses. Besides scaled, unscaled ground motion record sets are obtained to show the utility and efficiency of the solution models. For scaled ground motion sets the proposed model is based on hybrid HS-Solver which integrates heuristic harmony search (HS) algorithm with the spreadsheet Solver add-in. For unscaled ground motion sets HS based solution model is proposed. Design spectra defined in Eurocode-8 for different soil types are selected as target spectra. The European Strong Motion Database is used to get ground motion record sets. Also, a sensitivity analysis is conducted to evaluate the effect of different HS solution parameters on the solution accuracy. Results show that the proposed solution models can be regarded as efficient ways to develop scaled and unscaled ground motion sets compatible with code-based design spectra.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.12
• /
• pp.2687-2696
• /
• 2011

A Clustering problem is one of the organizational problems to improve network lifetime and scalability in underwater acoustic sensor networks. This paper propose an algorithm to obtain an optimal clustering solution to be able to minimize a total transmission power for all deployed nodes to transmit data to the sink node through its clusterhead. In general, as the number of nodes increases, the amount of calculation for finding the solution would be too much increased. To obtain the optimal solution within a reasonable computation time, we propose a genetic algorithm to obtain the optimal solution of the cluster configuration. In order to make a search more efficient, we propose some efficient neighborhood generating operations of the genetic algorithm. We evaluate those performances through some experiments in terms of the total transmission power of nodes and the execution time of the proposed algorithm. The evaluation results show that the proposed algorithm is efficient for the cluster configuration in underwater acoustic sensor networks.

• Communications for Statistical Applications and Methods
• /
• v.16 no.3
• /
• pp.409-419
• /
• 2009

In this article, an explicit solution of the EM algorithm for the image deburring is presented. To obtain the restore image from the strictly iterative EM algorithm is quite time-consumed and impractical in particular when the underlying observed image is not small and the number of iterations required to converge is large. The explicit solution provides a quite reasonable restore image although it exploits the approximation in the outside of the valid area of image, and also allows to obtain the effective EM solutions without iteration process in real-time in practice by using the discrete finite Fourier transformation.

• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 2002.10b
• /
• pp.399-400
• /
• 2002

A numerical procedure for analyzing thermo-elastic contact applied to an automotive disk brake and calculating subsurface stress distribution has been developed. The proposed procedure takes the advantage of the simplex algorithm to save computing time. Flamant's solution and Boussinesq's solution are adopted as Green function in analysis. Comparing the numerical results with the exact solutions has proved the validity of this procedure.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.554-558
• /
• 2001

In this study, a hybrid method is used to search the pseudo-optimal solution for the I-dimentional nesting problem. This method is composed of the genetic algorithm for the global search and a simple heuristic one for the local search near the pseudo optimal solution. Several simulation results show that the hybrid method gives very satisfactory results.

• Communications for Statistical Applications and Methods
• /
• v.5 no.3
• /
• pp.581-589
• /
• 1998

An algorithm is proposed for the $L_1$-estimation with linear equality and inequality constraints in linear regression model. The algorithm employs a linear scaling transformation to obtain the optimal solution of linear programming type problem. And a special scheme is used to maintain the feasibility of the updated solution at each iteration. The convergence of the proposed algorithm is proved. In addition, the updating and orthogonal decomposition techniques are employed to improve the computational efficiency and numerical stability.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.238-242
• /
• 1994

Shuster's algorithm for spin-axis determination is extended to include sensor bias and mounting angle as its solve-for parameters. The relation between direct and derived measurements bias is obtained by linearizing their kinematic equations. A one-step least-square estimation technique referred to as the 'closed form' solution is used, and the solution provides a more refined and decent initial guess for the subsequent filtering process contained within the differential correction module. The modified algorithm is applied for attitude determination of a GEO communication satellite in transfer orbit, and its results are presented.

• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.757-770
• /
• 1999

We analyse in this paper the possibility of using preconditioning techniques as for square non-singular systems, also in the case of inconsistent least-squares problems. We find conditions in which the minimal norm solution of the preconditioned least-wquares problem equals that of the original prblem. We also find conditions such that thd Kaczmarz-Extendid algorithm with relaxation parameters (analysed by the author in [4]), cna be adapted to the preconditioned least-squares problem. In the last section of the paper we present numerical experiments, with two variants of preconditioning, applied to an inconsistent linear least-squares model probelm.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.7
• /
• pp.746-758
• /
• 1988

This paper proposes a code scheduling algorithm which gives a software solution to the pipeline interlock. This algorithm provides a heuristic solution by recordering the instructions, instead of using hardware interlock mechanism when pipeline interlock prevents the execution of a machine instruction in a pipelined architecture. Program code size and overall execution time can be reduced due to the increased flexibility in the selection of instructions, which is possible from the alleviated ordering restriction on the use of conflict resources.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.6
• /
• pp.33-41
• /
• 2021

This paper proposes heuristic greedy algorithm that can be find the solution within polynomial time with solution finding rule for the capacitated minimum spanning tree(CMST) problem, known as NP-hard. The CMST problem can be solved by computer-aided meta-heuristic because of the Esau-Williams heuristic polynomial time algorithm has a poor performance. Nevertheless the meta-heuristic methods has a limit performance that can't find optimal solution. This paper suggests visual by handed solution-finding rule for CMST. The proposed algorithm firstly construct MST, and initial feasible solution of CMST from MST, then optimizes the CMST with the subtree gates more adjacent to root node. As a result of total 30 cases of OR-LIB 10 data, Q=3,5,10, the proposed algorithm gets the best performance.