• Title/Summary/Keyword: rule check

Search Result 132, Processing Time 0.023 seconds

음성인식용 DTW PE의 IC화를 위한 ADD 및 ABS 회로의 설계

  • 정광재;문홍진;최규훈;김종교
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.15 no.8
    • /
    • pp.648-658
    • /
    • 1990
  • There are many methods for speed up counting in speech recongition. A multiple processing method is the one way to achieve the aim using systolic array. This arithmetic operation by the array is achieved pipelining skill. And the operation is multiprocessing by processing element(PE) that is incresing counting efficiencies. The DTW PE cell is seperated into three large blocks. "MIN" is the one block for counting accumulated minimum distance, "ADD" block calculated these minimum distances, and "ABS" seeks for the absolut values to the total sum of local distances. We have accomplished circuit design and verification about the "ADD" and "ABS" blocks, and performed total layout '||'&'||' DRC(design rule check) using 3um CMOS N-Well rule base.le check) using 3$\mu$m CMOS N-Well rule base.

  • PDF

Static Analysis In Computer Go By Using String Graph (컴퓨터 바둑에서 String Graph를 사용한 정적분석)

  • 박현수;김항준
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.4
    • /
    • pp.59-66
    • /
    • 2004
  • We define a SG(String Graph) and an ASG(Alive String Graph) to the purpose to do static analysis. For a life and death judgment, we apply the rule to the situation which the stone is included and not included. We define the rules that are SR(String Reduction), ER(Empty Reduction), ET(Edge Transform), and CG(Circular Graph), when the stone is not included. We define the rules that are DESR(Dead Enemy Strings Reduction) and SCSR(Same Color String Reduction), when the stone is included. We evaluate a SG that it is an ASG or not by using rules. And we use APC(Articulation Point Check) nile according to number of articulation points lot a life and death judgment. The performance of our method has been tested on the problem set IGS_31_counted form the Computer Go Test Collection. The test set contains 11,191 Points and 1,123 Strings. We obtain 92.5% accuracy of Points and 95.7% accuracy of Strings.

Comparison of Buckling Check Formulas and Optimal Design (보강판의 좌굴 평가식에 따른 좌굴 강도 및 최적설계의 비교)

  • Jang, Beom-Seon;Cho, Ho-Young
    • Journal of Ocean Engineering and Technology
    • /
    • v.23 no.5
    • /
    • pp.71-78
    • /
    • 2009
  • In ship design or offshore structure design, the evaluation of buckling strength (or ultimate strength) is critical to the determination of scantling of stiffened plates. For this reason, it is useful to study the effect of applying different formula or the relationship between stiffened plate with buckling utilization factor (UF). It can facilitate a designer to decide how much the scantling should be reinforced or how much can be reduced for an optimal design. This paper conducts a comparative study for three buckling check methods; DNV-Ship-Rule, DNV-RP-C201, DNV-PULS. The capacity curves and 2D contour plot for utilization factors versus bi-axial in-plane stresses are compared. The contour plots of DNV-Ship-Rule and DNV-PULS show smoothly increasing trends of UF as the applied in-plane stresses increase, however that of DNV-RP-C201 shows rapidly increasing trend as the applied stresses go beyond transverse buckling stress. A sensitivity analysis is performed to investigate the influence level of each parameter of a stiffened plate on UF. Resulting from the analysis, plate thickness is identified to be the most affective parameter to UF regardless of the buckling check methods. Based on the addressed study, optimal designs for bottom plate of 165 K tanker corresponding to three formulas are compared with each other. DNV-PULS yields 1 mm and 2 mm less thickness than DNV-Ship-Rule and DNV-RP-C201, respectively.

