• 제목/요약/키워드: error minimizing

검색결과 516건 처리시간 0.023초

쓰레기 매립지 가스 포집관에서 가스조성에 따른 계측오차의 최소화 (Minimizing the Measurement Error from Gas Compositions of Gas Vent in Sanitary Landfill)

  • 이해승;이문형
    • 환경위생공학
    • /
    • 제17권1호
    • /
    • pp.28-35
    • /
    • 2002
  • 본 연구 목적은 계측저항이 없는 열선유속계를 이용하여 매립지 가스의 유량을 산정할 때 가스조성에 의해 발생되는 계측오차를 최소화할 수 있는 방안을 제시하고자하였다. Rotor meter와 가스조성 밀도를 이용하여 산정한 관 중심유속을 계측저항이 없는 열선유속계를 이용하여 구한 관 중심유속을 비교함으로서 계측오차를 측정하였다. 실험결과 열선 유속계와 rotor meter를 이용한 매립지 가스유속 계측오차의 최소화 방안을 통하여 매립지 가스유량의 오차 범위를 10% 이내로 최소화 할 수 있는 것으로 조사되었다.

패킷망에서 MPEG-4 비디오 오류처리 최적화 방식 연구 (Packet loss resilience methods of MPEG-4 Video)

  • 이상조;서덕영
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송공학회 2000년도 정기총회 및 학술대회
    • /
    • pp.15-19
    • /
    • 2000
  • This paper is about MPEG-4 error resilience tools of video streaming on packet service(ex, Internet). It is need to packetization for MPEG-4 video transport by packet unit on MPEG-4 system, this paper suggest packetization method of minimizing packet error on packet service[1]. FEC(Forward Error Correction) and retransmission is usually used for recovery of packet loss, and this paper suggest applying these method to DMIF(Delivery Multimedia Integration Framework) for minimizing packet loss[2].

  • PDF

추종 오차를 최소화하는 극-영점 배치 자기 동조 제어기 (Pole-zero placement self-tuning controller minimizing tracking error)

  • 한규정;이종용;이상효
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 16-17 Oct. 1987
    • /
    • pp.179-181
    • /
    • 1987
  • In this paper, a self-tuning controller design is proposed by using pole-zero placement method and considering a system time delay. To got better tracking for the generalized self-tuning controller, pole placement method for the closed loop system and zero placement method for the error transfer function are Introduced. The proposed method shows better efficiency than pole placement method for minimizing tracking error. Simulation gives good results in tie reference signal tracking.

  • PDF

Maximization of Zero-Error Probability for Adaptive Channel Equalization

  • Kim, Nam-Yong;Jeong, Kyu-Hwa;Yang, Liuqing
    • Journal of Communications and Networks
    • /
    • 제12권5호
    • /
    • pp.459-465
    • /
    • 2010
  • A new blind equalization algorithm that is based on maximizing the probability that the constant modulus errors concentrate near zero is proposed. The cost function of the proposed algorithm is to maximize the probability that the equalizer output power is equal to the constant modulus of the transmitted symbols. Two blind information-theoretic learning (ITL) algorithms based on constant modulus error signals are also introduced: One for minimizing the Euclidean probability density function distance and the other for minimizing the constant modulus error entropy. The relations between the algorithms and their characteristics are investigated, and their performance is compared and analyzed through simulations in multi-path channel environments. The proposed algorithm has a lower computational complexity and a faster convergence speed than the other ITL algorithms that are based on a constant modulus error. The error samples of the proposed blind algorithm exhibit more concentrated density functions and superior error rate performance in severe multi-path channel environments when compared with the other algorithms.

Multi-response Designs Minimizing Model Inadequacies

  • Bae, Whasoo
    • Communications for Statistical Applications and Methods
    • /
    • 제9권3호
    • /
    • pp.799-808
    • /
    • 2002
  • This paper aims at selecting the multi-response design with γ responses minimizing the bias error caused by fitting inadequate models to responses, where the first order models are fitted to Ρ responses fearing the quadratic bias, while to other γ- Ρ responses, the quadratic models are fitted fearing the cubic biases in the cuboidal region of interest. Under the assumption of symmetric design, by minimizing the criterion which represents the amount of error caused by fitting inadequate models, the optimum design was found to be the one having the design moments of second order and the fourth order as 1/3 and l/5, respectively. Examples of the design meeting the required conditions are given for illustration.

An On-line Algorithm to Search Minimum Total Error for Imprecise Real-time Tasks with 0/1 Constraint

  • Song Gi-Hyeon
    • 한국멀티미디어학회논문지
    • /
    • 제8권12호
    • /
    • pp.1589-1596
    • /
    • 2005
  • The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et al suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. On the other hand, in the case of on line scheduling, Shih and Liu proposed the NORA algorithm which can find a schedule with the minimum total error for a task system consisting solely of on-line tasks that are ready upon arrival. But, for the task system with 0/1 constraint, it has not been known whether the NORA algorithm can be optimal or not in the sense that it guarantees all mandatory tasks are completed by their deadlines and the total error is minimized. So, this paper suggests an optimal algorithm to search minimum total error for the imprecise on-line real-time task system with 0/1 constraint. Furthermore, the proposed algorithm has the same complexity, O(N log N), as the NORA algorithm, where N is the number of tasks.

  • PDF

