• Title/Summary/Keyword: List

Search Result 4,204, Processing Time 0.035 seconds

A Check List Development for Water Leakage Prevention in Educational Facility (교육시설물 누수방지 Check List 제안에 관한 연구 - 공법, 공간, 단계를 중심으로 -)

  • Kim, Song-Hwa;Kim, Jae-On;Son, Jae-Ho;Lee, Seung-Hyun
    • Proceedings of the Korean Institute Of Construction Engineering and Management
    • /
    • 2008.11a
    • /
    • pp.546-550
    • /
    • 2008
  • Midium-size Companies have participated in most of the Educational Facility Construction. Since they are lack of special manpower, construction experience, and know-how, many construction defects cause. A water leakage is a typical construct defect in the educational facility construction. A water leakage prevention has to be careful considered in plan, construction and maintenance stages. Therefore, this study suggests Check List for the water leakage prevention, which designer/engineer must consider in plan, construction, and maintenance stages for the educational facility.

  • PDF

A New Test Generation Algorithm Using a Backtrace Fault Simulation (역추적 결함 시뮬레이션을 이용한 새로운 테스트 생성 알고리즘)

  • 권기창;백덕화;권기룡
    • KSCI Review
    • /
    • v.2 no.1
    • /
    • pp.121-129
    • /
    • 1995
  • Fault simulation of logic circuits is an important part of the test-generation process. It is used for the propose of generation fault dictionaries or for the verification of the adequacy of tests. In this paper, a backtrace fault simulation is proposed to test generation. This is consists of 3 part ; initialization phase for given circuit, backtrace fault simulation phase to find fault list and reevaluation phase to list event. The main idea of this algorithm is to retain a minimum fault list by cutting uncontrollable lines of path when a logic event occurs in backward tracing phases. And the simulator is revaluates a fault list associated with the output of an element only if logic event occurs at any of its inputs when a list event occurs at one of its primary inputs. It reguires a O(n) memory space complexity. where n is a number of signal lines for the given circuits. Several examples are given to illustrate the power of this algorithm.

  • PDF

Building Hybrid Stop-Words Technique with Normalization for Pre-Processing Arabic Text

  • Atwan, Jaffar
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.7
    • /
    • pp.65-74
    • /
    • 2022
  • In natural language processing, commonly used words such as prepositions are referred to as stop-words; they have no inherent meaning and are therefore ignored in indexing and retrieval tasks. The removal of stop-words from Arabic text has a significant impact in terms of reducing the size of a cor- pus text, which leads to an improvement in the effectiveness and performance of Arabic-language processing systems. This study investigated the effectiveness of applying a stop-word lists elimination with normalization as a preprocessing step. The idea was to merge statistical method with the linguistic method to attain the best efficacy, and comparing the effects of this two-pronged approach in reducing corpus size for Ara- bic natural language processing systems. Three stop-word lists were considered: an Arabic Text Lookup Stop-list, Frequency- based Stop-list using Zipf's law, and Combined Stop-list. An experiment was conducted using a selected file from the Arabic Newswire data set. In the experiment, the size of the cor- pus was compared after removing the words contained in each list. The results showed that the best reduction in size was achieved by using the Combined Stop-list with normalization, with a word count reduction of 452930 and a compression rate of 30%.

Contents Recommendation Scheme Applying Non-preference Separately (비선호 분리 적용 콘텐츠 추천 방안)

  • Yoon Joo-young;Lee Kil-hung
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.19 no.3
    • /
    • pp.221-232
    • /
    • 2023
  • In this paper, we propose a recommendation system based on the latent factor model using matrix factorization, which is one of the most commonly used collaborative filtering algorithms for recommendation systems. In particular, by introducing the concept of creating a list of recommended content and a list of non-preferred recommended content, and removing the non-preferred recommended content from the list of recommended content, we propose a method to ultimately increase the satisfaction. The experiment confirmed that using a separate list of non-preferred content to find non-preferred content increased precision by 135%, accuracy by 149%, and F1 score by 72% compared to using the existing recommendation list. In addition, assuming that users do not view non-preferred content through the proposed algorithm, the average evaluation score of a specific user used in the experiment increased by about 35%, from 2.55 to 3.44, thereby increasing user satisfaction. It has been confirmed that this algorithm is more effective than the algorithms used in existing recommendation systems.

