• Annual Conference of KIPS
• /
• 2023.05a
• /
• pp.432-433
• /
• 2023

오늘날 AI 기술은 다양한 분야에서 활용되며 발전해나가고 있다. 하지만 AI 모델의 복잡도가 증가하며 AI의 산출 결과의 해석이 불가능한 Black-box 성격을 지니게 되었고, 이는 실 환경에서 AI 도입의 커다란 걸림돌로 작용하고 있다. 이에 따라 AI 판단 결과에 대한 Interpretation을 제공하는AI Decision Support의 중요성이 커지는 추세이다. 본 논문에서는 Reference 기반 Rule을 통해 AI 모델의 판단 결과에 대한 해석을 제공하고 입력된 데이터에 관한 Rule 적합도를 산출하여 AI Decision Support를 제공하고자 한다. 또한, Rule 적합도 정보를 기반으로 기존의 모델보다 정확한산출 결과를 통해 수집된 데이터의 Label을 확정시킨다. 이를 토대로 AI 모델의 업데이트를 실행하여 지속적으로 AI의 성능을 개선하면서도 지속 운용이 가능한 AI 운용 프레임워크를 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1085-1095
• /
• 2000

In this paper, we have defined the rules and the algorithm for diagnosis and recovery of routing configuration fault on a system. By using them, we have implemented the Java-based system that can manage routing configuration fault automatically. To manage routing configuration fault, the production rule for network configuration management, the production rule for routing configuration fault diagnosis, and the production rule for routing configuration fault recovery have been proposed. Rule-based routing configuration fault management system has been implemented on the basis of backward chaining algorithm and applied for meta rules for the purpose of interconnecting the production rules. We have derived the experimental result from transition process of the rules, the Blackboard, the goals based on scenarios. Through the implementation of dynamically applicable system in heterogeneous and rapidly changing network environments, we have proposed the methodology for network configuration fault management. Also, we expect that network configuration manager can reduce time and cost wasted for routing configuration fault management.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.5
• /
• pp.587-592
• /
• 2004

Context-aware computing systems require real-time context reasoning process for context awareness. Context reasoning can be done by comparing input information from sensors with knowledge-base within system. This method is identical with it of rule-based systems. In this paper, we propose hardware rule-based system architecture which can process context reasoning in real-time. Compared to previous architecture, hardware rule-based system architecture can reduce the number of constraints on rule representations and combinations of condition terms in rules. The modified content addressable memory, crossbar switch network and pre-processing module are used for reducing constraints. Using SystemC for description can provide easy modification of system configuration later.

• Journal of KIISE
• /
• v.42 no.8
• /
• pp.961-971
• /
• 2015

As a representative area-decomposed algorithm, an area-based quad-trie (AQT) has an issue of search performance. The search procedure must continue to follow the path to its end, due to the possibility of the higher priority-matching rule, even though a matching rule is encountered in a node. A leaf-pushing AQT improves the search performance of the AQT by making a single rule node exist in each search path. This paper proposes a new algorithm to further improve the search performance of the leaf-pushing AQT. The proposed algorithm implements a leaf-pushing AQT using a hash table and an on-chip Bloom filter. In the proposed algorithm, by sequentially querying the Bloom filter, the level of the rule node in the leaf-pushing AQT is identified first. After this procedure, the rule database, which is usually stored in an off-chip memory, is accessed. Simulation results show that packet classification can be performed through a single hash table access using a reasonable sized Bloom filter. The proposed algorithm is compared with existing algorithms in terms of the memory requirement and the search performance.

• Speech Sciences
• /
• v.8 no.3
• /
• pp.15-30
• /
• 2001

