http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
임용무(Yong Moo Lim),심문식(Moon Sik Shim),심현석(Hyun Seog Sim),김상문(Sang Moon Kim) 한국안광학회 2001 한국안광학회지 Vol.6 No.1
In this study, we compared the properties of 23 high and 55 low price sunglass lenses with the standards in the ordinary optical properties. materials, coloration, UV. IR and luminous transmittance, color acceptance for traffic signal, chromaticity and contrast sensitivity. The ordinary optical properties of the lenses met comparatively the requirements of the KS standard. The HIGH-type and LOW-type lenses were primarily made by glass and acrylate, respectively. In the coloration, HIGH-type was in group around neutral color but LOW-type was distributed widely on the line between 570 nm and 485 nm. There are fails in 7 of HIGH-type and 18% of LOW-type in the stimulus purity of the luminous transmittance. Wavelength of the UV/VIS cut-off was over 350 nm for HIGH-type but 6 of LOW-type was under 350 nm. In the erythemal UV, all HIGH-type met the needs of standards but 5 LOW-type failed with DIN standard. In the near UV, KS standard worked in stringency, and HIGH-type showed more failure than LOW-type. The characteristics of the IR transmittance of HIGH-type was better than that of LOW-type. In the color acceptance of traffic signal, all HIGH-type met the needs of ANSI standards but 21.8 of LOW-type failed with the standard. In the contrast sensitivity tested with various coloured sunglasses, the value increased with increasing of L and decreasing of test distance. In view of the results so far, HIGH-type met with excellent properties as compared with LOW-type.
심문식,김세경 木浦海洋大學校 2002 論文集 Vol.10 No.2
R. C. Rivest, A. Shamir, and L. Adleman introduced the most widely used and tested public-key cryptosystem-RSA system in 1977[7]. It is based on the Euler-Theorem[1]. Each user of the RSA system choose a pair (n, k) of natural numbers n and k, where the n is a product of large enough two distinct primes p and q. The safty of the RSA system depends on the prime factorization of n. So the primes p and q satisfy ; 1) the distinct primes p and q have almost same digits. 2) p-1 and q-1 have a large enough prime factor. 3) gcd(p, q) is a sufficiently small natural number. But in some sense, the three conditions may give us some informations to solve the system. So we need n such as a product of many primes. In this note, we will study the RSA system with n a product of three primes[Theorem 3.1] and we will give an Example[Example 2].