• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.27-37
• /
• 2005

The rectilinear Steiner tree problem (RSTP) is to find a minimum-length rectilinear interconnection of a set of terminals in the plane. It is well known that the solution to this problem will be the minimal spanning tree (MST) on some set Steiner points. The RSTP is known to be NP-complete. The RSTP has received a lot of attention in the literature and heuristic and optimal algorithms have been proposed, A key performance measure of the algorithm for the RSTP is the reduction rate that is achieved by the difference between the objective value of the RSTP and that of the MST without Steiner points. A hybrid evolution strategy on RSTP based upon the Prim algorithm was presented. The computational results show that the evolution strategy is better than the previously proposed other heuristic. The average reduction rate of solutions from the evolution strategy is about 11%, which is almost similar to that of optimal solutions.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.1056-1064
• /
• 2003

The Euclidean steiner tree problem (ESTP) is to find a minimum-length euclidean interconnection of a set of points in the plane. It is well known that the solution to this problem will be the minimal spanning tree (MST) on some set steiner points, and the ESTP is NP-complete. The ESTP has received a lot of attention in the literature, and heuristic and optimal algorithms have been proposed. In real field, heuristic algorithms for ESTP are popular. A key performance measure of the algorithm for the ESTP is the reduction rate that is achieved by the difference between the objective value of the ESTP and that of the MST without steiner points. In recent survey for ESTP, the best heuristic algorithm showed around $3.14\%$ reduction in the performance measure. We present a evolution programming (EP) for ESTP based upon the Prim algorithm for the MST problem. The computational results show that the EP can generate better results than already known heuristic algorithms.

• Asian-Australasian Journal of Animal Sciences
• /
• v.4 no.1
• /
• pp.21-24
• /
• 1991

A mixed infection of Haemophilus paragallinarum (Hpg), Mycoplasma gallisepticum (MG) and M. synoviae (Ms) was detected in layers of a poultry farm in Iwate prefecture in Japan by pathological, serological and bacteriological investigation. Hpg strains were isolated from three of five birds investigated and all strains were identified to be type C. The Hpg isolates were more susceptible in vitro to a combination of sulfamonomethoxine and ormetoprim (Ektecin) than each of sulfamethoxasol, sulfamonomethoxine, oxytetracycline, tetracycline, streptomycin, erythromycin and thianphinicol. After a total of six days' medication of 1% feed additive Ektecin, symptoms of infectious coryza of hens in the farm almost disappeared and no Hpg was detected even from birds showing nasal discharge.

• Korean Management Science Review
• /
• v.26 no.1
• /
• pp.65-76
• /
• 2009

The undirected Steiner tree problem in graphs is known to be NP-hard. The objective of this problem is to find a shortest tree containing a subset of nodes, called terminal nodes. This paper proposes a method based on a two-step procedure to solve this problem efficiently. In the first step. graph reduction rules eliminate useless nodes and edges which do not contribute to make an optimal solution. In the second step, a max-min ant colony optimization combined with Prim's algorithm is developed to solve the reduced problem. The proposed algorithm is tested in the sets of standard test problems. The results show that the algorithm efficiently presents very correct solutions to the benchmark problems.

• Proceedings of the PSK Conference
• /
• 2003.10b
• /
• pp.197.1-197.1
• /
• 2003

To investigate biological active constituents from natural products, we have studied the roots of Angelica koreana Max. (Umbelliferae). Fifteen compounds were isolated from the MeOH extract by column chromatography on a silica gel. The compounds were identified as isoimperatorin, oxypeucedanin, oxypeucedanin hydrate, osthol, nodakenin, 2-hydroxy-4-methylacetophenone, cimifugin, falcarindiol, heraclenin, pabulenol, umbelliferone, demethylsuberosin, hamaudol, sec-O-glucosylhamaudol, and prim-O-glucosylcimifugin, respectivelv, by spectroscopic means. Among these, the latter eight compounds were isolated for the first time form this plant.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.165-173
• /
• 2012

Given a connected, weighted, and undirected graph, the Minimum Spanning Tree (MST) should have minimum sum of weights, connected all vertices, and without any cycle taking place. Borůvka Algorithm is firstly suggested as an algorithm to evaluate the MST, but it is not widely used rather than Prim and Kruskal algorithms. Borůvka algorithm selects the Minimum Weight Edge (MWE) from each vertex with distinct weights in $1^{st}$ stage, and selects the MWE from each MSF (Minimum Spanning Forest) in $2^{nd}$ stage. But the cycle check and the number of MSF in $1^{st}$ stage and $2^{nd}$ stage are difficult to implication by computer program even if it is easy to verify visually. This paper suggests the generalized Borůvka Algorithm, This algorithm selects all of the same MWEs for each vertex, then checks the cycle and constructs MSF for ascending sorted MWEs. Kruskal method bring into this process. if the number of MSF greats then 1, this algorithm selects MWE from ascending sorted inter-MSF edges. The generalized Borůvka algorithm is verified its application by being applied to the 7 graphs with the many minimum weights or distinct weight edges for any vertex. As a result, the generalized Borůvka algorithm is less required for cycle verification then the Kruskal algorithm. Therefore, the generalized Borůvka algorithm is more fast to obtain MST then Kruskal algorithm.

• Proceedings of the Korean Society of Embryo Transfer Conference
• /
• 2002.11a
• /
• pp.118-118
• /
• 2002

