• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.11
• /
• pp.581-588
• /
• 2007

In Digital Right Management, symmetric cipher is used for content encryption to reduce encryption cost, AES, advanced encryption standard is usually used to multimedia encryption under desktop environment because of its reasonable security level and computation cost. But mobile handheld device often uses slow speed processor and operates under battery-powered environment. Therefore it requires low computation cost and low energy consumption. This paper proposes new stream cipher scheme which combines pseudo random number generator(PRNG) and dynamically generated permutations. Proposed scheme activates PRNG and generates original key streams. Then it generates extended key streams by applying permutation to original sequence. These extended key streams are XORed with plaintext and generate ciphertext. Proposed scheme reduces the usage of PRNG. Therefore this scheme is fast and consumes less energy in comparison with normal stream cipher. Especially, this scheme shows great speed up (almost 2 times) than normal stream cipher scheme in random access.

• The Proceedings of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.7 no.2
• /
• pp.36-40
• /
• 1993

In order to improve complicated construction and complex control which are disadvantage of optimal PWM technique aimed at harmonic elimination method, this paper presented MRA(Model Reference Adaptive) PWM technique that gatmg signal of inverter is generated by comparing the reference signal with the induced feedback signal at the reference model of load. Design of controller is composed of microprocessor and analog circuit. MRA PWM technique used in the paper is able to compensate the degradation of voltage efficiency to be generated by the ratio of the output voltage to the DC supply voltage being low for using conventional sinusoidal PWM technique. When the trapezoidal signal is employed as the reference signal. the low order harmonics of line current can be reduced and the switching pattern is made by on-line computation using comparatively simple numerical analysis.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.11
• /
• pp.117-126
• /
• 2003

GA(genetic algorithm) has a powerful searching ability and is comparatively easy to use and to apply as well. By that reason, GA is in the spotlight these days as an optimization skill for mechanical systems.$^1$However, GA has a low efficiency caused by a huge amount of repetitive computation and an inefficiency that GA meanders near the optimum. It also can be shown a phenomenon such as genetic drifting which converges to a wrong solution.$^{8}$ These defects are the reasons why GA is not widdy applied to real world problems. However, the low efficiency problem and the meandering problem of GA can be overcomed by introducing parallel computation$^{7}$ and gray code$^4$, respectively. Standard GA(SGA)$^{9}$ works fine on small to medium scale problems. However, SGA done not work well for large-scale problems. Large-scale problems with more than 500-bit of sere's have never been tested and published in papers. In the result of using the SGA, the powerful searching ability of SGA doesn't have no effect on optimizing the problem that has 96 design valuables and 1536 bits of gene's length. So it converges to a solution which is not considered as a global optimum. Therefore, this study proposes ExpGA(experience GA) which is a new genetic algorithm made by applying a new probability parameter called by the experience value. Furthermore, this study finds the solution throughout the whole field searching, with applying ExpGA which is a optimization technique for the structure having genetic drifting by the standard GA and not making a optimization close to the best fitted value. In addition to them, this study also makes a research about the possibility of GA as a optimization technique of large-scale design variable problems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.4
• /
• pp.183-193
• /
• 2019

Process mining is an analytical technique aimed at obtaining useful information about a process by extracting a process model from events log. However, most existing process models are deterministic because they do not include stochastic elements such as the occurrence probabilities or execution times of activities. Therefore, available information is limited, resulting in the limitations on analyzing and understanding the process. Furthermore, it is also important to develop an efficient methodology to discover the process model. Although genetic process mining algorithm is one of the methods that can handle data with noises, it has a limitation of large computation time when it is applied to data with large capacity. To resolve these issues, in this paper, we define a stochastic process tree and propose a tabu search-genetic process mining (TS-GPM) algorithm for a stochastic process tree. Specifically, we define a two-dimensional array as a chromosome to represent a stochastic process tree, fitness function, a procedure for generating stochastic process tree and a model trace as a string of activities generated from the process tree. Furthermore, by storing and comparing model traces with low fitness values in the tabu list, we can prevent duplicated searches for process trees with low fitness value being performed. In order to verify the performance of the proposed algorithm, we performed a numerical experiment by using two kinds of event log data used in the previous research. The results showed that the suggested TS-GPM algorithm outperformed the GPM algorithm in terms of fitness and computation time.

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1423-1429
• /
• 2019

