• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.6
• /
• pp.1283-1293
• /
• 2014

In ubiquitous environment, data are changing rapidly and new data is coming as times passes. And sometimes all of the past data will be lost if there is not sufficient space in memory. Therefore, there is a need to make rules and combine it with new data not to lose all the past data or to deal with large amounts of data. In making decision trees and extracting rules, the weight of each of rules is generally determined by the total number of the class at leaf. The computational problem of finding a minimum finite state acceptor compatible with given data is NP-hard. We assume that rules extracted are not correct and may have the loss of some information. Because of this precondition. this paper presents a new approach for refining rules. It controls their weight of rules of previous knowledge or data. In solving rule refinement, this paper tries to make a variety of rules with pruning method with majority and minority properties, control weight of each of rules and observe the change of performances. In this paper, the decision tree classifier with extended data expression having static weight is used for this proposed study. Experiments show that performances conducted with a new policy of refining rules may get better.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1858-1860
• /
• 2016

In this paper, a modified YARA software architecture that can perform pattern matching for multi-rule files is proposed. Based on a improved scanning thread algorithm, the new design reduces memory loading time of rule files for pattern matching. Therefore, the proposed architecture can reduce operation time for pattern matching while it requires an increased memory in proportion to the number of rule files.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10A
• /
• pp.1603-1610
• /
• 1999

본 논문은 CMOS의 latch-up 특성을 개선하기 위한 효과적인 mask 설계 방법에 관한 것이다. Mask의 평면구조와 latch-up 파라메타와의 상관관계를 실물 제작에 의한 실험과 컴퓨터 시뮬레이션에 의해 도출하였으며, guard ring의 효과에 대해서도 비교 분석하였다. 실험 결과, 수평구조 바이폴라 트랜지스터의 전류증폭률($\beta$n)이 디자인룰에 반비례하였으며, 수직구조 바이폴라 트랜지스터의 전류증폭률($\beta$n)은 디지인룰과 무관하였다. 스위칭전압과 유지전류는 디자인룰에 비례하였다. Guard ring은 latch-up의 가능성을 줄이는 데 상당한 효과가 있었음이 확인되었으며, Guard ring이 없는 경우에 비하여 전류증폭률의 곱($\beta$n$\beta$n)이 약 31% 감소, 유지전류는 약 25%가 향상됨을 확인하였다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.1
• /
• pp.735-743
• /
• 2015

The service oriented architecture assures flexibility of enterprise application development, so it supports agile reaction to business change. On the other hand, considerable effort is needed to develop a service by combining business and constraint consumes because the entire combination logic should be changed according to the change in business rule. To improve the current method, this paper applied an aspect oriented approach to service system development. In this paper, the rule concern is proposed in addition to the core concern and cross cutting concern of aspect oriented approach. The rule concern is extracted from business rules included in the business processes and services. The rule concern is classified into the process rule aspect and service rule aspect according to the level of the rule. In the proposed approach, system is modularized into the core concern, cross cutting concern and rule concern through separation of concern, and they are maintained independently. Therefore, the adaptability, reusability, and maintainability of a service system will be enhanced.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.05a
• /
• pp.47-50
• /
• 2003

기계학습의 한 종류인 분류자 시스템은 간단한 문제에 대하여 실시간 처리와 온라인 학습이 가능하다. 그러나 복잡한 환경에서는 빠른 적응이 힘들다. 본 논문에서는 복잡한 환경에서 분류자 시스템의 적응 성능을 개선함으로써 실시간이 가능하도록 전체 환경을 분류하고 각기 다른 룰 셋을 이용하는 룰 클러스터링에 의한 분류자 시스템을 제안한다 환경을 상황에 따라 나눔으로써 전체 환경이 변화하였을 경우 각 상황에 따른 변화에 대해서만 추가적으로 학습함으로써 탐색 공간을 줄여 학습 시간을 감소시킨다. 제안한 시스템은 분류자 시스템 중 ZCS을 이용하여 로봇축구 시스템에 적용하여 기존의 방법과 그 성능을 비교 검토한다.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.7
• /
• pp.20-25
• /
• 2003

