• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.173-190
• /
• 2011

In this paper, we construct a new approach of affine scaling interior algorithm using the affine scaling conjugate gradient and Lanczos methods for bound constrained nonlinear optimization. We get the iterative direction by solving quadratic model via affine scaling conjugate gradient and Lanczos methods. By using the line search backtracking technique, we will find an acceptable trial step length along this direction which makes the iterate point strictly feasible and the objective function nonmonotonically decreasing. Global convergence and local superlinear convergence rate of the proposed algorithm are established under some reasonable conditions. Finally, we present some numerical results to illustrate the effectiveness of the proposed algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.2
• /
• pp.53-66
• /
• 1989

The Public Vehicle Routing Problem (PVRP) is to find the minimum total cost routes of M or less Public-Vehicles to traverse the required arcs(streets) at least once, and return to their starting depot on a directed network. In this paper, first, a mathematical model is formulated as minimal cost flow model with illegal subtour elimination constraints, and with the fixed cost and routing cost as an objective function. Second, an efficient branch and bound algorithm is developed to obtain an exact solution. A subproblem in this method is a minimal cost flow problem relaxing illegal subtour elimination constraints. The branching strategy is a variable dichotomy method according to the entering nonrequired arcs which are candidates to eneter into an illegal subtour. To accelerate the fathoming process, a tighter lower bound of a candidate subproblem is calculated by using a minimum reduced coast of the entering nonrequired arcs. Computational results based on randomly generated networks report that the developed algorithm is efficient.

• Korean Management Science Review
• /
• v.19 no.1
• /
• pp.55-66
• /
• 2002

Given a directed network, a designated arc, and lowers and upper bounds for the distance of each arc, the preprocessing shortest path problem Is a decision problem that decides whether there is some choice of distance vector such that the distance of each arc honors the given lower and upper bound restriction, and such that the designated arc is on some shortest path from a source node to a destination notre with respect to the chosen distance vector. The preprocessing shortest path problem has many real world applications such as communication and transportation network management and the problem is known to be NP-complete. In this paper, we develop an algorithm that solves the problem using the structural properties of shortest paths.

• Bulletin of the Korean Mathematical Society
• /
• v.42 no.2
• /
• pp.415-420
• /
• 2005

Let $IB_n$ be the set of all irreducible matrices in $B_n$ and let $SIB_n$ be the set of all symmetric matrices in $IB_n$. Finding an upper bound for the set of indices of matrices in $IB_n$ and $SIB_n$ and determining gaps in the set of indices of matrices in $IB_n$ and $SIB_n$ has been studied by many researchers. In this paper, we establish a best upper bound for the set of weak exponents of indecomposability of matrices in $SIB_n\;and\;IB_n$, and show that there does not exist a gap in the set of weak exponents of indecomposability for any of class $SIB_n\;and\;class\;IB_n$.

• Journal of the Korean Chemical Society
• /
• v.14 no.2
• /
• pp.155-160
• /
• 1970

The kinetics of the pepsin-catalyzed hydrolysis of N-carbobenzoxy-L-glutamyl-L-tyrosine at pH 3.5 and $37^{\circ}C$ were determined by a spectrophotometric technique. The pepsin used was further purified on a Sephadex G-75 column. The kinetics data were Km = l.7 ${\times}10^{-3}M,\;-{\Delta}F^{\circ}$ = 3.99Kcal/mole, and $k^3=\;2.1{\times}10^{-2}\;sec^{-1}$. An analysis of the above data and other investigators' data obtained from some dipeptides led to the following conclusions. (1) Phenylalanyl residues in a synthetic peptide are bound to pepsin more strongly than glutamyl or tyrosyl residues, supporting the theory that a part of the binding region of the active center is hydrophobic. (2) Dipeptides are bound to pepsin principally through their side chains and the binding involves both side-chain residues. (3) The nature of amino acids in dipeptides $R_2-R_1,\;affect\;the\;k_3$ values.

• Journal of the Korean Magnetic Resonance Society
• /
• v.5 no.2
• /
• pp.130-137
• /
• 2001

Backbone dynamics of the catalytic residues in free and steroid-bound $\Delta$$^{5}$ -3- ketosteroid isomerase from Pseudomonas testosteroni has been examined by $^{15}$ N relaxation measurements. The relaxation data were analyzed using the model-free formalism to extract the model-free parameters (S$^2$, $\tau$$_{e}$, and R$_{ex}$). Tyr-34 and Asp-99 exhibit enhanced high-frequency (pico- to nanosecond) internal motions in the free enzyme, which are restricted upon ligand binding, while Asp-38 experiences severe restriction of the internal motions in the fee enzyme, suggesting that Tyr-14 and Asp-99 are more actively involved in the ligand binding than Asp-38. The results also indicate that the H-bond network in the catalytic cavity might be slightly strengthened upon ligand binding, which may have some implications on the enzyme mechanism.he enzyme mechanism.m.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.383-391
• /
• 2005

The paper is devoted to some flow shop scheduling problems, where job processing times are defined by functions dependent on their positions in the schedule. An example is constructed to show that the classical Johnson's rule is not the optimal solution for two different models of the two-machine flow shop scheduling to minimize makespan. In order to solve the makespan minimization problem in the two-machine flow shop scheduling, we suggest Johnson's rule as a heuristic algorithm, for which the worst-case bound is calculated. We find polynomial time solutions to some special cases of the considered problems for the following optimization criteria: the weighted sum of completion times and maximum lateness. Some furthermore extensions of the problems are also shown.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.865-873
• /
• 2009

Goodman([3]) presented the question of finding a best possible upper bound of the form $t(G)\;+\;t(G^c)$, where t(G) denote the number of triangles in given graph G. In this, the form of squares of degrees is appeared and many researches have been pursued as an application related to this. Here, we would like to deal with corollary related to the results of Nikiforov([6]).

• The Korean Journal of Mycology
• /
• v.11 no.1
• /
• pp.35-37
• /
• 1983

To investigate antitumor components in Korean higher fungi, the carpophores of Pholiota squarrosa belonging to the family Strophariaceae were collected and extracted with hot water. A protein-bound polysaccharide fraction was obtained by adding ethanol to the extract and by dialyzing through Visking tube. The fraction was examined for antitumor activity against sarcoma 180 implanted in mice. It showed an inhibition ratio of 78.7% at the dose of 20mg/kg/day. The tumor in two of the ten mice was completely regressed. The chemical analysis of the antitumor fraction by Anthrone and Lowry-Folin methods showed that it consisted of 42% polysaccharide and 55% protein. The enzyme fraction of the carpophores showed no proteolytic activity on casein.

• Korean Journal of Microbiology
• /
• v.30 no.4
• /
• pp.265-268
• /
• 1992

In this study, we want to detect bacteriocin production in purple nonsulfur bacteria. As a results, it was showed that bacteriocin produced between some strains of Rhodobacter capsulatus, Rhodobacter sphaeroides and Rhodocyclus gelatinosus. In particular, it was appeared that cell membrane-bound bacteriocin was also produced by Rhodobacter capsulatus ATCC 17016.