• Journal of the Korean Statistical Society
• /
• v.5 no.2
• /
• pp.109-118
• /
• 1976

현행 일반적으로 쓰여지고 있는 물가지수 산식은 기준시점의 거래량(또는 거래금액)을 상품별 가중치(weight)로 삼는 가중총합방식(weighted aggregate formula, 또는 가중산술평균산식)으로서의 Laspeyres식이라 함은 주지하는 바와 같다. 그것이 상품별로 유통면의 중요성을 분명히 감안하여 있고, 비교시점의 가격변동만이 계산에 반영된다는 점에 있어서 물가지수로서의 실용성이 널리 인정되어 있는 산식이다. 그러나 Lasperyres식의 난점을 또한 많은 것이니 그 가운데 특히 가중치의 고정성과 관련하여 기준시점의 이동에 따른 전후 물가지수의 비연결성은 결정적 결함이라 할 수 있다. 여기에 이 식의 지수적 허구성이 흔히 논의되고, 이른바 Paasche check라 하여 수시로 조사한 거래량(또는 거래금액)에 의하여 물가지수의 가중치로 삼아서 전자를 검정하는 방법도 쓰여지는 형편이다. 필지는 일찌기(1973년) Laspeyres식의 상품별 가중치에 관한 객관적 평가법의 하나로서 산업(따라서 상품)의 연관분석적 수단에 의한 약간의 시안을 발표한 바 없지 않았다. 그것은 요약컨대 산업연관분석에 쓰이는 투입계수표를 중심삼아 한 상품가격이 다른 상품가격에 미치는 파급효과, 따라서 물가에 미치는 파급력을 계산하고, 나아가서 각 상품의 수요 및 공급함수를 도입하여 그들 계수를 추정함으로써 가중치의 객관화를 꾀해 본 것이 전고의 골자이다.

• The Journal of the Acoustical Society of Korea
• /
• v.43 no.2
• /
• pp.200-206
• /
• 2024

Computing music similarity is an indispensable component in developing music search service. This paper proposes a relevance weight of each chromagram vector for cover song identification in computing a music similarity function in order to boost identification accuracy. We derive a music similarity function using the relevance weight based on the probabilistic relevance model, where higher relevance weights are assigned to less frequently-occurring discriminant chromagram vectors while lower weights to more frequently-occurring ones. Experimental results performed on two cover music datasets show that the proposed music similarity improves the cover song identification performance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.2
• /
• pp.105-110
• /
• 2018

This paper compare the adaptive equalization performance of NM-MMA (Novel Mixed-MMA) algorithm which using the mixed const function by scaling factor values. The mixed cost function of NM-MMA composed of the appropriate weighted addition of gradient vector in the MMA and SE-MMA cost function, and updating the tap coefficient based on these function, it is possible to improve the convergence speed and MSE value of current algorithm. The computer simulation was performed in the same channel, step size, SNR environment by changing the scaling factor, and its performance were compared appling the equalizer output constellation, residual isi, MD, MSE, SER. As a result of computer simulation, the residual values of performance index were reduced in case of the scaling factor of MMA cost function was greater than the scaling factor of SE-MMA. and the convergence speed was improved in case of the scaling factor of SE-MMA was greater than the MMA.

• Journal of the Korea Society for Simulation
• /
• v.19 no.2
• /
• pp.91-98
• /
• 2010

Conventional path-finding has focused on finding short collision-free paths. However, as computer games become more sophisticated, it is required to take tactical information like ambush points or lines of enemy sight into account. One way to make this information have an effect on path-finding is to represent a heuristic function of a search algorithm as a weighted sum of tactics. In this paper we consider the problem of learning heuristic to optimize path-finding based on given tactical information. What is meant by learning is to produce a good weight vector for a heuristic function. Training examples for learning are given by a game level-designer and will be compared with search results in every search level to update weights. This paper proposes a learning algorithm integrated with search for tactical path-finding. The perceptron-like method for updating weights is described and a simulation tool for implementing these is presented. A level-designer can mark desired paths according to characters' properties in the heuristic learning tool and then it uses them as training examples to learn weights and shows traces of paths changing along with weight learning.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.12
• /
• pp.55-62
• /
• 2009

