• Title/Summary/Keyword: 소수 생성

Search Result 274, Processing Time 0.029 seconds

The Removal of Natural Organic Matter and Disinfection By-Product Precursor by Ozone (오존처리에 의한 천연유기물질 변화 및 염소 소독부산물 전구물질 제어)

  • Son, Hee-Jong;Roh, Jae-Soon;Kim, Sang-Goo;Kang, Lim-Seok;Lee, Yong-Doo
    • Journal of Korean Society of Environmental Engineers
    • /
    • v.27 no.10
    • /
    • pp.1099-1107
    • /
    • 2005
  • The purpose of this study was to find the transformation of organic matter as well as chlorine by product formation potential with ozone dosage. The removal percents of $UV_{254}$ and DOC were $23%{\sim}65%$ and $2%{\sim}15%$ and THMFP and HAAFP were $17%{\sim}52%$ and $9%{\sim}29%$ respectively at $0.5{\sim}3\;mgO_3/mgDOC$ ozone dosage. The hydrophobic and transphobic organic matter were reduced to $37%{\sim}68%$ and $35%{\sim}64%$, on the other hand the hydrophilir organic matter was increased to $40%{\sim}49%$ at $0.5{\sim}3\;mgO_3/mgDOC$ ozone dosage. The produced THMFP and HAAFP from the hydrophobic and transphilic organic matter were decreased greatly with increasing ozone dosage but these by products were increased in the hydrophilic matter. The produced THMFP and HAAFP per unit DOC were decreased and reactivity was reduced greatly with increasing crone dosage. The removal rate of THMFP per unit DOC was much higher than HAAFP by ozone treatment. The Br-THMFP per unit DOC was much more removed than chloroformFP per unit DOC with increasing ozone dosage. and The removal rate of TCAAFP per unit DOC was increased with increasing ozone dosage but TCAAFP was not affected by ozone treatment. Br-HAAFP was decreased at $1\;mgO_3/mgDOC$ ozone dosage but was not more removed above $1\;mgO_3/mgDOC$ ozone dosage. Br-HAAFP had lower removal effect than Br-THMFP by ozone treatment. The optimal ozone dosage can be determined about $1\;mgO_3/mgDOC$ by considering both disinfection by product formation and economical efficiency.

A Labeling Methods for Keyword Search over Large XML Documents (대용량 XML 문서의 키워드 검색을 위한 레이블링 기법)

  • Sun, Dong-Han;Hwang, Soo-Chan
    • Journal of KIISE
    • /
    • v.41 no.9
    • /
    • pp.699-706
    • /
    • 2014
  • As XML documents are getting bigger and more complex, a keyword-based search method that does not require structural information is needed to search these large XML documents. In order to use this method, not only all keywords expressed as nodes in the XML document must be labeled for indexing but also structural information should be well represented. However, the existing labeling methods either have very simple information of XML documents for index or represent the structural information which is difficult to deal with the increase of XML documents' size. As the size of XML documents is getting larger, it causes either the poor performance of keyword search or the exponential increase of space usage. In this paper, we present the Repetitive Prime Labeling Scheme (RPLS) in order to improve the problem of the existing labeling methods for keyword-based search of large XML documents. This method is based on the existing prime number labeling method and allows a parent's prime number to be used at a lower level repeatedly so that the number of prime numbers being generated can be reduced. Then, we show an experimental result of the comparison between our methods and the existing methods.

Hardware Fault Attack Resistant RSA-CRT with Parallel Support (오류주입 공격에 강건하며 병렬연산이 가능한 RSA-CRT)

  • Eun, Ha-Soo;Oh, Hee-Kuck;Kim, Sang-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.5
    • /
    • pp.59-70
    • /
    • 2012
  • RSA-CRT is one of the commonly used techniques to speedup RSA operation. Since RSA-CRT performs its operations based on the modulus of two private primes, it is about four times faster than RSA. In RSA, the two primes are normally thrown away after generating the public key pair. However, in RSA-CRT, the two primes are directly used in RSA operations. This led to hardware fault attacks which can be used to factor the public modulus. The most common way to counter these attacks is based on error propagation. In these schemes, all the outputs of RSA are affected by the infected error which makes it difficult for an adversary to use the output to factor the public modulus. However, the error propagation has sequentialized the RSA operation. Moreover, these schemes have been found to be still vulnerable to hardware fault attacks. In this paper, we propose two new RSA-CRT schemes which are both resistant to hardware fault attack and support parallel execution: one uses common modulus and the other one perform operations in each prime modulus. Both proposed schemes takes about a time equal to two exponentiations to complete the RSA operation if parallel execution is fully used and can protect the two private primes from hardware fault attacks.

