• Journal of Electrical Engineering and Technology
• /
• v.13 no.6
• /
• pp.2319-2328
• /
• 2018

This paper introduces a control method for a transformerless MMC-HVDC system. The proposed method can effectively control the grid currents of the MMC-HVDC system under unbalanced grid conditions such as a single line-to-ground fault. The proposed method controls the currents of the positive sequence component and the negative sequence component without separating algorithms. Therefore, complicated calculations for extracting the positive sequence and the negative sequence component are not required. In addition, a control method to regulate a zero sequence component current under unbalanced grid conditions in the transformerless MMC-HVDC system is also proposed. The validity of the proposed method is verified through PSCAD/EMTDC simulation.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.9
• /
• pp.1315-1322
• /
• 2015

This paper proposes an active islanding detection method for the BESS (Battery Energy Storage System) with 3-phase inverter which is connected to the AC grid. The proposed method adopts the DDSRF (Decoupled Double Synchronous Reference Frame) PLL (Phase Locked-Loop) so that the independent control of positive-sequence and negative-sequence current is successfully carried out using the detected phase angle information. The islanding state can be detected by sensing the variation of negative-sequence voltage at the PCC (Point of Common Connection) due to the injection of 2-3% negative-sequence current from the BESS. The proposed method provides a secure and rapid detection under the variation of negative-sequence voltage due to the sag and swell. The feasibility of proposed method was verified by computer simulations with PSCAD/EMTDC and experimental analyses with 5kW hardware prototype for the benchmark circuit of islanding detection suggested by IEEE 1547 and UL1741. The proposed method would be applicable for the secure detection of islanding state in the grid-tied Microgrid.

• Journal of Communications and Networks
• /
• v.15 no.6
• /
• pp.581-588
• /
• 2013

Based on an interleaving technique and quadriphase periodic complementary sequence (CS) mates, this paper presents a method for constructing a family of 16-quadrature amplitude modulation (QAM) periodic CS mates. The resulting mates arise from the conversion of quadriphase periodic CS mates, and the period of the former is twice as long as that of the latter. In addition, based on the existing binary periodic CS mates, a table on the existence of the proposed 16-QAM periodic CS mates is given. Furthermore, the proposed method can also transform a mutually orthogonal (MO) quadriphase CS set into an MO 16-QAM CS set. Finally, three examples are given to demonstrate the validity of the proposed method.

• Journal of Korea Multimedia Society
• /
• v.20 no.5
• /
• pp.800-807
• /
• 2017

The Pattern Sequence-based Forecasting (PSF) is an approach to forecast the behavior of time series based on similar pattern sequences. The innovation of PSF method is to convert the load time series into a label sequence by clustering technique in order to lighten computational burden. However, it brings about a new problem in determining the number of clusters and it is subject to insufficient similar days occasionally. In this paper we proposed an adaption of the PSF method, which introduces a new clustering index to determine the number of clusters and imposes a threshold to solve the problem caused by insufficient similar days. Our experiments showed that the proposed method reduced the mean absolute percentage error (MAPE) about 15%, compared to the PSF method.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.5
• /
• pp.1041-1046
• /
• 2009

In this paper, we proposed a robust watermark scheme for image based on SVD(Singular Value Transform) and Triplet. First, the original image is decomposed by using 3-level DWT, and then used the singular values changed for embedding and extracting of the watermark sequence in LL3 band. Since the matrix of singular values is not easily altered with various signal processing noises, the embedded watermark sequence has the ability to withstand various signal processing noise attacks. Nevertheless, this method does not guarantee geometric transformation(such as rotation, cropping, etc.) because the geometric transformation changes the matrix size. In this case, the watermark sequence cannot be extracted. To compensate for the above weaknesses, a method which uses the triplet for embedding a barcode image watermark in the middle of frequency band is proposed. In order to generate the barcode image watermark, the pattern of the watermark sequence embedded in a LL3 band is used. According to this method, the watermark information can be extracted from attacked images.

• Nuclear Engineering and Technology
• /
• v.53 no.12
• /
• pp.4080-4092
• /
• 2021

