• Title/Summary/Keyword: C4.5알고리즘

Search Result 200, Processing Time 0.027 seconds

OCV Hysteresis Effect-based SOC Estimation in EKF Algorithm for a LiFePO4/C Cell (OCV 히스테리시스 특성을 이용한 확장 칼만 필터 기반 리튬 폴리머 배터리 SOC 추정)

  • Kim, J.H;Chun, C.Y.;Hur, I.N.;Cho, B.H.;Kim, B.J.
    • Proceedings of the KIPE Conference
    • /
    • 2011.11a
    • /
    • pp.301-302
    • /
    • 2011
  • 본 논문에서는 리튬 폴리머 배터리($LiFePO_4/C$)의 개방전압(OCV;open-circuit voltage) 히스테리시스 특성을 이용한 확장 칼만 필터(EKF;extended Kalman filter) 기반 state-of-charge(SOC) 추정방법을 소개한다. 배터리 등가회로의 중요 요소인 OCV 모델링을 위해 충전 및 방전 각각의 OCV 히스테리시스 특성을 고려하였고 더불어 OCV-SOC 관계의 SOC 간격을 10%에서 5%로 조정하여 EKF 기반 SOC 추정알고리즘의 성능이 향상되었다. 축소된 하이브리드 자동차용 전류프로파일을 적용했을 때 SOC 추정이 잘 이루어지지 않는 영역은 EKF의 측정방정식에 노이즈 모델 및 데이터 리젝션(data rejection)을 구축하였다. 제안된 방법을 이용하여 SOC 추정결과 전류적산법 대비 5%이내의 SOC 추정에러를 만족하였다.

  • PDF

Fuzzy Logic Based Sound Source Localization System Using Sound Strength in the Underground Parking Lot (지하주차장에서 음의 세기를 이용한 퍼지로직 기반 음원 위치추정 시스템)

  • Choi, Chang Yong;Lee, Dong Myung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.5
    • /
    • pp.434-439
    • /
    • 2013
  • It is very difficult to monitor the blind spots that are not recognized by traditional surveillance camera (CCTV) systems, and the surveillance efficiencies are very low though many accidents/events can be solved by the systems. In this paper, the fuzzy logic based sound source localization system using sound strength in the underground parking lot is suggested and the performance of the system is analyzed in order to enhance the stabilization and the accuracy of the localization algorithm in the suggested system. It is confirmed that the localization stabilization of the localization algorithm (SLA_fuzzy) using the fuzzy logic in the suggested system is 4 times higher than that of the conventional localization algorithm (SLA). In addition to this, the localization accuracy of the SLA_fuzzy in the suggested system is 29% higher than that of the SLA.

Automatic Recognition of Analog and Digital Modulation Signals (아날로그 및 디지털 변조 신호의 자동 인식)

  • Seo Seunghan;Yoon Yeojong;Jin Younghwan;Seo Yongju;Lim Sunmin;Ahn Jaemin;Eun Chang-Soo;Jang Won;Nah Sunphil
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.1C
    • /
    • pp.73-81
    • /
    • 2005
  • We propose an automatic modulation recognition scheme which extracts pre-defined key features from the received signal and then applies equal gain combining method to determine the used modulation. Moreover, we compare and analyze the performance of the proposed algorithm with that of decision-theoretic algorithm. Our scheme extracts five pre-defined key features from each data segment, a data unit for the key feature extraction, which are then averaged over all the segments to recognize the modulation according to the decision procedure. We check the performance of the proposed algorithm through computer simulations for analog modulations such as AM, FM, SSB and for digital modulations such as FSK2, FSK4, PSK2, and PSK4, by measuring recognition success rate varying SNR and data collection time. The result shows that the performance of the proposed scheme is comparable to that of the decision-theoretic algorithm with less complexity.