21세기 초고속 통신시스템 구축의 핵심 부품인 고정밀도의 광페룰(Fig. 1)의 수요는 획기적으로 증가할 것으로 전망된다. 전 세계 광페룰 생산량의 90% 정도를 일본에서 생산하고 있으며, 현재 국내 업체들도 일본산 가공설비를 대부분 도입하여 광페룰을 생산하고 있으나 품질 수준이나 생산량에서 아직 미미한 형편이다. 광페룰의 품질수준은 통신 품질의 향상 욕구에 따라 점점 높은 정밀도와 동심도가 요구되고 있으며 정밀도에 따른 가격의 차는 수배에 달하고 있다.(중략)

• The Korean Journal of Food And Nutrition
• /
• v.27 no.1
• /
• pp.22-30
• /
• 2014

In this study, purple sweet potato bread was prepared by the addition of 0.005%, 0.010%, 0.015% and 0.020% hemicellulase. It's effect on product quality and consumer evaluation were examined. The results showed that the dough pH and total titratable acidity were not significantly different between samples. In the fermentation power of dough expansion, a 0.015% addition sample was the highest between the samples. The bread pH decreased significantly as hemicellulase was increased, whereas. Bread total titratable acidity was significantly decreased. The addition of hemicellulase samples were significantly higher in specific volume and baking loss than the control sample. The moisture content was not significantly different between samples. In colors, the lightness of the control sample was the highest, the redness of the 0.020% addition sample was the lowest while the yellowness of the control was the lowest. The hardness and the fracturability decreased significantly as hemicellulase was increased. The resilience indicated reverse effects. In consumer evaluation, the color and softness were not significantly different between samples. And the hemicellulase addition of samples was higher in flavor than that of the control sample. The overall acceptability was the highest at 5.67 with a 0.010% addition sample. According to these results, the addition of 0.010% hemicellulase in purple sweet potato bread would be the optimum level.

• Journal of Digital Contents Society
• /
• v.18 no.8
• /
• pp.1593-1601
• /
• 2017

In a big data platform, association rule mining applications could bring some benefits. For instance, in a agricultural big data platform, the association rule mining application could recommend specific products for farmers to grow, which could increase income. The key process of the association rule mining is the frequent itemsets mining, which finds sets of products accompanying together frequently. Former researches about this issue, e.g. Apriori, are not satisfying enough because huge possible sets can cause memory to be overloaded. In order to deal with it, SON algorithm has been proposed, which divides the considered set into many smaller ones and handles them sequently. But in a single machine, SON algorithm cause heavy time consuming. In this paper, we present a method to find association rules in our Hadoop based big data platform, by parallelling SON algorithm. The entire process of association rule mining including pre-processing, SON algorithm based frequent itemset mining, and association rule finding is implemented on Hadoop based big data platform. Through the experiment with real dataset, it is conformed that the proposed method outperforms a brute force method.

• Journal of Internet Computing and Services
• /
• v.9 no.5
• /
• pp.23-34
• /
• 2008

The number of web service user is increasing steadily as web-based service is offered in various form. But, web service has a vulnerability such as SQL Injection, Parameter Injection and DoS attack. Therefore, it is required for us to develop Web IDS system and additionally to offer Rule-base intrusion detection/response mechanism against those attacks. However, existing Web IDS system didn't correspond properly on recent web attack mechanism because they didn't including suitable pre-processing procedure on huge web log data. Therfore, we propose an efficient web log pre-processing mechanism for enhancing rule based detection and improving the performance of web IDS base attack response system. Proposed algorithm provides both a field unit parsing and a duplicated string elimination procedure on web log data. And it is also possible for us to construct improved web IDS system.

• The Optical Journal
• /
• v.13 no.2 s.72
• /
• pp.23-27
• /
• 2001

이번 호는 작업관리르 다룬다. 작업 관리는 작업 룰(규율) 관리, 준비 교체 작업 관리, 작업 개선관리의 세 시스템으로 대별할 수 있다. 이와 함께 소정의 표준작업조건 아래서 일정한 작업방법에 따라서 숙련된 작업자가 정상적인 속도로 작업을 수행하는 데 필요한 시간인 '표준 작업시간'을 이해하고, 표준 작업시간 측정방법 가운데 Stop Watch법을 자세히 알아보기로 하자.