Hydrophobicity and Adhesion of SiO2/Polyurethane Nanocomposites Topcoat for Aircraft De-icing with Different Pre-curing Time (선경화 시간에 따른 항공기 De-icing용 나노실리카/폴리우레탄 복합재료 탑코트의 소수성 및 접착특성 평가)

  • Kim, Jong-Hyun;Shin, Pyeong-Su;Kwon, Dong-Jun;Park, Joung-Man
    • Composites Research
    • /
    • v.33 no.6
    • /
    • pp.365-370
    • /
    • 2020
  • The icing formation at aircraft occur problems such as increasing weight of the body, fuel efficiency reduction, drag reduction, the error of sensor, and etc. The viscosity of polyurethane (PU) topcoat was measured at 60℃ in real time to set the pre-curing time. SiO2 nanoparticles were dispersed in ethanol using ultra-sonication method. The SiO2/ethanol solution was sprayed on PU topcoat that was not cured fully with different pre-curing conditions. Surface roughness of SiO2/PU nanocomposites were measured using surface roughness tester and the surface roughness data was visualized using 3D mapping. The adhesion property between SiO2 and PU topcoat was evaluated using adhesion pull-off test. The static contact angle was measured using distilled water to evaluate the hydrophobicity. Finally, the pre-curing time of PU topcoat was optimized to exhibit the hydrophobicity of SiO2/PU topcoat.

A study on the formation region, droplet size and stability of O/W microemulsion (O/W형 microemulsion의 생성영역과 입자크기 및 안정성에 관한 연구)

  • Jo, Ju-Yeong;Han, Chang-Gyu;Jo, Chun-Gu
    • Journal of the Society of Cosmetic Scientists of Korea
    • /
    • v.21 no.2
    • /
    • pp.22-48
    • /
    • 1995
  • This study was investigated to search for the effects of the structure of each component in four-component O/W microemulsion system on its formation region, droplet size and stablilty. The results was that the more number of OH site, the shorter carbon chain length of polyol, the larger formation region of microemulsion was showed. The small microemulsion droplet was obtained on condition that the polatry of oil was large and carbon chain length of hydrophobic group of surfactant was long. In using satrated hydrocarbon (such as liquid paraffin, squalane) as dispersed phase, the stability of microemulsion was better than aromatic oil phase.

  • PDF

Fingerprint Matching Algorithm Based on Artificial Immune System (인공 면역계에 기반한 지문 매칭 알고리즘)

  • 정재원;양재원;이동욱;심귀보
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.05a
    • /
    • pp.173-176
    • /
    • 2003
  • 지문은 종생불변성, 만인부동성, 그리고 사용상의 편리함 때문에 신원인증을 위한 생체인식에 많이 사용되고 있다. 최근에는 기하학구조에 기반한 특이점 매칭방식이 제안되어 인식성능이 매우 높고 잡음에 강한 특성이 있으나 매칭 회수가 많아 인식속도가 느린 단점이 있다. 따라서 기존의 방식은 소수의 지문에 대한 1:다 매칭이나 1:1매칭에 주로 사용된다. 본 논문에서는 기존의 문제점들을 개선하기 위하여 생체 면역계의 자기-비자기 인식 능력에 주목하였다. 생체 면역계는 자기-비자기의 구별 능력을 바탕으로 바이러스나병원균 등의 낮선 외부침입자로부터 자신을 보호하고 침입자를 식별, 제거하는 시스템이다. 본 논문에서는 생체 면역계를 이루는 면역세포 중의 하나인 세포독성 T세포의 생성과정에서 자기, 비자기를 구별하기 위한 MHC 인식부를 형성하는 과정에 착안한 빠르고 신뢰성 있는 지문 인식 알고리즘을 제안한다. 제안한 방식은 지문에 존재하는 특이점(minutiae)인식을 통해 1단계로 global 패턴을 생성하고 2단계로 기하학적인 구조를 만들며, 인식시 global 패턴을 인식한 MHC 인식부에 대해서만 2차 local 매칭을 수행함으로써 매칭 속도가 매우 빠르며 지문의 비틀림이나 회전 등에 대하여 강인하게 인식된다.

  • PDF

