http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Inhibitory Effect of the Phenolic Compounds from Apples Against Oxidative Damage and Inflammation
Sim, Jang-Seop,Jeong, Jin-Boo,Lee, Jong-Hwa,Kwon, Tae-Hyung,Cha, Young-Joon,Jeong, Hyung-Jin The Plant Resources Society of Korea 2010 한국자원식물학회지 Vol.23 No.6
ROS have been associated with pathogenic processes including carcinogenesis through direct effect on DNA and play an important role in the pathogenesis of inflammation. Because of many types of phenolic acid derivatives and flavonoids, apples have been one of the human diet since ancient times and are one of the most commonly consumed fruits in worldwide. In this study, catechin, chlorogenic acid and phlorizin dihydrate were purified and identified by HPLC and GC/MS. The contents of catechin, chlorogenic acid and phlorizin dihydrate were 1.01 mg, 7.01 mg and 3.67 mg/ kg wet weight, respectively. Catechin and phlorizin dihydrate were found to significantly inhibit oxidative DNA damage, while chlorogenic did not affect. Also, catechin inhibits NO and $PGE_2$ production via suppressing iNOS and COX-2 expression. However, chlorogenic acid and phlorizin dihydrate did not affect. Our results show that catechin may be the most active phenolic compound in anti-oxidative damage and anti-inflammatory effect.
심정섭(Jeong Seop Sim),박근수(Kunsoo Park),김성렬(Sung-Ryul Kim),이지수(Jee-Soo Lee) 한국정보과학회 2002 정보과학회논문지 : 시스템 및 이론 Vol.29 No.1·2
반복적인 문자열에 대한 연구는 최근 들어 여러 분야에서 활발히 진행되어 왔다. 특히 DNA 염기서열의 분석 등 분자생물학에서 그 필요성이 대두되고 있다. 주기, 커버, 시드, 스퀘어 등이 반복적인 문자열의 대표적인 예들이다. 근사문자열 매칭 분야에서도 근사주기, 근사스퀘어 등 반복적인 문자열에 관한 연구가 진행되고 있다. 본 논문에서는 근사커버의 개념을 제시한다. 길이가 각각 m, n 인 두 문자열 P, T 가 주어졌을 때, P 가 T 의 근사커버가 되는 최소의 편집거리를 O (mn) 시간, 최소의 가중편집거리를 O (mn²) 시간에 찾는 알고리즘을 제시한다. 또한, 문자열 T 만 주어졌을 때, T 의 최소 근사커버 거리를 갖는 문자열 P 를 찾는 문제가 NP-완전 결과임을 증명한다. Repetitive strings have been studied in such diverse fields as molecular biology, data compression, etc. Some important regularities that have been studied are periods, covers, seeds and squares. A natural extension of the repetition problems is to allow errors. Among the four notions above, approximate squares and approximate periods have been studied. In this paper, we introduce the notion of approximate covers which is an approximate version of covers. Given two strings P ( P = m) and T ( T = n) , we propose an algorithm which finds the minimum distance t such that P is a t -approximate cover of T . The algorithm takes O (mn) time for the edit distance and O (mn²) time for a weighted edit distance. Furthermore, when only T is given, we show that the problem of finding a string which is an approximate cover of T with the minimum distance is NP-complete.
A String Reconstruction Algorithm and Its Application to Exponentiation Problems
심정섭(Jeong Seop Sim),이문규(Mun-Kyu Lee),김동규(Dong Kyue Kim) 한국정보과학회 2008 정보과학회논문지 : 시스템 및 이론 Vol.35 No.9·10
대부분의 문자열 문제들과 이들에 대한 알고리즘들은 패턴 매칭, 데이타 압축, 생물정보학 등의 분야에 응용되어 왔다. 그러나 문자열 문제와 암호화 문제의 관련성에 대한 연구는 거의 진행되지 않았다. 본 논문에서는 다음과 같은 문자열 재구성 문제들에 대해 연구하고 이 결과들이 암호학에 응용될 수 있음을 보인다. 유한 알파벳으로 구성된 길이 n 인 문자열 x 와, 길이 k (≤ n) 이내의 문자열의 집합 W가 주어졌을 때, 첫 번째 문제는 W내의 문자열들 중 일부 문자열들을 최소의 회수로 연결하여 x 를 재구성할 수 있는 연결 순서를 찾는 문제이다. 이 문제에 대해 O(kn+L) -시간 알고리즘을 제시한다. 이때, L은 W내의 모든 문자열들의 길이의 합을 표시한다. 두 번째 문제는 첫 번째 문제의 동적 버전이며 이에 대해 O(k³n+L)-시간 알고리즘을 제시한다. 마지막으로 암호학과 관련된 멱승문제와 위에 제시된 재구성 문제들과의 관련성을 보이고 멱승문제를 해결하는 새로운 알고리즘을 제시한다. Most string problems and their solutions are relevant to diverse applications such as pattern matching, data compression, recently bioinformatics, and so on. However, there have been few works on the relations between string problems and cryptographic problems. In this paper, we consider the following string reconstruction problems and show how these problems can be applied to cryptography. Given a string χ of length n over a constant-sized alphabet ∑ and a set W of strings of lengths at most an integer к (≤ n), the first problem is to find the sequence of strings in W that reconstruct χ by the minimum number ofoncatenations. We propose an О(kn+L)-time algorithm for this problem, where ? is the sum of all lengths of strings in a given set, using suffix trees and a shortest path algorithm for directed acyclic graphs. The other is a dynamic version of the first problem and we propose an О(k³n+L)-time algorithm. Finally, we show that exponentiation problems that arise in cryptography can be successfully reduced to these problems and propose a new solution for exponentiation.
Jeong Seop LEE,Byung Sun YU,Sang Jun SIM 한국생물공학회 2021 한국생물공학회 학술대회 Vol.2021 No.10
The aim of this work was to develop a photobioreactor which has high areal productivity for increasing biomass and lipid production in microalgal cultivation. To accomplish economic microalgae mass production, lower investment cost is essential. We developed low cost film bag reactor. Film bag reactor has advantage of cost, but its smaller volumetric capacity that comes from weak mechanical strength is main limitation. To overcome this problem, additional bulkheads were introduced to increase column size safely. In addition, spacer was devised to link film bags for single large volume reactor. By using this advanced polymer bag reactor, areal productivity of biofuel was greatly increased. Thus, we expect that economic mass production of microalgal fuel becomes feasible.