• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.11
• /
• pp.1641-1646
• /
• 2017

This paper presents a fast method to identify an area of severity which is a network area leading to voltage sags at multiple sensitive load points, simultaneously. To assess voltage sag performance considering various sensitive loads, it is need to determine an area of severity for the load points. The area of severity can be calculated by overlapping areas of vulnerability for each sensitive load. However, as the number of sensitive loads increases, computational complexity and time for determining an area of severity are highly increased. In this paper, an efficient scheme based on line division is described. The proposed method is useful for identifying an area of severity and assessing voltage sag performance considering multiple loads together.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2053-2061
• /
• 1997

The motion comensated video coding technology is very improtant to compress video signal since it reduces the temporal redundancies in successive frames. But the computational complexity of the motion estimation(ME) is too enormous to use in the area of real-time and/or resolution video processing applications. To reduce the complexity of ME, fast search algoritjms and hardware design methods are developed. Especially, the three step search(TSS) is well known method which shows stable performance in various video sequences. And other variations of TSS are developed to get better performance andto reduce the complexity. In this paepr, we present the modified TSS using neighboring block's motion vectors to determine first step motion vector in TSS. The presented method uses the correlation of the adjacent blocks with same motion field. The simualtion resutls show that it has a good MAE performance and low complexity comparing with original TSS.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.4
• /
• pp.97-102
• /
• 2007

In this paper, a new architecture for fast-serial $GF(2^m)$ multiplier with low hardware complexity is proposed. The fast-serial multiplier operates standard basis of $GF(2^m)$ and is faster than bit serial ones but with lower area complexity than bit parallel ones. The most significant feature of the fast-serial architecture is that a trade-off between hardware complexity and delay time can be achieved. But The traditional fast-serial architecture needs extra (t-1)m registers for achieving the t times speed. In this paper a new fast-serial multiplier without increasing the number of registers is presented.

• IE interfaces
• /
• v.12 no.1
• /
• pp.19-25
• /
• 1999

The time slot scheduling problem for a satellite cluster with an arbitrary number of satellite is considered, which is one of the most interesting problems in the satellite communication scheduling area. This problem is known to be NP-complete, and several heuristic algorithms have been proposed. In this paper, a new efficient algorithm is suggested, which has lower computational complexity and provides much better solution than other existing algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2774-2796
• /
• 2015

Quality-of-service (QoS) provisioning for a cognitive mesh network (CMN) with heterogeneous services has become a challenging area of research in recent days. Considering both real-time (RT) and non-real-time (NRT) traffic in a multihop CMN, [1] studied cross-layer resource management, including joint access control, route selection, and resource allocation. Due to the complexity of the formulated resource allocation problems, which are mixed-integer non-linear programming, a low-complexity yet efficient algorithm was proposed there to approximately solve the formulated optimization problems. In contrast, in this work, we present an application of genetic algorithm (GA) to re-address the hard resource allocation problems studied in [1]. Novel initialization, selection, crossover, and mutation operations are designed such that solutions with enough randomness can be generated and converge with as less number of attempts as possible, thus improving the efficiency of the algorithm effectively. Simulation results show the effectiveness of the newly proposed GA-based algorithm. Furthermore, by comparing the performance of the newly proposed algorithm with the one proposed in [1], more insights have been obtained in terms of the tradeoff among QoS provisioning for RT traffic, throughput maximization for NRT traffic, and time complexity of an algorithm for resource allocation in a multihop network such as CMN.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.390-395
• /
• 2009

The robustness of audio fingerprinting system in a noisy environment is a principal challenge in the area of content-based audio retrieval. The selected feature for the audio fingerprints must be robust in a noisy environment and the computational complexity of the searching algorithm must be low enough to be executed in real-time. The audio fingerprint proposed by Philips uses expanded hash table lookup to compensate errors introduced by noise. The expanded hash table lookup increases the searching complexity by a factor of 33 times the degree of expansion defined by the hamming distance. We propose a new method to improve noise robustness of audio fingerprinting in noise environment using predominant pitch which reduces the bit error of created hash values. The sub-fingerprint of our approach method is computed in each time frames of audio. The time frame is transformed into the frequency domain using FFT. The obtained audio spectrum is divided into 33 critical bands. Finally, the 32-bit hash value is computed by difference of each bands of energy. And only store bits near predominant pitch. Predominant pitches are extracted in each time frames of audio. The extraction process consists of harmonic enhancement, harmonic summation and selecting a band among critical bands.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2050-2059
• /
• 1999

