각종 합성섬유에의 Glycidyl methacrylate 의 방사선 Graft 중합

심정섭,홍석주 한국화학공학회 1973 Korean Chemical Engineering Research(HWAHAK KONGHA Vol.11 No.4

Radiation graft polymerization of glycidyl methacrylate(GMA) to various synthetic fibers such as polyester, nylon 6 and polypropylene was carried out by γ-rays to total dose of 2×10^6 and 1×10^7 r, respectively. Graft ploymerization was performed by simultaneous γ-ray irradiation in a polar sovlent under stmospheric pressure, and the degree of grafting was checked. Dyeabilities of GMA grafted polyester, polypropylene and nylon 6 were discussed. Mechanical properties of GMA grafted synthetic fibers were examined.

접촉각 측정에 의한 RDX/EVA의 표면 에너지 해석

심정섭,김현수,이근득 한국군사과학기술학회 2000 한국군사과학기술학회지 Vol.3 No.2

Plastic bonded explosive(PBX) is mainly composed of the nitramine explosives, RDX, HMX, and polymer binders. When the adhesion between nitramine crystals and binder is not particularly strong and can be failed under stress, dewetting occurs rather suddenly and this leads to a significant drop in tensile strength of explosives. Mechnical property of plastic bonded explosive depends on the surface characteristics of filler and binder. In order to design for better adhesion, an understanding of the surface properties of explosive and binder is essential. In this study, 2 kinds of RDX and 4 kinds of ethylene vinyl acetate copolymers are selected, since they are widely used in many plastic bonded explosives. The technical objective of this investigation is to calculate for the surface free energy of RDX and EVA using theory of Fowkes, van Oss, Neumann approaches and Kaelble equation and to predict the interaction between filler and binder from their surface free energies.

고성능 에폭시 수지의 경화반응과 물성향상

심정섭 한국고분자학회 1992 한국고분자학회 학술대회 연구논문 초록집 Vol.1992 No.10

DSC Cure Studies of High Performance Epoxy Resin Part Ⅱ : The Reaction with HPT Curing Agent from Isothermal Experiment

심정섭,이원,장정식 한국공업화학회 1990 한국공업화학회 연구논문 초록집 Vol.1990 No.0

Isothermal cure kinetics of EPON HPT 1071 Resin / EPON HPT 1062 Curing Agent system were studied by differential scanning calorimetry. Based on the assumption with the overall reaction order of 2, kinetic parameters were determined from an auto-catalytic kinetic model and the model with modified manipulation. Compared to previous calculation of kinetic parameters, the model with modified manipulation has good fitting with experimental results. Drastic increase in reaction rate was observed at higher cure temperature. For a given formulation, cure temperature increases with increasing the maximum cure rate and decreasing the time requried to reach the maximum peak. The conversion at the maximum cure rate is independent of the cure temperature. Studies on cure temperature were also undretaken as a function of reaction rate constant.

문자열 재구성 알고리즘 및 멱승문제 응용

심정섭,이문규,김동규 한국정보과학회 2008 정보과학회논문지 : 시스템 및 이론 Vol.35 No.10

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 x of length n over a constant-sized alphabet ∑ and a set W of strings of lengths at most an integer k(≤n), the first problem is to find the sequence of strings in W that reconstruct x by the minimum number of concatenations. We propose an O(kn+L)-time algorithm for this problem, where L 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 O(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. 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 x of length n over a constant-sized alphabet ∑ and a set W of strings of lengths at most an integer k(≤n), the first problem is to find the sequence of strings in W that reconstruct x by the minimum number of concatenations. We propose an O(kn+L)-time algorithm for this problem, where L 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 O(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.

A String Reconstruction Algorithm and Its Application to Exponentiation Problems

심정섭,이문규,김동규,Sim, Jeong-Seop,Lee, Mun-Kyu,Kim, Dong-Kyue Korean Institute of Information Scientists and Eng 2008 정보과학회논문지 : 시스템 및 이론 Vol.35 No.9

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 x of length n over a constant-sized alphabet ${\sum}$ and a set W of strings of lengths at most an integer $k({\leq}n)$, the first problem is to find the sequence of strings in W that reconstruct x by the minimum number of concatenations. We propose an O(kn+L)-time algorithm for this problem, where L 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 $O(k^3n+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. 대부분의 문자열 문제들과 이들에 대한 알고리즘들은 패턴 매칭, 데이타 압축, 생물정보학 등의 분야에 응용되어 왔다. 그러나 문자열 문제와 암호화 문제의 관련성에 대한 연구는 거의 진행되지 않았다. 본 논문에서는 다음과 같은 문자열 재구성 문제들에 대해 연구하고 이 결과들이 암호학에 응용될 수 있음을 보인다. 유한 알파벳으로 구성된 길이 n인 문자열 x와, 길이 $k({\leq}n)$ 이내의 문자열의 집합 W가 주어졌을 때, 첫 번째 문제는 내의 문자열들 중 일부 문자열들을 최소의 회수로 연결하여 x를 재구성할 수 있는 연결 순서를 찾는 문제이다. 이 문제에 대해 O(kn+L)-시간 알고리즘을 제시한다. 이때, L은 W 내의 모든 문자열들의 길이의 합을 표시한다. 두 번째 문제는 첫 번째 문제의 동적 버전이며 이에 대해 $O(k^3n+L)$시간 알고리즘을 제시한다. 마지막으로 암호학과 관련된 멱승문제와 위에 제시된 재구성 문제들과의 관련성을 보이고 멱승문제를 해결하는 새로운 알고리즘을 제시한다.

문자열의 근사커버 찾기

심정섭,박근수,김성렬,이지수,Sim, Jeong-Seop,Park, Kun-Soo,Kim, Sung-Ryul,Lee, Jee-Soo 한국정보과학회 2002 정보과학회논문지 : 시스템 및 이론 Vol.29 No.1

반복적인 문자열에 대한 연구는 최근 들어 여러 분야에서 활발히 진행되어 왔다. 특히, DNA 염기서열의 분석 등 분자생물학에서 그 필용성이 대두되어 있다. 주기 커버, 시드 시퀘어 등이 반복적인 문자열의 대표적인 예들이다. 근사문자열 매칭 분야에서도 근사주기, 근사스퀘어 등 반복적인 문자열에 관 한 연구가 진행되고 있다. 본 논문에서는 근사커버의 개념을 제시한다. 길이가 각각 m, n 인 두 문자열 P. T가 주어졌을 때, P가 T의 근사커버가 되는 최소의 편집거리를 O(mn) 시간, 최소의 가중편집거리를 $O(mn^2)$시간에 찾는 알 고리즘을 제시한다. 또한 문자열 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 perods, covers seeds and squares. A natural extension of the repetition problems is to allow errors. Among the four notions above aproximate squares and approximate periodes 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 and algorithm with finds the minimum distance t such that P is a t-approximate cover of T. The algorithm take O(m,n) time for the edit distance and $O(mn^2)$ time of finding a string which is an approximate cover of T is minimum distance is NP-complete.

肝硬化患者에서 발생한 肝厥證을 生肝健脾湯으로 치료한 례

심정섭,김경수,강대근,김강산 대한한방내과학회 2002 大韓韓方內科學會誌 Vol.23 No.4

화학공학과 공업화학과 응용화학부

심정섭 한국공업화학회 1999 공업화학전망 Vol.2 No.1

N/A

준결정성 POLY ( VINYL ALCOHOL ) 비공막의 용질투과능

심정섭,김태호 한국고분자학회 1986 한국고분자학회 학술대회 연구논문 초록집 Vol.1986 No.4