• 한국산업정보학회논문지
• /
• 제23권3호
• /
• pp.131-142
• /
• 2018

Since income growth rate and poverty level are related, there is a possibility that the poverty rate may converge in the long run steady state as well. If the poverty rate converges, then for this study the state that begins with the high poverty rate would have a higher poverty reduction rate. To examine the convergence of poverty rate among the US states, this study uses two times series methodologies. First, in order to prevent the power loss from ignoring the structural break when testing for a unit root in a single time series, this study employs the newly developed panel LM unit root tests with level and trend shifts. The results of unit root tests of the log of poverty rate without allowing for structural breaks show that twenty six states reject the null hypothesis of unit root test for the ADF test, twenty five states for the LM test, and thirty five states for the RALS-LM test. The result of unit root tests that allow one structural break shows that the null hypothesis of a unit root test is rejected for twenty two states with the LM test, and thirty three states with the RALS-LM test. This supports poverty rates are converging among US states.

• East Asian Economic Review
• /
• 제25권4호
• /
• pp.403-424
• /
• 2021

AdaBoost tweaks the sample weight for each training set used in the iterative process, however, it is demonstrated that it provides more correlated errors as the boosting iteration proceeds if models' accuracy is high enough. Therefore, in this study, we propose a novel way to improve the performance of the existing AdaBoost algorithm by employing heterogeneous models and a stochastic twist. By employing the heterogeneous ensemble, it ensures different models that have a different initial assumption about the data are used to improve on diversity. Also, by using a stochastic algorithm with a decaying convergence rate, the model is designed to balance out the trade-off between model prediction performance and model convergence. The result showed that the stochastic algorithm with decaying convergence rate's did have a improving effect and outperformed other existing boosting techniques.

• 한국추진공학회:학술대회논문집
• /
• 한국추진공학회 2009년도 제33회 추계학술대회논문집
• /
• pp.511-514
• /
• 2009

본 연구에서는 경사진 그레인 포트 형상을 가진 고체 연료를 사용한 하이브리드 로켓의 연소 특성을 실험적으로 고찰하였다. 수렴 형상의 그레인 포트를 가지는 연료를 사용함으로써 경사각이 없는 연료에 비해 후퇴율을 17.5% 증가시킬 수 있었으나 확산 형상 연료에서는 후퇴율의 차이가 없었다. 또한 수렴 형상을 사용한 경우 특성속도 효율이 증가하였으며 이를 통해 하이브리드 로켓 연료에서 수렴 형상의 그레인 포트가 연소 효율 및 성능을 개선하는데 효과적임을 확인하였다.

• 한국컴퓨터정보학회논문지
• /
• 제24권3호
• /
• pp.29-39
• /
• 2019

In this study, we introduce a model that satisfies energy efficiency and economical efficiency by introducing and demonstrating cogeneration generators in industrial complexes using various actual data collected at the site. The proposed model is composed of three scenarios, ie, full - time operation, scenario operated according to demand, and a fusion type. In this study, the power generation profit and surplus thermal energy are measured according to the operation of the generator, and the thermal energy is traded according to the demand of the customer to calculate the profit and loss including the heat and evaluate the economic efficiency. As a result of the study, it is relatively profitable to reduce the generation of the generator under the condition that the electricity rate is low and the gas rate is high, while the basic charge is not increased. On the contrary, if the electricity rate is high and the gas rate is low, The more you start up, the more profit you can see. These results show that even a cogeneration power plant with a low economic efficiency due to a low "spark spread" has sufficient economic value if it can sell more than a certain amount of heat energy from a nearby customer and adjust the applied power through peak management.

• 한국항행학회논문지
• /
• 제3권2호
• /
• pp.167-173
• /
• 1999

본 논문에서는 적응 sidelobe canceller에 Howells-Applebaum과 DMI 알고리즘을 적용하여 수렴속도와 간섭제거 성능을 알아보았다. Applebaum 알고리즘은 계산상의 간단함으로 많이 이용되어지지만 수렴속도가 느리고 eigenvalue spread에 영향을 받는다. 반면에 DMI는 Applebaum 알고리즘에 비해 빠른 수렴속도를 보이나 계산 및 구현이 복잡하다. 빠른 수렴속도와 우수한 간섭제거성능을 요구하는 적응 SLC(sidelobe canceller)에 이 두 알고리즘을 적용하여 성능 및 계산의 복잡성을 비교해 보고 적응 SLC에 DMI 알고리즘이 더 적합함을 보인다.

• 한국전자통신학회논문지
• /
• 제4권3호
• /
• pp.224-229
• /
• 2009