Programmed cell death (PCD) is thought as a well-controlled process by which unwanted cells are selectively eliminated. During the last decade many researches have elucidated molecules and their interactions involved in cell death by using largely in vitro induction of cell death or survival signals in a more defined manner, While these critical information and novel findings provide us with clearer understanding of mechanisms underlying cell death, it does by no means explain how PCD occurs and which cells or tissues are affected during normal embryonic development in vivo. In this study, we used zebrafish to examine whether the PCD is occurring selectively or randomly in developing embryos by whole mount in situ TUNEL analysis with specific markers for neural cells. The result revealed that the degree and distribution of TUNEL staining varied considerably throughout gastrulation stage, and there was also a number of TUNEL-negative embryos. Most of TUNEL-positive cells were scattered randomly throughout the blastoderm. During the gastrulation stage about 75 % of the embryos analyzed exhibited more than 5 TUNEL-positive cells. As the dorsal epiblast begins to thicken rather abruptly near the end of gastrulation, TUNEL-positive cells were mainly located along the dorsal side. Although there were some variations in TUNEL staining during segmentation and pharyngeal stages, TUNEL staining continued to be localized to the central nervous system, and was also detected in the sensory organs, trigeminal ganglions, and the primary sensory neurons. High levels of the cell death in developing brain between 20-somite and prim-6 stages are thought to play a role in the morphogenesis and organization of the brain. At prim-16 stage, cell death is considerably reduced in the brain region. Dying cells are mainly localized to the prospective brain region where ectodermal cells are about to initiate neurogenesis. As development progressed, high levels and more reproducible patterns of cell death were observed in the developing nervous system. Intensive TUNEL staining was restricted to the trigeminal ganglions, the primary sensory neurons, and sensory organs, such as olfactory pits and otic vesicles. Thus, PCD patterning in zebrafish embryos occurs randomly at early stages and becomes restricted to certain region of the embryos. The spatio-temporal pattern of PCD during the early embryonic development in zebrafish will provide basic information for further studies to elucidate genes involved in. regulation of PCD largely unknown in vivo during vertebrate embryogenesis.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.273-280
• /
• 2008

In WSN(Wireless Sensor Network) many routing algorithms such as LEACH, PEGASIS and PEDEP consisting of sensor nodes with limited energy have been proposed to extend WSN lifetime. Under the assumption of perfect fusion, these algorithms used convergecast that periodically collects sensed data from all sensor nodes to a base station. But because these schemes studied less energy consumption for a convergecast as well as fairly energy consumption altogether, the minimum energy consumption for a convergecast was not focused enough nor how topology influences to energy consumption. This paper deals with routing topology and energy consumption for a single convergecast in the following ways. We chose major WSN topology as MSC(Minimum Spanning Chain)s, MSTs, PEGASIS chains and proposed LECSEN chains. We solved the MSC length by Linear Programming(LP) and propose the LECSEN chain to compete with MST and MSC. As a result of simulation by Monte Carlo method for calculation of the topology length and standard deviation of link length, we learned that LECSEN is competitive with MST in terms of total energy consumption and shows the best with the view of even energy consumption at the sensor nodes. Thus, we concluded LECSEN is a very useful routing topology in WSN.

• Nuclear Engineering and Technology
• /
• v.50 no.3
• /
• pp.356-367
• /
• 2018

A series of tests dedicated to station blackout (SBO) accident scenarios have been recently performed at the $Prim{\ddot{a}}rkreislauf-Versuchsanlage$ (primary coolant loop test facility; PKL) facility in the framework of the OECD/NEA PKL-3 project. These investigations address current safety issues related to beyond design basis accident transients with significant core heat up. This work presents a detailed analysis using the best estimate thermal-hydraulic code TRACE (v5.0 Patch4) of different SBO scenarios conducted at the PKL facility; failures of high- and low-pressure safety injection systems together with steam generator (SG) feedwater supply are considered, thus calling for adequate accident management actions and timely implementation of alternative emergency cooling procedures to prevent core meltdown. The presented analysis evaluates the capability of the applied TRACE model of the PKL facility to correctly capture the sequences of events in the different SBO scenarios, namely the SBO tests H2.1, H2.2 run 1 and H2.2 run 2, including symmetric or asymmetric secondary side depressurization, primary side depressurization, accumulator (ACC) injection in the cold legs and secondary side feeding with mobile pump and/or primary side emergency core coolant injection from the fuel pool cooling pump. This study is focused specifically on the prediction of the core exit temperature, which drives the execution of the most relevant accident management actions. This work presents, in particular, the key improvements made to the TRACE model that helped to improve the code predictions, including the modeling of dynamical heat losses, the nodalization of SGs' heat exchanger tubes and the ACCs. Another relevant aspect of this work is to evaluate how well the model simulations of the three different scenarios qualitatively and quantitatively capture the trends and results exhibited by the actual experiments. For instance, how the number of SGs considered for secondary side depressurization affects the heat transfer from primary side; how the discharge capacity of the pressurizer relief valve affects the dynamics of the transient; how ACC initial pressure and nitrogen release affect the grace time between ACC injection and subsequent core heat up; and how well the alternative feeding modes of the secondary and/or primary side with mobile injection pumps affect core quenching and ensure stable long-term core cooling under controlled boiling conditions.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.3
• /
• pp.17-28
• /
• 2008

The Steiner arborescence problem is known to be NP-hard. The objective of this problem is to find a minimal Steiner tree which starts from a designated node and spans all given terminal nodes. This paper proposes a method based on a two-step procedure to solve this problem efficiently. In the first step, graph reduction rules eliminate useless nodes and arcs which do not contribute to make an optimal solution. In the second step. ant colony algorithm with use of Prim's algorithm is used to solve the Steiner arborescence problem in the reduced graph. The proposed method based on a two-step procedure is tested in the five test problems. The results show that this method finds the optimal solutions to the tested problems within 50 seconds. The algorithm can be applied to undirected Steiner tree problems with minor changes. 18 problems taken from Beasley are used to compare the performances of the proposed algorithm and Singh et al.'s algorithm. The results show that the proposed algorithm generates better solutions than the algorithm compared.