• 제목/요약/키워드: update rate

검색결과 285건 처리시간 0.039초

독립적 적응을 기반으로 한 업데이트 간격이 다른 Affine Projection 알고리즘 필터의 조합 (Combination of Two Affine Projection Algorithm Filters with Different Update Interval based on Independent Adaptation)

  • 김광훈;최영석;송우진
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2008년도 하계종합학술대회
    • /
    • pp.895-896
    • /
    • 2008
  • We propose a adaptive combination of affine projection algorithm (APA) filters with different update interval. Two APA filters with different update interval are adapted independently in order to keep the advantages of both component filters. This novel scheme provides improvement of performance in term of the convergence rate and the steady-state error. Experimental results show good properties of the proposed algorithm.

  • PDF

A Flash-based B+-Tree using Sibling-Leaf Blocks for Efficient Node Updates and Range Searches

  • Lim, Seong-Chae
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제8권3호
    • /
    • pp.12-24
    • /
    • 2016
  • Recently, as the price per bit is decreasing at a fast rate, flash memory is considered to be used as primary storage of large-scale database systems. Although flash memory shows off its high speeds of page reads, however, it has a problem of noticeable performance degradation in the presence of increasing update workloads. When updates are requested for pages with random page IDs, in particular, the shortcoming of flash tends to impair significantly the overall performance of a flash-based database system. Therefore, it is important to have a way to efficiently update the B+-tree, when it is stored in flash storage. This is because most of updates in the B+-tree arise at leaf nodes, whose page IDs are in random. In this light, we propose a new flash B+-tree that stores up-to-date versions of leaf nodes in sibling-leaf blocks (SLBs), while updating them. The use of SLBs improves the update performance of B-trees and provides the mechanism for fast key range searches. To verify the performance advantages of the proposed flash B+-tree, we developed a mathematical performance evaluation model that is suited for assessing B-tree operations. The performance comparisons from it show that the proposed flash B+-tree provides faster range searches and reduces more than 50% of update costs.

Time-Aware Wear Leveling by Combining Garbage Collector and Static Wear Leveler for NAND Flash Memory System

  • Hwang, Sang-Ho;Kwak, Jong Wook
    • 한국컴퓨터정보학회논문지
    • /
    • 제22권3호
    • /
    • pp.1-8
    • /
    • 2017
  • In this paper, we propose a new hybrid wear leveling technique for NAND Flash memory, called Time-Aware Wear Leveling (TAWL). Our proposal prolongs the lifetime of NAND Flash memory by using dynamic wear leveling technique which considers the wear level of hot blocks as well as static wear leveling technique which considers the wear level of the whole blocks. TAWL also reduces the overhead of garbage collection by separating hot data and cold data using update frequency rate. We showed that TAWL enhanced the lifetime of NAND flash memory up to 220% compared with previous wear leveling techniques and our technique also reduced the number of copy operations of garbage collections by separating hot and cold data up to 45%.

Texture synthesis for model-based coding

  • Sohn, Young-Wook;Kim, In-Kwon;Park, Rae-Hong
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송공학회 1996년도 Proceedings International Workshop on New Video Media Technology
    • /
    • pp.23-28
    • /
    • 1996
  • Model-based coding is one of several approaches to very low bit rate image coding and it can be used in many applications such as image creation and virtual reality. However, its analysis and synthesis processes remain difficult, especially in the sense that the resulting synthesized image reveals some degradation in detailed facial components such as furrows around eyes and mouth. To solve the problem, a large number of methods have been proposed and the texture update method is one of them. In this paper, we investigate texture synthesis for model-based coding. In the update process of the proposed texture synthesis algorithm, texture information is stored in a memory and the decoder reuses it. With this method, the transmission bit rate for texture data can be reduced compared with the conventional method updating texture periodically.

  • PDF

무선 애드혹 링크 품질을 위한 STM 기반의 미디어 스트리밍 (STM-based Media Streaming for Wireless Ad Hoc Link Quality)

  • 이종득
    • 한국항행학회논문지
    • /
    • 제17권3호
    • /
    • pp.285-291
    • /
    • 2013
  • 본 논문에서는 무선 애드 혹 링크 품질을 보장하기 위하여 새로운 STM기반의 미디어 스트리밍 기법을 제안 하였다. 제안된 기법은 스트리밍 모니터링, 스트리밍 보장, 그리고 스트리밍 갱신과정을 거쳐 링크 품질이 보장되도록 하였으며, 스트리밍 $t_{new}$에 의해 미디어 프레임들이 모니터링되도록 하였다. 그리고 프레임의 크기에 따른 미디어 스트리밍 갱신 알고리즘을 이용하여 링크 오류율과 재전송률을 최소화하도록 하였다. 시뮬레이션 결과 제안된 기법이 STCP기법, 그리고 RMST기법에 비해서 성능이 우수함을 보인다.