Data Clustering Algorithm Adaptive to Data Forms (데이터 형태에 적응하는 클러스터링 알고리즘)

  • Lee, K.H.;Lee, K.C.
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2000.10b
    • /
    • pp.1433-1436
    • /
    • 2000
  • 클러스터링에 있어서 k-means[7], DBSCAN[2], CURE[4], ROCK[5], PAM[8], 같은 기존의 알고리즘은 원형이나 타원형 등의 어느 고정된 모양에 의해 클러스터를 결정한다. 만약 클러스터 하려는 데이터의 분포가 우연히 알고리즘의 결정된 모양과 일치하면 정확한 해를 얻을 수 있다. 하지만 자연적인 데이터의 분포에서는 발생하기 어렵다. 데이터의 형태를 추적하여 이러한 문제점을 해결한 CHAMELEON[1] 알고리즘이 최근에 발표되었다. 하지만 모양에는 독립적이나 데이터의 양이 증가함에 따라 소요되는 시간이 폭발적으로 증가한다. 이것은 기존의 마이닝 데이터들이 대용량이라는 것을 고려하면 현실에 적용하기 힘든 문제점이 있다. 이러한 문제점을 해결하기 위해 본 논문에서는 K-means[7]]를 이용한 대표를 선출하는 방법으로 CHAMELEON[1]의 문제점 개선(EF-CHAMELEON)을 시도하였으며 여러 자연적인 형태의 도형들은 아주 작은 원형들의 집합으로 구성 될 수 있다는 생각을 기본으로 잡음에 영향을 받지 않을 정도로 아주 작은 초기 다수의 소형 클러스터를 K-mean을 이용하여 구성하고 이를 다시 크러스터간의 상대적인 거리를 이용하여 다시 머지 하는 방법으로 모양에 의존적인 문제를 해결하며 비교사 학습(unsupervised learning)에 충실하기 위해 임계값을 적용 적정 단계에서 알고리즘을 멈추게 한 ADF 알고리즘을 소개한다. 실험 데이터는 기존의 여러 클러스터링 알고리즘이 판별 할 수 없었던 다양한 모양을 가지고있는 2차원 배열을 사용하여 ADF. CHAMELEON[1], EF-CHAMELEON,의 성능을 비교하였다.

  • PDF

Design and Implementation of the Localization System Using Distance Identification Code in Wireless Sensor Network (무선 센서네트워크에서 거리 식별코드를 이용한 위치인식시스템 설계 및 구현)

  • Choi, Chang-Yong;Lee, Dong-Myung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.8A
    • /
    • pp.575-582
    • /
    • 2009
  • The localization algorithm(LAtu) using the IDentification Code($C_{ID}$) is suggested in RSS(Received Signal Strength) based Wireless Sensor Network(WSN), and the localization system using the suggested algorithm is designed and implemented in this paper. In addition to this, the performance of ranging correction quality and localization error of the localization system(System(LAtu)) that is developed using the LAtu is analyzed and compared with that of the localization system(System(LAieee)) using the channel model of IEEE 802.15.4 standard(LAieee) by the actual experimentation. From the experimentation, the ranging correction quality is analyzed that the LAtu is highly better than the channel model of LAieee about 34% under the distance between the moving module and the beacon module($D_{MM-BM}$) is 2m, and is also a few better than that of the LAieee about average 5% under the $D_{MM-BM}$ is above 5m. The localization error quality of the System(LAtu) is lower than that of the System(LAieee)) about 1cm under the lecture room and 4cm in the large lecture room.

Validation Testing Tool for Light-Weight Stream Ciphers (경량 스트림 암호 구현 적합성 검증 도구)

  • Kang Ju-Sung;Shin Hyun Koo;Yi Okyeon;Hong Dowon
    • The KIPS Transactions:PartC
    • /
    • v.12C no.4 s.100
    • /
    • pp.495-502
    • /
    • 2005
  • Cryptographic algorithm testing is performed to ensure that a specific algorithm implementation is implemented correctly and functions correctly. CMVP(Cryptographic Module Validation Program) of NIST in US is the well-known testing system that validates cryptographic modules to Federal Information Processing Standards (FIPS). There is no FIPS-approved stream cipher, and CMVP doesn't involve its validation testing procedure. In this paper we provide validation systems for three currently used light-weight stream ciphers: Bluetooth encryption algorithm E0, 3GPP encryption algorithm A5/3, and RC4 used for WEP and SSL/TLS Protocols. Moreover we describe our validation tools implemented by JAVA programing.

Temperature Control of Greenhouse Using Ventilation Window Adjustments by a Fuzzy Algorithm (퍼지제어에 의한 자연환기온실의 온도제어)

  • 정태상;민영봉;문경규
    • Journal of Bio-Environment Control
    • /
    • v.10 no.1
    • /
    • pp.42-49
    • /
    • 2001
  • This study was carried out to develop a fuzzy control technique of ventilation window for controlling a temperature in a greenhouse. To reduce the fuzzy variables, the inside air temperature shop was taken as one of fuzzy variables, because the inside air temperature variation of a greenhouse by ventilation at the same window aperture is affected by difference between inside and outside air temperature, outside wind speed and the wind direction. Therefore, the antecedent variables for fuzzy algorithm were used the control error and its slop, which was same value as the inside air temperature slop during the control period, and the conclusion variable was used the window aperture opening rate. Through the basic and applicative control experiment with the control period of 3 minutes the optimum ranges of fuzzy variables were decided. The control error and its slop were taken as 3 and 1.5 times compared with target error in steady state, and the window opening rate were taken as 30% of full size of the window aperture. To evaluate the developed fuzzy algorithm in which the optimized 19 rules of fuzzy production were used, the performances of fuzzy control and PID control were compared. The temperature control errors by the fuzzy control and PID control were lower than 1.3$^{\circ}C$ and 2.2$^{\circ}C$ respectively. The accumulated operating size of the window, the number of operating and the number of inverse operating for the fuzzy control were 0.4 times, 0.5 times and 0.3 times of those compared with the PID control. Therefore, the fuzzy control can operating the window more smooth and reduce the operating energy by 1/2 times of PID control.

  • PDF

