• Title/Summary/Keyword: Time Weighted Algorithm

Search Result 311, Processing Time 0.024 seconds

Design of Fuzzy-Neural Networks Structure using HCM and Optimization Algorithm (HCM 및 최적 알고리즘을 이용한 퍼지-뉴럴네트워크구조의 설계)

  • Yoon, Ki-Chang;Park, Byoung-Jun;Oh, Sung-Kwun
    • Proceedings of the KIEE Conference
    • /
    • 1998.11b
    • /
    • pp.654-656
    • /
    • 1998
  • This paper presents an optimal identification method of nonlinear and complex system that is based on fuzzy-neural network(FNN). The FNN used simplified inference as fuzzy inference method and Error Back Propagation Algorithm as learning rule. And we use a HCM Algorithm to find initial parameters of membership function. And then to obtain optimal parameters, we use the genetic algorithm. Genetic algorithm is a random search algorithm which can find the global optimum without converging to local optimum. The parameters such as membership functions, learning rates and momentum coefficients are easily adjusted using the genetic algorithms. Also, the performance index with weighted value is introduced to achieve a meaningful balance between approximation and generalization abilities of the model. To evaluate the performance of the FNN, we use the time series data for 9as furnace and the sewage treatment process.

  • PDF

Decentralized Moving Average Filtering with Uncertainties

  • Song, Il Young
    • Journal of Sensor Science and Technology
    • /
    • v.25 no.6
    • /
    • pp.418-422
    • /
    • 2016
  • A filtering algorithm based on the decentralized moving average Kalman filter with uncertainties is proposed in this paper. The proposed filtering algorithm presented combines the Kalman filter with the moving average strategy. A decentralized fusion algorithm with the weighted sum structure is applied to the local moving average Kalman filters (LMAKFs) of different window lengths. The proposed algorithm has a parallel structure and allows parallel processing of observations. Hence, it is more reliable than the centralized algorithm when some sensors become faulty. Moreover, the choice of the moving average strategy makes the proposed algorithm robust against linear discrete-time dynamic model uncertainties. The derivation of the error cross-covariances between the LMAKFs is the key idea of studied. The application of the proposed decentralized fusion filter to dynamic systems within a multisensor environment demonstrates its high accuracy and computational efficiency.

Two variations of cross-distance selection algorithm in hybrid sufficient dimension reduction

  • Jae Keun Yoo
    • Communications for Statistical Applications and Methods
    • /
    • v.30 no.2
    • /
    • pp.179-189
    • /
    • 2023
  • Hybrid sufficient dimension reduction (SDR) methods to a weighted mean of kernel matrices of two different SDR methods by Ye and Weiss (2003) require heavy computation and time consumption due to bootstrapping. To avoid this, Park et al. (2022) recently develop the so-called cross-distance selection (CDS) algorithm. In this paper, two variations of the original CDS algorithm are proposed depending on how well and equally the covk-SAVE is treated in the selection procedure. In one variation, which is called the larger CDS algorithm, the covk-SAVE is equally and fairly utilized with the other two candiates of SIR-SAVE and covk-DR. But, for the final selection, a random selection should be necessary. On the other hand, SIR-SAVE and covk-DR are utilized with completely ruling covk-SAVE out, which is called the smaller CDS algorithm. Numerical studies confirm that the original CDS algorithm is better than or compete quite well to the two proposed variations. A real data example is presented to compare and interpret the decisions by the three CDS algorithms in practice.

Vocal separation method using weighted β-order minimum mean square error estimation based on kernel back-fitting (커널 백피팅 알고리즘 기반의 가중 β-지수승 최소평균제곱오차 추정방식을 적용한 보컬음 분리 기법)

  • Cho, Hye-Seung;Kim, Hyoung-Gook
    • The Journal of the Acoustical Society of Korea
    • /
    • v.35 no.1
    • /
    • pp.49-54
    • /
    • 2016
  • In this paper, we propose a vocal separation method using weighted ${\beta}$-order minimum mean wquare error estimation (WbE) based on kernel back-fitting algorithm. In spoken speech enhancement, it is well-known that the WbE outperforms the existing Bayesian estimators such as the minimum mean square error (MMSE) of the short-time spectral amplitude (STSA) and the MMSE of the logarithm of the STSA (LSA), in terms of both objective and subjective measures. In the proposed method, WbE is applied to a basic iterative kernel back-fitting algorithm for improving the vocal separation performance from monaural music signal. The experimental results show that the proposed method achieves better separation performance than other existing methods.

NO-WAIT OR NO-IDLE PERMUTATION FLOWSHOP SCHEDULING WITH DOMINATING MACHINES

  • WANG JI BO;XIA ZUN QUAN
    • Journal of applied mathematics & informatics
    • /
    • v.17 no.1_2_3
    • /
    • pp.419-432
    • /
    • 2005
  • In this paper we study the no-wait or no-idle permutation flowshop scheduling problem with an increasing and decreasing series of dominating machines. The objective is to minimize one of the five regular performance criteria, namely, total weighted completion time, maximum lateness, maximum tardiness, number of tardy jobs and makespan. We establish that these five cases are solvable by presenting a polynomial-time solution algorithm for each case.

