• Title/Summary/Keyword: hit ratio

Search Result 281, Processing Time 0.03 seconds

A Study on the Interest of the Eyes Applying Gazing Phenomena - Based on an Eye-tracking Experiment Carried with a Facade as a Medium - (주시현상을 적용한 시선의 관심도 연구 - 파사드를 매개로 한 아이트래킹 실험 중심으로 -)

  • Yeo, Mi;Lee, Chang No
    • Korean Institute of Interior Design Journal
    • /
    • v.23 no.1
    • /
    • pp.122-131
    • /
    • 2014
  • This study aimed to conduct an eye-tracking experiment carried with facade images as a medium and to do research on 'the interest of the eyes' resulted from people's gazing phenomena. This study secured gazing data which appeared according to visual response and analyzed gazing phenomena to find the basic theory of 'the interest of the eyes' as a methodological role, which consumer interest and attention could be grafted when a plan and a design for space design was made. Data terms used in eye-tracking backgrounds and the movement of the eyes were investigated in literature review. Twenty (20) facade images were selected through a case study to get experimental stimuli for the related experiment. Thirty (30) subjects (men and women) suitable for the experiment were recruited to conduct an eye-tracking experiment. After the experiment, five (5) areas were set up in the facade image to identify the focus level of interest and attention. The level of interest and focus was connected to the interest of the eyes. The analysis to study the interest of the eyes was based on nine (9) items such as sequence, entry time, dwell time, hit ratio, revisits, revisitors, average fixation, first fixation and fixation count. Through gaze analysis, the following conclusion was drawn about the 'interest level of sight' for gaze frequency. The interest level can be interpreted to be higher for faster sequence, shorter entry time, longer all fixation(ms) for dwell time, faster all saccade(%), higher hit ratio, more revisits, more revisitors, longer average fixation, faster and longer first fixation, and more fixation count, and the person can be said to have felt interest faster and/or more.

RDBMS Based Efficient Method for Shortest Path Searching Over Large Graphs Using K-degree Index Table (대용량 그래프에서 k-차수 인덱스 테이블을 이용한 RDBMS 기반의 효율적인 최단 경로 탐색 기법)

  • Hong, Jihye;Han, Yongkoo;Lee, Young-Koo
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.5
    • /
    • pp.179-186
    • /
    • 2014
  • Current networks such as social network, web page link, traffic network are big data which have the large numbers of nodes and edges. Many applications such as social network services and navigation systems use these networks. Since big networks are not fit into the memory, existing in-memory based analysis techniques cannot provide high performance. Frontier-Expansion-Merge (FEM) framework for graph search operations using three corresponding operators in the relational database (RDB) context. FEM exploits an index table that stores pre-computed partial paths for efficient shortest path discovery. However, the index table of FEM has low hit ratio because the indices are determined by distances of indices rather than the possibility of containing a shortest path. In this paper, we propose an method that construct index table using high degree nodes having high hit ratio for efficient shortest path discovery. We experimentally verify that our index technique can support shortest path discovery efficiently in real-world datasets.

A Situation Evaluation System based on the Strength and the Influence Distribution of Stones in Computer Go (컴퓨터 바둑에서 돌의 세기와 영향력 분포에 기반한 형세 평가 시스템)

  • 김영상
    • Journal of the Korea Computer Industry Society
    • /
    • v.3 no.3
    • /
    • pp.259-270
    • /
    • 2002
  • In computer Go, the method evaluating the situation of a face is not generalized. To evaluate the situations all the faces accurately, computer Go must judge owners of 361 positions according the changes of the faces. In this paper, we apply the structure of graph as a method analyzing the rules and characters of Go. The Situation Evaluation System(SES) which can evaluate the situation of a face without DB information oかy using strength of stone(SS), influence power(IP), safety(S), position value(PV), and position-value matrix(PM) is proposed. This system is very effective to evaluate the whole situations of Go because it can show the owner of 361 positions between Black and White. As a result, SES can well compute the situations in the opening game of Go. It makes 70.9% hit-ratio as compared with the practical Go games of professional players. According to the results compared with Nemesis, the commercial program which has the joseki(established stones: hewn sequences of moves near the corner which result in near-equal positions for White and Black), SES is superior to Nemesis by 10% higher in the hit-ratio of situation evaluations of professional players.

  • PDF

