• Title/Summary/Keyword: counting problem

Search Result 115, Processing Time 0.019 seconds

Hot Data Verification Method Considering Continuity and Frequency of Write Requests Using Counting Filter

  • Lee, Seung-Woo;Ryu, Kwan-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.6
    • /
    • pp.1-9
    • /
    • 2019
  • Hard disks, which have long been used as secondary storage in computing systems, are increasingly being replaced by solid state drives (SSDs), due to their relatively fast data input / output speeds and small, light weight. SSDs that use NAND flash memory as a storage medium are significantly different from hard disks in terms of physical operation and internal operation. In particular, there is a feature that data overwrite can not be performed, which causes erase operation before writing. In order to solve this problem, a hot data for frequently updating a data for a specific page is distinguished from a cold data for a relatively non-hot data. Hot data identification helps to improve overall performance by identifying and managing hot data separately. Among the various hot data identification methods known so far, there is a technique of recording consecutive write requests by using a Bloom filter and judging the values by hot data. However, the Bloom filter technique has a problem that a new bit array must be generated every time a set of items is changed. In addition, since it is judged based on a continuous write request, it is possible to make a wrong judgment. In this paper, we propose a method using a counting filter for accurate hot data verification. The proposed method examines consecutive write requests. It also records the number of times consecutive write requests occur. The proposed method enables more accurate hot data verification.

Similarity Analysis of Exports Value Added by Country and Implication for Korea's Global Value Added Chains

  • Cho, Jung-Hwan
    • Journal of Korea Trade
    • /
    • v.23 no.4
    • /
    • pp.103-114
    • /
    • 2019
  • Purpose - This paper investigates the structure of exports across countries in terms of value added. Exports value added is examined under two categories, domestic and overseas. Using a statistical classification method by distance based on these two value added categories, this paper estimates the similarity of exports value added across countries including Korea. Design/methodology - The model of study is to employ a generalized distance function and then derive the Manhattan and Euclidean distances. The paper also performs cluster analysis using the Partitioning Around Medoids (PAM) and hierarchical methods to classify the 44 sample countries considered in this study. Findings - Our main findings are as follows. The 44 countries can be classified under 5 groups by their domestic and overseas value added in exports. Korea has a sandwich global value chains (GVCs) position between Japan, China, and Taiwan in the East Asian region. Originality/value - Existing papers point out the double counting problem of trade statistics as the intermediate goods trade across borders increases. This paper addresses the double counting problem by using the World Input-Output Table. The paper shows the need to explore the similarity of value added in exports structure across countries and investigate the GVCs position and role of each country.

Effects of Illuminating Condition on ERP and Work Performance during a Counting Task (계수작업시 사상관련전위 및 작업성능에 미치는 조명조건의 영향)

  • 임현교
    • Journal of the Korean Society of Safety
    • /
    • v.15 no.1
    • /
    • pp.167-175
    • /
    • 2000
  • Work performance and human error are complicated phenomena so that it is very difficult to grasp the true nature of them. However, Event Related Potential (ERP) may give a clue to them because human brain reflects diverse psychophysiological process. In the present study, the possibility of ERP application to the ergonomic area was evaluated in view of grasping error symptoms. For that purpose, the subjects were asked to count specific characters in a random character matrix on a computer monitor, and their ERP was compared with their performance data. Based upon the results, the amplitude of P300 was not so high as that in the case of the Odd Ball tasks, correct response corresponded with stable ERP with high P300 amplitude whereas wrong response did with unstable, fluctuating ERP with low P300 amplitude. Those results coincided with the work performance, and it was concluded that 3-wave fluorescent with illumination level of 800 lux would be recommendable for the counting task in concern. Conclusively, ERP including P300 might supply an objective clue to the problem of human errors in cognitive process.

  • PDF

Analysis of Food Poisoning via Zero Inflation Models

  • Jung, Hwan-Sik;Kim, Byung-Jip;Cho, Sin-Sup;Yeo, In-Kwon
    • The Korean Journal of Applied Statistics
    • /
    • v.25 no.5
    • /
    • pp.859-864
    • /
    • 2012
  • Poisson regression and negative binomial regression are usually used to analyze counting data; however, these models are unsuitable for fit zero-inflated data that contain unexpected zero-valued observations. In this paper, we review the zero-inflated regression in which Bernoulli process and the counting process are hierarchically mixed. It is known that zero-inflated regression can efficiently model the over-dispersion problem. Vuong statistic is employed to compare performances of the zero-inflated models with other standard models.

