• 한국항행학회논문지
• /
• 제18권4호
• /
• pp.288-295
• /
• 2014

현재 사용 중인 계기착륙장치(ILS)는 시스템 특성상 동시에 다수의 입항하는 항공기가 사용하기 어렵고, 활주로 방향별로 장비들이 설치되어야 한다. 또한 착륙하는 항공기들이 일정한 구역에서 단일 비행경로만으로 착륙절차가 구성되어야 한다는 한계점이 있다. 이에 항공 교통량이 증가하게 된다면 입항하는 항공기들의 체공 시간이 더욱 증가하게 될 것이다. 이러한 한계점을 보완하기 위해 GNSS를 이용한 착륙시설로 GBAS가 개발 되었다. 본 논문에서는 비행시험 전 시뮬레이터를 이용하여 태안 비행장에서 실제 사용 하고 있는 항공기 착륙절차와 Curved approach를 이용한 절차를 비교 하였다. 비교 결과 Curved approach 절차를 이용하게 되면 기존절차보다 비행시간이 감소되어 연료 및 소음공역회피 등과 같은 효과가 일어 날 수 있을 것으로 판단된다.

• 한국윤활학회:학술대회논문집
• /
• 한국윤활학회 2002년도 proceedings of the second asia international conference on tribology
• /
• pp.399-400
• /
• 2002

A numerical procedure for analyzing thermo-elastic contact applied to an automotive disk brake and calculating subsurface stress distribution has been developed. The proposed procedure takes the advantage of the simplex algorithm to save computing time. Flamant's solution and Boussinesq's solution are adopted as Green function in analysis. Comparing the numerical results with the exact solutions has proved the validity of this procedure.

• 한국경영과학회지
• /
• 제19권3호
• /
• pp.203-217
• /
• 1994

In this paper we develop an exponentialization procedure for the modelling of open FMS networks with general processing time at each station and limited buffer size. By imposing a reasonable assumption on the solution set, the nonlinear equation system for the exponentialization procedure is formulated as a variational inequality problem and the solution existence is examined. The efficient algorithm for the nonlinear equation system is developed using linearized Jacobi approximation method.

• Management Science and Financial Engineering
• /
• 제12권1호
• /
• pp.127-142
• /
• 2006

In this paper, we present a frequency reassignment problem (FRP) that arises when we add new base stations to resolve hot-spots or to expand the coverage of a code division multiple access (CDMA) network. For this problem, we develop an integer programming (IP) model along with some valid inequalities and preprocessing rules. Also, we develop an effective heuristic procedure that solves two sub-problems induced from the original problem in repetition. Computational results show that the proposed heuristic procedure finds a feasible solution of good quality within reasonable computation time. Also, the lower bound by-produced from the heuristic procedure is quite strong.

• 대한의용생체공학회:의공학회지
• /
• 제8권2호
• /
• pp.205-214
• /
• 1987

In this paper, a mathmatical model for the purpose of QRS detection is considered in the case of the occurence of nonoverlappjng pulse-shaped waveforms corrupted with white noise. The number of waveform, the arrival times, amplitudes, and widths of QRS complexes are regarded as random variables. The joint MAP estimation of all the unknown Quantities consists of linear filtering followed by an optimization procedure. Because the optimization procedure is time-consuming, this procedure is modified so that a threshold test is obtained.

• Journal of the Korean Data and Information Science Society
• /
• 제6권2호
• /
• pp.41-50
• /
• 1995

In this paper, an iterative procedure, which detects the location of the outliers and the joint estimates of the outliers effects and the model parameters in the autoregressive moving average model with two types of outliers, is proposed. The performance of the procedure is compared with the one in Chen and Liu(1993) through the Monte Carlo simulation. The proposed procedure is very robust in the sense that applies the procedures to the stationary time series model with any types of outliers.

• Journal of Chest Surgery
• /
• 제8권1호
• /
• pp.9-12
• /
• 1975

Four patients with postpneumonectomy empyema were treated successfully by modification of Clagett`procedure. Their primary diseases were chronic bronchiectasis, empyema with bronchopleural fisula, pulmonary tuberculosis, and pyohemothorax. The time interval between 1st and 2nd operation was 26.5 months in average. The pleural space was irrigated with various kinds of antiseptic solutions for 23.3 days in average and debrided, filled with antibiotic saline solution. After the procedure, patients had no recurrences of empyema and discharged from hospital after brief days. (averages: 15.5 days)

• Structural Engineering and Mechanics
• /
• 제24권6호
• /
• pp.683-698
• /
• 2006

The accurate dynamic analysis of concrete arch dams relies heavily on employing a three-dimensional semi-infinite fluid element. The usual method for calculating the impedance matrix of this fluid hyper-element is dependent on the solution of a complex eigen-value problem for each frequency. In the present study, an efficient procedure is proposed which simplifies this procedure amazingly, and results in great computational time saving. Moreover, the accuracy of this technique is examined thoroughly and it is concluded that efficient procedure is incredibly accurate under all practical conditions.

• 대한산업공학회지
• /
• 제27권2호
• /
• pp.135-139
• /
• 2001

A process control procedure is suggested when screening inspection is performed with a surrogate variable correlated with the performance variable. Assuming bivariate normal distribution for the performance and screening variable, the procedure is designed on the basis of the time required for detecting process shift.

• ETRI Journal
• /
• 제24권5호
• /
• pp.360-372
• /
• 2002

In this paper, we propose the modified dynamic weighted round robin (MDWRR) cell scheduling algorithm, which guarantees the delay property of real-time traffic and also efficiently transmits non-real-time traffic. The proposed scheduling algorithm is a variation of the dynamic weighted round robin (DWRR) algorithm and guarantees the delay property of real-time traffic by adding a cell transmission procedure based on delay priority. It also uses a threshold to prevent the cell loss of non-real-time traffic that is due to the cell transmission procedure based on delay priority. Though the MDWRR scheduling algorithm may be more complex than the conventional DWRR scheme, considering delay priority minimizes cell delay and decreases the required size of the temporary buffer. The results of our performance study show that the proposed scheduling algorithm has better performance than the conventional DWRR scheme because of the delay guarantee of real-time traffic.