Lateralization, the change of a coronal nasal into a lateral in an l-n sequence, has been considered to be prosodically unrestricted, e.g. an utterance-span rule, in Korean (Han 1993, Park 1990). However, aerodynamic data of the nasal do not corroborate their claims. In the paper, I look at how lateralization can best be characterized. Specifically, I ask whether its domain is best treated via a syntax-based (Nespor & Vogel 1986, Selkirk 1984) or an intonation-based approach (Pierrehumbert 1980, Jun 1993) to prosodic structure. Based on nasal airflow data as a means of monitoring velum activity coincident with a nasal stop in an l-n sequence, combined with pitch tracks to define an accentual phrase, I argue that lateralization is neither an utterance-span rule nor a syntax-based rule. Sentences recorded with a potential environment for lateralization show that lateralization occurs within an accentural phrase but is blocked between accentual phrase boundaries. When intonation-based and syntax-based models disagree about phrase boundaries, lateralization only occurs where the intonation-based model predicts it will. This indicates that lateralization is best defined as an accentual pheonomenon, being sensitive to the accentual phrase. This finding lends further support to an intonation-based model for Korean prosodic structure (Jun 1993).

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.527-530
• /
• 1998

In this paper, a transformation-based English part of speech tagging system is designed and implemented. The tagging system tags raw corpus at first and the transformation rule correct the errors. Apart from traditional rule based tagging system, this system makes rules automatically. Using 60,000 words of corpus as a training corpus, the transformation rules are generated automatically by iterative training. The idea how to calculate positive effect of transformation and select transformation rules is proposed to generate more effective and correct transformations. In this paper, part of the Brown corpus and English text is used for experimental data. And the performance of transformation based tagging system is demonstrated by the calculation of accuracy.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.6
• /
• pp.106-118
• /
• 1998

The study concerns a design procedure of rule-based systems. The proposed rule-based fuzzy modeling implements system structure and parameter identification in the efficient from of "IF..., THEN..." statements, and exploits the theory of system optimization and fuzzy implication rules. The method for rule-based fuzzy modeling concerns the from of the conclusion part of the the rules that can be constant. Both triangular and Gaussian-like membership function are studied. The optimization hinges on an autotuning algorithm that covers as a modified constrained optimization method known as a complex method. The study introduces a weighted performance index (objective function) that helps achieve a sound balance between the quality of results produced for the training and testing set. This methodology sheds light on the role and impact of different parameters of the model on its performance. The study is illustrated with the aid of two representative numerical examples.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.703-707
• /
• 1991

During the past several years, fuzzy control has emerged as one of the most active and fruitful areas for reaserch in the applications of fuzzy set theory. A key component of the fuzzy controller is a rule-based system which provides a linguistic description of control strategy. This strategy has the form of a collection of fuzzy conditional statements which are implemented and manipulated using fuzzy set theory. In this paper, we propose the rule-based controller for DC motor speed control. The result of performance compare with PID controller to verify the validity of proposed algorithm.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.05a
• /
• pp.329-337
• /
• 2007

Case-based reasoning (CBR) methods are applied to various target problems on the supposition that previous cases are sufficiently similar to current target problems, and the results of previous similar cases support the same result consistently. However, these assumptions are not applicable for some target cases. There are some target cases that have no sufficiently similar cases, or if they have, the results of these previous cases are inconsistent. That is, the appropriateness of CBR is different for each target case, even though they are problems in the same domain. Thus, applying CBR to whole datasets in a domain is not reasonable. This paper presents a new hybrid datamining technique called two-step filtering CBR and Rule Induction (TSFCR), which dynamically selects either CBR or RI for each target case, taking into consideration similarities and consistencies of previous cases. We apply this method to three medical diagnosis datasets and one credit analysis dataset in order to demonstrate that TSFCR outperforms the genuine CBR and RI.

• Journal of Korean Society for Quality Management
• /
• v.31 no.3
• /
• pp.114-125
• /
• 2003

In this paper, we deal with the problem of modeling of agent-based robot manufacturing cell. Its role is becoming increasingly important in automated manufacturing systems. For Object Oriented & Queueing Petri Nets (OO&QPNs), an extended formalism for the combined quantitative and qualitative analysis of different systems is used for structure and performance analysis of mobile robotic cell. In the case study, the OO&QPN model of a mobile robotic cell is represented and analyzed, considering multi-class parts, non-preemptive priority and alternative routing. Finally, the comparison of performance values between Shortest Process Time (SPT) rule and First Come First Serve (FCFS) rule is suggested. In general, SPT rule is most suitable for parts that have shorter processing time than others.