• Journal of Korea Water Resources Association
• /
• v.41 no.1
• /
• pp.49-63
• /
• 2008

The Bayesian MCMC(Bayesian Markov Chain Monte Carlo) and the MLE(Maximum Likelihood Estimation) methods using a quadratic approximation are applied to perform the at-site low flow frequency analysis at the 4 stage stations (Nakdong, Waegwan, Goryeonggyo, and Jindong). Using the results of two types of the estimation method, the frequency curves including uncertainty are plotted. Eight case studies using the synthetic flow data with a sample size of 100, generated from 2-parmeter Weibull distribution are performed to compare with the results of analysis using the MLE and the Bayesian MCMC. The Bayesian MCMC and the MLE are applied to 36 years of gauged data to validate the efficiency of the developed scheme. These examples illustrate the advantages of the Bayesian MCMC and the limitations of the MLE based on a quadratic approximation. From the point of view of uncertainty analysis, the Bayesian MCMC is more effective than the MLE using a quadratic approximation when the sample size is small. In particular, the Bayesian MCMC is a more attractive method than MLE based on a quadratic approximation because the sample size of low flow at the site of interest is mostly not enough to perform the low flow frequency analysis.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.08a
• /
• pp.93-98
• /
• 1998

자연스러운 한국어 음성을 합성할 수 있는 비정형 합성단위 선택기술 및 접합을 이용한 한국어 합성 시스템의 갭라을 최종 목표로 하고 있다. 이러한 최종 목쵸에 도달하기 위해 본 연구팀에서 검토중인 연구방향과 시스템의 구조 및 이를 토대로 현재까지 진행된 결과를 보고한다. 현재 검토중인 시스템은 입력된 문장으로부터 목적치 패턴을 생성하고, 이에 근사한 임의 길이 합성단위를 대량의 음성DB 로부터 선택하여 접합시키는 방식을 이용하고자 한다. 본 논문에서는 음성의 왜곡을 최소화할 수 있는 비정형 합성단위의 추출법에 관한 검토 결과와 본 연구팀에서 성능평가 중인 F0 자동 생성 알고리즘에 대하여 보고한다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.5
• /
• pp.527-532
• /
• 2005

In this paper, we proposed an adaptive fuzzy sliding control for unknown nonlinear systems using estimation of bounds for approximation errors. Unknown nonlinearity of a system is approximated by the fuzzy logic system with a set of IF-THEN rules whose consequence parameters are adjusted on-line according to adaptive algorithms for the purpose of controlling the output of the nonlinear system to track a desired output. Also, using assumption that the approximation errors satisfy certain bounding conditions, we proposed the estimation algorithms of approximation errors by Lyapunov synthesis methods. The overall control system guarantees that the tracking error asymptotically converges to zero and that all signals involved in controller are uniformly bounded. The good performance of the proposed adaptive fuzzy sliding mode controller is verified through computer simulations on an inverted pendulum system.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.33 no.3
• /
• pp.375-381
• /
• 2023

Fully homomorphic encryption enables algebraic operations on encrypted data, and recently, methods for approximating non-algebraic operations such as the maximum function have been studied. However, precise approximation of max-pooling operations for four or more numbers have not been researched yet. In this study, we propose a precise max-pooling approximation method using the composition of approximate polynomials of the maximum function and theoretically analyze its precision. Experimental results show that the proposed approximate max-pooling has a small amortized runtime of less than 1ms and high precision that matches the theoretical analysis.

• The KIPS Transactions:PartD
• /
• v.19D no.2
• /
• pp.151-160
• /
• 2012

Most of the distributed high-dimensional indexing structures provide a reasonable search performance especially when the dataset is uniformly distributed. However, in case when the dataset is clustered or skewed, the search performances gradually degrade as compared with the uniformly distributed dataset. We propose a method of improving the k-nearest neighbor search performance for the distributed vector approximation-tree based on the strongly clustered or skewed dataset. The basic idea is to compute volumes of the leaf nodes on the top-tree of a distributed vector approximation-tree and to assign different number of bits to them in order to assure an identification performance of vector approximation. In other words, it can be done by assigning more bits to the high-density clusters. We conducted experiments to compare the search performance with the distributed hybrid spill-tree and distributed vector approximation-tree by using the synthetic and real data sets. The experimental results show that our proposed scheme provides consistent results with significant performance improvements of the distributed vector approximation-tree for strongly clustered or skewed datasets.

