• Title/Summary/Keyword: hit rate

Search Result 241, Processing Time 0.024 seconds

A Novel Hitting Frequency Point Collision Avoidance Method for Wireless Dual-Channel Networks

  • Quan, Hou-De;Du, Chuan-Bao;Cui, Pei-Zhang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.3
    • /
    • pp.941-955
    • /
    • 2015
  • In dual-channel networks (DCNs), all frequency hopping (FH) sequences used for data channels are chosen from the original FH sequence used for the control channel by shifting different initial phases. As the number of data channels increases, the hitting frequency point problem becomes considerably serious because DCNs is non-orthogonal synchronization network and FH sequences are non-orthogonal. The increasing severity of the hitting frequency point problem consequently reduces the resource utilization efficiency. To solve this problem, we propose a novel hitting frequency point collision avoidance method, which consists of a sequence-selection strategy called sliding correlation (SC) and a collision avoidance strategy called keeping silent on hitting frequency point (KSHF). SC is used to find the optimal phase-shifted FH sequence with the minimum number of hitting frequency points for a new data channel. The hitting frequency points and their locations in this optimal sequence are also derived for KSHF according to SC strategy. In KSHF, the transceivers transmit or receive symbol information not on the hitting frequency point, but on the next frequency point during the next FH period. Analytical and simulation results demonstrate that unlike the traditional method, the proposed method can effectively reduce the number of hitting frequency points and improve the efficiency of the code resource utilization.

Popularity Based Cache Replacement Scheme to Enhance Performance in Content Centric Networks (콘텐츠 중심 네트워크에서 성능 향상을 위한 인기도 기반 캐시 교체 기법)

  • Woo, Taehee;Park, Heungsoon;Kim, Hogil
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.11
    • /
    • pp.2151-2159
    • /
    • 2015
  • Unlike an existing IP routing methods, the Content Centric Network(CCN) is new networking paradigm to find the contents by content name. The CCN can effectively process the content requested repeatedly by the user because of the cache which can be storing a content. This paper proposes a popularity based cache replacement scheme. The proposed scheme improves the hit rate better than a existing scheme. Accordingly reducing the load of server and Round Trip Time(RTT).

Interpretation of AE Signals from Rocket Motor Case Assembly (로켓 연소관 조립체의 음향방출 신호해석)

  • Rhee, Sang-Ho;Hwang, Tae-Kyong;Mun, Sun-Il
    • Journal of the Korean Society for Nondestructive Testing
    • /
    • v.23 no.5
    • /
    • pp.488-496
    • /
    • 2003
  • To establish nondestructive test method for rocket motor assembly with rubber and aerospace composite materials, practicable quality control acoustic emission test method is presented. Structural analysis for motor assembly is performed by ABAQUS code and analysis output result is confirmed by strain gage and AE data. Various specimens were tested and analyzed using strain gage and acoustic emission data. The hit rate of acoustic emission was closely related with case/rubber debonding. This report also describes practicable acoustic emission nondestructive method for evaluating motor case assembly quality assurance in the industrial field.

Technique for Estimating the Number of Active Flows in High-Speed Networks

  • Yi, Sung-Won;Deng, Xidong;Kesidis, George;Das, Chita R.
    • ETRI Journal
    • /
    • v.30 no.2
    • /
    • pp.194-204
    • /
    • 2008
  • The online collection of coarse-grained traffic information, such as the total number of flows, is gaining in importance due to a wide range of applications, such as congestion control and network security. In this paper, we focus on an active queue management scheme called SRED since it estimates the number of active flows and uses the quantity to indicate the level of congestion. However, SRED has several limitations, such as instability in estimating the number of active flows and underestimation of active flows in the presence of non-responsive traffic. We present a Markov model to examine the capability of SRED in estimating the number of flows. We show how the SRED cache hit rate can be used to quantify the number of active flows. We then propose a modified SRED scheme, called hash-based two-level caching (HaTCh), which uses hashing and a two-level caching mechanism to accurately estimate the number of active flows under various workloads. Simulation results indicate that the proposed scheme provides a more accurate estimation of the number of active flows than SRED, stabilizes the estimation with respect to workload fluctuations, and prevents performance degradation by efficiently isolating non-responsive flows.

  • PDF

Distortion invariant pattern recognition using Modified synthetic HMT (수정 합성 HMT를 이용한 왜곡불변 패턴 인식)

  • 현영길;김종찬;김정우;도양회;김수중
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.7B
    • /
    • pp.1361-1369
    • /
    • 1999
  • A hit-miss transform(HMT) using modified synthetic structuring elements(SEs) for distortion-invariant recognition of multiple objects is proposed. A fundamental problem in an HMT is the determination of the optimal SE needed to improve the false alarm rate, and detect distorted objects with various shapes. The proposed synthetic methods of SE provide good solutions against this problem. One is the multistage synthesis of each true class SE using only set theory, and the other is the multistage synthesis of each true class and false class SE using set theory and SDF(synthetic discriminant function) synthesis method. Simulation results show the proposed methods can be used for the recognition of distorted intraclass objects and the discrimination of similar interclass objects.

  • PDF

