• 제목/요약/키워드: Mining method

검색결과 2,062건 처리시간 0.029초

A Virtual RLC Active Damping Method for LCL-Type Grid-Connected Inverters

  • Geng, Yiwen;Qi, Yawen;Zheng, Pengfei;Guo, Fei;Gao, Xiang
    • Journal of Power Electronics
    • /
    • 제18권5호
    • /
    • pp.1555-1566
    • /
    • 2018
  • Proportional capacitor-current-feedback active damping (AD) is a common damping method for the resonance of LCL-type grid-connected inverters. Proportional capacitor-current-feedback AD behaves as a virtual resistor in parallel with the capacitor. However, the existence of delay in the actual control system causes impedance in the virtual resistor. Impedance is manifested as negative resistance when the resonance frequency exceeds one-sixth of the sampling frequency ($f_s/6$). As a result, the damping effect disappears. To extend the system damping region, this study proposes a virtual resistor-inductor-capacitor (RLC) AD method. The method is implemented by feeding the filter capacitor current passing through a band-pass filter, which functions as a virtual RLC in parallel with the filter capacitor to achieve positive resistance in a wide resonance frequency range. A combination of Nyquist theory and system close-loop pole-zero diagrams is used for damping parameter design to obtain optimal damping parameters. An experiment is performed with a 10 kW grid-connected inverter. The effectiveness of the proposed AD method and the system's robustness against grid impedance variation are demonstrated.

데이터 스트림 빈발항목 마이닝의 프라이버시 보호를 위한 더미 데이터 삽입 기법 (Dummy Data Insert Scheme for Privacy Preserving Frequent Itemset Mining in Data Stream)

  • 정재열;김기성;정익래
    • 정보보호학회논문지
    • /
    • 제23권3호
    • /
    • pp.383-393
    • /
    • 2013
  • 데이터 스트림 마이닝 기술은 실시간으로 발생하는 데이터를 분석하여 유용한 정보를 얻는 기술이다. 데이터 스트림 마이닝 기술 중에서 빈발항목 마이닝은 전송되는 데이터들 중에서 어떤 항목이 빈발한지 찾는 기술이며, 찾은 빈발항목들은 다양한 분야에서 패턴분석이나 마케팅의 목적으로 사용된다. 기존에 제안된 데이터 스트림 빈발항목 마이닝은 악의적인 공격자가 전송되는 데이터를 스니핑할 경우 데이터 제공자의 실시간 정보가 노출되는 문제점을 가지고 있다. 이러한 문제는 전송되는 데이터에서 원본 데이터를 구별 못하게 하는 더미 데이터 삽입 기법을 통해 해결가능하다. 본 논문에서는 더미 데이터 삽입 기법을 이용한 프라이버시 보존 데이터 스트림 빈발항목 마이닝 기법을 제안한다. 또한, 제안하는 기법은 암호화 기법이나 다른 수학적 연산이 요구되지 않아 연산량 측면에서 효과적이다.

