• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.343-351
• /
• 2004

In order to maintain load balancing in a distributed system, we should obtain workload information from all the nodes on network. This processing requires $O(v^2)$ communication overhead, where v is the number of nodes. In this paper, we present a new synchronous dynamic distributed load balancing algorithm on a (v, k ＋ 1, 1)-configured network applying a symmetric balanced incomplete block design, where $v\;=\;k^2$\;＋\;k\;＋\;1$. Our algorithm needs only $O(\sqrt[v]{v})$ communication overhead and each node receives workload information from all the nodes without redundancy. Therefore, load balancing is maintained since every link has the same amount of traffic for transferring workload information.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.6 no.2
• /
• pp.164-172
• /
• 2001

This paper describes common MPPT(Maximum Power Point Tracking) control algorithm; Constant Voltage Control, P&O(Perturbation and Observation), IncCond(Incremental Conductance), and investigated it\`s efficiency. Though simulation and efficiency evaluation, the steady/transient states characteristics and efficiency of control algorithms are analyzed respectively. Also, two-mode MPPT control to improve on the existing control algorithm. Moreover, is proposed for high efficiency this paper suggests a topology for MPPT measuring efficiency and a method of examination.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.1
• /
• pp.30-36
• /
• 1990

Context-free language can be recognized by Cocke-Younger-Kasami algorithm. This algorithm is a class of polyadic-nonserial dynamic programming technique and has the O(n**3) time complexity. In this paper, a one-dimensional systolic array for recognition of context-free language is designed. The designed triangle type two-dimensional array is projected and transformed to an one-dimensional array. The designed one-dimensional array has n processing elements and \ulcornern+1)/2\ulcorner(n-1)+3n-1 time units to process the algorithm (n is the length of input string). The time complexity is O(n\ulcorner.

• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.595-602
• /
• 2002

The watchman routes which an watchman patrols the interior of polygon moving along the route are classified to minimum length or minimum links. The watchman route with minimum links has minimum changes of direction in process. In this paper, we present an algorithm with $O(N^2)$ time for finding the watchman route with minimum links in the weakly visible polygons which have specific property.

• Korean Journal of Materials Research
• /
• v.27 no.6
• /
• pp.312-317
• /
• 2017

In the construction of a white LED, the region of the red emission is a very important factor. Red light emitting materials play an important role in improving the color rendering index of commercial lighting. These materials also increase the color gamut of display products. Therefore, the development of novel phosphors with red emission and the study of color tuning are actively underway to improve product quality. In the present study, heuristic algorithms were used to search for phosphors capable of increasing the color rendering index and color gamut. Using a heuristic algorithm, the phosphors that were identified were $SrGe_4O_9:Mn^{4+}$ and $BaGe_4O_9:Mn^{4+}$. Emission spectra study confirmed that these phosphors emit light in the deep red wavelength region, which can fulfill the requirement for the improvement in color rendering index and color gamut for a white LED.

• Journal of the Korean Society of Visualization
• /
• v.19 no.1
• /
• pp.68-73
• /
• 2021

In this study, the detection of rubber o-ring defects was carried out using k-fold cross validation and Support Vector Machine (SVM) algorithm. The data process was carried out in 3 steps. First, we proceeded with a frame alignment to eliminate unnecessary regions in the learning and secondly, we applied gray-scale changes for computational reduction. Finally, data processing was carried out using image augmentation to prevent data overfitting. After processing data, SVM algorithm was used to obtain normal and defect detection accuracy. In addition, we applied the SVM algorithm through the k-fold cross validation method to compare the classification accuracy. As a result, we obtain results that show better performance by applying the k-fold cross validation method.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.67 no.4
• /
• pp.233-237
• /
• 2018

In this paper, we compared power generation characteristics of two MPPT algorithms, P & O and InC, applied to grid-connected solar inverters. The MPPT detects the voltage and current of the solar module string and transfers the power to the DC link. Since the grid is connected by the power conversion circuit, the grid connection control and the MPPT control influence each other. The power generation characteristics were analyzed by Psim simulation according to the MPPT cycle in the weak grid conditions.

• Proceedings of the KIPE Conference
• /
• 2004.07a
• /
• pp.97-100
• /
• 2004

Our country has depended on fossil fuel very much according to the Increasing of the demand of the electric power. For instance, if the reduction and freezing caused by the warm gas in earth by the regulation of international environment happen in Korea it will bring about the result of weakness in industrial activity. As a result, it will cause many problems to compete an advanced country which wants to connect environment with the activity of industrial product in their country. The photovoltaic system outputs have peak about a half past 13 o'clock(before and after) mainly in a good weather. The output decreases rapidly from a half past 17 o'clock and PV output doesn't work at six o'clock before the sun rises. The outputs of PV system stops at that time. The frequent degree of harmonics in dwelling house which lots of people live has peak from 19 o'clock to 22 o'clock Harmonics mainly happens at least at night. In recent, many researches about power quality has been studying very hard in order to solve the question, the voltage fluctuating and harmonics as one compensator. In this paper, I suggest the algorithm which can increase the power quality as a rate of operation of this system. This algorithm proves to have effectiveness through computer simulation.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.2
• /
• pp.119-124
• /
• 1998

Block Matching Motion Estimation(BMME) Algorithm is demands a very large amount of computing power and have been proposed many fast algorithms. These algorithms are many problem that larger size of VLSI scale due to non-localized search block data and problem of non-reuse of input data for each processing step. In this paper, we designed systolic arry of high processing capacity, constraints input output pin size and reuse of input data for small VLSI size. The proposed systolic array is optimized memory access time because of iterative reuse of input data on search block and become independent of problem size due to increase of algorithm's parallelism and total processing elements connection is localized spatial and temporal. The designed systolic array is reduced O(N6) time complexity to O(N3) on moving vector and has O(N) input/output pin size.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.3
• /
• pp.487-500
• /
• 1997

In this paper, we introduce the shortest flow-generating path problem in the generalized network. As the simplest generalized network model, this problem captures many of the most salient core ingredients of the generalized network flows and so it provides both a benchmark and a point of departure for studying more complex generalized network models. We show that the generalized label-correcting algorithm for the shortest flow-generating path problem has O(mn) time complexity if it starts with a good point and also propose an O($n^3m^2$) algorithm for finding a good starting point. Hence, the shortest flow-generating path problem is solved in O($n^3m^2$) time.