• 한국항공운항학회지
• /
• 제31권2호
• /
• pp.1-6
• /
• 2023

When landing an aircraft descent-speed, wind around the airport, and regulations are important indicators for the pilot to decide whether to land in the Final Approach. In this study, in order to maintain a decent angle accessible to the airport, the pilot predicts an appropriate decent rate suitable for wind direction, wind speed, and speed to make a stable landing. To confirm this, the decent rate according to the speed and speed of wind was calculated using the information actually measured on the B737NG aircraft and compared with the theoretical figures. The purpose of this study is to ensure that the pilot can make a stable landing at a given FPM (Feet Per Minute) when a visual approach and non-normal approach is required at an airport designed with a somewhat higher descent angle.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1595-1597
• /
• 1987

Two gradient methods, steepest descent method and conjugate gradient descent method, are compar ed through application to vector linear predictors. It is found that the convergence rate of the conju-gate gradient descent method is much faster than that of the steepest descent method.

• Journal of applied mathematics & informatics
• /
• 제20권1_2호
• /
• pp.239-254
• /
• 2006

An efficient descent method for unconstrained optimization problems is line search method in which the step size is required to choose at each iteration after a descent direction is determined. There are many ways to choose the step sizes, such as the exact line search, Armijo line search, Goldstein line search, and Wolfe line search, etc. In this paper we propose a new inexact line search for a general descent method and establish some global convergence properties. This new line search has many advantages comparing with other similar inexact line searches. Moreover, we analyze the global convergence and local convergence rate of some special descent methods with the new line search. Preliminary numerical results show that the new line search is available and efficient in practical computation.

• Journal of the Korean Data and Information Science Society
• /
• 제27권4호
• /
• pp.911-923
• /
• 2016

빅데이터 시대에 머신러닝의 중요성은 더욱 부각되고 있고 로지스틱 회귀는 머신러닝에서 분류를 위한 방법으로 의료, 경제학, 마케팅 및 사회과학 전반에 걸쳐 널리 사용되고 있다. 지금까지 R과 Hadoop의 통합환경인 RHIPE 플랫폼은 설치 및 MapReduce 구현의 어려움으로 인해 거의 연구가 이루지 지지 않았다. 본 논문에서는 대용량 데이터에 대해 로지스틱 회귀 추정을 위한 두가지 알고리즘 즉, Gradient Descent 알고리즘과 Newton-Raphson 알고리즘에 대해 MapReduce로 구현하고, 실제 데이터와 모의실험 데이터를 가지고 이들 알고리즘 간의 성능을 비교하고자 한다. 알고리즘 성능 실험에서 Gradient Descent 알고리즘은 학습률에 크게 의존하고 또한 데이터에 따라 수렴하지 않는 문제를 갖고 있다. Newton-Raphson 알고리즘은 학습률이 불필요 할 뿐만 아니라 모든 실험 데이터에 대해 좋은 성능을 보였다.

• 한국항공우주학회지
• /
• 제49권9호
• /
• pp.781-789
• /
• 2021

본 연구에서는 소형무인기(≤25kg)가 도심 지역에서 비행하고자 할 때 요구되는 고장 빈도를 무인기 추락 시 발생할 수 있는 지상 인명 피해를 기반으로 정량적으로 분석하였다. 도심 지역의 인구 밀도, 차량 교통량, 건폐율, 건물 층수 데이터 및 무인기 추락 궤적 모델링을 이용하여 특정 위치에서 무인기 추락 시 인명 피해를 계산하였고 이를 바탕으로 각 무인기 추락 위치에서 안전성 목표값을 만족하기 위한 최대 허용 가능 무인기 고장 빈도를 계산하였다. 이를 통해 각 무인기 추락 위치별 고장 빈도 요구사항을 맵 형태로 도출할 수 있었다. 최종적으로 최대 허용 가능 무인기 고장 빈도를 몇 구간으로 구분하여 각 구간별 도심 지역 비행 가능 영역을 분석하였다. 영월 지역을 대상으로 했을 때 인구 주거 지역 접근을 위해서는 최소 10^-4 (failure/flight hour) 이하의 무인기 고장 빈도가 요구됨을 확인하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.1033-1036
• /
• 1999