Performance Analysis on SAT, PB and SMT for Counting Problems (카운팅 문제에 대한 SAT, PB, SMT의 성능 분석)

  • Park, Ho-Jin;Park, Sa-Choun;Kwon, Gi-Hwon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.05a
    • /
    • pp.371-374
    • /
    • 2008
  • n개의 이진 변수 집합 중에 k개를 선택하는 카운팅 문제(Counting Problem)들은 여러 방법으로 풀이가 가능하다. 본 논문에서는 카운팅 문제를 풀기 위해 SAT, PB, SMT를 소개하고, 칸 칠하기(Fill-a-Pix) 퍼즐을 예로 들어 카운팅 문제의 인코딩 방법을 제시하고 처리 결과를 비교해 보았다. SAT이 상대적으로 인코딩은 가장 복잡했으나, 처리 시 가장 우수한 성능을 보였다. 따라서 본 논문은 카운팅 문제를 다룰 때에는 SAT이 가장 적합하다는 것을 제안한다.

A resource-constrained job shop scheduling problem with general precedence constraints

  • Ahn, Jaekyoung
    • Korean Management Science Review
    • /
    • v.10 no.1
    • /
    • pp.171-192
    • /
    • 1993
  • In this paper, a rule for dispatching operations, named the Most Dissimilar Resources (MDR) dispatching rule is presented. The MDR dispatching rule has been designed to maximize utilization of resources in a resource-constrained job shop with general precedence constraints. In shown that solving the above scheduling problem with the MDR dispatching rule is equivalent to multiple solving of the maximum clique problem. A graph theoretic approach is used to model the latter problem. The pairwise counting heuristic of computational time complexity O(n$^{2}$) is developed to solve the maximum clique problem. An attempt is made to combine the MDR dispatching rule with the existing look-ahead dispatching rules. Computational experience indicates that the combined MDR dispatching rules provide solutions of better quality and consistency than the dispatching rules tested in a resource-constrained job shop.

  • PDF

STOCHASTIC SINGLE MACHINE SCHEDULING WITH WEIGHTED QUADRATIC EARLY-TARDY PENALTIES

  • Zhao, Chuan-Li;Tang, Heng-Yong
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.5_6
    • /
    • pp.889-900
    • /
    • 2008
  • The problem of scheduling n jobs on a single machine is considered when the machine is subject to stochastic breakdowns. The objective is to minimize the weighted squared deviation of job completion times from a common due date. Two versions of the problem are addressed. In the first one the common due date is a given constant, whereas in the second one the common due date is a decision variable. In each case, a general form of deterministic equivalent of the stochastic scheduling problem is obtained when the counting process N(t) related to the machine uptimes is a Poisson process. It is proved that an optimal schedule must be V-shaped in terms of weighted processing time when the agreeable weight condition is satisfied. Based on the V-shape property, two dynamic programming algorithms are proposed to solve both versions of the problem.

  • PDF

Content Analysis of the 5th grade Science Textbooks in Japan and Korea (한국과 일본 5학년 과학 교과서 내용 분석)

  • Kim, Hyo-Nam;Lee, Young-Mi
    • Journal of The Korean Association For Science Education
    • /
    • v.15 no.4
    • /
    • pp.452-458
    • /
    • 1995
  • Science textbooks are very important materials in order to know elementary science learning in Japan and Korea. In this research the 5th grade science textbooks in Japan and Korea are analyzed by an analyzing category. The analyzing category is consisted of knowledge and scientific inquiry. Knowledge is divided by fact, concept, and rule. Scientific inquiry is divided by problem cognition, variable control, experiment planning, observing, measuring, categorizing, inferring, data transformation, predicting, correlation, cause and effect, result, communication, which are 13 subcategories. Analyzing methods are counting the frequency of each subcategory and tabulating the data. The results of this study are: 1. The frequency of scientific inquiry appeared in Korean 5th grade science textbooks is three times more than that in Japanese textbooks. 2. In scientific inquiry category, Japanese science textbooks emphasized observing, predicting, measuring and problem cognition; Korean science textbooks emphasized experiment planning, observing and problem cognition. 3. In knowledge category, fact subcategory is mostly emphasized in both countries.

  • PDF

COMBINATORIAL ENUMERATION OF THE REGIONS OF SOME LINEAR ARRANGEMENTS

  • Seo, Seunghyun
    • Bulletin of the Korean Mathematical Society
    • /
    • v.53 no.5
    • /
    • pp.1281-1289
    • /
    • 2016
  • Richard Stanley suggested the problem of finding combinatorial proofs of formulas for counting regions of certain hyperplane arrangements defined by hyperplanes of the form $x_i=0$, $x_i=x_j$, and $x_i=2x_j$ that were found using the finite field method. We give such proofs, using embroidered permutations and linear extensions of posets.

THE WEIGHTED SECOND MAIN THEOREM AND ALGEBRAIC DEPENDENCE OF MEROMORPHIC MAPPINGS SHARING MOVING HYPERPLANES

  • Cao, Hongzhe;Duan, Lizhen
    • Bulletin of the Korean Mathematical Society
    • /
    • v.57 no.1
    • /
    • pp.179-194
    • /
    • 2020
  • In this article, we establish some new second main theorems for meromorphic mappings of ℂm into ℙn(ℂ), in which the truncated counting functions have different weights. As for application, we deal with the algebraic dependence problem of meromorphic mappings sharing moving hyperplanes in general position.