Multiprocessor scheduling problem has been an important research area for the past decades. The problem is defined as finding an optimal schedule which minimizes the parallel execution time of an application on a target multiprocessor system. Duplication Based Scheduling (DBS) is a relatively new approach for solving multiprocessor scheduling problems. This paper classifies DBS algorithms into two categories according to the task duplication method used. The paper then presents a new DBS algorithm that extracts the strong features of the two categories of DBS algorithms. The simulation study shows that the proposed algorithm achieves considerable performance improvement over existing DBS algorithms with similar time complexity.

• Journal of Radiation Protection and Research
• /
• v.46 no.2
• /
• pp.48-57
• /
• 2021

Background: In this study, the complexities of step-and-shoot intensity-modulated radiation therapy (IMRT) plans in magnetic resonance-guided radiation therapy systems were evaluated. Materials and Methods: Overall, 194 verification plans from the abdomen, prostate, and breast sites were collected using a ⁶⁰Co-based ViewRay radiotherapy system (ViewRay Inc., Cleveland, OH, USA). Various plan complexity metrics (PCMs) were calculated for each verification plan, including the modulation complexity score (MCS), plan-averaged beam area (PA), plan-averaged beam irregularity, plan-averaged edge (PE), plan-averaged beam modulation, number of segments, average area among all segments (AA/Seg), and total beam-on time (TBT). The plan deliverability was quantified in terms of gamma passing rates (GPRs) with a 1 mm/2% criterion, and the Pearson correlation coefficients between GPRs and various PCMs were analyzed. Results and Discussion: For the abdomen, prostate, and breast groups, the average GPRs with the 1 mm/2% criterion were 77.8 ± 6.0%, 79.8 ± 4.9%, and 84.7 ± 7.3%; PCMs were 0.263, 0.271, and 0.386; PAs were 15.001, 18.779, and 35.683; PEs were 1.575, 1.444, and 1.028; AA/Segs were 15.37, 19.89, and 36.64; and TBTs were 18.86, 19.33, and 5.91 minutes, respectively. The various PCMs, i.e., MCS, PA, PE, AA/Seg, and TBT, showed statistically significant Pearson correlation coefficients of 0.416, 0.627, -0.541, 0.635, and -0.397, respectively, with GPRs. Conclusion: The area-related metrics exhibited strong correlations with GPRs. Moreover, the AA/Seg metric can be used to estimate the IMRT plan accuracy without beam delivery in the ⁶⁰Co-based ViewRay radiotherapy system.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.14 no.6
• /
• pp.7-14
• /
• 2018

Salient information extraction from multi-view videos is a very challenging area because of inter-view, intra-view correlations, and computational complexity. There are several techniques developed for keyframes extraction from multi-view videos with very high computational complexities. In this paper, we present a keyframes extraction approach from multi-view videos using entropy and complexity information present inside frame. In first step, we extract representative shots of the whole video from each view based on structural similarity index measurement (SSIM) difference value between frames. In second step, entropy and complexity scores for all frames of shots in different views are computed. Finally, the frames with highest entropy and complexity scores are considered as keyframes. The proposed system is subjectively evaluated on available office benchmark dataset and the results are convenient in terms of accuracy and time complexity.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.583-591
• /
• 2000

Caching mechanisms have been studied extensively to buffer the speed gap of hierarchical storages in the context of cache memory, paging system, and buffer management system. As the wide-area distributed environments such as the WWW extend broadly, caching of remote objects becomes more and more important. In the wide-area distributed environments, the cost and the benefit of caching an object is not uniform due to the location of the object; which should be considered in the cache replacement algorithms. For online operation, the time complexity of the replacement algorithm should not be excessive. To date, most replacement algorithms for the wide-area distributed environments do not meet both the non-uniformity of objects and the time complexity constraint. This paper proposes a replacement algorithm which considers the non-uniformity of objects properly; it also allows for an efficient implementation. Trace-driven simulations show that proposed algorithm outperforms existing replacement algorithms.