Generalized Extending Method for q-ary LCZ Sequence Sets (q진 LCZ 수열군의 일반화된 확장 생성 방법)

  • Chung, Jung-Soo;Kim, Young-Sik;Jang, Ji-Woong;No, Jong-Seon;Chung, Ha-Bong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11C
    • /
    • pp.874-879
    • /
    • 2008
  • In this paper, a new extending method of q-ary low correlation zone(LCZ) sequence sets is proposed, which is a generalization of binary LCZ sequence set by Kim, Jang, No, and Chung. Using this method, q-ary LCZ sequence set with parameters (N,M,L,${\epsilon}$) is extended as a q-ary LCZ sequence set with parameters (pN,pM,p[(L+1)/p]-1,p${\epsilon}$), where p is prime and p|q.

p-ary Unified Sequences : p-ary Extended d-Form Sequences with Ideal Autocorrelation Property (p진 통합시퀀스 : 이상적인 자기상관특성을 갖는 p진 d-동차시퀀스)

  • No, Jong-Seon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.1A
    • /
    • pp.42-50
    • /
    • 2002
  • In this paper, for a prime number p, a construction method to genarate p-ary d-from sequences with ideal autocorrelation property is proposed and using the ternary sequences with ideal autocorrelation found by Helleseth, Kumar and Martinsen, ternary d-form sequences with ideal autocorrelation introduced. By combining the methods for generation the p-ary extended sequence (a special case of geometric sequences) and the p-ary d-from sequences, a construction method of p-ary unified (extended d-form) sequences which also have ideal autocorrelation property is proposed, which is very general class of p-ary sequences including the binary and nonbinary extended sequences and d-form seuqences. Form the ternary sequences with ideal autocorrelation by Helleseth, Kumar and Martinesen, ternary unified sequences with ideal autocorrelation property are also generated.

Fast Computation Algorithm of Fresnel Holograms Using Recursive Addition Method (반복 가산 기법을 이용한 Fresnel 홀로그램의 고속 계산 알고리듬)

  • Choi, Hyun-Jun;Seo, Young-Ho;Kim, Dong-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.5C
    • /
    • pp.386-394
    • /
    • 2008
  • For digital holographic video system, it is important to generate digital hologram as fast as possible. This paper proposed a fixed-point method and fast generation method that can calculate the Fresnel hologram using operation of whole-coordinate recursive addition. To compute the digital hologram, 3D object is assumed to be a collection of depth-map point generated using a PC. Our algorithm can compute a phase on a hologram by recursive addition with fixed-point format at a high speed. When we operated this algorithm on a personal computer, we could maximally compute digital hologram about 70% faster than conventional method and about 30% faster than of [3]'s method.

The Development of DDC system for High Precision Laser distance instrument (고정밀 레이저 거리 계측기용 디지털 복조 회로 개발에 관한 연구)

  • Bae, Young-Chul;Park, Jong-Bae;Cho, Eui-Joo;Kang, Ki-Woong;Kang, Keon-Il;Kim, Hyeon-Woo;Kim, Eun-Ju
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.4
    • /
    • pp.730-736
    • /
    • 2008
  • We proposed and implemented new DDC system which overcomes the difficulties including lack of flexibility of modifications of frequency which is the problem of previous frequence oscillator and synchronization. New DDC system can create frequence in two decimal points. Moreover, due to its usage in adjusting to frequence clock which is required by many consumers, laser distance instrument can reduce its error; thus, implementation of system is capable of high precision distance measurement can be performed.