• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.8
• /
• pp.1281-1286
• /
• 2003

A line search algorithm to increase a convergence in Newton's method is developed and applied to nonlinear finite element analysis. The algorithm is based on the slack line search theory which is an efficient algorithm to determine initial acceleration coefficient, variable backtracking algorithm proposed by some researchers, and convergence criterion based on residual norm. Also, it is capable of avoiding exceptional diverging conditions. Developed program is tested in metal forming simulation such as forging and ring rolling. Numerical result shows the validity of the algorithm for a highly nonlinear system .

• Journal of Korea Water Resources Association
• /
• v.53 no.8
• /
• pp.597-604
• /
• 2020

Muskingum, a hydrologic channel flood routing, is a method of predicting outflow by using the relationship between inflow, outflow, and storage. As many studies for Muskingum model were suggested, parameters were gradually increased and the calculation process was complicated by many parameters. To solve this problem, an optimization algorithm was applied to the parameter estimation of Muskingum model. This study applied the Advanced Nonlinear Muskingum Model considering continuous flow (ANLMM-L) to Wilson flood data and Sutculer flood data and compared results of the Linear Nonsingum Model incorporating Lateral flow (LMM-L), and Kinematic Wave Model (KWM). The Sum of Squares (SSQ) was used as an index for comparing simulated and observed results. Exponential Bandwidth Harmony Search with Centralized Global Search (EBHS-CGS) was applied to the parameter estimation of ANLMM-L. In Wilson flood data, ANLMM-L showed more accurate results than LMM-L. In the Sutculer flood data, ANLMM-L showed better results than KWM, but SSQ was larger than in the case of Wilson flood data because the flow rate of Sutculer flood data is large. EBHS-CGS could be appplied to be appplicable to various water resources engineering problems as well as Muskingum flood routing in this study.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.42 no.6
• /
• pp.122-129
• /
• 2000

The purpose of this study is to investigate both the fundamental and some higher natural frequencies and mode shapes of compressive members resting on the linear elastic foundation. The model of compressive member is based on the classical Bernoulli-Euler beam theory. The differential equation governing free vibrations of such members subjected to an axial load is derived and solved numerically for calculating the natural frequencies and mode shapes. The Improved Euler method is used to integrate the differential equation and the Determinant Search method combined with the Regula-Falsi method to determine the natural frequencies, respectively. In numerical examples, the hinged-hinged, hinged-clamped, clamped-hinged and clamped-clamped end constraints are considered. The convergence analysis is conducted for determining the available step size in the Improved Euler method. The validation of theories developed herein is also conducted by comparing the numerical results between this study and SAP 90. The non-dimensional frequency parameters are presented as the non-dimensional system parameters: section ratio, modulus parameter and load parameter. Also typical mode shapes are presented.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2005.04a
• /
• pp.359-366
• /
• 2005

Most engineering optimization are based on numerical linear and nonlinear programming methods that require substantial gradient information and usually seek to improve the solution in the neighborhood of a starting point. These algorithm, however, reveal a limited approach to complicated real-world optimization problems. If there is more than one local optimum in the problem, the result may depend on the selection of an initial point, and the obtained optimal solution may not necessarily be the global optimum. This paper describes a new harmony search(HS) meta-heuristic algorithm-based approach for structural size optimization problems with continuous design variables. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. Two classical space truss optimization problems are presented to demonstrate the effectiveness and robustness of the HS algorithm. The results indicate that the proposed approach is a powerful search and optimization technique that may yield better solutions to structural engineering problems than those obtained using current algorithms.

• Journal of Information Processing Systems
• /
• v.8 no.3
• /
• pp.437-444
• /
• 2012

In this paper, we propose a method for predicting a user's location based on their past movement patterns. There is no restriction on the length of past movement patterns when using this method to predict the current location. For this purpose, a modified search tree has been devised. The search tree is constructed in an effective manner while it additionally learns the movement patterns of a user one by one. In fact, the time complexity of the learning process for a movement pattern is linear. In this process, the search tree expands to take into consideration more details about the movement patterns when a pattern that conflicts with an existing trained pattern is found. In this manner, the search tree is trained to make an exact matching, as needed, for location prediction. In the experiments, the results showed that this method is highly accurate in comparison with more complex and sophisticated methods. Also, the accuracy deviation of users of this method is significantly lower than for any other methods. This means that this method is highly stable for the variations of behavioral patterns as compared to any other method. Finally, 1.47 locations were considered on average for making a prediction with this method. This shows that the prediction process is very efficient.

• Proceedings of the IEEK Conference
• /
• 2001.06b
• /
• pp.373-376
• /
• 2001

This paper has been studied a real-time video frame data processing control that used the linear systolic array for motion estimation. The proposed data control processing provides to the input data into the multiple processor array unit(MPAU) from search area and reference block data. The proposed data control architecture has based on two slice band for input data processing. And it has no required external control logic blocks for input data as like reference block or search area data.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1995.06a
• /
• pp.141-145
• /
• 1995

Code excited linear prediction speech coders exhibit good performance at data rates as low as 4800 bps. The major drawback to CELP type coders is their large computational requirements. In this paper, we propose a new codebook search method that preserves the quality of the CELP vocoder with reduced complexity. The basic idea is to restrict the searching range of the random codebook by using a searching technique of the regular pulse excitation. Applying the proposed method to the CELP vocoder, we can get approximately 48% complexity reduction in the codebook search.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.246-252
• /
• 2010

A binary linear integer program is formulated for the problem of expanding the capacity of a fiber optic network and routing the traffic to deliver new interactive multimedia services. A two-phase Lagrangian dual search procedure and a Lagrangian heuristic are developed. Computational results show superior performance of the two-phase subgradient optimization compared with the conventional one-phase approach.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.3
• /
• pp.28-36
• /
• 2009

In this paper, we propose a frame-rate up-conversion method for temporal quality enhancement. The proposed method adaptively changes search range during hierarchical motion estimation and reconstructs hole regions using the proposed bi-direction prediction and linear interpolation. In order to alleviate errors due to inaccurate motion vector estimation, search range is adaptively changed based on reliability and for more accurate, motion estimation is performed in descending order of block variance. After segmentation of background and object regions, for filling hole regions, the pixel values of background regions are reconstructed using linear interpolation and those of object regions are compensated based on the proposed hi-directional prediction. The proposed algorithm is evaluated in terms of PSNR with original uncompressed sequences. Experimental results show that the proposed algorithm is better than conventional methods by around 2dB, and blocky artifacts and blur artifacts are significantly diminished.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.2
• /
• pp.87-93
• /
• 2002

A new approach of constructing a suffix tree $T_s$for the given string S is to construct recursively a suffix tree $ T_0$ for odd positions construct a suffix tree $T_e$ for even positions from $ T_o$ and then merge $ T_o$ and $T_e$ into $T_s$ To construct suffix trees for integer alphabets in linear time had been a major open problem on index data structures. Farach used this approach and gave the first linear-time algorithm for integer alphabets The hardest part of Farachs algorithm is the merging step. In this paper we present a new and simpler merging algorithm based on a coupled BFS (breadth-first search) Our merging algorithm is more intuitive than Farachs coupled DFS (depth-first search ) merging and thus it can be easily extended to other applications.