A Study on the Choice of Fuzzy Rule Genetic Algorithm Using Similarity Check Method (유사성 체크 방법을 이용한 Fuzzy Rule선택 Genetic Algorithm에 관한 연구)

  • Kang, Jeon-Geun;Kim, Myeong-Soon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2017.11a
    • /
    • pp.731-734
    • /
    • 2017
  • GA(Genetic Algorithm)는 자연계 진화 과정의 적자생존의 유전적 부호화 및 처리과정을 모델링함으로서 해석적으로 처리하기 힘든 문제의 최적화에 널리 이용하고 있으며, 퍼지제어에서 룰의 선택에도 적용된다. 본 논문에서는 일반적인 GA방법에 자료의 유사성을 체크하는 방법을 도입하여 Fuzzy Rule선택 환경에 적용하고 시뮬레이션을 통해 이를 확인한다. 시뮬레이션 결과 제안된 SFRGA(Similarity Fuzzy Rule Genetic Algorithm)방법은 일반적 GA방법보다 단축된 지연시간 효과와 부수적으로 조기포화 현상(premature convergence)의 감소 및 자동 배정 퍼지 클리스터링(Fuzzy clustering)의 가능성을 얻을 수 있었다.

Control Method for the number of check-point nodes in detection scheme for selective forwarding attacks (선택적 전달 공격 탐지 기법에서의 감시 노드 수 제어기법)

  • Lee, Sang-Jin;Cho, Tae-Ho
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2009.08a
    • /
    • pp.387-390
    • /
    • 2009
  • Wireless Sensor Network (WSN) can easily compromised from attackers because it has the limited resource and deployed in exposed environments. When the sensitive packets are occurred such as enemy's movement or fire alarm, attackers can selectively drop them using a compromised node. It brings the isolation between the basestation and the sensor fields. To detect selective forwarding attack, Xiao, Yu and Gao proposed checkpoint-based multi-hop acknowledgement scheme (CHEMAS). The check-point nodes are used to detect the area which generating selective forwarding attacks. However, CHEMAS has static probability of selecting check-point nodes. It cannot achieve the flexibility to coordinate between the detection ability and the energy consumption. In this paper, we propose the control method for the number fo check-point nodes. Through the control method, we can achieve the flexibility which can provide the sufficient detection ability while conserving the energy consumption.

  • PDF

The Reformation of the Public Record Management System in Early Chosǒn Dynasty (조선초기 공기록물(公記錄物) 관리제(管理制)의 개편)

  • Yoon, Hoon-pyo
    • The Korean Journal of Archival Studies
    • /
    • no.2
    • /
    • pp.129-168
    • /
    • 2000
  • $Chos{\check{o}}n$ Dynasty was governed by the words of king, however, if they were not announced by the form of public document, they were useless. Therefore, the form of public document was the symbol of governing activity, and it was very important to manage the public record in operating the nation affairs. However, the point we should consider is that $Chos{\check{o}}n$ Dynasty, in the case of managing the public record, edited 'the original' instead of preserving them. And so, the preservation of the public record was deeply related to the editing of history. In Late Korea dynasty, the management of the public record got into utter confusion and so many troubles were occurred. In order to resolve these problems, the movements which innovated the public record managements system was gradually extended. This movements were continued in $Chos{\check{o}}n$ Dynasty. Finally, through the several modification procedures, the rules of public record management were legislated by 'Kyong Kuk Dae Jeon'(經國大典). Especially, by laws of 'Kyong Kuk Dae Jeon', not only the daily records of Secretary Department(承政院) but also the important documents which was related to the government branch should be booked in the last decade of the year and the number of the books had to be reported to the king. This rule made certification of the fact that the king was the last confirmer of the public record management. In addition, through the procedure of printing the record of the national affairs, and the diplomatic once in three years, and then preserving that public record in the National Department(議政府), other departments responsible and the archives, the National Department practically took part in the public record management. The management system was also changed in order that the public record was virtually used and consulted before taking the procedure of immortal preservation. All public documents were classified by the definite rule and filed in a same volume. After classifying and filing, certainly, for making convenience of reference and application of public record, records were indicated by the paper card. It may be that, after the step of reference, application and indicating, the public documents were gradually transferred to the next step. In these procedures, Early $Chos{\check{o}}n$ public documents system was confirmed.