In this study, the performance of sequence tracking methods for multiple interaction events in specific CdZnTe Compton imagers was evaluated using Monte Carlo simulations. The Compton imager consisted of a 6 × 6 array of virtual Frisch-grid CZT crystals, where the dimensions of each crystal were 5 × 5 × 12 mm³. The sequence tracking methods for another Compton imager that consists of two identical CZT crystals arrays were also evaluated. When 662 keV radiation was incident on the detectors, the percentages of the correct sequences determined by the simple comparison and deterministic methods for two sequential interactions were identical (~80%), while those evaluated using the minimum squared difference method (55-59%) and Three Compton method (45-55%) for three sequential interactions, differed from each other. The reconstructed images of a 662 keV point source detected using single and double arrays were evaluated based on their angular resolution and signal-to-noise ratio, and the results showed that the double arrays outperformed single arrays.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.3
• /
• pp.10-20
• /
• 2020

This paper presents a method to measure the similarity of assigned jobs in the gravure printing operation based on the chromaticity and color sequence, and order the jobs accordingly. The proposed dispatching rule can be used to fulfill diverse manufacturing site requirements because the parameters can be adjusted to prioritize chromaticity and color sequence. In general, dispatching rules either ignore the job-changing time or require that the time be clearly defined. However, in the gravure printing operation targeted in this study, it is difficult to apply the general dispatching rule because of the difficulties in quantifying the job-changing time. Therefore, we propose a method for generalizing assignment rules of the job planner, allocating relative similarity among assigned jobs, and determining the sequence of jobs accordingly. Chromaticity priority is determined by the arrangement of the color assignments in the printing operation; color sequence priority is determined by the addition, deletion, or change in a specific color sequence. Finally, the job similarity is determined by the dot product of the chromaticity and color sequence priorities. Implementation of the proposed dispatching rule at an actual manufacturing site showed the planner present the same job order as that obtained using the proposed rule. Therefore, this rule is expected to be useful in industrial sites where clear quantification of the job-changing time is not possible.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.376-379
• /
• 2003

DNA computing based DNA sequence Is operated through the biology experiment. Biology experiment used as operator causes illegal reactions through shifted hybridization, mismatched hybridization, undesired hybridization of the DNA sequence. So, it is essential to design DNA sequence to minimize the potential errors. This paper proposes method of the DNA sequence generation based evolutionary operation processor. Genetic algorithm was used for evolutionary operation and extra hardware, namely genetic algorithm processor was implemented for solving repeated evolutionary process that causes much computation time. To show efficiency of the Proposed processor, excellent result is confirmed by comparing between fitness of the DNA sequence formed randomly and DNA sequence formed by genetic algorithm processor. Proposed genetic algorithm processor can reduce the time and expense for preparing DNA sequence that is essential in DNA computing. Also it can apply design of the oligomer for development of the DNA chip or oligo chip.

• The KIPS Transactions:PartD
• /
• v.12D no.1 s.97
• /
• pp.51-62
• /
• 2005

After figuring out the function of an amino acid sequence, we can infer the function of the other amino acids that have similar sequence composition. Besides, it is possible that we alter protein whose function we know, into useful protein using genetic engineering method. In this process. an original protein amino sequence produces various protein sequences that have different sequence composition. Here, a systematic technique is needed to manage protein version sequences and reference data of those sequences. Thus, in this paper we proposed a technique of managing protein version sequences based on local sequence alignment and a technique of managing protein historical reference data using Trigger This method automatically determines the similarity between an original sequence and each version sequence while the protein version sequences are stored into database. When this technique is employed, the storage space that stores protein sequences is also reduced. After storing the historical information of protein and analyzing the change of protein sequence, we expect that a new useful protein and drug are able to be discovered based on analysis of version sequence.

• Korean Journal of Microbiology
• /
• v.39 no.2
• /
• pp.67-75
• /
• 2003

One large topic in comparative genomics is to predict functional annotation by classifying protein sequences. Computational approaches for function prediction include protein structure prediction, sequence alignment and domain prediction or binding site prediction. This paper is on another computational approach searching for sets of homologous sequences from sequence similarity graph. Methods based on similarity graph do not need previous knowledges about sequences, but largely depend on the researcher's subjective threshold settings. In this paper, we propose a genome sequence clustering method of iterative testing and graph decomposition, and a simple method to calculate a strict threshold having biochemical meaning. Proposed method was applied to known bacterial genome sequences and the result was shown with the BAG algorithm's. Result clusters are lacking some completeness, but the confidence level is very high and the method does not need user-defined thresholds.