• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.12
• /
• pp.698-704
• /
• 2003

Autoreclosure provides a mean of improving power transmitting ability and system stability. The conventional reclosure adopts the fixed dead time interval strategy, that is, the reclosure is activated after a time delay to restore the system to normal as quickly as possible without regard to the system conditions, however, these simple techniques cannot give the optimal operating performance. For this reason, various adaptive reclosure algorithms have been proposed recently, This paper presents an adaptive autoreclosure algorithm including the variable dead time, optimal reclosure, sequential reclosure and emergency extended equal-area criterion (EEAC) algorithm in order to improve the system stability. The reclosure algorithm performs out the operations that are attuned to the power system conditions. The proposed adaptive reclosure algorithm is verified and tested by using EMTP MODELS, and the simulation results show that the system oscillations are reduced and the transient stability is enhanced by employing the proposed adaptive reclosure algorithm.

• International Journal of Reliability and Applications
• /
• v.2 no.4
• /
• pp.241-251
• /
• 2001

In this paper, optimal bum-in time to minimize the total mean cost, which is the sum of manufacturing cost with burn-in and cumulative warranty-related cost, is obtained. When the products with cumulative pro-rata warranty have high failure rate in the early period (infant mortality period), a burn-in procedure is adopted to eliminate early product failures. After burn-in, the posterior product life distribution and the warranty-related cost are dependent on burn-in time; long burn-in period may reduce the warranty-related cost, but it increases the manufacturing cost. The paper provides a methodology to obtain total mean cost under burn-in and cumulative pro-rata warranty. Property of the optimal burn-in time is analyzed, and numerical examples and sensitivity analysis are studied.

• Journal of Integrative Natural Science
• /
• v.9 no.3
• /
• pp.206-214
• /
• 2016

The basic goal of software development is to produce high quality software at low cost. Therefore, when to stop software testing and release the software product is a significant point in the software development. The software cost model is an effective tool used to help software developers control costs and determine the release time. In this paper, we discuss the cost model to apply all 6 models with consideration of time to remove errors, cost of removing each error and risk cost due to software failure. We show the impact of cost coefficients and parameter values on the expected total cost by changing the values and comparing the optimal release times.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.399-405
• /
• 2002

Now days, it is based on GIS and GPS, it can search for the shortest path and estimation of arrival time by using the internet and cell phone to driver. But, even though good car navigation system does not create which is the shortest path when there average vehicle speed is 10 -20 Km. Therefore In order to reduce vehicle waiting time and average vehicle speed, we suggest optimal green time algorithm using fuzzy adaptive control , where there are different traffic intersection length and lane. In this paper, it will be able to forecast the optimal traffic Information, estimation of destination arrival time, under construction road, and dangerous road using internet.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.615-621
• /
• 1999

On the aspect of on-time and development resource use, it is very important to predict the software release time during the software development process. In this paper, we present the optimal release problem based on the evaluation indicator and cost evaluation. And also we show the optimal release point considered with both of them. We applied the Exponential Software Reliability Growth Model(E-SRGM) and Testing-effort dependent Software Reliability Growth Model(Te-SRGM) and decided the software release time according to software reliability indicator. As a result of two models comparison, we verify the Te-SRGM is more adopted in our switching system software.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.3 s.96
• /
• pp.215-221
• /
• 1999

The object of the thermal error compensation system in machine tools is improving the accuracy of a machine tool through real time error compensation. The accuracy of the machine tool totally depends on the accuracy of thermal error model. A thermal error model can be obtained by appropriate combination of temperature variables. The proposed method for optimal variable selection in the thermal error model is based on correlation grouping and successive regression analysis. Collinearity matter is improved with the correlation grouping and the judgment function which minimizes residual mean square is used. The linear model is more robust against measurement noises than an engineering judgement model that includes the higher order terms of variables. The proposed method is more effective for the applications in real time error compensation because of the reduction in computational time, sufficient model accuracy, and the robustness.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.6
• /
• pp.128-136
• /
• 1995

