• Proceedings of the Korean Society for Quality Management Conference
• /
• 2010.04a
• /
• pp.115-120
• /
• 2010

반응표면실험계획들을 평가하기 위한 방법으로서 전형적인 방법이 알파벳최적화이다. 그러나 이러한 알파벳최적화(D-, A-, G-, V-최적화 등)는 하나의 수치이므로 그 유용성에도 불구하고 반응표면실험 계획들이 갖는 추정반응값분산의 분포에 대한 정보에 한계를 갖는다. 이를 극복하고자 하는 대안으로서 그래픽 방법들이 있는데 우리는 그 중에 분위수그림을 애니메이션화한 동적분위수그림을 제안할 수 있고 이 동적분위수그림을 이용하여 반응표면실험계획들이 갖는 추정반응값분산의 분포를 서로 비교, 평가 할 수 있다.

• Journal of the Korean Mathematical Society
• /
• v.43 no.1
• /
• pp.45-63
• /
• 2006

This paper is concerned with a boundary control problem for the vorticity minimization, in which the flow is governed by the stationary two dimensional Stokes equations. We wish to find a mathematical formulation and a relevant process for an appropriate control along the part of the boundary to minimize the vorticity due to the flow. After showing the existence and uniqueness of an optimal solution, we derive the optimality conditions. The differentiability of the state solution in regard to the control parameter shall be conjunct with the necessary conditions for the optimal solution. For the minimizer, an algorithm based on the conjugate gradient method shall be proposed.

• Korean Journal of Mathematics
• /
• v.23 no.2
• /
• pp.293-312
• /
• 2015

We deal with a boundary control problem for the vorticity minimization, in which the ow is governed by the time-dependent two dimensional incompressible Navier-Stokes equations. We derive a mathematical formulation and a process for an appropriate control along the portion of the boundary to minimize the vorticity motion due to the ow in the fluid domain. After showing the existence of an optimal solution, we derive the optimality system for which optimal solutions may be determined. The differentiability of the state solution in regard to the control parameter shall be conjunct with the necessary conditions for the optimal solutions.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.2 no.3
• /
• pp.29-39
• /
• 1992

We investigate a systematic design procedure of automatic rule generation of fuzzy logic based controllers for highly nonlinear dynamic systems such as an engine dynamic modle. By "automatic rule generation" we mean autonomous clustering or collection of such meaningful transitional relations from one conditional subspace to another. During the design procedure, we also consider optimaly control strategies such as minimum squared error, near minimum time, minimum energy or combined performance critiera. Fuzzy feedback control systems designed by our method have the properties of closed-loop stability, robustness under parameter variabitions, and a certain degree of optimality. Most of all, the main advantage of the proposed approach is that reliability can be potentially increased even if a large grain of uncertainty is involved within the control system under consideration. A numerical example is shown in which we apply our strategic fuzzy controller dwsign to a highly nonlinear model of engine idling speed control.d control.

• International Journal of Reliability and Applications
• /
• v.18 no.2
• /
• pp.21-44
• /
• 2017

Accelerated life tests (ALTs) are frequently used in manufacturing industries to evaluate the reliability of products within a reasonable amount of time and cost. Test units are subjected to elevated stresses which yield quick failures. Most of the previous works on designing ALT plans are focused on tests that involve a single stress. Many times more than one stress factor influence the product's functioning. This paper deals with the design of optimum modified ramp-stress ALT plan for Burr type XII distribution with Type-I censoring under two stress factors, viz., voltage and switching rate each at two levels- low and high. It is assumed that usage time to failure is power law function of switching rate, and voltage increases linearly with time according to modified ramp-stress scheme. The cumulative exposure model is used to incorporate the effect of changing stresses. The optimum plan is devised using D-optimality criterion wherein the ${\log}_{10}$ of the determinant of Fisher information matrix is maximized. The method developed has been explained using a numerical example and sensitivity carried out.

• Journal of Communications and Networks
• /
• v.10 no.4
• /
• pp.396-402
• /
• 2008