Scheduling Algorithm to Minimize Total Error for Imprecise On-Line Tasks

  • Song, Gi-Hyeon
    • 한국멀티미디어학회논문지
    • /
    • 제10권12호
    • /
    • pp.1741-1751
    • /
    • 2007
  • The imprecise computation technique ensures that all time-critical tasks produce their results before their deadlines by trading off the quality of the results for the computation time requirements of the tasks. In the imprecise computation, most scheduling problems of satisfying both 0/1 constraints and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. In the previous studies, the reasonable strategies of scheduling tasks with the 0/1 constraints on uniprocessors and multiprocessors for minimizing the total error are proposed. But, these algorithms are all off-line algorithms. Then, in the on-line scheduling, NORA(No Off-line tasks and on-line tasks Ready upon Arrival) algorithm can find a schedule with the minimum total error. In NORA algorithm, EDF(Earliest Deadline First) strategy is adopted in the scheduling of optional tasks. On the other hand, for the task system with 0/1 constraints, NORA algorithm may not suitable any more for minimizing total error of the imprecise tasks. Therefore, in this paper, an on-line algorithm is proposed to minimize total error for the imprecise real-time task system with 0/1 constraints. This algorithm is suitable for the imprecise on-line system with 0/1 constraints. Next, to evaluate performance of this algorithm, a series of experiments are done. As a consequence of the performance comparison, it has been concluded that IOSMTE(Imprecise On-line Scheduling to Minimize Total Error) algorithm proposed in this paper outperforms LOF(Longest Optional First) strategy and SOF(Shortest Optional First) strategy for the most cases.

  • PDF

포커싱 에러를 최소화하기 위한 광디스크의 형상설계 (Design of Optical Disk Profile for Minimizing the Focusing Error)

  • 홍석준;지중근;이종수;박노철;박영필
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2002년도 추계학술대회논문집
    • /
    • pp.1015-1021
    • /
    • 2002
  • Optical disk is the media which is used generally in data storage device, but it has a disadvantage in the vibration by spinning and the shock. For overcoming these disadvantage, we must control the optical disk to minimize the focusing error and tacking error. The present study investigates the disk profile for minimizing the focusing error subjected to environmental shock and weight of the disk. In this study, the disk is assumed to be a cantilever beam to determine the disk profile for the minimum displacement as to the shock considering only the first mode. Also, for the optimally determined profile by ADS program this paper recalculate the robust caltilever profile by using orthogonal array and ANOM.

  • PDF

KSLV-II 추진기관 탑재 추진제 잔류량 최소화 설계 (Design for Minimization of Onboard Propellant Residual in KSLV-II)

  • 정영석;조규식;오승협
    • 항공우주기술
    • /
    • 제10권1호
    • /
    • pp.1-12
    • /
    • 2011
  • 발사체에서 추진제는 발사체 전체 중량의 대부분을 차지하는 것으로 추진제의 탑재량 오차 및 잔류량의 오차는 발사성능에 매우 큰 영향을 미치게 된다. 즉, 발사체의 총추력 오차를 발생시키게 된다. 그러므로 추진제 잔류량을 최소화하는 것이 발사체 성능을 최적화 하는 방법이다. 이에 대한 방법으로 지금까지 연구된 것은 발사체에 능동제어 개념을 도입해서 추진제를 완전 소진시키는 방법과 추진제 잔류량을 최소화하기 위해 확률적인 방법으로 연료의 추가탑재량을 계산하는 방법이 연구되어졌다. 본 연구에서는 한국형 발사체 개발에 본 개념을 적용하여 추진제 잔류량을 최소화하기 위해 탑재해야할 연료 추가탑재량과 그때 남는 추진제 잔류량을 예측해 보았다.

포커싱 에러를 최소화하기 위한 광디스크 형상설계 (Design of Optical Disk Profile for Minimizing the Focusing Error)

  • Hong, Seok-Joon;Jee, Jung-Guen;Park, No-Cheol;Lee, Jongsoo;Park, Young-Pil
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2002년도 추계학술대회논문초록집
    • /
    • pp.398.2-398
    • /
    • 2002
  • Optical disk is the media which is used generally in data storage device, but it has a disadvantage in the vibration by the spinning and the shock. For overcoming these disadvantage, we must control the optical disk to minimize the focusing and tracking error. The present study investigates the disk profile fur minimizing the focusing error subjected to environmental shock and weight of the disk. (omitted)

  • PDF