• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.1
• /
• pp.79-84
• /
• 2009

In this paper, a best-first branch and bound algorithm based upon the bottom-up approach for the unweighted unconstrained two-dimensional cutting problem is proposed to find the optimal solution to the problem. The algorithm uses simple and effective methods to prevent constructing duplicated patterns and reduces the searching space by dividing the branched node set. It also uses a efficient bounding strategy to fathom the set of patterns. Computational results are compared with veil-known exact algorithms and demonstrate the efficiency of the proposed algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.4
• /
• pp.42-49
• /
• 2003

The branch and bound techniques based on cut tree and eigenvector have been Introduced in the literature [1, 2, 3, 6, 9, 12]. These techniques are used as a basis to allocate departments to floors and then to fit departments with unchangeable dimensions into floors. Grouping algorithms to allocate departments to each floor are developed and branch and bound forms the basis of optimizing using the criteria of rectilinear distance. The proposed branch and bound technique, in theory, will provide the optimal solution on two dimensional layout. If the runs are time and/or node limited, the proposed method is a strong heuristic The technique is made further practical by the fact that the solution is constrained such that the rectangular shape dimensions length and width are fixed and a perfect fit is generated if a fit is possible. Computational results obtained by cut tree-based algorithm and eigenvector-based algorithm are shown when the number of floors are two or three and there is an elevator.

• Journal of IKEEE
• /
• v.22 no.4
• /
• pp.1210-1213
• /
• 2018

In this paper, we propose a method to reduce the amount of current through the Timing Control of the duty cycle and the Report Attribute Control at the MAC Layer in consideration of the Sleep Mode under the IoT wireless environment. The use of a duty cycle is an effective way to reduce energy consumption on wireless sensor networks where the node is placed in sleep mode periodically. In particular, we studied how to control power efficiency through duty rate in Short Transition Time and ACK Time processing while satisfying radio channel limitation criterion. When comparing before and after the improvement considering the delay time constraint, we validated the correlation of the electrical current reduction.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.269-272
• /
• 2001

Since Multi-way Search Tree reduces the number of the memory access by increasing the branch factor, it is considered a method to archive the high-speed IP address lookup. Using the combination of initial 16 bit may and Multi-way Search Tree, it also reduces the search time of If address lookup. Multi-way Search Tree consists of K keys and K＋1 key pointers. This paper shows how the E update of Multi-way Search Tree which consists of the one pointer within a node can be performed. Using the one pointer within a node, it increases the number of keys within a node and reduces the search time of IP lookup. We also describes IP updating methods such as modification, Insertion and Deletion of address entries. Our update scheme performs better than the method which rebuilds the entire IP routing table when IP update processes.

• Horticultural Science & Technology
• /
• v.18 no.5
• /
• pp.591-593
• /
• 2000

This study was conducted to investigate the effect of training time on the growth and yield of 'Sinsakigake-2' pepper (Capsicum annuum L.). Plants were either left untrained as control or trained at the third node leaving four shoots per plant. Plants were traind at 20, 45, 70, or 95 days after transplanting (DAT). The earlier the training time, the more the branch number of the plant. Fruit weight was not affected by training time. However, the percentage of marketable fruits and the number of marketable fruits per plant were the highest in plants trained at 70 DAT, and the lowest in the control. Early marketable yield was the highest in the control, and the lowest in plants trained at 45 DAT.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.5
• /
• pp.278-286
• /
• 2000

A new large-scale network geometric analysis is introduced. For a large-scale circuit, it must be analyzed with a geometric diagram and figure. So many equations are induced from a geometric loop-node diagram. The results are arranged into a simple matrix, of course. In case of constructing a network diagram, it is not easy to handle voltage and current sources together. Geometric loop analysis is related to voltage sources, and node analysis is to current sources. The reciprocal transfer is possible only to have series or parallel impedance. If not having this impedance, in order to obtain equivalent circuit, many equations must be derived. In this paper a loop-reduction method is proposed. With this method current source branch is included into the other branch, and disappears in circuit diagram. So the number of independent circuit equations are reduced as much as that of current sources. The number is not (b-n+1), but (b-n+1-p). Where p is the number of current sources. The reduction procedure is verified with a geometric principle and circuit theory. A resultant matrix can be constructed directly from this diagram structure, not deriving circuit equations. We will obtain the last results with the help of a computer.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.3
• /
• pp.1079-1088
• /
• 2018

A line overload emergency control strategy based on the source-load synergy coefficient is proposed in this paper. First, the definition of the source-load synergy coefficient is introduced. When line overload is detected, the source-load branch synergy coefficient and source-load distribution synergy coefficient are calculated according to the real-time operation mode of the system. Second, the generator tripping and load shedding control node set is determined according to the source-load branch synergy coefficient. And then, according to the line overload condition, the control quantity of each control node is determined using the Double Fitness Particle Swarm Optimization (DFPSO), with minimum system economic loss as the objective function. Thus load shedding for the overloaded line could be realized. On this basis, in order to guarantee continuous and reliable power supply, on the condition that no new line overload is caused, some of the untripped generators are selected according to the source-load distribution synergy coefficient to increase power output. Thus power supply could be restored to some of the shedded loads, and the economic loss caused by emergency control could be minimized. Simulation tests on the IEEE 10-machine 39-bus system verify the effectiveness and feasibility of the proposed strategy.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.2
• /
• pp.15-23
• /
• 2021