An Improved Active Damping Method with Capacitor Current Feedback

  • Geng, Yi-Wen;Qi, Ya-Wen;Liu, Hai-Wei;Guo, Fei;Zheng, Peng-Fei;Li, Yong-Gang;Dong, Wen-Ming
    • Journal of Power Electronics
    • /
    • 제18권2호
    • /
    • pp.511-521
    • /
    • 2018
  • Proportional capacitor current feedback active damping (CCFAD) has a limited valid damping region in the discrete time domain as (0, $f_s/6$. However, the resonance frequency ($f_r$) of an LCL-type filter is usually designed to be less than half the sampling frequency ($f_s$) with the symmetry regular sampling method. Therefore, ($f_s/6$, $f_s/2$) becomes an invalid damping region. This paper proposes an improved CCFAD method to extend the valid damping region from (0, $f_s/6$ to (0, $f_s/2$), which covers all of the possible resonance frequencies in the design procedure. The full-valid damping region is obtained and the stability margin of the system is analyzed in the discrete time domain with the Nyquist criterion. Results show that the system can operate stably with the proposed CCFAD method when the resonance frequency is in the region (0, $f_s/2$). The performances at the steady and dynamic state are enhanced by the selected feedback coefficient H and controller gain $K_p$. Finally, the feasibility and effectiveness of the proposed CCFAD method are verified by simulation and experimental results.

Data Mining Application in Inbound Call Center

  • Lee, Hyun-Woo
    • Journal of the Korean Data and Information Science Society
    • /
    • 제17권2호
    • /
    • pp.335-344
    • /
    • 2006
  • The purpose of this paper is to apply data mining method for the inbound call center optimization. Data mining analysis is come to be used in order to predict the degree of difficulty on the consultation. It is the method of maximal efficiency for the call center that uses of the predicted degree of difficulty and customer grade as routing which hits to the skill of the consultation unit. This method is to get the possibility of efficiency for the call center with the maximum efficiency.

  • PDF

워크플로우 로그에서 워크플로우 명세 탐사 (Workflow Specification Mining on Workflow Logs)

  • 정희택
    • 한국정보통신학회논문지
    • /
    • 제6권8호
    • /
    • pp.1325-1335
    • /
    • 2002
  • 자동화된 업무 처리를 위한 워크플로우 시스템이 일반화되었다. 본 연구는 워크플로우 로그 로부터 워크플로우 명세를 탐사하는 방안을 제안한다. 제안한 기법은 과업간 순환, AND 그리고 OR 제어 흐름을 고려하여 워크플로우 명세를 탐사한다. 또한 로그 생성 시에 워크플로우 명세를 탐사할 수 있는 동적 탐사 기법을 제안한다.

Mining Maximal Frequent Contiguous Sequences in Biological Data Sequences

  • Kang, Tae-Ho;Yoo, Jae-Soo;Kim, Hak-Yong;Lee, Byoung-Yup
    • International Journal of Contents
    • /
    • 제3권2호
    • /
    • pp.18-24
    • /
    • 2007
  • Biological sequences such as DNA and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of more than hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological datasets with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with a fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. The experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.

Determination Method for Topology Configuration of Hybrid Cascaded H-Bridge Rectifiers

  • Zhuang, Yuan;Wang, Cong;Wang, Chang;Cheng, Hong;Gong, Yingcai;Wang, Hao
    • Journal of Power Electronics
    • /
    • 제16권5호
    • /
    • pp.1763-1772
    • /
    • 2016
  • To reduce system complexity and implementation costs, fully-controlled H-bridge (FHB) modules and diode H-bridge PFC (DHB) modules are cascaded to form a hybrid cascaded H-bridge rectifier (HCHR). In this paper, the advantages of such a HCHR over other cascaded rectifiers are analyzed depending on the numbers of FHB modules and DHB modules. Therefore, to assign proper numbers to these two kinds of modules for the HCHR, a configuration determination method is investigated under balanced and imbalanced loads. Three principles are also presented to guide the configuration determination for the HCHR. In addition, the constraints for selecting the step-up ratio and filter inductance are derived based on a phasor diagram analysis. The proposed configuration determination method is validated by simulations under three different conditions in the PSIM environment. Finally, experiments are carried out on a scaled-down prototype where the configuration can be easily adjusted. The feasibility of the proposed theory is then verified by experimental results.

빈발도와 가중치를 이용한 서비스 연관 규칙 마이닝 (Mining Association Rule on Service Data using Frequency and Weight)

  • 황정희
    • 디지털콘텐츠학회 논문지
    • /
    • 제17권2호
    • /
    • pp.81-88
    • /
    • 2016
  • 일반적인 빈발패턴 탐사 방법은 항목의 빈발도만을 고려한다. 그러나 유용한 정보를 추출하는 데 있어 빈발도와 더불어 고려해야 하는 것은 빈발항목이 아니더라도 연관된 항목이 주기적으로 함께 발생한다면 시기나 시간에 따라 관심의 중요도가 변화하는 것을 고려해야 한다. 즉, 시간에 따라 사용자가 요구하는 서비스의 중요도는 다르므로 각 서비스 항목에 대한 중요도의 값을 고려하여 마이닝 하는 방법이 필요하다. 본 논문에서는 서비스 온톨로지 기반으로 가중치를 이용한 서비스 빈발 패턴을 추출하는 마이닝 기법을 제안한다. 제안하는 기법은 시공간 상황을 기반으로 서비스의 중요도를 고려한 가중치를 부여하여 연관 서비스를 발견한다. 새롭게 탐사되는 서비스는 저장되어 있는 서비스 규칙과의 새로운 조합을 통해 사용자에게 최적의 서비스 정보를 제공할 수 있는 기반이 된다.

그래프 마이닝에서 그래프 동형판단연산의 향상기법 (Improved approach of calculating the same shape in graph mining)

  • 노영상;윤은일;김명준
    • 한국컴퓨터정보학회논문지
    • /
    • 제14권10호
    • /
    • pp.251-258
    • /
    • 2009
  • 그래프마이닝에서 그래프패턴의 동형판단문제는 지수함수적 계산시간을 요구하기 때문에 그래프마이닝의 전체수행시간에서 동형판단 연산이 차지하는 비율이 매우 높다. 그러므로 그래프마이닝 알고리즘은 그래프동형판단을 최대한 효율적으로 할 필요가 있다. 본 논문은 그래프마이닝에서 빠른 수행시간을 보이는 gaston 알고리즘의 동형판단효율성을 증가시켜 수행시간을 평가해 보았으며, 제시한 방법으로 인해 더욱 향상된 성능을 보인다.

An alternative upstream method for the Zhelamuqing tailings impoundment construction of a Copper Mine in China

  • Wei, Zuoan;Chen, Yulong;Yin, Guangzhi;Yang, Yonghao;Shu, Weimin
    • Geomechanics and Engineering
    • /
    • 제19권5호
    • /
    • pp.383-392
    • /
    • 2019
  • How to safely and economically dispose mining tailings is a challenge to mine operators. This paper presents an alternative upstream method for tailings dam construction, termed as the template construction method (TCM), which has been successfully implemented at Zhelamuqing tailings impoundment since 2004. By the beginning of 2015, the tailings dam wall had reached 95 m in height for the 46 upstream raises, with the total height of the dam including the starter dyke being 128 m. The proposed TCM is relatively simple and cost-effective and provides a good way for constructing rapidly raising tailings dam based on this case.