The use of network coding in wireless networks has been proposed in the literature for energy efficient broadcast. However, the decoding complexity of existing algorithms is too high for low-complexity devices. In this work we formalize the all-to-all information exchange problem and shows how to optimize the transmission scheme in terms of energy efficiency. Furthermore, we prove by construction that there exists O(1) -complexity network coding algorithms for grid networks which can achieve such optimality. We also present low-complexity heuristics for random. topology networks. Simulation results show that network coding algorithms outperforms forwarding algorithms in most cases.

• Communications for Statistical Applications and Methods
• /
• v.26 no.1
• /
• pp.11-25
• /
• 2019

The present paper utilizes auxiliary information to neutralize the effect of non-response for estimating the population mean. Improved ratio type estimators for population mean have been proposed and their properties are studied. These estimators are suggested for both single phase sampling and two phase sampling in presence of non-response. Empirical studies are conducted to validate the theoretical results and demonstrate the performance of the proposed estimators. The proposed estimators are shown to perform better than those used by Cochran (Sampling Techniques (3rd ed), John Wiley & Sons, 1977), Khare and Srivastava (In Proceedings-National Academy Science, India, Section A, 65, 195-203, 1995), Rao (Randomization Approach in Incomplete Data in Sample Surveys, Academic Press, 1983; Survey Methodology 12, 217-230, 1986), and Singh and Kumar (Australian & New Zealand Journal of Statistics, 50, 395-408, 2008; Statistical Papers, 51, 559-582, 2010) under the derived optimality condition. Suitable recommendations are put forward for survey practitioners.

• Journal of applied mathematics & informatics
• /
• v.40 no.5_6
• /
• pp.857-871
• /
• 2022

In this work, we formulated a mathematical model for divorce in marriage and extended in to an optimal control model. Firstly, we qualitatively established the model positivity and boundedness. Also we saw sensitivity analysis of the model and identified the positive and negative indices parameters. An optimal control model were developed by incorporating three time dependent control strategies (couple relationship education, reducing getting married too young & consulting separators to renew their marriage) on the deterministic model. The Pontryagin's maximum principle were used for the derivation of necessary conditions of the optimal control problem. Finally, with Newton's forward and backward sweep method numerical simulation were performed on optimality system by considering four integrated strategies. So that we reached to a result that using all three strategies simultaneously (the strategy D) is an optimal control in order to effectively control marriage divorce over a specified period of time. From this we conclude that, policymakers and stakeholders should use the indicated control strategy at a time in order to fight against Divorce in a population.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2022.11a
• /
• pp.351-356
• /
• 2022

Among the path planning methods used to generate the ship's path, the graph search-based method is widely used because it has the advantage of its completeness, optimality. In order to apply the graph-based search method to the berthing path plan, the deviation from the path must be minimized. Path following suitability should be considered essential, since path deviation during berthing can lead to collisions with berthing facilities. However, existing studies of graph search-based berthing path planning are dangerous for application to real-world navigation environments because they produce results with a course change just before berthing. Therefore, in this paper, we develop a cost function suitable for path following, and propose a 3D A* algorithm that applies it. In addition, in order to evaluate the suitability for the actual operating environment, the results of the path generation of the algorithm are compared with the trajectory of the data collected by manned operations.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.10
• /
• pp.582-590
• /
• 2000

A fast optimal path planning algorithm using the analog Cellular Nonlinear Circuits(CNC) is proposed. The analog circuits based optimal path planning is very useful since most of the optimal path planning problems require real time computation. There has already been a previous study to implement the dynamic programming with analog circuits. However, it could not be applied for the practically large size of problems since the algorithm employs the mechanism of reducing its input current/voltage by the amount of cost, which causes outputs of distant cells to become zero. In this study, a subgoal-based dynamic programming algorithm to compute the optimal path is proposed. In the algorithm, the optimal paths are computed regardless of the distance between the starting and the goal points. It finds subgoals starting from the starting point when the output of the starting cell is raised from its initial value. The subgoal is set as the next initial position to find the next subgoal until the final goal is reached. The global optimality of the proposed algorithm is discussed and two different kinds of simulations have been done for the proposed algorithm.