• Journal of the Society of Naval Architects of Korea
• /
• v.31 no.2
• /
• pp.91-98
• /
• 1994

An efficient optimization procedure combining the frequency approximation technique and the component-mode synthesis method is proposed for the structural dynamic optimization of the large structures subject to prescribed natural frequency constraints. Frequency constraints are approximated by using the first-order sensitivities with respect to both design parameters and their reciprocals. The component-mode synthesis method proposed by the authors in Ref.[8] is used for the repetitive detail finite-element analysis and sensitivity analysis. The validity of the proposed optimization procedure is confirmed through the numerical implementation of some examples. The presented approximation technique requires much smaller number of repetitive analysis than that using the sensitivities with respect to design parameters only, and further improvement in the numerical efficiency is achieved by the adoption of the introduced component-mode synthesis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12C
• /
• pp.1149-1155
• /
• 2007

In this paper, we propose a new overlap and add speech synthesis method which demonstrates improved continuity performance. The proposed method uses a weighted phase error function and minimizes the wave discontinuity of the synthesis signal, rather than the phase discontinuity, to estimate the mid-point phase. Experimental results show that the proposed method improves the continuity between the synthesized signals relative to the existing method.

• 전기의세계
• /
• v.39 no.3
• /
• pp.47-54
• /
• 1990

유한요소법과 경계요소법의 합성으로 전자계 해석을 하는 기법은 각 방법의 장점을 수용하여 경계가 없는 무한영역의 전자장을 분석하는 기법으로서 어떤 복잡하고 어려운 기하학적 구조의 문제도, 비선형이나 비균질성 재질의 문제도 쉽게 formulation이 가능하여 용이하게 해석할 수 있지만 전체 System matrix방정식이 비대칭이며 부분적인 full matrix를 형성하여 계산시간이 길어 진다는 단점도 있다. 적용예에서 보여 준 것과 같이 합성요소법은 그 해가 실제에 근사한 값을 가질수 있다고 생각되며, 계산시간을 단축시키기 위하여 직접법이나 반복법을 사용한 새로운 해법들이 도입되고 있다. 최근에는 system전체 node의 순서를 고려한 NDRA(Nested Dissection Reordering Algorithm)이 도입되고 있고, System matrix자체를 유한 요소법의 형태로 유지시키며 풀수 있는 방법으로 알려진 Absorbin 경계조건을 사용하여 전자파에 대한 해석을 하고 있다. 유한 및 경계요소 합성법은 초고압 옥외용 전력기기의 전자장 해석과 설계, 레이다나 안테나 등의 전자파 해석문제, 초전도 응용, 전력기기의 전자장해석과 설계, 우주공간에서의 전력전송문제 등을 쉽게 model화하여 적용할 수 있을 것이다.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.545-557
• /
• 2001

In this paper we propose a hierarchical classification algorithm based on rough membership function which can reason a new object approximately. We use the fuzzy reasoning method that substitutes fuzzy membership value for linguistic uncertainty and reason approximately based on the composition of membership values of conditional sttributes Here we use the rough membership function instead of the fuzzy membership function It can reduce the process that the fuzzy algorithm using fuzzy membership function produces fuzzy rules In addition, we transform the information system to the understandable minimal decision information system In order to do we, study the discretization of continuous valued attributes and propose the discretization algorithm based on the rough membership function and the entropy of the information theory The test shows a good partition that produce the smaller decision system We experimented the IRIS data etc. using our proposed algorithm The experimental results with IRIS data shows 96%~98% rate of classification.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.227-233
• /
• 2000

In this paper, we present a new high-level data path synthesis algorithm which solves the two design problems, namely, scheduling and allocation, with power minimization as a key design parameter. From the observations in previous works on data path synthesis for low power, we derive an integer programming (IP) formulation for the problem, from which we then develop an efficient heuristic to carry out the scheduling and allocation simultaneously. Our experimental results demonstrate that the proposed algorithm is very effective in saving power consumption of circuits significantly.