온라인 게임 콘텐츠 업데이트의 효과에 관한 탐색적 연구 (An Exploratory Study on the Impact of Contents Updates in Online Games)

  • 김태웅;김대영;박성택
    • 디지털융복합연구
    • /
    • 제13권10호
    • /
    • pp.147-155
    • /
    • 2015
  • 본 연구의 목적은 시장에 출시된 온라인 게임의 운영과정에서 오류를 수정하고 게임성능을 제고하기 위해 제공하는 콘텐츠 업데이트 또는 패치서비스가 실질적으로 게이머의 플레잉 시간에 영향을 미치는지 여부를 계량적으로 분석해 보는 데에 있다. 이를 위해 온라인게임 개발회사가 게임콘텐츠와 관련하여 추가하는 콘텐츠 업데이트를 두 가지 유형으로 구분하여 업데이트 후 플레잉 시간에 통계적으로 유의한 영향을 미치는지 여부를 회귀분석을 이용하여 분석하였다. 분석 결과, 콘텐츠 업데이트 외에 추가적인 독립변수로 설정한 출시 후 경과시간은 플레잉 시간 변동에 음의 유의한 영향을 미치는 것을 나타났지만, 새로운 게이머들을 유인하고 기존 게이머들의 플레잉 시간을 증가시키기 위해 제공하는 콘텐츠 생성이나 조절은 플레잉 시간 증가에 유의한 영향을 미치지 않은 것으로 나타났다. 연구결과가 제시하는 게임 디자인 측면에서의 시사점을 결론으로 제시하였다.

방송 채널 효율 향상을 위한 그룹 계층 구성 기반 접근 제어 시스템 (Conditional Access System with A Group Hierarchy to Improve Broadcasting Channel Efficiency)

  • 양장훈;김동구
    • 한국항행학회논문지
    • /
    • 제13권5호
    • /
    • pp.726-735
    • /
    • 2009
  • 본 논문에서는 방송 시스템에서 채널의 대역폭이 제한되는 상황에서 유효 가입자 제어를 위한 메시지 전송 오버헤드를 감소시키는 접근 제어 시스템을 제안하였다. 이를 위해서 IP 기반 멀티캐스트에 제안되었던 트리 계층 구조의 키 개정 시스템을 도입하여 가입자를 트리 구조에 직접 매핑하는 경우와 가입자를 채널 그룹별로 나누어 채널 그룹을 트리 구조에 적용하는 시스템을 고려하였다. 제안 시스템의 효율성을 평가하기 위해 기존의 시스템과 제안 시스템에 대해서 보안을 위한 주기적인 키 개정을 위한 오버헤드 전송율과 동적이면서 비주기적으로 가입자의 변동이 발생을 할 때의 오버헤드 전송율을 분석하였다. 다양한 시스템 환경에서 제안 시스템은 기존 시스템에 비해서 가입자의 변동이 발생할 경우에 수 배에서 수십 만배의 키 개정을 위한 메시지 오버헤드 전송율을 크게 감소시키는 것을 분석 평가를 통해서 확인하였다.

  • PDF

Analyzing Online Customer Reviews for the Hotel Classification in Vietnam

  • NGUYEN, Ha Thi Thu;TRAN, Tuan Minh;NGUYEN, Giang Binh
    • The Journal of Asian Finance, Economics and Business
    • /
    • 제8권8호
    • /
    • pp.443-451
    • /
    • 2021
  • The classification standards for hotels in Vietnam are different from many other hotel classification standards in the world. This study aims to analyze customer reviews on the TripAdvisor website to develop a new algorithm for hotel rating that is independent of Vietnam's hotel classification standards. This method can be applied to individual hotels, or hotels of a region or the whole country, while online booking sites only rate individual hotels. Data was crawled from TripAdvisor with 22,287 reviews of 5 cities in Vietnam. This study used a statistical model to analyze the review dataset and build an algorithm to rate hotels according to aspects or hotel overall. The results have less rating deviation when compared to the TripAdvisor system. This study also supports hotel managers to regularly update the status of their hotels using data from customer reviews, from which, managers can strategize long-term solutions to improve the quality of the hotel in all aspects and attract more travelers to Vietnam. Moreover, this method can be developed into an automatic system to rate hotels and update the status of service quality more quickly, thus, saving time and costs.

Congestion Detection and Control Strategies for Multipath Traffic in Wireless Sensor Networks

  • Razzaque, Md. Abdur;Hong, Choong Seon
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2009년도 추계학술발표대회
    • /
    • pp.465-466
    • /
    • 2009
  • This paper investigates congestion detection and control strategies for multi-path traffic (CDCM) diss emination in lifetime-constrained wireless sensor networks. CDCM jointly exploits packet arrival rate, succ essful packet delivery rate and current buffer status of a node to measure the congestion level. Our objec tive is to develop adaptive traffic rate update policies that can increase the reliability and the network lif etime. Our simulation results show that the proposed CDCM scheme provides with good performance.

Performance Improvement of an INS by using a Magnetometer with Pedestrian Dynamic Constraints

  • Woyano, Feyissa;Park, Aangjoon;Lee, Soyeon
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제6권1호
    • /
    • pp.1-9
    • /
    • 2017
  • This paper proposes to improve the performance of a strap down inertial navigation system using a foot-mounted low-cost inertial measurement unit/magnetometer by configuring an attitude and heading reference system. To track position accurately and for attitude estimations, considering different dynamic constraints, magnetic measurement and a zero velocity update technique is used. A conventional strap down method based on integrating angular rate to determine attitude will inevitably induce long-term drift, while magnetometers are subject to short-term orientation errors. To eliminate this accumulative error, and thus, use the navigation system for a long-duration mission, a hybrid configuration by integrating a miniature micro electromechanical system (MEMS)-based attitude and heading detector with the conventional navigation system is proposed in this paper. The attitude and heading detector is composed of three-axis MEMS accelerometers and three-axis MEMS magnetometers. With an absolute algorithm based on gravity and Earth's magnetic field, rather than an integral algorithm, the attitude detector can obtain an absolute attitude and heading estimation without drift errors, so it can be used to adjust the attitude and orientation of the strap down system. Finally, we verify (by both formula analysis and from test results) that the accumulative errors are effectively eliminated via this hybrid scheme.