• 제목/요약/키워드: Information Error

검색결과 11,144건 처리시간 0.033초

On statistical properties of some dierence-based error variance estimators in nonparametric regression with a finite sample

  • Park, Chun-Gun
    • Journal of the Korean Data and Information Science Society
    • /
    • 제22권3호
    • /
    • pp.575-587
    • /
    • 2011
  • We investigate some statistical properties of several dierence-based error variance estimators in nonparametric regression model. Most of existing dierence-based methods are developed under asymptotical properties. Our focus is on the exact form of mean and variance for the lag-k dierence-based estimator and the second-order dierence-based estimator in a nite sample size. Our approach can be extended to Tong's estimator (2005) and be helpful to obtain optimal k.

A Study on Error Detection Algorithm of COD Measurement Machine

  • Choi, Hyun-Seok;Song, Gyu-Moon;Kim, Tae-Yoon
    • Journal of the Korean Data and Information Science Society
    • /
    • 제18권4호
    • /
    • pp.847-857
    • /
    • 2007
  • This paper provides a statistical algorithm which detects COD (chemical oxygen demand) measurement machine error on real-time. For this we propose to use regression model fitting and check its validity against the current observations. The main idea is that the normal regression relation between COD measurement and other parameters inside the machine will be violated when the machine is out of order.

  • PDF

의사결정나무의 현실적인 상황에서의 팩(PAC) 추론 방법 (PAC-Learning a Decision Tree with Pruning)

  • 김현수
    • Asia pacific journal of information systems
    • /
    • 제3권1호
    • /
    • pp.155-189
    • /
    • 1993
  • Empirical studies have shown that the performance of decision tree induction usually improves when the trees are pruned. Whether these results hold in general and to what extent pruning improves the accuracy of a concept have not been investigated theoretically. This paper provides a theoretical study of pruning. We focus on a particular type of pruning and determine a bound on the error due to pruning. This is combined with PAC (Probably Approximately Correct) Learning theory to determine a sample size sufficient to guarantee a probabilistic bound on the concept error. We also discuss additional pruning rules and give an analysis for the pruning error.

  • PDF

Jammer와 부호 상관 효과를 고려한 FH/FSK성능 분석에 관한 연구 (A Study on the Performance of FH/FSK Including Jammer and Code Correlation Effects)

  • 안중수;박진수
    • 한국통신학회논문지
    • /
    • 제16권5호
    • /
    • pp.424-433
    • /
    • 1991
  • In the noncoherent FH/FSK system presence of the multitione jamming and noise, in the case random and 송 structures jamming model, the performance analyzed that random and struetured jamming derived error proability. It is found that error probability and performance when error corecting code used Hamming. BCH, Convolutional code under the worst case partial band jamming interference.

  • PDF

Forecasting Internet Traffic by Using Seasonal GARCH Models

  • Kim, Sahm
    • Journal of Communications and Networks
    • /
    • 제13권6호
    • /
    • pp.621-624
    • /
    • 2011
  • With the rapid growth of internet traffic, accurate and reliable prediction of internet traffic has been a key issue in network management and planning. This paper proposes an autoregressive-generalized autoregressive conditional heteroscedasticity (AR-GARCH) error model for forecasting internet traffic and evaluates its performance by comparing it with seasonal autoregressive integrated moving average (ARIMA) models in terms of root mean square error (RMSE) criterion. The results indicated that the seasonal AR-GARCH models outperformed the seasonal ARIMA models in terms of forecasting accuracy with respect to the RMSE criterion.

Parallel Writing and Detection for Two Dimensional Magnetic Recording Channel

  • 장용;이재진
    • 한국통신학회논문지
    • /
    • 제37A권10호
    • /
    • pp.821-826
    • /
    • 2012
  • Two-dimensional magnetic recording (TDMR) is treated as the next generation magnetic recording method, but because of its high channel bit error rate, it is difficult to use in practices. In this paper, we introduce a new writing method that can decrease the nonlinear media error effectively, and it can also achieve 10 Tb/$in^2$ of user bit density on a magnetic recording medium with 20 Teragrains/$in^2$.

적응형 FEC(Adaptive Forward Error Correction)를 이용한 에러 복구에 관한 연구 (The Study of Error Correctment with Adaptive FEC(Adaptive Forward Error Correction))

  • 김상형;신정아;조재상;이성인;유우종;유원경;유관종;김두현
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2003년도 가을 학술발표논문집 Vol.30 No.2 (3)
    • /
    • pp.304-306
    • /
    • 2003
  • 최근 이질적인 네트워크 환경에 적합한 다양한 멀티미디어 데이터를 서비스할 수 있는 연구가 광범위하게 이루어 지고 있다. 따라서 유동적인 네트웍 상황에 맞추어 전송되는 스트리밍 데이터는 사용자에게 보다 우수한 품질의 서비스를 제공받을 수 있는 기회를 준다. 본 논문에서는 대용량의 멀티미디어 데이터를 서비스하는 과정에서 발생하는 스트리밍 데이터의 에러 발생을 최소화할 수 있는 기법인 적응형 FEC 기법을 제안한다. 이 기법은 멀티미디어 데이터의 전송량을 최소화하면서 고화질 영상의 전송을 가능하게 한다.

  • PDF

Estimation for Autoregressive Models with GARCH(1,1) Error via Optimal Estimating Functions.

  • Kim, Sah-Myeong
    • Journal of the Korean Data and Information Science Society
    • /
    • 제10권1호
    • /
    • pp.207-214
    • /
    • 1999
  • Optimal estimating functions for a class of autoregressive models with GARCH(1,1) error are discussed. The asymptotic properties of the estimator as the solution of the optimal estimating equation are investigated for the models. We have also some simulation results which suggest that the proposed optimal estimators have smaller sample variances than those of the Conditional least-squares estimators under the heavy-tailed error distributions.

  • PDF

Reed-Solomon/길쌈 연쇄부호의 비트오율해석 (An Analysis of Bit Error Probability of Reed-Solomon/Convolutional Concatenated Codes)

  • 이상곤;문상재
    • 전자공학회논문지A
    • /
    • 제30A권8호
    • /
    • pp.19-26
    • /
    • 1993
  • The bit error probability of Reed-Solomon/convolutional concatenated codes can be more exactly calculated by using a more approximate bound of the symbol error probability of the convolutional codes. This paper obtains the unequal symbol error bound of the convolutional codes, and applies to the calculation of the bit error probability of the concatenated codes. Our results are tighter than the earlier studied other bounds.

  • PDF

Cognitive Relay Networks with Underlay Spectrum Sharing and Channel Estimation Error: Interference Probability and BER Analysis

  • Ho-Van, Khuong
    • Journal of Communications and Networks
    • /
    • 제16권3호
    • /
    • pp.301-304
    • /
    • 2014
  • This paper proposes accurate interference probability and bit error rate formulas for cognitive relay networks with underlay spectrum sharing and channel estimation error (CEE). Numerous results reveal that the CEE not only degrades the performance of secondary systems (SSs) but also increases interference power caused by SSs to primary systems (PSs), eventually unfavorable to both systems. A solution to further protect PSs from this effect through reducing the power of secondary transmitters is investigated and analyzed.