• Environmental and Resource Economics Review
• /
• v.30 no.4
• /
• pp.581-605
• /
• 2021

The purpose of this study is to provide basic data for improving energy efficiency by estimating the regional energy efficiency in Korea using the stochastic frontier approach beyond the energy intensity that has been traditionally used as an indicator of energy efficiency. In this paper, energy efficiency and energy intensity efficiency were estimated as a stochastic distance function from 1998 to 2018 for 16 cities and provinces in Korea. In addition, the robustness of energy efficiency according to the capital stock estimation methods which had been mixed in previous studies was reviewed. As a result of the analysis, there is a significant change in regional rankings according to the three energy efficiency indicators, so they should be used complementary to each other. Second, while the energy efficiency improved little by little over time, the energy intensity efficiency decreased slightly though. Lastly, energy efficiency by region according to the capital stock estimation method was not robust. Care must be taken in estimating capital stock, which is important in economic analysis.

• Water for future
• /
• v.23 no.1
• /
• pp.89-98
• /
• 1990

This study is developed the runoff analysis method that is used the geomorphologic instantaneous unit hydrograph to the relative role of network geometry in a basin. The quantitative expressions for the geomorphologic characteristics of a basin are used Shreve's link sepration and width function method. The network geometry are used Weibull's distribution as probability model of the width function, the structural characteristics of channel networks and the other geomorphologic parameters for the gaged basin.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.2
• /
• pp.51-51
• /
• 2001

본 논문은 디지털 순서회로 설계시 상태할당 알고리즘 개발에 관한 연구로, 동적 소비전력을 감소시키기 위하여 상태변수의 변화를 최소로 하는 코드를 할당하여 상태코드가 변화하는 스위칭횟수를 줄이도록 하였다. 상태를 할당하는데는 Markov의 확률함수를 이용하여 hamming거리가 최소가 되도록 상태 천이도에서 각 상태를 연결하는 edge에 weight를 정의한 다음, 가중치를 이용하여 각 상태들간의 연결성을 고려하여 인접한 상태들간에는 가능한 적은 비트 천이를 가지도륵 모든 상태를 반복적으로 찾아 계산하였다. 비트 천이의 정도를 나타내기 위하여 cost 함수로 계산한 결과 순서회로의 종류에 따라 Lakshmikant의 알고리즘보다 최고 57.42%를 감소시킬 수 있었다.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.6A
• /
• pp.1001-1011
• /
• 2006

It is a general agreement that exact statistical solutions can be found by a Monte Carlo technique. Due to difficulties, however, in the numerical generation of random fields, which satisfy not only the probabilistic distribution but the spectral characteristics as well, it is recognized as relatively difficult to find an exact response variability of a structural response. In this study, recognizing that the random field assumes a constant over the domain under consideration when the correlation distance tends to infinity, a semi-theoretical solution of response variability is proposed for general structures. In this procedure, the probability density function is directly used. It is particularly noteworthy that the proposed methodology provides response variability for virtually any type of probability density function, and has capability of considering correlations between multiple random variables.

• The Journal of the Acoustical Society of Korea
• /
• v.41 no.6
• /
• pp.662-667
• /
• 2022

Computing music similarity is an indispensable component in developing music search service. This paper focuses on learning a music similarity function in order to boost cover song identification performance. By using the probabilistic linear discriminant analysis, we construct a latent music space where the distances between cover song pairs reduces while the distances between the non-cover song pairs increases. We derive a music similarity function by testing hypothesis, whether two songs share the same latent variable or not, using the probabilistic models with the assumption that observed music features are generated from the learned latent music space. Experimental results performed on two cover music datasets show that the proposed music similarity improves the cover song identification performance.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1996.05d
• /
• pp.405-409
• /
• 1996