This paper proposes an efficient fault diagnosis for digital circuits using multilayer neural networks. The efficient learning algorithm is also proposed for the multilayer neural network, which is combined the steepest descent for high-speed optimization and the dynamic tunneling for global optimization. The fault-diagnosis system using the multilayer neural network of the proposed algorithm has been applied to the parity generator circuit. The simulation results shows that the proposed system is higher convergence speed and rate, in comparision with system using the backpropagation algorithm based on the gradient descent.

• 한국경영과학회지
• /
• 제16권2호
• /
• pp.118-127
• /
• 1991

In this paper, criteria and algorithms for the optimal service rate in a closed queueing network have been established. The objective is to minimize total cost. It is shown that system throughput is increasing concave over the service rate of a node and cycle time is increasing convex over the set of service times with a single calss of cubsomers. This enables developing an algorithm using a steepest descent method when the cost function for service rate is convex. The efficiency of the algorithm rests on the fact that the steepest descent direction is readily obtained at each iteration from the MVA algorithm. Several numerical examples are presented. The major application of this research is optimization of facility capacity in a manufacturing system.

• 한국콘텐츠학회논문지
• /
• 제4권3호
• /
• pp.99-105
• /
• 2004

이 논문은 다층퍼셉트론의 학습을 빠르게 하기 위한 최적 학습률을 제안한다. 이 학습률은 한 뉴런에 연결된 가중치들에 대한 학습률과, 중간층에 가상의 목표값을 설정하기 위한 학습률로 나타난다. 그 결과, 중간층 가중치의 최적 학습률은 가상의 중간층 목표값 할당 성분과 중간층 오차함수를 최소화 시키고자하는 성분의 곱으로 나타난다. 제안한 방법은 고립단어인식과 필기체 숫자 인식 문제의 시뮬레이션으로 효용성을 확인하였다.

• ETRI Journal
• /
• 제45권1호
• /
• pp.119-130
• /
• 2023

We propose a quantized gradient search algorithm that can achieve global optimization by monotonically reducing the quantization step with respect to time when quantization is composed of integer or fixed-point fractional values applied to an optimization algorithm. According to the white noise hypothesis states, a quantization step is sufficiently small and the quantization is well defined, the round-off error caused by quantization can be regarded as a random variable with identically independent distribution. Thus, we rewrite the searching equation based on a gradient descent as a stochastic differential equation and obtain the monotonically decreasing rate of the quantization step, enabling the global optimization by stochastic analysis for deriving an objective function. Consequently, when the search equation is quantized by a monotonically decreasing quantization step, which suitably reduces the round-off error, we can derive the searching algorithm evolving from an optimization algorithm. Numerical simulations indicate that due to the property of quantization-based global optimization, the proposed algorithm shows better optimization performance on a search space to each iteration than the conventional algorithm with a higher success rate and fewer iterations.

• 항공우주시스템공학회지
• /
• 제17권5호
• /
• pp.11-18
• /
• 2023

The architecture of the Fuel Thermal Management System (FTMS) in a commercial aircraft engine was built to model and simulate the fuel system. The study shows the thermal interactions between the fuel and engine lubrication oil through the mission profile of a high bypass ratio, two-spool turbofan engine. Fuel temperature was monitored as it flowed through each sub-component of the fuel system during the mission. The heat load in the fuel system strongly depended on the fuel flow rate, and was significantly increased for the periods of cruise and descent with decrease of fuel flow rate, rather than for the periods of take-off. Due to the thermal interaction in the pump housing, the fuel temperature at the outlet of the low-pressure pump was increased (4.0, 9.2, and 30.0) % over the case without thermal interaction for take-off, cruise, and descent, respectively.