• International Journal of Naval Architecture and Ocean Engineering
• /
• v.11 no.1
• /
• pp.82-96
• /
• 2019

A semi-submersible structure has been widely used for offshore drilling and production of oil and gas. The small water plane area makes the structure very sensitive to weight increase in terms of payload and stability. Therefore, it is necessary to lighten the substructure from the early design stage. This study aims at an optimization of hull structure based on a sophisticated yield and buckling strength in accordance with classification rules. An in-house strength assessment system is developed to automate the procedure such as a generation of buckling panels, a collection of required panel information, automatic buckling and yield check and so on. The developed system enables an automatic yield and buckling strength check of all panels composing the hull structure at each iteration of the optimization. Design variables are plate thickness and stiffener section profiles. In order to overcome the difficulty of large number of design variables and the computational burden of FE analysis, various methods are proposed. The steepest descent method is selected as the optimization algorithm for an efficient search. For a reduction of the number of design variables and a direct application to practical design, the stiffener section variable is determined by selecting one from a pre-defined standard library. Plate thickness is also discretized at 0.5t interval. The number of FE analysis is reduced by using equations to analytically estimating the stress changes in gradient calculation and line search steps. As an endeavor to robust optimization, the number of design variables to be simultaneously optimized is divided by grouping the scantling variables by the plane. A sequential optimization is performed group by group. As a verification example, a central column of a semi-submersible structure is optimized and compared with a conventional optimization of all design variables at once.

• Structural Engineering and Mechanics
• /
• v.87 no.3
• /
• pp.255-272
• /
• 2023

Spatial cable systems can provide more transverse stiffness and torsional stiffness without sacrificing the vertical bearing capacity compared with conventional vertical cable systems, which is quite lucrative for long-span earth-anchored suspension bridges' development. Higher economy highlights the importance of refined form-finding analysis. Meanwhile, the internal connection between the lateral and vertical sags has not yet been specified. Given this, an analytic algorithm of form-finding for the earth-anchored suspension bridge with spatial cables is proposed in this paper. Through the geometric compatibility condition and mechanical equilibrium condition, the expressions for cable segment, the recurrence relationship between catenary parameters and control equations of spatial cable are established. Additionally, the nonlinear general reduced gradient method is introduced into fast and high-precision numerical analysis. Furthermore, the analytic expression of the lateral and vertical sags is deduced and discussed. This is very significant for the space design above the bridge deck and the optimization of the sag-to-span ratio in the preliminary design stage of the bridge. Finally, the proposed method is verified with the aid of two examples, one being an operational self-anchored suspension bridge (with spatial cables and a 260 m main span), and the other being an earth-anchored suspension bridge under design (with spatial cables and a 500 m main span). The necessity of an iterative calculation for hanger tensions on earth-anchored suspension bridges is confirmed. It is further concluded that the main cable and their connected hangers are in very close inclined planes.

• Journal of the Korean Geotechnical Society
• /
• v.40 no.4
• /
• pp.127-135
• /
• 2024

The purpose of this paper is to establish the relationship between compression wave velocity and porosity in unsaturated soil using a deep neural network (DNN) algorithm. Input parameters were examined using the error norm method to assess their impact on porosity. Compression wave velocity was conclusively found to have the most significant influence on porosity estimation. These parameters were derived through both field and laboratory experiments using a total of 266 numerical data points. The application of the DNN was evaluated by calculating the mean squared error loss for each iteration, which converged to nearly zero in the initial stages. The predicted porosity was analyzed by splitting the data into training and validation sets. Compared with actual data, the coefficients of determination were exceptionally high at 0.97 and 0.98, respectively. This study introduces a methodology for predicting dependent variables through error norm analysis by disregarding fewer sensitive factors and focusing on those with greater influence.

• Korean Journal of Optics and Photonics
• /
• v.16 no.3
• /
• pp.182-190
• /
• 2005

The fiber Raman amplifier(FRA) is a distinctly advantageous technology. Due to its wider, flexible gain bandwidth, and intrinsically lower noise characteristics, FRA has become an indispensable technology of today. Various FRA modeling methods, with different levels of convergence speed and accuracy, have been proposed in order to gain valuable insights for the FRA dynamics and optimum design before real implementation. Still, all these approaches share the common platform of coupled ordinary differential equations(ODE) for the Raman equation set that must be solved along the long length of fiber propagation axis. The ODE platform has classically set the bar for achievable convergence speed, resulting exhaustive calculation efforts. In this work, we propose an alternative, highly efficient framework for FRA analysis. In treating the Raman gain as the perturbation factor in an adiabatic process, we achieved implementation of the algorithm by deriving a recursive relation for the integrals of power inside fiber with the effective length and by constructing a matrix formalism for the solution of the given FRA problem. Finally, by adiabatically turning on the Raman process in the fiber as increasing the order of iterations, the FRA solution can be obtained along the iteration axis for the whole length of fiber rather than along the fiber propagation axis, enabling faster convergence speed, at the equivalent accuracy achievable with the methods based on coupled ODEs. Performance comparison in all co-, counter-, bi-directionally pumped multi-channel FRA shows more than 102 times faster with the convergence speed of the Average power method at the same level of accuracy(relative deviation < 0.03dB).

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.6 s.109
• /
• pp.562-573
• /
• 2006

