http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
각종 합성섬유에의 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.
심정섭,Sim, Jeong-Seop 한국과학기술단체총연합회 1998 과학과 기술 Vol.31 No.8
고분자 과학은 골격이 1940년대에 확립되어 이제 회갑을 맞는 활기찬 학문이다. 오랜전통을 갖는 서구과학의 타 학문에 비해 6.25동란등으로 10년 정도의 학문적 공백기를 감안하더라도 근소한 핸디캡으로 출발하였으므로 고분자 과학과 기술의 성취에는 한국인의 입장이 유리할 것이다.
感光性樹脂에 關한 硏究-Isophthalic acid-Cinnamic acid-Glycerine 系 縮重合物의 分子量에 關하여
심정섭,이부섭,Shim, Jyong-Sup,Lee, Boo-Sop 대한화학회 1962 대한화학회지 Vol.6 No.1
The polycondensates of isophthalic acid-cinnamic acid-glycerine system were synthesized. The molecular weights of these products were determined by two methods, viscosity method and osmotic pressure methods. In the synthesis of resin, the reaction temperature was kept at 232$^{\circ}C$ and the mole ratio of the reactants was chosen as follows: Glycerine ;1.0 Isophthalic acid ;1.0 Cinnamic acid ;2.8 Excessive cinnamic acid prevented gelation of reaction mixtures. As the solution became very dilute, reduced osmotic pressure P/C (at the concentration of solution below 0.24g/100 ml of acetone) and reduced viscosity ${\eta}_{sp}/C$ (at the concentration of solution below 0.32 g/100 ml of acetone) increased rapidly. The correspondence between molecular weights determined by the two methods made Huggin's equation applicable to the prepared polymer. The values of K and a are $2.77{\times}10^{-5}$ and 1.063, respectively.
심정섭,김현수,Shim, Jung-Seob,Kim, Hyoun-Soo 한국군사과학기술학회 2008 한국군사과학기술학회지 Vol.11 No.2
A Plastic Bonded Explosive(PBX) is mainly composed of nitramine explosive and polymer binder. The great number of serious applications of PBX requires the good adhesion between nitramine crystals and binder, which depends on the surface characteristics of a filler and binder. In the pursuit of the better design to achieve the enhanced adhesion, profound knowledge of the surface and interfacial characteristics of explosive and binder should be exploited. In this study, the influences of physicochemical properties between RDX and binders such as interfacial tension($\gamma_{SL}$), latent heat($Q_m$), and density($\rho$) on impact sensitivity of PBX were investigated. As experimental results, the major contribution factor to impact sensitivity of PBX was the interfacial tension, compare with other surface properties. The correlation coefficient of $H_{50}$ versus $\gamma_{SL}$ is 0.9932 when a polynomial regression method was used.
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)$시간 알고리즘을 제시한다. 마지막으로 암호학과 관련된 멱승문제와 위에 제시된 재구성 문제들과의 관련성을 보이고 멱승문제를 해결하는 새로운 알고리즘을 제시한다.