• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.3
• /
• pp.33-40
• /
• 1992

In this paper, We designed a 2-stage amplifier for transponder of satellite with dual GaAs FETs NE13783, and performed the worst-case analysis for circuit qualification in the space environment. The bandwidth of amplifier was chosen 11.7-12.2 GHz which is the down link frequency band for domestic Ku-band satellite communication, and the alumina substrate with 25 mil of thickness. The design and optimization of amplifier was achieved by the commercial CAD program TOUCHSTONE and the measurement was performed through the automatic network analyzer.

• International Journal of Aeronautical and Space Sciences
• /
• v.15 no.1
• /
• pp.63-73
• /
• 2014

For robust stability analysis of parameters uncertainty missiles, the traditional frequency domain method can only analyze each respective channel at several interval points within uncertain parameter space. Discontinuous calculation and couplings between channels will lead to inaccurate analysis results. A method based on the ${\nu}$-gap metric is proposed, which is able to comprehensively evaluate the robust stability of missiles with uncertain parameters; and then a genetic-simulated annealing hybrid optimization algorithm, which has global and local searching ability, is used to search for a parameters combination that leads to the worst stability within the space of uncertain parameters. Finally, the proposed method is used to analyze the robust stability of a re-entry missile with uncertain parameters; the results verify the feasibility and accuracy of the method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4595-4610
• /
• 2020

In the practical communication environment, the accurate channel state information (CSI) is difficult to obtain, which will cause the mismatch of resource and degrade the system performance. In this paper, to account for the channel uncertainties, a robust power allocation scheme for a downlink Non-orthogonal multiple access (NOMA) heterogeneous network (HetNet) is designed to maximize energy efficiency (EE), which can ensure the quality of service (QoS) of users. We conduct the robust optimization model based on worse-case method, in which the channel gains belong to certain ellipsoid sets. To solve the non-convex non-liner optimization, we transform the optimization problem via Dinkelbach method and sequential convex programming, and the power allocation of small cell users (SCUs) is achieved by Lagrange dual approach. Finally, we analysis the convergence performance of proposed scheme. The simulation results demonstrate that the proposed algorithm can improve total EE of SCUs, and has a fast convergence performance.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.1
• /
• pp.37-43
• /
• 2010

In this paper, a reliability-based design optimization is developed for the topology design of linear structures using a performance measure approach. Spatial domain is discretized using three dimensional Reissner-Mindlin plate elements and design variable is taken as the material property of each element. A continuum based adjoint variable method is employed for the efficient computation of sensitivity with respect to the design and random variables. The performance measure approach of RBDO is employed to evaluate the probabilistic constraints. The topology optimizationproblem is formulated to have probabilistic displacement constraints. The uncertainties such as material property and external loads are considered. Numerical examples show that the developed topology optimization method could effectively yield a reliable design, comparing with the other methods such as deterministic, safety factor, and worst case approaches.

• Management Science and Financial Engineering
• /
• v.13 no.1
• /
• pp.35-53
• /
• 2007

We consider a(worst-case) robust optimization version of the Economic Order Quantity(EOQ) model. Order setup costs and inventory carrying costs are assumed to have uncertainty in their values, and the uncertainty description of the two parameters is supposed to be given by an ellipsoidal representation. A genetic algorithm combined with Monte Carlo simulation is proposed to approximate the ellipsoidal representation. The objective function of the model under ellipsoidal uncertainty description is derived, and the resulting problem is solved by another genetic algorithm. Computational test results are presented to show the performance of the proposed method.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.383-391
• /
• 2005

The paper is devoted to some flow shop scheduling problems, where job processing times are defined by functions dependent on their positions in the schedule. An example is constructed to show that the classical Johnson's rule is not the optimal solution for two different models of the two-machine flow shop scheduling to minimize makespan. In order to solve the makespan minimization problem in the two-machine flow shop scheduling, we suggest Johnson's rule as a heuristic algorithm, for which the worst-case bound is calculated. We find polynomial time solutions to some special cases of the considered problems for the following optimization criteria: the weighted sum of completion times and maximum lateness. Some furthermore extensions of the problems are also shown.

• The Journal of Korea Robotics Society
• /
• v.19 no.1
• /
• pp.45-52
• /
• 2024

This paper introduces an approach to enhance the performance of magnetic manipulation systems for microrobot actuation. A variety of eight-electromagnet configurations have been proposed to date. The previous study revealed that achieving 5 degrees of freedom (5-DOF) control necessitates at least eight electromagnets without encountering workspace singularities. But so far, the research considering the influence of iron cores embedded in electromagnets has not been conducted. This paper offers a novel approach to optimizing electromagnet configurations that effectively consider the influence of iron cores. The proposed methodology integrates probabilistic optimization with finite element methods (FEM), using Bayesian Optimization (BO). The Bayesian optimization aims to optimize the worst-case magnetic force generation for enhancing the performance of magnetic manipulation system. The proposed simulation-based model achieves approximately 20% improvement compared to previous systems in terms of actuation performance. This study has the potential for enhancing magnetic manipulation systems for microrobot control, particularly in medical and microscale technology applications.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.14-35
• /
• 1991

The purpose of this study is to develop an efficient exact algorithm for the problem of scheduling n in dependent jobs on m unequal parallel processors to minimize makespan. Efficient solutions are already known for the preemptive case. But for the non-preemptive case, this problem belongs to a set of strong NP-complete problems. Hence, it is unlikely that the polynomial time algorithm can be found. This is the reason why most investigations have bben directed toward the fast approximate algorithms and the worst-case analysis of algorithms. Recently, great advances have been made in mathematical theories regarding Lagrangean relaxation and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining these mathematical tools with branch-and-bound procedures, these have been some successes in constructing pseudo-polynomial time algorithms for solving previously unsolved NP-complete problems. This study applied similar methodologies to the unequal parallel processor problem to find the efficient exact algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.13-35
• /
• 1991

The purpose of this study is to develop an efficient exact algorithm for the problem of scheduling n in dependent jobs on m unequal parallel processors to minimize makespan. Efficient solutions are already known for the preemptive case. But for the non-preemptive case, this problem belongs to a set of strong NP-complete problems. Hence, it is unlikely that the polynomial time algorithm can be found. This is the reason why most investigations have bben directed toward the fast approximate algorithms and the worst-case analysis of algorithms. Recently, great advances have been made in mathematical theories regarding Lagrangean relaxation and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining these mathematical tools with branch-and-bound procedures, these have been some successes in constructing pseudo-polynomial time algorithms for solving previously unsolved NP-complete problems. This study applied similar methodologies to the unequal parallel processor problem to find the efficient exact algorithm.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.21 no.2
• /
• pp.344-348
• /
• 2012

The knuckle crane design in Korea has been performed by assuming a cantilever beam type structure and numerically analyzing design data and finally improving the stiffness by replacing material. In our study, a complete finite element model of the knuckle crane is constructed and finite element analysis is conducted using Optistruct. Structural optimization to reduce the weight of the knuckle crane is processed by applying maximum loading condition at the largest radius of motion, which is the worst case of loading condition. As the results, existing over stiff design in a knuckle crane is corrected to meet a desired design limit and overall weight is reduced, which eventually leads to a reduction of $CO_2$ emission.