Recently, a system that supports efficient interaction, a human machine interface (HMI), has become a hot topic. In this paper, we propose a new real time low-cost hand gesture control system as one of vehicle interaction methods. In order to reduce computation time, depth information was acquired using a time-of-flight (TOF) camera because it requires a large amount of computation when detecting hand regions using an RGB camera. In addition, fourier descriptor were used to reduce the learning model. Since the Fourier descriptor uses only a small number of points in the whole image, it is possible to miniaturize the learning model. In order to evaluate the performance of the proposed technique, we compared the speeds of desktop and raspberry pi2. Experimental results show that performance difference between small embedded and desktop is not significant. In the gesture recognition experiment, the recognition rate of 95.16% is confirmed.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.10 s.101
• /
• pp.1028-1035
• /
• 2005

OFDM system has high PAPR(Peak-to-Average-Power Ratio) problem. In this paper, we present a low complexity phase weighting method to reduce the computational quantity so that we can cut down the processing time of SPW method. Proposed method is derived from the DFT property of periodical sequences by which PAPR can be reduced efficiently. The simulation results show the same PAPR reduction efficiency of proposed method in comparison with conventional methods. It can reduce 2.15 dB of PAPR with two phase factors and 3.95 dB of PAPR with four phase factors. The computation analysis shows significant improvement in the low complexity phase weighting method.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.3
• /
• pp.75-81
• /
• 2015

This paper proposed the new eight-parallel MDC FFT processor using the eight-parallel MDC architecture and the efficient scheduling scheme. The proposed FFT processor supports the 256-point FFT based on the modified radix-$2^6$ FFT algorithm. The proposed scheduling scheme can reduce the number of complex multipliers from eight to six without increasing delay buffers and computation cycles. Moreover, the proposed FFT processor can be used in OFDM systems required high throughput and low hardware complexity. The proposed FFT processor has been designed and implemented with a 90nm CMOS technology. The experimental result shows that the area of the proposed FFT processor is $0.27mm^2$. Furthermore, the proposed eight-parallel MDC FFT processor can achieve the throughput rate up to 2.7 GSample/s at 388MHz.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.10
• /
• pp.550-560
• /
• 2002

External sort on cluster computers requires not only fast internal sorting computation but also careful scheduling of disk input and output and interprocessor communication through networks. This is because the overall time for the execution is determined by reflecting the times for all the jobs involved, and the portion for interprocessor communication and disk I/O operations is significant. In this paper, we improve the sorting performance (sorting throughput) on a cluster of PCs with a low-speed network by developing a new algorithm that enables even distribution of load among processors, and optimizes the disk read and write operations with other computation/communication activities during the sort. Experimental results support the effectiveness of the algorithm. We observe the algorithm reduces the sort time by 45% compared to the previous NOW-sort[1], and provides more scalability in the expansion of the computing nodes of the cluster as well.

• Journal of Navigation and Port Research
• /
• v.36 no.8
• /
• pp.637-641
• /
• 2012

In this paper, the method that reduce a computation time by optimizing computation process is proposed to realize low-power underwater acoustic communication system. At first, dependency of decision delay on tap length of linear equalizer was investigated. Variance is calculated based on this result, and the optimal decision delay bound is estimated. In addition to decide optimal tap length with decision delay, we extracted the MSE(Mean Square Error) graph. From the graph, we obtained variance value of the MSE-decision delay, and estimated the optimum decision delay range from the variance value. Also, using the extracted optimal parameters, we performed a simulation. According to the result, the simulation employing optimal tap length, which is only 40% of maximum tap length, showed a satisfactory performance comparable to simulation employing maximum tap length. We verified that the proposed method has 33% lower tap length than maximal tap length via sea trial.

• Korean Journal of Remote Sensing
• /
• v.24 no.1
• /
• pp.1-16
• /
• 2008

Steam and advection fogs are frequently observed in the Yellow Sea from March to July except for May. This study uses remote sensing (RS) data for the monitoring of sea fog. Meteorological data obtained from the Ieodo Ocean Research Station provided a valuable information for the occurrence of steam and advection fogs as a ground truth. The RS data used in this study were GOES-9, MTSAT-1R images and QuikSCAT wind data. A dual channel difference (DCD) approach using IR and shortwave IR channel of GOES-9 and MTSAT-1R satellites was applied to detect sea fog. The results showed that DCD, texture-related measurement and the weak wind condition are required to separate the sea fog from the low cloud. The QuikSCAT wind data was used to provide the wind speed criteria for a fog event. The laplacian computation was designed for a measurement of the homogeneity. A new combined method, which includes DCD, QuikSCAT wind speed and laplacian computation, was applied to the twelve cases with GOES-9 and MTSAT-1R. The threshold values for DCD, QuikSCAT wind speed and laplacian are -2.0 K, $8m\;s^{-1}$ and 0.1, respectively. The validation results showed that the new combined method slightly improves the detection of sea fog compared to DCD method: improvements of the new combined method are $5{\sim}6%$ increases in the Heidke skill score, 10% decreases in the probability of false detection, and $30{\sim}40%$ increases in the odd ratio.