This paper proposes a decision method of fuzzy weights by utilizing degrees of contribution in order to classify insect footprint patterns having difficulties to classify species clearly. Insect footprints revealed delicately in the form of scattered spots since they are very small. Therefore it is not easy to define shape of footprints unlike other species, and there are lots of noises in the footprint patterns so that it is difficult to distinguish those from correct data. For these reasons, the extracted feature set has obvious feature values with some uncertain feature values, so we estimate weights according to degrees of contribution. If the one of feature values has distinct difference enough to decide a class among other classes, high weight is assigned to make classification. A calculated weight determines the membership values by fuzzy functions and objects are classified into the class having a superior value.atu present experimental resultseighrontribution. Iinsect footprints with noises by the proposed method.

• Journal of KIISE:Software and Applications
• /
• v.32 no.1
• /
• pp.1-9
• /
• 2005

In this paper we propose a modified fuzzy min-max neural network model for pattern classification and discuss the usefulness of the model. We define a new hypercube membership function which has a weight factor to each of the feature within a hyperbox. The weight factor makes it possible to consider the degree of relevance of each feature to a class during the classification process. Based on the proposed model, a knowledge extraction method is presented. In this method, a list of relevant features for a given class is extracted from the trained network using the hyperbox membership functions and connection weights. Ft)r this purpose we define a Relevance Factor that represents a degree of relevance of a feature to the given class and a similarity measure between fuzzy membership functions of the hyperboxes. Experimental results for the proposed methods and discussions are presented for the evaluation of the effectiveness and feasibility of the proposed methods.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.5
• /
• pp.855-867
• /
• 2022

As the need for a deep learning accelerator increases with the development of IoT equipment, research on the implementation and safety verification of the deep learning accelerator is actively. In this paper, we propose a new side channel analysis methodology for secret information that overcomes the limitations of the previous study in Usenix 2019. We overcome the disadvantage of limiting the range of weights and restoring only a portion of the weights in the previous work, and restore the IEEE754 32bit single-precision with 99% accuracy with a new method using CPA. In addition, it overcomes the limitations of existing studies that can reverse activation functions only for specific inputs. Using deep learning, we reverse activation functions with 99% accuracy without conditions for input values with a new method. This paper not only overcomes the limitations of previous studies, but also proves that the proposed new methodology is effective.

• Journal of Institute of Control, Robotics and Systems
• /
• v.1 no.2
• /
• pp.83-87
• /
• 1995

본 논문에서는 이산시간 LQ 조절기의 안정도 강인성을 주파수 영역및 시간영역에서 고찰하고 그 향상책을 제시하낟. 주파수영역에서 강인성 척도인 궤환차행렬(return difference matrix) 의 최소특이치가 상태가중치 행렬과 제어가중치 행렬의 비와 반비례함을 보이고, 시간영역에서 매개변수의 변화에 대한 안정도 강인성 범위들을 얻는다. 이 범위들의 점근적 성질을 밝히기 위하여 LQ 궤환이득의 특이치들이 상태가중치 행렬과 제어기중치 행렬의 비의 증가함수 임을 보인다. 몇가지 조건하에서 시스템 행렬(입력행렬)에 대한 안정도 강인성 범위가 상태 가중치 행렬과 제어가중치 행렬의 비가 증가(감소)함에 따라서 증가함을 보이고, 이러한 사실들을 예제를 통하여 검증한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.305-307
• /
• 2000

본 논문에서는 다층 퍼셉트론 신경망에서 연결선 수를 최소로 하면서 일반화 성능을 향상시키기 위해 가장 널리 쓰여지고 있는 Optimal Brain Surgeon을 이용한 프루닝(pruning)을 기반으로 하여 오차 함수의 가중치 감소항을 추가시키는 방법을 사용한다. 이때 학습 및 프루닝의 성능에 많은 영향을 미치는 가중치 감소항의 방영정도를 베이시안 테크닉에 기반하여 적응적으로 최적화 하는 방법을 제안한다. 제안하는 방법의 성능을 검증하기 위해 벤치마크 데이터를 이용하여 실험을 수행하였다. 순수한 OBS 방법과 고정된 반영정도를 가진 가중치 감소항을 추가시킨 OBS, 그리고 제안하는 적응적 가중치 감소항을 적용한 OBS 방법을 비교하여 제한하는 방법이 기존의 두 방법에 비해 신경망 구조의 최적화 능력이 뛰어남을 확인할 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.811-813
• /
• 2004

본 논문에서는, 고유 얼굴 분포를 기반으로 하여 퍼지 이론을 이용한 얼굴 인식 기법을 제안한다 고유 얼굴의 가중치값들에 대해 각각의 분포를 이용한 소속도 함수가 계산되며. 소속도 함수를 통해 계산된 소속도는 신경망을 통해 학습된다.