The problem addressed in this paper is that of the on-line computational burden of time-optimal control laws for quick, strongly nonlinear systems like revolute robots. It will be demonstrated that a large amount of off-line computation can be substituted for most of the on-line burden in cases of time optimization with constrained inputs if differential point-to- point specifications can be relaxed to cell-to-cell transitions. These cells result from a coarse discretization of likely swaths of state space into a set of nonuniform, contiguous volumes of relatively simple shapes. The cell boundaries approximate stream surfaces of the phase fluid and surfaces of equal transit times. Once the cells have been designed, the bang- bang schedules for the inputs are determined for all likely starting cells and terminating cells. The scheduling process is completed by treating all cells into which the trajectories might unex- pectedly stray as additional starting cells. Then an efficient-to-compute control law can be based on the resulting table of optimal strategies.

• Journal of the military operations research society of Korea
• /
• v.2 no.1
• /
• pp.177-184
• /
• 1976

As the organizational size of a military service or business increases and its management becomes complex, the success in its management depends less on static type of management but more on careful, dynamic type of management. In this thesis, an operations research technique is applied to the problems of determining optimal air traffic control rule and of optimal capacity of air base for a military air base. An airport runway is regarded as the service facility in a queueing mechanism, used by landing, low approach, and departing aircraft. The usual order of service gives priority different classes of aircraft such as landings, departures, and low approaches; here service disciplines are considered assigning priorities to different classes of aricraft grouped according to required runway time. Several such priority rules are compared by means of a steady-state queueing model with non-preemptive priorities. From the survey conducted for the thesis development, it was found that the flight pattern such as departure, law approach, and landing within a control zone, follows a Poisson distribution and the service time follows an Erlang distribution. In the problem of choosing the optimal air traffic control rule, the control rule of giving service priority to the aircraft with a minimum average waiting cost, regardless of flight patterns, was found to be the optimal one. Through a simulation with data collected at K-O O Air Base, the optimal take-off interval and the optimal capacity of aircraft to be employed were determined.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.1
• /
• pp.137-143
• /
• 2019

As the performance of computers increases, the use of deep learning, which has faced technical limitations in the past, is becoming more diverse. In many fields, deep learning has contributed to the creation of added value and used on the bases of more data as the application become more divers. The process for obtaining a better performance model will require a longer time than before, and therefore it will be necessary to find an optimal model that shows the best performance more quickly. In the artificial neural network modeling a tuning process that changes various elements of the neural network model is used to improve the model performance. Except Gride Search and Manual Search, which are widely used as tuning methods, most methodologies have been developed focusing on heuristic algorithms. The heuristic algorithm can get the results in a short time, but the results are likely to be the local optimal solution. Obtaining a global optimal solution eliminates the possibility of a local optimal solution. Although the Brute Force Method is commonly used to find the global optimal solution, it is not applicable because of an infinite number of hyper parameter combinations. In this paper, we use a statistical technique to reduce the number of possible cases, so that we can find the global optimal solution.

• Nuclear Engineering and Technology
• /
• v.54 no.5
• /
• pp.1712-1725
• /
• 2022

For improving the seismic performance of the nuclear power plant (NPP) piping system, attempts have been made to apply a dynamic absorber (DA). However, the current piping DA design method is limited because it cannot provide the globally optimum values for the target design seismic loading. Therefore, this study proposes a seismic time history analysis-based DA optimal design method for piping. To this end, the Kriging approach is introduced to reduce the numerical cost required for seismic time history analyses. The appropriate design of the experiment method is used to increase the efficiency in securing response data. A gradient-based method is used to efficiently deal with the multi-dimensional unconstrained optimization problem of the DA optimal design. As a result, the proposed method showed an excellent response reduction effect in several responses compared to other optimal design methods. The proposed method showed that the average response reduction rate was about 9% less at the maximum acceleration, about 5% less at the maximum value of the response spectrum, about 9% less at the maximum relative displacement, and about 4% less at the maximum combined stress compared to existing optimal design methods. Therefore, the proposed method enables an effective optimal DA design method for mitigating seismic response in NPP piping in the future.