A Study on Mobility-Aware Edge Caching and User Association Algorithm (이동성 기반의 엣지 캐싱 및 사용자 연결 알고리즘 연구)

  • TaeYoon, Lee;SuKyoung, Lee
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.12 no.2
    • /
    • pp.47-52
    • /
    • 2023
  • Mobile Edge Computing(MEC) is considered as a promising technology to effectively support the explosively increasing traffic demands. It can provide low-latency services and reduce network traffic by caching contents at the edge of networks such as Base Station(BS). Although users may associate with the nearest BSs, it is more beneficial to associate users to the BS where the requested content is cached to reduce content download latency. Therefore, in this paper, we propose a mobility-aware joint caching and user association algorithm to imporve the cache hit ratio. In particular, the proposed algorithm performs caching and user association based on sojourn time and content preferences. Simulation results show that the proposed scheme improves the performance in terms of cache hit ratio and latency as compared with existing schemes.

A data prefetching scheme to improve response time of Video Streaming service (비디오 스트리밍 응답 시간 개선을 위한 데이터 사전 배치 방법)

  • Min, Ji-won;Mun, Hyun-su;Lee, Young-seok
    • KNOM Review
    • /
    • v.22 no.1
    • /
    • pp.52-59
    • /
    • 2019
  • As the video streaming service are supported by various devices, the amount of usage increases and efforts to improve the service from the viewpoint of users have continued. When a user watches a video, a response time occurs from input to playback, and if this response time becomes longer, the user's service satisfaction decreases. In this paper, we are proposing a method prefetching each user's preference video data obtained by analyzing user's past history record to the device for reducing the response time. We will show the result that prefetching data can improve the response time to 41% at most. And we analyzed real-video streaming viewing record and got each user's preferred video list. We investigated the change of response time according to a hit-ratio and amount of overhead data that was prefetched to the device, but not viewed. It was shown that as the hit-ratio grows bigger, the improvement of response time becomes more effective.

The Prediction of Currency Crises through Artificial Neural Network (인공신경망을 이용한 경제 위기 예측)

  • Lee, Hyoung Yong;Park, Jung Min
    • Journal of Intelligence and Information Systems
    • /
    • v.22 no.4
    • /
    • pp.19-43
    • /
    • 2016
  • This study examines the causes of the Asian exchange rate crisis and compares it to the European Monetary System crisis. In 1997, emerging countries in Asia experienced financial crises. Previously in 1992, currencies in the European Monetary System had undergone the same experience. This was followed by Mexico in 1994. The objective of this paper lies in the generation of useful insights from these crises. This research presents a comparison of South Korea, United Kingdom and Mexico, and then compares three different models for prediction. Previous studies of economic crisis focused largely on the manual construction of causal models using linear techniques. However, the weakness of such models stems from the prevalence of nonlinear factors in reality. This paper uses a structural equation model to analyze the causes, followed by a neural network model to circumvent the linear model's weaknesses. The models are examined in the context of predicting exchange rates In this paper, data were quarterly ones, and Consumer Price Index, Gross Domestic Product, Interest Rate, Stock Index, Current Account, Foreign Reserves were independent variables for the prediction. However, time periods of each country's data are different. Lisrel is an emerging method and as such requires a fresh approach to financial crisis prediction model design, along with the flexibility to accommodate unexpected change. This paper indicates the neural network model has the greater prediction performance in Korea, Mexico, and United Kingdom. However, in Korea, the multiple regression shows the better performance. In Mexico, the multiple regression is almost indifferent to the Lisrel. Although Lisrel doesn't show the significant performance, the refined model is expected to show the better result. The structural model in this paper should contain the psychological factor and other invisible areas in the future work. The reason of the low hit ratio is that the alternative model in this paper uses only the financial market data. Thus, we cannot consider the other important part. Korea's hit ratio is lower than that of United Kingdom. So, there must be the other construct that affects the financial market. So does Mexico. However, the United Kingdom's financial market is more influenced and explained by the financial factors than Korea and Mexico.

Cache Memory and Replacement Algorithm Implementation and Performance Comparison

  • Park, Na Eun;Kim, Jongwan;Jeong, Tae Seog
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.3
    • /
    • pp.11-17
    • /
    • 2020
  • In this paper, we propose practical results for cache replacement policy by measuring cache hit and search time for each replacement algorithm through cache simulation. Thus, the structure of each cache memory and the four types of alternative policies of FIFO, LFU, LRU and Random were implemented in software to analyze the characteristics of each technique. The paper experiment showed that the LRU algorithm showed hit rate and search time of 36.044% and 577.936ns in uniform distribution, 45.636% and 504.692ns in deflection distribution, while the FIFO algorithm showed similar performance to the LRU algorithm at 36.078% and 554.772ns in even distribution and 45.662% and 489.574ns in bias distribution. Then LFU followed, Random algorithm was measured at 30.042% and 622.866ns at even distribution, 36.36% at deflection distribution and 553.878ns at lowest performance. The LRU replacement method commonly used in cache memory has the complexity of implementation, but it is the most efficient alternative to conventional alternative algorithms, indicating that it is a reasonable alternative method considering the reference information of data.

