• Journal of Bio-Environment Control
• /
• v.19 no.2
• /
• pp.117-121
• /
• 2010

To investigate effects of binding treatments of branches (FMB, fruiting mother branch; PSB, secondary scaffold branch; SSB, primary scaffold branch) on enlargement and coloring of persimmon 'Fuyu' fruits in ripening period, the branches were bound by steel wire. For eight weeks after binding treatments, Hunter $a^*$ of fruit peel in FMB and SSB binding treatments was more increased than in the others. In fruit characteristics harvested at eight weeks after the binding treatments, the fruit weight was heavier in the binding treatments than in control, the first of those was in SSB binding. The fruit height was higher in SSB binding than in the others, but the fruit diameter was longer in FMB and SSB binding treatments. Solid soluble content was higher in FMB and PSB binding treatments. $Chroma^*$ of the fruit peel was higher in FMB and PSB binding treatments as Hunter $a^*$ and $b^*$ values were higher and lower in FMB and SSB binding treatments, respectively. Lycopene and $\beta$-carotene content in the fruit peel were higher significantly in PSB and SSB binding treatments, total chlorophyll content in all the binding treatments was lower than in control.

• Journal of Korean Institute of Industrial Engineers
• /
• v.6 no.2
• /
• pp.21-29
• /
• 1980

This paper deals with the capital budgeting problem of a firm where investments are risky and interrelated. The established models might be classified into two categories; One is the chance-constrained programming model and the other is the expected utility maximization model. The former has a rather limited objective function and does not consider the risk in direct manner. The latter, on the other hand, might lead to a wrong decision because it uses an approximate value of expected utility. This paper attempts to extend the applicability of the chance-constrained programming model by modifying its objective function into a more general form. The capital budgeting problem is formulated as a nonlinear 0-1 integer programming problem first, and is formulated into a linear 0-1 integer programming problem for finding a lower-bound solution of the original problem. The optimal solution of the original problem is then obtained by branch & bound algorithm.

• Korean Journal of Materials Research
• /
• v.12 no.11
• /
• pp.875-879
• /
• 2002

$Pb_{1-x}$ $Cd_{x}$ $I_2$ (x=0.0, 0.2, 0.5, 0.7, 0.9, 1.0) single crystals were grown by using Bridgman method and their structural and optical properties were investigated from the measurement of X-ray diffraction, optical absorption and photoluminescence. As-grown single crystals have hexagonal closed packed layered structure. The values of lattice constant c decrease with increasing composition x. Direct and indirect transition optical energy band gaps are calculated from optical absorption spectra measured at room temperature. They increase exponentially from 2.3eV to 3.2 eV with increasing composition x. The energies of photoluminescence peak due to donor bound exciton measured at 6K increase with increasing composition . However, the peak energies of donor-acceptor pair (DAP) are independent of the optical energy band gaps of $Pb_{1-x}$/$Cd_{x}$ $I_2$ single crystals.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.506-516
• /
• 2005

This paper deals with an investment scheduling problem of maximizing net present value of dividend with reinvestment allowed, where each investment has certain capital requirement and generates deterministic profit. Such deterministic profit is calculated at completion of each investment and then allocated into two parts, including dividend and reinvestment, at each predetermined reinvestment time point. The objective is to make optimal scheduling of investments over a fixed planning horizon which maximizes total sum of the net present values of dividends subject to investment precedence relations and capital limit but with reinvestment allowed. In the analysis, the scheduling problem is transformed to a kind of parallel machine scheduling problem and formulated as an integer programming which is proven to be NP-complete. Thereupon, a depth-first branch-and-bound algorithm is derived. To test the effectiveness and efficiency of the derived algorithm, computational experiments are performed with some numerical instances. The experimental results show that the algorithm solves the problem relatively faster than the commercial software package (CPLEX 8.1), and optimally solves the instances with up to 30 investments within a reasonable time limit.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.2
• /
• pp.124-131
• /
• 2011

In this research report, we propose a heuristic algorithm with some primal recovery strategies for capacitated facility location problems (CFLP), which is a well-known combinatorial optimization problem with applications in distribution, transportation and production planning. Many algorithms employ the branch-and-bound technique in order to solve the CFLP. There are also some different approaches which can recover primal solutions while exploiting the primal and dual structure simultaneously. One of them is a MVCD (Mean Value Cross Decomposition) ensuring convergence without solving a master problem. The MVCD was designed to handle LP-problems, but it was applied in mixed integer problems. However the MVCD has been applied to only uncapacitated facility location problems (UFLP), because it was very difficult to obtain "Integrality" property of Lagrangian dual subproblems sustaining the feasibility to primal problems. We present some heuristic strategies to recover primal feasible integer solutions, handling the accumulated primal solutions of the dual subproblem, which are used as input to the primal subproblem in the mean value cross decomposition technique, without requiring solutions to a master problem. Computational results for a set of various problem instances are reported.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.187-200
• /
• 1998