Development of association rule threshold by balancing of relative rule accuracy (상대적 규칙 정확도의 균형화에 의한 연관성 측도의 개발)

  • Park, Hee Chang
    • Journal of the Korean Data and Information Science Society
    • /
    • v.25 no.6
    • /
    • pp.1345-1352
    • /
    • 2014
  • Data mining is the representative methodology to obtain meaningful information in the era of big data.By Wikipedia, association rule learning is a popular and well researched method for discovering interesting relationship between itemsets in large databases using association thresholds. It is intended to identify strong rules discovered in databases using different interestingness measures. Unlike general association rule, inverse association rule mining finds the rules that a special item does not occur if an item does not occur. If two types of association rule can be simultaneously considered, we can obtain the marketing information for some related products as well as the information of specific product marketing. In this paper, we propose a balanced attributable relative accuracy applicable to these association rule techniques, and then check the three conditions of interestingness measures by Piatetsky-Shapiro (1991). The comparative studies with rule accuracy, relative accuracy, attributable relative accuracy, and balanced attributable relative accuracy are shown by numerical example. The results show that balanced attributable relative accuracy is better than any other accuracy measures.

Compatibility-Guaranteeing Software Component Evolution based on Composition Rules (안정적 확장이 보장되는 소프트웨어를 위한 정형적 조합 법칙)

  • Lee, Sunae;Lee, Joon-Sang;Bae, Doo-Hwan
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04c
    • /
    • pp.10-12
    • /
    • 2003
  • Since building large-scale software is usually bi9 burden to most developers, it has been an important issue for many researchers. In this paper, we suggest a mechanism that can be used to support such large-scale development. Through composition rules via subtyping within Statecharts, incremental construction of software can be achieved. Among the composition rules (i.e. delegation rule and mixin rule), we mainly focus on the delegation rule in our work. Not only we can check the subtype property. but also can verify the behavior compatibility of composite results that are available by composition rules. This new mechanism is helpful for analysts as well as designers, and it can be used as a guideline for incremental and compatible construction of component based software.

  • PDF

A Study on the Fault Diagnosis System for Combustion System of Diesel Engines Using Knowledge Based Fuzzy Inference (지식기반 퍼지 추론을 이용한 디젤기관 연소계통의 고장진단 시스템에 관한 연구)

  • 유영호;천행춘
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.27 no.1
    • /
    • pp.42-48
    • /
    • 2003
  • In general many engineers can diagnose the fault condition using the abnormal ones among data monitored from a diesel engine, but they don't need the system modelling or identification for the work. They check the abnormal data and the relationship and then catch the fault condition of the engine. This paper proposes the construction of a fault diagnosis engine through malfunction data gained from the data fault detection system of neural networks for diesel generator engine, and the rule inference method to induce the rule for fuzzy inference from the malfunction data of diesel engine like a site engineer with a fuzzy system. The proposed fault diagnosis system is constructed in the sense of the Malfunction Diagnosis Engine(MDE) and Hierarchy of Malfunction Hypotheses(HMH). The system is concerned with the rule reduction method of knowledge base for related data among the various interactive data.

PC-DRC : Design Rule Check for Integrated Circuit Using PC (PC-DRC : PC를 이용한 집적회로 layout 설계 규칙 검사)

  • Park, In-Cheol;Eo, Kil-Soo;Kyung, Chong-Min
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1547-1550
    • /
    • 1987
  • This paper describes a new design rule checking system, PC-DRC, for CIF mask layout, which was written in C language on IBM PC/AT under DOS 3.0 environment. H/W devices and S/W utilities for PC-DRC is identical to that for PC-LADY[6], which makes PC-DRC an ideal post-processing routine for CIF file generated by PC-LADY. Various spurious errors were eliminated by ORing the input ClF data for each layer and the design rule errors were checked by edge based method on rectilinear polygon form. The detected errors are stored in CIF and displayed on CRT simultaneously.

  • PDF