• Communications of the Korean Mathematical Society
• /
• v.18 no.4
• /
• pp.745-754
• /
• 2003

Maximum clique problem is to find a maximum clique(largest in size) in an undirected graph G. We present a method that computes either a maximum clique or an upper bound for the size of a maximum clique in G. We show that this method performs well on certain class of graphs and discuss the application of this method in a branch and bound algorithm for solving maximum clique problem, whose efficiency is depended on the computation of good upper bounds.

• Bulletin of the Korean Chemical Society
• /
• v.11 no.6
• /
• pp.534-538
• /
• 1990

Glucagon was found to interact with DMPC vesicles electrostatically and hydrophobically. It appears that glucagon bound irreversibly to the vesicles through hydrophobic interaction was partially protected from the proteolysis by trypsin. Out of three possible sites, only the peptide bond preceded by Arg-18 was cleaved by a prolonged trypsin treatment. ${\alpha}$-chymotrysin did not affect the vesicle-bound glucagon. Based on these observations, possible structure of irreversibly bound glucagon on the vesicle surface is discussed.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.391-397
• /
• 2019

In this paper, we give a simple proof of the improved Johnson bound for A(n, d), the maximum number of codewords in a binary code of length n and minimum distance d, given by Mounits, Etzion and Litsyn.

• Journal of Soil and Groundwater Environment
• /
• v.20 no.6
• /
• pp.111-116
• /
• 2015

The soil sample obtained from shooting area contaminated with Pb, Cu, and Zn was investigated to determine the chemical forms of heavy metals with Tessier’s sequential extraction method, which is constituted of five fractions such as ‘exchangeable’, ‘bound to carbonate’, ‘bound to oxide’, ‘bound to organic matter’, and residual fractions. The amount of organic matter was measured by loss on ignition (LOI) and then the results of ‘bound to organic matter’ and LOI were compared. The sequential extraction results show that 4.7%-45% of Pb, 6.2%-25.9% of Cu and 3.9%-15.3% of Zn belong to the ‘bound to organic matter’ fraction, but LOI result shows that only 1.0%-2.8% of organic matter exists in the soil sample. In heavy medium separation tests, because Pb and Cu extracted in ‘bound to organic matter’ and residual fractions were removed, the heavy metals in the fractions would exist as heavier forms. These results suggest that the part of heavy metal extracted in ‘bound to organic matter’ fraction would result from the oxidation of metallic forms by hydrogen peroxide and nitric acid used in the fraction, and, consequently, that the ‘bound to organic matter’ fraction should be investigated in detail to determine the removal method and treatment capacity when the Tessier’s sequential extraction method is used to examine heavy metal contaminants resulted from elemental metal like bullets.

• Molecules and Cells
• /
• v.39 no.7
• /
• pp.536-542
• /
• 2016

Interleukin-17A is a member of the IL-17 family, and is known as CTLA8 in the mouse. It is produced by T lymphocytes and NK cells and has proinflammatory roles, inducing cytokine and chemokine production. However, its role in tumor biology remains controversial. We investigated the effects of locally produced IL-17A by transferring the gene encoding it into CT26 colon cancer cells, either in a secretory or a membrane-bound form. Expression of the membrane-bound form on CT26 cells dramatically enhanced their proliferation in vitro. The enhanced growth was shown to be due to an increased rate of cell cycle progression: after synchronizing cells by adding and withdrawing colcemid, the rate of cell cycle progression in the cells expressing the membrane-bound form of IL-17A was much faster than that of the control cells. Both secretory and membrane-bound IL-17A induced the expression of Sca-1 in the cancer cells. When tumor clones were grafted into syngeneic BALB/c mice, the tumor clones expressing the membrane-bound form IL-17A grew rapidly; those expressing the secretory form also grew faster than the wild type CT26 cells, but slower than the clones expressing the membrane-bound form. These results indicate that IL-17A promotes tumorigenicity by enhancing cell cycle progression. This finding should be considered in treating tumors and immune-related diseases.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.4
• /
• pp.132-141
• /
• 2015

We focus on the fire scheduling problem (FSP), the problem of determining the sequence of targets to be fired at, for the objective of minimizing makespan to achieve tactical goals. In this paper, we assume that there are m available weapons to fire at n targets (> m) and the weapons are already allocated to targets. One weapon or multiple weapons can fire at one target and these fire operations should start simultaneously while the finish time of them may be different. We develop several dominance properties and a lower bound for the problem, and suggest a branch and bound algorithm implementing them. Also, In addition, heuristic algorithms that can be used for obtaining an initial upper bound in the B&B algorithm and for obtaining good solutions in a short time were developed. Computational experiments are performed on randomly generated test problems and results show that the suggested algorithm solves problems of a medium size in a reasonable amount of computation time. The proposed lower bound, the dominance properties, and the heuristics for upper bound are tested in B&B respectively, and the result showed that lower bound is effective to fathoming nodes and the dominance properties and heuristics also worked well. Also, it is showed that the CPU time required by this algorithm increases rapidly as the problem size increases. Therefore, the suggested B&B algorithm would be limited to solve large size problems. However, the employed heuristic algorithms can be effectively used in the B&B algorithm and can give good solutions for large problems within a few seconds.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.3
• /
• pp.385-394
• /
• 2007

An upper bound of the basis number of the semi-strong product of cycles with bipartite graphs is given. Also, an example is presented where the bound is achieved.

• Bulletin of the Korean Mathematical Society
• /
• v.38 no.4
• /
• pp.797-801
• /
• 2001

The purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewords in a binary code of word length n with minimum distance 4 between codewords. We have improved upper bound for A[12k+11,4]. In this correspondence we prove $A[23,4]\leq173716$.

• Journal of Korean Society for Quality Management
• /
• v.22 no.1
• /
• pp.205-213
• /
• 1994

We construct a new lower bound of Cramer-Rao type for the median-unbiased estimator in the presence a nuisance parameter. We also identify useful necessary and sufficient conditions for the attainability of the lower bound. Some applications including the analysis of censored reliability data are considered as examples.

• Kyungpook Mathematical Journal
• /
• v.46 no.4
• /
• pp.489-496
• /
• 2006

The aim of this paper is to use the Stein-Chen method to obtain a non-uniform bound on Poisson approximation in matching problem.