A Study on the Characteristics of noise smoothing in FIR-Median Hybrid Filters (메디안 혼성 필터의 잡음 특성 개선)

  • 최삼길;김창규;전계록;김명기;변건식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.11
    • /
    • pp.1185-1198
    • /
    • 1992
  • In this paper, the differential weighted algorithm proposed in order to improve th noise smoothing characteristics of conventional Median filter and FIR-Median Hybrid filter. Performance of some image restoration filter(median filter, FIR-Median Hybird filter, FIR-Median Hybrid filter to proposed differential weighted algorithm) are compared and evaluated on the noise smoothing characteristics and sharp edge conservation characteristics. Test and Real images used in this paper are Lenna and Urological images corrupted by impulse, gaussian, exponential and laplacian noise. Experimental results show that the FIR-Median Hybrid filter applied to the differential weighted algorithm are comparatively superior to others. But the filter orders have increased, the more time consumed to image processing. Hence if the adequate filtering by the type of image is selected. now after a great support will be take consideration into the various parts of application by computer science and of medical image processing.

  • PDF

Enhanced Spectral Envelope Coding Scheme Using Inter-frame Correlation for G.729.1 (G.729.1 코더에서 프레임 간의 상호상관 관계를 이용한 개선된 스펙트럼 포락 코딩 방법)

  • Cho, Keun-Seok;Sung, Jong-Mo;Hahn, Min-Soo;Kim, Young-Il;Jeong, Sang-Bae
    • Phonetics and Speech Sciences
    • /
    • v.1 no.4
    • /
    • pp.97-103
    • /
    • 2009
  • This paper describes a new algorithm for encoding spectral envelope in the time domain alias cancellation (TDAC) part of G.729.1. The spectral envelope and modified discrete cosine transform (MDCT) coefficients of the weighted code-excited linear predictive (CELP) coding error in lower-band and the higher-band input signal are encoded in the TDAC part. In order to reduce allocation bits for spectral envelope coding, a new algorithm using sub-band correlation between adjacent frames is proposed. In addition, to improve the quality of decoded signals, two bit allocation strategies using reduced bits from the proposed algorithm are proposed. The performance of the proposed algorithm is evaluated in terms of objective quality and bit reduction rates. Experimental results show that the proposed algorithm increases the quality of sounds significantly.

  • PDF

An Eulerian Cycle Algorithm for Chinese Postman Problem

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.7
    • /
    • pp.47-52
    • /
    • 2016
  • This paper introduces an algorithm to construct an Eulerian cycle for Chinese postman problem. The Eulerian cycle is formed only when all vertices in the graph have an even degree. Among available algorithms to the Eulerian cycle problem, Edmonds-Johnson's stands out as the most efficient of its kind. This algorithm constructs a complete graph composed of shortest path between odd-degree vertices and derives the Eulerian cycle through minimum-weight complete matching method, thus running in $O({\mid}V{\mid}^3)$. On the contrary, the algorithm proposed in this paper selects minimum weight edge from edges incidental to each vertex and derives the minimum spanning tree (MST) so as to finally obtain the shortest-path edge of odd-degree vertices. The algorithm not only runs in simple linear time complexity $O({\mid}V{\mid}log{\mid}V{\mid})$ but also obtains the optimal Eulerian cycle, as the implementation results on 4 different graphs concur.

A Three-Step Preprocessing Algorithm for Enhanced Classification of E-Mail Recommendation System (이메일 추천 시스템의 분류 향상을 위한 3단계 전처리 알고리즘)

  • Jeong Ok-Ran;Cho Dong-Sub
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.54 no.4
    • /
    • pp.251-258
    • /
    • 2005
  • Automatic document classification may differ significantly according to the characteristics of documents that are subject to classification, as well as classifier's performance. This research identifies e-mail document's characteristics to apply a three-step preprocessing algorithm that can minimize e-mail document's atypical characteristics. In the first 5go, uncertain based sampling algorithm that used Mean Absolute Deviation(MAD), is used to address the question of selection learning document for the rule generation at the time of classification. In the subsequent stage, Weighted vlaue assigning method by attribute is applied to increase the discriminating capability of the terms that appear on the title on the e-mail document characteristic level. in the third and last stage, accuracy level during classification by each category is increased by using Naive Bayesian Presumptive Algorithm's Dynamic Threshold. And, we implemented an E-Mail Recommendtion System using a three-step preprocessing algorithm the enable users for direct and optimal classification with the recommendation of the applicable category when a mail arrives.

Intelligent Tuning of PID Controller With Disturbance RejectionUsing Immune Algorithm

  • Kim, Dong-Hwa;Cho, Jae-Hoon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.885-890
    • /
    • 2004
  • Strictly maintaining the steam temperature can be difficult due to heating value variation to the fuel source, time delay changes in the main steam temperature, the change of the dynamic characteristics in the reheater. Up to the present time, PID Controller has been used to operate this system. However, it is very difficult to achieve an optimal PID gain with no experience, since the gain of the PID controller has to be manually tuned by trial and error. This paper focuses on tuning of the Controller with disturbance rejection for thermal power plant using immune based multiobjective approach. An ITSE(Integral of time weighted squared error) is used to decide performance of tuning results.

  • PDF