본 연구는 일정 지역의 확률론적 지진위험도 (Probabilistic Seismic Hazard) 평가와 관련하여 전문가가 제시한 제1차 입력자료를 이용하여 제2차 입력자료를 도출할 때 입력자료의 다단계화를 통하여 각 단계별 구간의 입력자료가 확률론적 지진위험도 불확실성에 미치는 상대적 영향을 분석하였다. 확률론적 지진위험도 분석을 위하여 미국지질조사연구소 (USGS) 및 미국 로렌스리버모어 연구소(LLNL)가 개발한 전산코드를 각각 이용하였고 또한 전문가가 제시한 제 1차 입력자료는 기존 연구보고서에서 주어진 자료를 이용하였다. 분석결과 지진활동도 변수 특히 지진규모의 각 단계 및 감쇠특성함수의 진앙거리 단계에 따라서 확률론적 지진위험도의 절대값 및 불확실성에 미치는 영향의 차이가 상대적으로 크다는 것이 확인되었다. 또한 부지별로 이러한 분석을 함으로서 확률론적 지진 위험도 곡선에 영향을 미치는 임의 부지에 고유한 임계 지진규모 및 임계 진앙거리에 대한 분석을 통하여 전반적으로 불확실성을 감소시킬 수 있다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.6
• /
• pp.59-68
• /
• 2017

Random process plays a major role in wireless communication system to analytically derive the probability distribution function of the various statistical distribution. In this paper, we derive the decreasing function of the exponential distribution under the given condition which is expressed as wireless channel condition. The probability distribution function of Gaussian, Laplacian, Rayleigh and Nakagami distribution are also derived. Extensive simulation results of these statistical distributions are provided to prove that random process has a significant role in the wireless communications. In addition, the Rayleigh and Rician channels show specific examples of visible distance communication and invisible distance channel environment. This paper is motivated by that we assume a block fading channel model, where the channel is constant during a transmission block and changes independently between consecutive transmission block, can achieve a better performance in high SNR regime with i.i.d channel. This algorithm for realizing these transforms can be applied to the Kronecker MIMO channel.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.19-26
• /
• 2009

In this paper, a minimum Euclidian distance criterion between error PDF and Dirac delta function is introduced and a constant modulus type blind equalizer algorithm based on the criterion is proposed. The proposed algorithm using constant modulus error in place of actual error term of the criterion has superior convergence and steady state MSE performance, and the error signal of the proposed algorithm exhibits more concentrated density function in blind equalization environments. Simulation results indicate that the proposed method can be a reliable candidate for blind equalizer algorithms for multipoint communications.

• Journal of Internet Computing and Services
• /
• v.10 no.1
• /
• pp.11-17
• /
• 2009

Blind equalization techniques have been used in multipoint communication on which the research on the internet has focused. In this paper, a criterion of minimizing Euclidian Distance between two PDFs for adaptive blind equalizers has been presented. In order for ED expressed with Parzen PDFs to be minimized, we propose to use a set of randomly generated desired symbols at the receiver so that the PDF of the generated symbols matches that of the transmitted symbols. From the simulation results, the proposed method has shown superior error performance even in severe channel environments in which CMA has shown severe performance degradation. This indicates that the proposed algorithm can be considered relatively insensitive to ESR variations compared to CMA. As a field of ITL, ED minimization using Parzen PDFs has shown possibilities of being successfully applied to blind equalization.

• Journal of Internet Computing and Services
• /
• v.15 no.4
• /
• pp.119-124
• /
• 2014

Blind adaptive systems based on the Euclidean distance (ED) between the distribution function of the output samples and that of a set of random symbols generated at the receiver matching with the distribution function of the transmitted symbol points estimate the ED at each iteration time to examine its convergence state or its minimum ED value. The problem is that this ED estimation obtained by block?data processing requires a heavy calculation burden. In this paper, a recursive ED estimation method is proposed that reduces the computational complexity by way of utilizing the relationship between the current and previous states of the datablock. The relationship provides a ground that the currently estimated ED value can be used for the estimation of the next ED without the need for processing the whole new data block. From the simulation results the proposed recursive ED estimation shows the same estimation values as that of the conventional method, and in the aspect of computational burden, the proposed method requires only O(N) at each iteration time while the conventional block?processing method does $O(N^2)$.