Comparative Study of Dimension Reduction Methods for Highly Imbalanced Overlapping Churn Data

  • Lee, Sujee;Koo, Bonhyo;Jung, Kyu-Hwan
    • Industrial Engineering and Management Systems
    • /
    • v.13 no.4
    • /
    • pp.454-462
    • /
    • 2014
  • Retention of possible churning customer is one of the most important issues in customer relationship management, so companies try to predict churn customers using their large-scale high-dimensional data. This study focuses on dealing with large data sets by reducing the dimensionality. By using six different dimension reduction methods-Principal Component Analysis (PCA), factor analysis (FA), locally linear embedding (LLE), local tangent space alignment (LTSA), locally preserving projections (LPP), and deep auto-encoder-our experiments apply each dimension reduction method to the training data, build a classification model using the mapped data and then measure the performance using hit rate to compare the dimension reduction methods. In the result, PCA shows good performance despite its simplicity, and the deep auto-encoder gives the best overall performance. These results can be explained by the characteristics of the churn prediction data that is highly correlated and overlapped over the classes. We also proposed a simple out-of-sample extension method for the nonlinear dimension reduction methods, LLE and LTSA, utilizing the characteristic of the data.

A Study on the Performance of Prefetching Web Cache Proxy (Prefetch하는 웹 캐쉬 프록시의 성능에 대한 연구)

  • 백윤철
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.11
    • /
    • pp.1453-1464
    • /
    • 2001
  • Explosive growth of Internet populations results performance degradations of web service. Popular web sites cannot provide proper level of services to many requests, and such poor services cannot give user a satisfaction. Web caching, the remedy of this problem, reduces the amount of network traffic and gives fast response to user. In this paper, we analyze the characteristics of web cache traffics using traces of NLANR(National Laboratory for Applied Network Research) root caches and Education network cache in Seoul National University. Based on this analysis, we suggest a method of prefetching and we discuss the gains of our prefetching. As a result, we find proposed prefetching enhances hit rate up to 3%, response time up to 5%.

  • PDF

Improving Probability of Precipitation of Meso-scale NWP Using Precipitable Water and Artificial Neural Network (가강수량과 인공신경망을 이용한 중규모수치예보의 강수확률예측 개선기법)

  • Kang, Boo-Sik;Lee, Bong-Ki
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2008.05a
    • /
    • pp.1027-1031
    • /
    • 2008
  • 본 연구는 한반도 영역을 대상으로 2001년 7, 8월과 2002년 6월로 홍수기를 대상으로 RDAPS 모형, AWS, 상층기상관측(upper-air sounding)의 자료를 이용하였다. 또한 수치예보자료를 범주적 예측확률로 변환하고 인공신경망기법(ANN)을 이용하여 강수발생확률의 예측정확성을 향상시키는데 있다. 신경망의 예측인자로 사용된 대기변수는 500/ 750/ 1000hpa에서의 지위고도, 500-1000hpa에서의 층후(thickness), 500hpa에서의 X와 Y의 바람성분, 750hpa에서의 X와 Y의 바람성분, 표면풍속, 500/ 750hpa/ 표면에서의 온도, 평균해면기압, 3시간 누적 강수, AWS관측소에서 관측된 RDAPS모형 실행전의 6시간과 12시간동안의 누적강수, 가강수량, 상대습도이며, 예측변수로는 강수발생확률로 선택하였다. 강우는 다양한 대기변수들의 비선형 조합으로 발생되기 때문에 예측인자와 예측변수 사이의 복잡한 비선형성을 고려하는데 유용한 인공신경망을 사용하였다. 신경망의 구조는 전방향 다층퍼셉트론으로 구성하였으며 역전파알고리즘을 학습방법으로 사용하였다. 강수예측성과의 질을 평가하기 위해서 $2{\times}2$ 분할표를 이용하여 Hit rate, Threat score, Probability of detection, Kuipers Skill Score를 사용하였으며, 신경망 학습후의 강수발생확률은 학습전의 강수발생확률에 비하여 한반도영역에서 평균적으로 Kuipers Skill Score가 0.2231에서 0.4293로 92.39% 상승하였다.

  • PDF

An Efficient Spatial Data Cache Algorithm for a Map Service in Mobile Environment (모바일 환경에서 지도 서비스를 위한 효율적인 공간 데이터 캐시 알고리즘)

  • Moon, Jin-Yong
    • Journal of Digital Contents Society
    • /
    • v.16 no.2
    • /
    • pp.257-262
    • /
    • 2015
  • Recently, the interests of mobile GIS technology is increasing with the spread of wireless network, the improvement of mobile device's performances, and the growth of demands about mobile services. Providing services in a wireless environment with existing wired-based GIS solutions have many limitations such as slow communication, processing rates and screen size. In this paper, we propose a cache algorithm on client side to solve the above problems. The proposed algorithm demonstrates the performance improvement over known studies by utilizing unit time and spatial proximity. In addition, this paper conducts a performance evaluation to measure the improvement in algorithm efficiency and analyzes the results of the performance evaluation. When spatial data queries are conducted, according to our performance evaluation, hit rate has been improved over the existing algorithms.

Cache simulation for measuring cache performance suitable for sound rendering (사운드 렌더링에 적합한 캐시 성능 측정을 위한 캐시 시뮬레이션)

  • Joo, Yejong;Hong, Dukki;Chung, Woonam;Park, Woo-Chan
    • Journal of the Korea Computer Graphics Society
    • /
    • v.23 no.3
    • /
    • pp.123-133
    • /
    • 2017
  • Cache performance is an important factor in hardware system. We proceed with a cache simulation to analyze the cache performance suitable for sound rendering. In addition, we introduce hardware models based on ray tracing used in geometric method and studies to improve cache performance. Cache simulation is performed on various conditions for cache size, way and block. Various simulations can be found to influence the cache hit rate. We compare cache simulation results with actual hardware performance to analyze cache performance suitable for sound rendering.