• Bulletin of the Korean Chemical Society
• /
• v.21 no.1
• /
• pp.29-30
• /
• 2000

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.1-23
• /
• 2005

The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an $O(n^2)$ time sequential algorithm and an $O(n^2/p+logn)$ time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.

• Biotechnology and Bioprocess Engineering:BBE
• /
• v.8 no.2
• /
• pp.158-161
• /
• 2003

Root cultures of Angelica gigas Nakai were found to be sensitive to elicitation by poly-saccharide elicitors, such as methyl-$\beta$-cyclodextrin, glucan, carboxymethyl-$\beta$-chitin, chitosan, yeast extract and pectin. For the production of decursinol angelate, ca rboxymethyl-$\beta$-chitin and glucan were found to be the most efficient elicitors. The e nhanced accumulation of decursinol angelate was proportional to the increase of the phenylalanine ammonialyase (PAL) activity after the treatment with most of the elicitors. However, carboxymethyl-$\beta$-chitin treatment did not stimulate the PAL activity, despite the 1.6-fold increase in the decursinol angelate production.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2009.05c
• /
• pp.1-6
• /
• 2009

The HwaSungSungYouk is one of the construction project in viewpoint of today's construction management and various information how to build the HwaSung at the last of the eighteen century had been recorded in HwaSungSungYoukEuGye. The purpose of this study is to analyse the data in HwaSungSungYoukEuGye in viewpoint of today's construction management for estimating the resources of PalDal-mun construction. In the record, there are a 10t of information relate to time management, cost management and human resource management, and the concept of modern construction management will be also use to figure out the construction data of the HwaSungSungYoukEuGye.

• Microbiology and Biotechnology Letters
• /
• v.26 no.6
• /
• pp.566-568
• /
• 1998

Partial nucleotide sequence (nt 1-1842) of chloramphenicol resistance plasmid pKH7 has been reported previously and residual nucleotide sequence (nt 1843-4118) of pKH7 was determined and then the complete nucleotide sequence of pKH7 was obtained. pKH7 consists of 4118 bp and has three ORFs. Besides Rep and CAT proteins described in previous paper, Pre protein which mediates site-specific recombination in Staphylococcus aureus was found to be on pKH7. R $S_{A}$, a site-specific recombination site of Pre protein, and palA, a specific lagging-strand conversion signal, was also found in pKH7. Amino acid sequence of Pre protein of pKH7 was compared with those of other antibiotic resistant Staphylococcus aureus plasmids.s.

• Journal of applied mathematics & informatics
• /
• v.33 no.5_6
• /
• pp.475-484
• /
• 2015

In this article, we deal with the uniqueness problems of meromorphic functions concerning differential polynomials and prove the following theorem. Let f and g be two nonconstant meromorphic functions, n ≥ 12 a positive integer. If fⁿ(f³ - 1)f′ and gⁿ(g³ - 1)g′ share (1, 2), f and g share ∞ IM, then f ≡ g. The results in this paper improve and generalize the results given by Meng (C. Meng, Uniqueness theorems for differential polynomials concerning fixed-point, Kyungpook Math. J. 48(2008), 25-35), I. Lahiri and R. Pal (I. Lahiri and R. Pal, Nonlinear differential polynomials sharing 1-points, Bull. Korean Math. Soc. 43(2006), 161-168), Meng (C. Meng, On unicity of meromorphic functions when two differential polynomials share one value, Hiroshima Math.J. 39(2009), 163-179).

• Korean Journal of Veterinary Research
• /
• v.53 no.4
• /
• pp.257-261
• /
• 2013

This study evaluated two different surgical techniques for the treatment of palmar annular ligament desmitis (PAL) in horses. The group 1 (G1) consisted of 11 Thoroughbred submitted to desmotomy, and G2 of 22 horses that underwent PAL desmectomy. There was no statistically significant difference between mean palmar annular ligament thickness in both groups evaluated (p = 0.800). In this study, the horses of G1 had 12 times more chance to return to physical activity, when compared to animals of G2 (p = 0.033; O.R. = 12.0; C.I.95% = 1,142 - 126,122). Desmectomy was more efficient in promoting the resolution of the injury and the return to sports activity.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.18-21
• /
• 2005

The impact of the interannual climatic variability on the vegetation sensitively appears in the timing of phenological events such as green-up, mature, and senescence. Therefore, an accurate and temporally high-resolution NDVI dataset will be required for analysis on the interannual variability of the climate-vegetation relationship. We constructed a daily 8km NDVI dataset over Eurasia based on the 8km tiled data of Pathfinder A VHRR Land (PAL) Global daily product. Cloud contamination was successfully reduced by Temporal Window Operation (TWO), which is a method to find optimized upper envelop line of the NDVI seasonal change. Based on the daily NDVI time series from 1982 to 2000, an accurate (daily) interannual change of the phenological events will be analyzed.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.1-11
• /
• 2010

The conditional covering problem is an important variation of well studied set covering problem. In the set covering problem, the problem is to find a minimum cardinality vertex set which will cover all the given demand points. The conditional covering problem asks to find a minimum cardinality vertex set that will cover not only the given demand points but also one another. This problem is NP-complete for general graphs. In this paper, we present an efficient algorithm to solve the conditional covering problem on interval graphs with n vertices which runs in O(n)time.

• Journal of Microbiology and Biotechnology
• /
• v.10 no.2
• /
• pp.233-237
• /
• 2000

As part of a continuing investigation to identify free radical scavengers from the fruit bodies of basidiomycetes, we isolated two p-terphenyl compounds, designated as PAl and PA2l, from cethanolic extract of the fruit body of Pasillus panuoides. The methanolic extract was processed by ethyl acetate extraction and silica gel column chromatography to yield two active fraction. PAl was obtained from one of the fractions through Sephadex LH-20 and silica gel column chromatographies and reverse-phase HPLC. The other fraction was purified by Sephadex LH-20 and reverse-phase column chromatographies to produce PA2. The compounds PA1 and PA2 were identified as leucomentin-4 and leucomentin-2, respectively, on the basis of various spectroscopic analyses. These compounds exhibited strong inhibitory activities against lipid peroxidation in rat liver microsomes with IC_{50}$ values of 0.10 and $0.06{\;}\mu\textrm{g}ml$, respectively.