Optimi Design for R.C. Beam with Discrete Variables (이산형 설계변수를 갖는 철그콘크리트보의 최적설계)

  • 구봉근;한상훈;김홍룡
    • Magazine of the Korea Concrete Institute
    • /
    • v.5 no.4
    • /
    • pp.167-178
    • /
    • 1993
  • The objective of this paper is to look into the possibility of the detailed and practical optimum design of rt:inforced concrete beam using methods oi discrete mathematical programming. In this discrete optimum formulation, the design variables are the overall depth, width and effective depth of members, and area of longitudinal reinforcement. In addition, the details such as the amount of web reinforcement and cutoff points of longitudinal reinforcement are also considered as variables. Total cost has been used as the objective function. The constraints include the code requirments such as flexural strength, shear strength, ductility, serviceability, concrete cover. spacing, web reinforcement, and development length and cutoff points of longitudinal renforcement. An optimization algorithm is presented for effective optimum design of R.C. beam with discrete de sign variables. First, the continuous variable optimization can be achieved by Feasible Direction Method. Using the results obtained from the continuous variable optimization, a branch and bound method is used to obtained the discrete design values. The proposed algorithm is applied to test problem for reliability, and the results are compared with those of graphical method and rounded-up method. And a simply supported R.C. beam and a two-span continuous R.C. beam are presented as numerical examples for effectiveness and applicability. It is considered that the presented algorithm can be effectively applied to the discrete optimum design of R.C. beams.

Efficient Feature Selection Based Near Real-Time Hybrid Intrusion Detection System (근 실시간 조건을 달성하기 위한 효과적 속성 선택 기법 기반의 고성능 하이브리드 침입 탐지 시스템)

  • Lee, Woosol;Oh, Sangyoon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.12
    • /
    • pp.471-480
    • /
    • 2016
  • Recently, the damage of cyber attack toward infra-system, national defence and security system is gradually increasing. In this situation, military recognizes the importance of cyber warfare, and they establish a cyber system in preparation, regardless of the existence of threaten. Thus, the study of Intrusion Detection System(IDS) that plays an important role in network defence system is required. IDS is divided into misuse and anomaly detection methods. Recent studies attempt to combine those two methods to maximize advantagesand to minimize disadvantages both of misuse and anomaly. The combination is called Hybrid IDS. Previous studies would not be inappropriate for near real-time network environments because they have computational complexity problems. It leads to the need of the study considering the structure of IDS that have high detection rate and low computational cost. In this paper, we proposed a Hybrid IDS which combines C4.5 decision tree(misuse detection method) and Weighted K-means algorithm (anomaly detection method) hierarchically. It can detect malicious network packets effectively with low complexity by applying mutual information and genetic algorithm based efficient feature selection technique. Also we construct upgraded the the hierarchical structure of IDS reusing feature weights in anomaly detection section. It is validated that proposed Hybrid IDS ensures high detection accuracy (98.68%) and performance at experiment section.

A distance metric of nominal attribute based on conditional probability (조건부 확률에 기반한 범주형 자료의 거리 측정)

  • 이재호;우종하;오경환
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09b
    • /
    • pp.53-56
    • /
    • 2003
  • 유사도 혹은 자료간의 거리 개념은 많은 기계학습 알고리즘에서 사용되고 있는 중요한 측정개념이다 하지만 입력되는 자료의 속성들중 순서가 정의되지 않은 범주형 속성이 포함되어 있는 경우, 자료간의 유사도나 거리 측정에 어려움이 따른다. 비거리 기반의 알고리즘들의 경우-C4.5, CART-거리의 측정없이 작동할 수 있지만, 거리기반의 알고리즘들의 경우 범주형 속성의 거리 정보 결여로 효과적으로 적용될 수 없는 문제점을 갖고 있다. 본 논문에서는 이러한 범주형 자료들간 거리 측정을 자료 집합의 특성을 충분히 고려한 방법을 제안한다. 이를 위해 자료 집합의 선험적인 정보를 필요로 한다. 이런 선험적 정보인 조건부 확률을 기반으로한 거리 측정방법을 제시하고 오류 피드백을 통해서 속성 간 거리 측정을 최적화 하려고 노력한다. 주어진 자료 집합에 대해 서로 다른 두 범주형 값이 목적 속성에 대해서 유사한 분포를 보인다면 이들 값들은 비교적 가까운 거리로 결정한다 이렇게 결정된 거리를 기반으로 학습 단계를 진행하며 이때 발생한 오류들에 대해 피드백 작업을 진행한다. UCI Machine Learning Repository의 자료들을 이용한 실험 결과를 통해 제안한 거리 측정 방법의 우수한 성능을 확인하였다.

  • PDF