Ditching the Party: Disaggregating Split Ticket Voting in Taiwan's 2016 Legislative Election

  • Rich, Timothy S.
    • Analyses & Alternatives
    • /
    • v.3 no.1
    • /
    • pp.63-92
    • /
    • 2019
  • What motivates split-ticket voting in mixed electoral systems, where voters choose one party in district races and another party on the party list ballot? While much of the literature assumes strategic intent, three aspects commonly are overlooked: the competitiveness of district races, the presence of a district candidate from one's preferred party, and whether voters know the electoral threshold for party list seats. Furthermore, few studies disaggregate types of split-ticket voting (e.g. not voting for one's preferred party in a district vs. party list). Taiwan provides an intriguing case study for analysis, not only as a relatively new adopter of a mixed system, but also the presence of additional conditions that would encourage at least the consideration of a split ticket. Using survey data from the Taiwan's Election and Democratization Studies (TEDS) after the Taiwan's 2016 Legislative Yuan election, this analysis finds that knowing the threshold, the winner's margin, and the placement of a district candidate from one's preferred party all influence split-ticket voting among those with a partisan preference. However, closer inspection identifies a distinction between defecting from the district versus the party list. Evidence shows that district competitiveness and candidate placement influences defection from the district candidate, while the electoral threshold influences defection from the party list. The results add to our understanding of strategic and non-strategic incentives in mixed systems.

  • PDF

THE RADIO SOURCE LIST AND THE COUNT AT 1420 MHz IN THE FIELD OF ABELL 2256

  • KIM KWANG TAE
    • Journal of The Korean Astronomical Society
    • /
    • v.28 no.1
    • /
    • pp.1-13
    • /
    • 1995
  • A list of radio sources in the field of Abell 2256 is presented at 1420 MHz. Also presented is the source count based on the list. This source count is taken with the sources above $7\sigma$ level at 1420 MHz. The overall characteristics of the count is consistent with that of a field where no galaxy cluster presents. The excess of radio sources due to the cluster is examined in the source count but it turned out to be unnoticiable as expected.

  • PDF

ACL Improvement in Web Cache Server (웹 캐시 서버에서의 ACL 개선방안)

  • 강선애;김기창;심종익
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.10c
    • /
    • pp.382-384
    • /
    • 2001
  • 인터넷 사용자의 증가로 인한 서버의 과부하 및 네트워크 응답시간 지연의 대안으로 캐시서버의 사용이 보편화되고 있다. 그러 나, 최근 유해사이트의 급격한 중가로 캐시 서버의 부가 기능인 ACL(Access Control List)또한 중요한 기능의 하나가 되면서 대량의 유해사이트 차단 목록이 캐시 서버의 병목현상을 가중시키고 있다 본 논문에서는 캐시 서버의 대명사격인 Squid의 ACL방식과 대량의 black list를 적용했을 때의 ACL의 regular expression방식의 문제점을 살펴보고, 대량의 black list에 적합한 hash기반 ACL 처리 방식을 제안한다. hash를 이용한 ACL방식은 빠른 검색을 제공하여 캐시 서버의 응답시간에 큰 영향을 주지않기 때문에 캐시서버가 정상적인 서비스를 할 수 있도록 해준다.

  • PDF

Implementation of deductive fault simulation using counting method (카운팅 방법을 사용한 연역적 고장 시뮬레이션의 구현)

  • 강신영;김규철
    • Proceedings of the IEEK Conference
    • /
    • 2000.11b
    • /
    • pp.176-179
    • /
    • 2000
  • Fault simulation is often necessary to determine the fault coverage of a given test, that is, to find all the faults detected by test. In this paper we implement a deductive fault simulation using counting method. Counting method uses f$\sub$i/ of fault table and Search list to compute set operation. f$\sub$i/ was counted by fault list of input gate. And we propagate fault list from primary inputs toward primary output by comparing with controling sum. It improved performance by reducing search of faults.

  • PDF