Most of the open-source decision tree algorithms are based on three splitting criteria (Entropy, Gini Index, and Gain Ratio). Therefore, the advantages and disadvantages of these three popular algorithms need to be studied more thoroughly. Comparisons of the three algorithms were mainly performed with respect to the predictive performance. In this work, we conducted a comparative experiment on the splitting criteria of three decision trees, focusing on their interpretability. Depth, homogeneity, coverage, lift, and stability were used as indicators for measuring interpretability. To measure the stability of decision trees, we present a measure of the stability of the root node and the stability of the dominating rules based on a measure of the similarity of trees. Based on 10 data collected from UCI and Kaggle, we compare the interpretability of DT (Decision Tree) algorithms based on three splitting criteria. The results show that the GR (Gain Ratio) branch-based DT algorithm performs well in terms of lift and homogeneity, while the GINI (Gini Index) and ENT (Entropy) branch-based DT algorithms performs well in terms of coverage. With respect to stability, considering both the similarity of the dominating rule or the similarity of the root node, the DT algorithm according to the ENT splitting criterion shows the best results.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.47 no.2
• /
• pp.48-56
• /
• 2024

We examine a single machine scheduling problem with step-improving jobs in which job processing times decrease step-wisely over time according to their starting times. The objective is to minimize total completion time which is defined as the sum of completion times of jobs. The total completion time is frequently considered as an objective because it is highly related to the total time spent by jobs in the system as well as work-in-progress. Many applications of this problem can be observed in the real world such as data gathering networks, system upgrades or technological shock, and production lines operated with part-time workers in each shift. Our goal is to develop a scheduling algorithm that can provide an optimal solution. For this, we present an efficient branch and bound algorithm with an assignment-based node design and tight lower bounds that can prune branch and bound nodes at early stages and accordingly reduce the computation time. In numerical experiments well designed to consider various scenarios, it is shown that the proposed algorithm outperforms the existing method and can solve practical problems within reasonable computation time.

• Journal of Sericultural and Entomological Science
• /
• v.10
• /
• pp.35-40
• /
• 1969

Various formulae for estimation of spring leaf production in mulberry trees were calculated and obtained. Four varieties of mulberry trees were used as the materials, and four characters, namely branch length (X$_1$), node number (X$_2$), branch diameter (X$_3$) and branch number per stock (X$_4$) were studied. The formulae to estimate the leaf yield of spring mulberry trees are as follows: 1. $Y_1$v$_1$= -26.8939＋50.3950X$_1$＋1.1403X$_2$ $Y_1$v$_2$= -372.1091＋116.6371X$_1$＋0.1984X$_2$ $Y_1$v$_3$= 149.8203＋90.5125X$_1$-0.9775X$_2$ $Y_1$v$_4$= 108, 1496＋59.4533X$_1$＋1.4965X$_2$ Where $Y_1$v$_1$, $Y_1$v$_2$, $Y_1$v$_3$, $Y_1$v$_4$, are showed the estimated yield of the each variety, namely Gaeryang Seuban, Ilchirye, Nosang, and Suwon Sang No. 4, respectively. X$_1$ and X$_2$ denote the measured values of branch length and node number, respectively. 2. $Y_{7}$v$_1$= -54.4411＋32.9869c1.1127X$_2$＋21.7600X$_3$ $Y_{7}$v$_2$= -494.1480-1.8756X$_1$＋0.9788X$_2$＋110.0039X$_3$ $Y_{7}$v$_3$= 143.2836＋29.1779X$_1$＋0.1644X$_2$＋48.4135X$_3$ $Y_{7}$v$_4$= 1243.2549＋1.9454X$_1$＋2.7118X$_2$-75.6669X$_3$ Where $Y_{7}$v$_1$, $Y_{7}$v$_2$, $Y_{7}$v$_3$, $Y_{7}$v$_4$, are the estimated yield of the each variety, namely Gaeryang-Seuban, Ilchirye, Nosang, Suwon Sang No 4, respectively. X$_1$, X$_2$, X$_3$ denote the measured values of each character, branch length, node number, branch diameter and branch number per stock, respectively. 3. $Y_{11}$v$_1$=233.4780＋74.3713X$_1$＋1.2912X$_2$＋39.0420X$_3$-148.9300X$_4$ $Y_{11}$v$_2$=-317.0150＋15.l524X$_1$＋1.0861X$_2$＋156.7973X$_3$-148.3742X$_4$ $Y_{11}$v$_3$=178.7011＋29.8664X$_1$-0.2562X$_2$＋102.4632X$_3$-83.2693X$_4$ $Y_{11}$v$_4$= 264.0062＋47.7742X$_1$＋2.6996X$_2$＋92.8882X$_3$-192.3464X$_4$ Where $Y_{11}$v$_1$, $Y_{11}$v$_2$, $Y_{11}$v$_3$, $Y_{11}$v$_4$, are the estimated yield values of four varieties, and X$_1$, X$_2$, X$_3$, X$_4$, denote the measured values of four characters, namely branch length, node number, branch diameter and branch number per stock, respectively. The estimation method of mulberry spring leaf yield by measurement of some characters, in autumn the year before, could be the better method to determine the leaf yield of mulberry trees without destroying the leaves and without weighting the leaves of mulberry trees than the other methods.