본 논문은 LMS 알고리즘을 이용하여 적응횡단선 필터의 수렴 속도를 향상시키기 위한 효율적인 신호간섭 제어기법을 제안한다. 수신 데이터를 재사용하여 심볼 시간 주기에 계수들을 곱함으로써 적응되는 제안된 알고리즘의 수렴특성이 수렴 속도의 향상을 이론적으로 증명하기 위해 분석한다, 스텝-크기 매개변수 ${\mu}$가 증가됨에 따라 LMS 알고리즘의 수렴 속도가 제어된다. 고유치확산을 증가시킴에 따라 적응 등화기의 수렴속도를 천천히 제어하고 평균 자승 에러의 안정-상태 값을 증가시키는 효과를 나타내며 데이터-재사용 LMS 알고리즘이 적응횡단선 필터의 수렴속도를 (B+1)배만큼 증가시켜 신호간섭제어의 우수성을 입증한다.

• 한국정보전자통신기술학회논문지
• /
• 제6권2호
• /
• pp.88-94
• /
• 2013

본 논문은 LMS 알고리즘의 수렴 속도를 향상시키기 위한 효율적인 신호간섭 제어기법을 제안한다. 수신 데이터를 재활용하여 심볼 시간 주기에 계수들을 곱함으로써 적응되는 제안된 알고리즘의 수렴특성이 수렴 속도의 향상을 이론적으로 증명하기 위해 분석한다. 스텝-크기 매개변수 ${\mu}$가 증가 됨에 따라 알고리즘의 수렴 속도가 제어된다. 고유치 확산을 증가시킴에 따라 적응 등화기의 수렴속 도를 천천히 제어하고 평균 자승 에러의 안정-상태 값을 증가시키는 효과를 나타내며 데이터-재사 용 LMS 기술이 수렴속도를 (B+1)배만큼 증가시켜 적응 등화기에서 신호간섭제어의 우수성을 입증 한다.

• Kyungpook Mathematical Journal
• /
• 제58권4호
• /
• pp.733-746
• /
• 2018

The concept of f-statistical convergence which is, in fact, a generalization of statistical convergence, has been introduced recently by Aizpuru et al. (Quaest. Math. 37: 525-530, 2014). The main object of this paper is to prove an f-statistical analog of the classical Korovkin type approximation theorem of Boyanov and Veselinov. It is shown that the f-statistical analog is intermediate between the classical theorem and its statistical analog. As an application, we estimate the rate of f-statistical convergence of the sequence of positive linear operators defined from $C^*[0,{\infty})$ into itself.

• 한국통신학회논문지
• /
• 제39A권10호
• /
• pp.585-592
• /
• 2014

It is well known that serial belief propagation (BP) decoding for low-density parity-check (LDPC) codes achieves faster convergence without any increase of decoding complexity per iteration and bit error rate (BER) performance loss than standard parallel BP (PBP) decoding. Serial BP (SBP) decoding, such as horizontal SBP (H-SBP) decoding or vertical SBP (V-SBP) decoding, updates check nodes or variable nodes faster than standard PBP decoding within a single iteration. In this paper, we propose combined horizontal-vertical SBP (CHV-SBP) decoding. By the same reasoning, CHV-SBP decoding updates check nodes or variable nodes faster than SBP decoding within a serialized step in an iteration. CHV-SBP decoding achieves faster convergence than H-SBP or V-SBP decoding. We compare these decoding schemes in details. We also show in simulations that the convergence rate, in iterations, for CHV-SBP decoding is about $\frac{1}{6}$ of that for standard PBP decoding, while the convergence rate for SBP decoding is about $\frac{1}{2}$ of that for standard PBP decoding. In simulations, we use recently proposed generalized LDPC (GLDPC) codes with binary cyclic codes (BCC).

• 대한수학회지
• /
• 제43권4호
• /
• pp.815-828
• /
• 2006

Let {$V_{nk},\;k\;{\geq}\;1,\;{\geq}\;1$} be an array of rowwise independent random elements which are stochastically dominated by a random variable X with $E\|X\|^{\frac{\alpha}{\gamma}+{\theta}}log^{\rho}(\|X\|)\;<\;{\infty}$ for some ${\rho}\;>\;0,\;{\alpha}\;>\;0,\;{\gamma}\;>\;0,\;{\theta}\;>\;0$ such that ${\theta}+{\alpha}/{\gamma}<2$. Let {$a_{nk},k{\geq}1,n{\geq}1$) be an array of suitable constants. A complete convergence result is obtained for the weighted sums of the form $\sum{^\infty_k_=_1}\;a_{nk}V_{nk}$.