Request Deduplication Scheme in Cache-Enabled 5G Network Using PON

  • Jung, Bokrae
    • Journal of information and communication convergence engineering
    • /
    • v.18 no.2
    • /
    • pp.100-105
    • /
    • 2020
  • With the advent of the 5G era, the rapid growth in demand for mobile content services has increased the need for additional backhaul investment. To meet this demand, employing a content delivery network (CDN) and optical access solution near the last mile has become essential for the configuration of 5G networks. In this paper, a cache-enabled architecture using the passive optical network (PON) is presented to serve video on demand (VoD) for users. For efficient use of mobile backhaul, I propose a request deduplication scheme (RDS) that can provide all the requested services missed in cache with minimum bandwidth by eliminating duplicate requests for movies within tolerable range of the quality of service (QoS). The performance of the proposed architecture is compared with and without RDS in terms of the number of requests arriving at the origin server (OS), hit ratio, and improvement ratio according to user requests and cache sizes.

The Proposal of Alternative Regulatory Considering Game Mechanism for Game at Game Providers : Focusing on The Reward Ratio for Betting (게임제공업소용 게임물에 대한 게임 메커니즘을 고려한 대안적 규제 제언 : 베팅에 대한 보상 비율을 중심으로)

  • Song, Seung-Keun
    • Cartoon and Animation Studies
    • /
    • s.49
    • /
    • pp.493-519
    • /
    • 2017
  • Looking back at the last 10 years of the enactment of the Game Industry Act, the law was revised as a regulation rather than a promotion of the game. The objective of this study is to investigate where game regulation originated and derived through the history of those, and to find out what areas were missed, and to solve the tangled threads by regulation. For this purpose, we reviewed the implications of 10,000 won per hour, and discussed alternatives. Data were collected and analyzed on the basis of a review of regulatory literature and in - depth interviews with experts. When regulating games, we found that the side effects were further amplified by simply regulating the amount. Especially, we found that the vicious cycle in which functions such as indication, hit repeatedly, and automatic progress are made and immediately following prohibited is repeated. The point at which there is a sharp interest between the game user and the game operator in the game progression is the 'reward ratio for betting'. This is the key to protecting users. This could be a regulation considering the mechanism of the game. If the regulatory paradigm shifts in the future due to game regulations that take into account the 'reward ratio for betting' in the future, it is expected to minimize the side effects of price regulation and create a sound game ecosystem.

Variation in Leaf Mechanical Damage by Typhoon among Rice Cultivars: Effects on Yield and Rice Quality (태풍에 의한 벼 잎 파열의 품종간 차이 및 잎 파열이 수량과 미질에 미치는 영향)

  • 홍광표;김영광;정완규;손길만;송근우
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.49 no.3
    • /
    • pp.199-206
    • /
    • 2004
  • Typhoon "MAEMI", happened in September 2003, hit the great damage to Gyeongnam province area. Especially, rice plant was lodged or severe leaf damage was caused. This study was conducted to find out the extents of leaf damage among different rice cultivars, and to evaluate rice yield and eating quality due to leaf damage after typhoon. Rice cultivars torn off over half of the flag leaf length (FLL) were one medium-late maturing cultivar (Donginl), medium maturing cultivar (Yeonganbyeo), eight early maturing cultivars (Samcheonbyeo, Jounghwnbyeo, Munjangbyeo, Taebongbyeo, Odaebyeo, Samhaegbyeo, Sobaegbyeo, Sinunbongbyeo), two long-il type cultivars (Samgangbyeo, Namcheonbyeo), and three special use cultivars (Heukseonchalbyeo, Jinbuchalbyeo, Yangjobyeo). Cultivars torn off below 1/10 FLL were eight medium-late maturing cultivars (Chucheongbyeo, Daecheongbyeo, Saechu cheongbyeo, Donganbyeo, Daeyabyeo, Hwamyeongbyeo, 방eongsanbyeo, Dongjinbyeo) and two medium maturing cultivays (Donghaebyeo, Gumobyeo2). The rest cultivars were tore off by 1/10∼1/2 ELL. In yield components, the longer was flag leaf damage, the lower was ripened grain ratio, grain weight and brown/rough rice ratio, which was severly impacted to late than to ordinary season cultivation. However, rice yield did not decrease up to tearing by 1/10 ELL. Head rice ratio decreased from flag leaf tearing over 1/10 ELL in late season cultivation. The longer was flag leaf damage, the lower was eating quality, which could not show significantly different.