This paper presents an original approach for solving short-term power scheduling in extended power system with two fuels in a unit and a limited fuel using Lagrangian relaxations. The underlying model incorporates the full set of costs and constraints including setup, production, ramping, and operational status, and takes the form of a mixed integer nonlinear control problem. Moreover, the mathematical model developed includes two fuels in a unit and a limited fuel, regulation reserve requirements of prespecified group of units. Lagrangian relaxation is used to disaggregate the model by generator into separate subproblems which are then solved with a nested dynamic program including empirical knowledges. The strength of the methodology lies partially in its ability to construct good feasible solutions from information provided by the dual. Thus, the need for branch-and-bound is eliminated. In addition, the inclusion of two fuels in a unit and a limited fuel provides new insight into the limitations of current techniques. Computational experience with the proposed algorithm indicates that Problems containing up to 23 units including 8 unit used two fuels and 24 time periods can be readily solved in reasonable times. Duality gaps of less than 4％ were achieved.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.6
• /
• pp.1261-1268
• /
• 2013

This study proposes a voltage and reactive coordinative control strategy with distributed generator (DG) in a distribution power system. The aim is to determine the optimum dispatch schedules for an on-load tap changer (OLTC), distributed generator settings and all shunt capacitor switching on the load and DG generation profile in a day. The proposed method minimizes the real power losses and improves the voltage profile using squared deviations of bus voltages. The results indicate that the proposed method reduces the real losses and voltage fluctuations and improve receiving power factor. This paper proposes coordinated voltage and reactive power control methods that adjust optimal control values of capacitor banks, OLTC, and the AVR of DGs by using a voltage sensitivity factor (VSF) and dynamic programming (DP) with branch-and-bound (B&B) method. To avoid the computational burden, we try to limit the possible states to 24 stages by using a flexible searching space at each stage. Finally, we will show the effectiveness of the proposed method by using operational cost of real power losses and voltage deviation factor as evaluation index for a whole day in a power system with distributed generators.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06b
• /
• pp.292-297
• /
• 2008

본 논문은 FPGA 기반 설계에서 주변보다 급격한 온도 변화를 보이는 hotspot들을 탐지하기 위한 열 감지 센서 수를 정하고, 센서의 놓여야 할 배치 장소를 결정하는 알고리즘을 제안한다. 열 감지 센서로는 동적으로 설계가 가능한 ring oscillator 센서 기술을 사용한다는 가정 하에, 센서의 사용 개수를 최소화함과 동시에 최적의 센서 배치 위치 찾는다. 기존의 연구의 단점은 센서가 감지하는 영역 범위를 적당한 크기의 정사각형으로 간주하였기에, 실제 원형의 관측 범위를 보이는 센서 감지 영역의 현실을 올바로 반영하지 못하였으며, 또한 잘 알려진 회로 분할(partition) 기법에 의존한 휴리스틱으로 최적의 결과를 보장하지는 못하였다. 이와는 달리 본 연구에서는 센서의 관측 범위를 원형으로 할 수도 있게 함과 동시에 최적의 해를 보장하는 센서 할당 및 배치 알고리즘을 제안한다. 구체적으로 본 제안 알고즘에서는 소위 “Candidate Coloring 기법”을 통해 센서가 놓여야 할 모든 후보 영역을 표시하며, “Candidate Filtering 기법”을 통해 불필요한 후보 영역들을 완전히 삭제하여 탐색 공간을 줄이게 되며 (해의 최적 해는 항상 유지 되도록 하면서), 마지막으로 Branch-and-Bound 알고리즘을 적용해 최적의 센서 할당 및 배치 결과를 찾아내었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06b
• /
• pp.298-302
• /
• 2008

주어진 작은 크기의 칩 내부에 많은 기능 (예: 멀티미디어, 음성/영상 등)을 작동시키기 위해서는 고집적(high-integration)의 회로가 구현되게 된다. 이러한 고집적 회로는 작동할 때 상당한 양의 전력 소모를 유발하게 되어 결국 배더리 수명을 단축시키는 상황을 가지게 한다. 더욱 심각한 상황은 고 밀도의 칩 안에서의 많은 전력 소모는 열의 발생을 더욱 가속화 시키게 되며, 결국 칩 작동의 신뢰성(reliability)을 상당히 잃게 만든다. 본 연구에서는 칩의 작동에 따른 열 발생으로 유발되는 칩의 온도 상승을 감지하는 센서회로 구현에 관한 것이다. FPGA 칩은 주 목적의 기능을 수행하는 회로들을 구현함과 동시에 추가적으로 열 감지 센서 회로를 구현할 자원을 FPGA가 제공을 해 주어야 하는데, 주목적의 회로 공간(즉, 자원) 사용으로 인해 열 센서 회로 구현 자원이 충분하지 않을 경우나 여러 지역에 사용 가능한 자원이 소규모로 흩어진 경우 등 센서 구현을 위한 자원 탐색 및 구현 가능성에 대해 점검하는 알고리즘이 필요하다. 본 연구는 이러한 알고리즘을 개발하여 그 효용성을 실험을 통해 보이고 있다. 제안한 알고리즘의 특징은 Branch-and-Bound에 기반을 두고 있으며, 알고리즘의 수행 시간 단축을 위한 효과적인 search tree pruning 기법을 제안하고 있다.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.3
• /
• pp.377-382
• /
• 2004

An unconstrained three-dimensional cutting problem describes the process of finding the cutting pattern that yields the maximum total profit-sum for the small parallelepipeds pieces cut from a large parallelepiped box and there is no limit to the number of pieces to be cut. The problem is a classic NP-hard. The bottom-up approach, which generates all of the feasible cutting patterns by combining two other cutting patterns, can be applied to the three-dimensional problem. We introduce a build and new branching strategies for the unconstrained three-dimensional cutting problem. The strategies are all generalized from the branching strategies proposed by G et at. to solve unconstrained two-dimensional cutting problems.