It is required to reduce the peak-to-average power ratio(PAPR) in an orthogonal frequency division multiplexing system or a multicarrier system. And it is needed to eliminate the transmission of the side information in the Partial Transmit Sequences. So, in this paper, a new technique is proposed, where the subcarriers used for the multiple signal representation are only utilized for the reduction of PAPR to eliminate the burden of transmitting the side information. That is, it is proposed by taking the modified minimization criteria of partial transmit sequences scheme instead of using the convex optimization or the fast algorithm of tone reservation(TR) technique As the result of simulation, the PAPR reduction capability of the proposed method is improved by 3.2 dB dB, 3.4 dB, 3.6 dB with M=2, 4, 8(M is the number of partition in the so-called partial transmit reduction sequences(PTRS)), when the iteration number of fast algorithm of TR is 10 and the data rate loss is 5 %. But it is degraded in the capability of PAPR reduction by 3.4 dB, 3.1 dB, 2.2 dB, comparing to the TR when the data rate loss is 20 %. Therefore, the proposed method is outperformed the TR technique with respect to the complexity and PAPR reduction capability when M=2.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.23 no.1
• /
• pp.21-29
• /
• 2003

It is very important to reduce the computational time in estimating the parameters of vision control algorithm for robot's position control in real time. Unfortunately, the batch estimation commonly used requires too murk computational time because it is iteration method. So, the batch estimation has difficulty for robot's position control in real time. On the other hand, the Extended Kalman Filtering(EKF) has many advantages to calculate the parameters of vision system in that it is a simple and efficient recursive procedures. Thus, this study is to develop the EKF algorithm for the robot's vision control in real time. The vision system model used in this study involves six parameters to account for the inner(orientation, focal length etc) and outer (the relative location between robot and camera) parameters of camera. Then, EKF has been first applied to estimate these parameters, and then with these estimated parameters, also to estimate the robot's joint angles used for robot's operation. finally, the practicality of vision control scheme based on the EKF has been experimentally verified by performing the robot's position control.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.2
• /
• pp.96-107
• /
• 1999

The generalized sidelobe cancellers(GSC's) ar used for suppressing an interference in array radar. The frequency-domain GSC's have a faster convergence rate than the time-domain GSC's because they remove the correlation between the interferences using a frequency-domain least mean square(LMS) algorithm. However, we have not fully used the advantage of the frequency-domain GSC's since we have always updated the weights of all frequency bins, even the interferer free frequency bin. In this paper, we propose a new frequency-domain GSC based on constant false-alarm rate(CFAR) detector, of which GSC adaptively determine the bin whose weight is updated according to the power of each frequency bin. This canceller updates the weight of only updated according to the power of each frequency bin. This canceller updates the weight of only the bin of which the power is high because of the interference signal. The computer simulation shows that the new GSC reduces the iteration number for convergence over the conventional GSC's by more than 100 iterations. The signal-to-noise ration(SNR) improvement is more than 5 dB. Moreover, the number of renewal weights required for the adaptation is much fewer than that of the conventional one.

• Journal of Korea Water Resources Association
• /
• v.41 no.9
• /
• pp.895-905
• /
• 2008

To analyze hydrologic processes in a watershed requires both various geographical data and hydrological time series data. Recently, not only geographical data such as DEM(Digital Elevation Model) and hydrologic thematic map but also hydrological time series from numerical weather prediction and rainfall radar have been provided as grid data, and there are studies on hydrologic analysis using these grid data. In this study, GRM(Grid based Rainfall-runoff Model) which is physically-based distributed rainfall-runoff model has been developed to simulate short term rainfall-runoff process effectively using these grid data. Kinematic wave equation is used to simulate overland flow and channel flow, and Green-Ampt model is used to simulate infiltration process. Governing equation is discretized by finite volume method. TDMA(TriDiagonal Matrix Algorithm) is applied to solve systems of linear equations, and Newton-Raphson iteration method is applied to solve non-linear term. Developed model was applied to simplified hypothetical watersheds to examine model reasonability with the results from $Vflo^{TM}$. It was applied to Wicheon watershed for verification, and the applicability to real site was examined, and simulation results showed good agreement with measured hydrographs.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.1
• /
• pp.37-47
• /
• 2008

Exploitation of address generation units which are typically provided in DSPs plays an important role in DSP code generation since that perform fast address computation in parallel to the central data path. Offset assignment is optimization of memory layout for program variables by taking advantage of the capabilities of address generation units, consists of memory layout generation and address pointer assignment steps. In this paper, we propose an effective address pointer assignment method to minimize the number of address calculation instructions in DSP code generation. The proposed approach reduces the time complexity of a conventional address pointer assignment algorithm with fixed memory layouts by using minimum cost-nodes breaking. In order to contract memory size and processing time, we employ a powerful pruning technique. Moreover our proposed approach improves the initial solution iteratively by changing the memory layout for each iteration because the memory layout affects the result of the address pointer assignment algorithm. We applied the proposed approach to about 3,000 sequences of the OffsetStone benchmarks to demonstrate the effectiveness of the our approach. Experimental results with benchmarks show an average improvement of 25.9% in the address codes over previous works.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.20 no.6
• /
• pp.751-759
• /
• 2007

We have developed several methods for the optimization problem having large-scale and highly nonlinear system. First, step by step method in optimization process was employed to improve the convergence. In addition, techniques of furnishing good initial guesses for analysis using sensitivity information acquired from optimization iteration, and of manipulating analysis/optimization convergency criterion motivated from simultaneous technique were used. We applied them to flow control problem and verified their efficiency and robustness. However, they are based on quasi-Newton method that approximate the Hessian matrix using exact first derivatives. However solution of the Navier-Stokes equations are very cost, so we want to improve the efficiency of the optimization algorithm as much as possible. Thus we develop a true Newton method that uses exact Hessian matrix. And we apply that to the three-dimensional problem of flow around a sphere. This problem is certainly intractable with existing methods for optimal flow control. However, we can attack such problems with the methods that we developed previously and true Newton method.