• Title/Summary/Keyword: 반소수

Search Result 93, Processing Time 0.027 seconds

The Primality Test (소수 판별법)

  • Lee, Sang-Un;Choi, Myeong-Bok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.8
    • /
    • pp.103-108
    • /
    • 2011
  • Generally, Miller-Rabin method has been the most popular primality test. This method arbitrary selects m at k-times from m=[2, n-1] range and (m,n)=1. Miller-Rabin method performs $k{\times}r$ times and reports prime as $m^d\;{\equiv}\;1(mod\;n)$ or $m^{2^rd}\;{\equiv}\;-1(mod n)$ such that n-1=$2^sd$, $0\;{\leq}\;r\;{\leq}\;s-1$. This paper suggests more simple primality test than Miller-Rabin method. This test method computes c=$p^{\frac{n-1}{2}}(mod\;n)$ for k times and reports prime as c=-1. The proposed primality test method reduces $k{\times}r$ times of Miller-Rabin method to k times.

Prevention of Protein Loss Using A Shield Coating According to Moisture Behavior in Human Hair (수분거동 패턴에 따른 차폐막 설정을 통한 모발단백질 소실방지)

  • Song, Sang-Hun;Lim, Byung Tack;Son, Seong Kil;Kang, Nae-Gyu
    • Journal of the Society of Cosmetic Scientists of Korea
    • /
    • v.46 no.1
    • /
    • pp.57-65
    • /
    • 2020
  • To prevent loss of hair protein during hair washing process by water through, a shield coating the pathway of water molecules was studied. Hydrophobic virgin hair, hydrophilic hair, which was damaged only methyleicosanoic acid (18-MEA) on the surface, and a repaired hair re-bound 18-MEA, were prepared and water mass changes by as heat were measured. Results showed that hydrophobic hairs followed bi-exponential function of 39 s and 151 s and other two hairs exhibited fast- and mono-exponential decay with 83 s, reflecting the extraction of water molecules without any resistance at the hydrophobic surface. On the assumption that hydrophobic surface resists an extraction of protein in water during the wash, the protein concentrations were compared from the hair of hydrophobic and hydrophilic surface. The extracted hair proteins were 179 and 148 ㎍/mL from the hair coated with hydrophilic polyethylene glycol (PEG) and hydrophobic polydimethylsiloxane (PDMS), respectively. This study suggested that hydrophobic coating on the hair surface could be used to prevent protein loss in wash, represented by LFM. In conclusion, this research provides some useful information to contribute to the development of hair washing products that can prevent protein loss in the cleaning process by granting hydrophobic coatings.

An Analysis on the Process of Conceptual Understanding of Fifth Grade Elementary School Students about the Division of Decimal with Base-Ten Blocks (십진블록을 활용한 소수의 나눗셈 지도에서 초등학교 5학년 학생들의 개념적 이해 과정 분석)

  • Pang, Jeong-Suk;Kim, Soo-Jeong
    • Journal of Educational Research in Mathematics
    • /
    • v.17 no.3
    • /
    • pp.233-251
    • /
    • 2007
  • The purpose of this study was to propose instructional methods using base-ten blocks in teaching the division of decimal for 5th grade students by analyzing the process of their conceptual comprehension. The students in this study were found to understand the two main meanings of the division of decimal, distribution and area, by modeling them with base-ten blocks. They were able to identify the algorithm through the use of base-ten blocks and to understand the principle of calculations by connecting the manipulative activities to each stage of algorithm. The students were also able to determine using base-ten blocks whether the results of division of decimal might be reasonable. This study suggests that the appropriate use of base-ten blocks promotes the conceptual understanding of the division of decimal.

  • PDF

A Study on the Improved the Hydrophobicity of Torrefied Biomass (반탄화 과정을 통한 바이오매스의 소수성 개선 연구)

  • JEONG, JAE-SEONG;KIM, GYEONG-MIN;JEONG, HYUN-JUN;KIM, GYU-BO;JEON, CHUNG-HWAN
    • Transactions of the Korean hydrogen and new energy society
    • /
    • v.30 no.1
    • /
    • pp.49-57
    • /
    • 2019
  • Biomass, a carbon-neutral fuel, has great advantages because it can replace fossil fuels to reduce greenhouse gas emissions. However, due to its low density, high water content, and hydrophilicity, biomass has disadvantages for transportation and storage. To improve these properties, a pretreatment process of biomass is required. One of the various pre-treatment technologies, torrefacion, makes biomass similar to coal through low-temperature pyrolysis. In this study, torrefacion treatment was carried out at 200, 230, 250, 280, and $300^{\circ}C$ for wood pellet, empty fruit bunch (EFB) and kenaf, and the feasibility of replacing coal with fuel was examined. Hygroscopicity tests were conducted to analyze the hydrophobicity of biomass, and its chemical structure changes were investigated using Infrared spectrum analysis. It was confirmed that the hygroscopicity was decreased gradually as the torrefacion temperature increased according to the hygroscopicity tests. The hydrophilicity was reduced according to the pyrolysis of hemicellulose, cellulose, and lignin of biomass.

First record of Schoenoplectiella ×uzenensis (Ohwi ex T. Koyama) Hayasaka (Cyperaceae) from Korea (사초과 올챙이골속의 한국 미기록종: 고창고랭이 (Schoenoplectiella ×uzenensis (Ohwi ex T. Koyama) Hayasaka))

  • Kim, Jonghwan;Kim, Minha;Kim, Muyeol
    • Korean Journal of Plant Taxonomy
    • /
    • v.46 no.2
    • /
    • pp.267-271
    • /
    • 2016
  • A newly recorded species, Schoenoplectiella ${\times}$uzenensis (Ohwi ex T. Koyama) Hayasaka, was found in Chosan Lake, Gosu-myeon, Gochang-gun, Jeollabuk-do, Korea. Schoenoplectiella ${\times}$uzenensis differs from its related species in having short rhizomes and 1 to 3 spikelets showing inflorescence. Schoenoplectiella triangulata has very short rhizomes and 520 spikelets with inflorescence. Schoenoplectiella lineolata has long creeping rhizomes and 1 spikelet showing inflorescence. We propose the new Korean name of 'Go-Chang-Go-Rang-Ei' based on its initial collection site. A description, line drawing, color photographs, table, and a species key of Korean Schoenoplectiella are provided for species identification.

The improved Goldschmidt floating point reciprocal algorithm (개선한 Goldschmidt 부동소수점 역수 알고리즘)

  • 한경헌;최명용;김성기;조경연
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2004.05b
    • /
    • pp.247-250
    • /
    • 2004
  • Goldschmidt 알고리즘에 의한 부동소수점 1.f2의 역수는 q=NK1K2....Kn (Ki=1+Aj, j=2i)이다. 본 논문에서는 N과 A 값을 1.f2의 값에 따라서 선정하고 Aj의 값이 유효자리수의 반이하 값을 가지면 연산을 종료하는 개선된 Goldschmidt 부동소수점 역수 알고리즘을 제안한다. 1.f2가 1.01012보다 작으면 N=2-1.f2, A=1.f2-1로 하며, 1.01012보다 크거나 같으면 N=2-0.lf2, A=1-0.lf2로 한다. 한편 Goldschmidt 알고리즘은 곱셈을 반복해서 수행하므로 계산 오류가 누적이 된다. 이러한 누적 오류를 감안하면 배정도실수 역수에서는 2-57, 단정도실수 역수에서는 2-28의 유효자리수까지 연산해야 한다. 따라서 Aj가 배정도실수 역수에서는 2-29, 단정도실수 역수에서는 2-14 보다 작아지면 연산을 종료한다. 본 논문에서 제안한 개선한 Goldschmidt 역수 알고리즘은 N=2-0.1f2, A=1-0.lf2로 계산하는 종래 알고리즘과 비교하여 곱셈 연산 회수가 배정도실수 역수는 22%, 단정도실수 역수는 29% 감소하였다. 본 논문의 연구 결과는 테이블을 사용하는 Goldschmidt 역수 알고리즘에 적용해서 연산 시간을 줄일 수 있다.

  • PDF

Effect of torrefaction on enzymatic saccharification of lignocellulosic biomass (목질계 바이오매스의 효소당화에서 반탄화 전처리 영향)

  • Choi, Hyoyeon;Pak, Daewon
    • Journal of Energy Engineering
    • /
    • v.24 no.3
    • /
    • pp.1-5
    • /
    • 2015
  • This study is to investigate the effect of torrefaction on enzymatic hydrolysis of lignocellulosic biomass for bio-ethanol production. As a pretreatment, the torrefaction of lignocellulosic biomass was conducted in temperature of $250{\sim}350^{\circ}C$ in the absence of oxygen. Tween-80, nonionic surfactant, was tested to enhance saccharification efficiency by coping with hydrophobicity resulted from torrefaction. As a result, the glucose production from enzymatic hydrolysis of biomass pretreated by torrefaction was greater than that obtained from the non-pretreated biomass. Sugar conversion was higher when the biomass was saccharified with addition of tween-80. It was found that torrefaction can be applied as a preptreatment for lignocellulosic biomass and tween-80 is needed to enhance its enzyme saccharification.

On compressed binary video-based GUI (압축된 이진 동영상 기반의 GUI에 대한 연구)

  • 정재훈;김대중;김운경
    • Proceedings of the IEEK Conference
    • /
    • 2003.11b
    • /
    • pp.119-122
    • /
    • 2003
  • 멀티미디어의 시대가 도래함에 따라 셀 수도 없이 많은 영상매체들이 범람하고 있다. 과거에는 영상 매체들의 수는 셀 수 있는 대상으로 분류되는 소수의 보조 매체이었던 것에 반해 지금의 영상매체 특히 동영상을 이용한 전달방식은 과거의 인간 인지의 보조수단이 아닌 인지의 주류로 떠오르고 있는 실정이다. 이에 이 수많은 영상매체를 얼마나 빠르게 인지한 수 있는 가가 중요한 관점으로 떠오르고 있다.

  • PDF

Distributed Visual Media Retrieval Framework Architecture Using Semantic Web (시맨틱 웹을 이용한 분산 시각미디어 검색 프레임워크 아키텍쳐)

  • 손영수;양명미;김정선
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10a
    • /
    • pp.136-138
    • /
    • 2004
  • 대부분의 Ontology를 이용한 이미지 검색 시스템들은 중앙 집중적(Centralization)으로 구성되어 있어, 단일, 소수의 이미지 제공자의 특화된 Semantic기반의 이미지 검색을 제공한다. 이에 반해 간단한 구조물 가진 메타데이터 기반의 분산 이미지 검색 시스템들은 이미지 제공자들의 자율성을 보장하기 용의 하지만, Semantic 기반의 이미지 검색을 제공하지 못한다. 본 논문은 위 시스템들의 단점들을 극복하기 위해 다양한 이미지 제공자들의 자율성을 보장하면서, Semantic 기반의 이미지 검색을 지원하는 프레임워크의 아키텍쳐를 제안한다.

  • PDF

A Step-by-Step Primality Test (단계적 소수 판별법)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.3
    • /
    • pp.103-109
    • /
    • 2013
  • Miller-Rabin method is the most prevalently used primality test. However, this method mistakenly reports a Carmichael number or semi-prime number as prime (strong lier) although they are composite numbers. To eradicate this problem, it selects k number of m, whose value satisfies the following : m=[2,n-1], (m,n)=1. The Miller-Rabin method determines that a given number is prime, given that after the computation of $n-1=2^sd$, $0{\leq}r{\leq}s-1$, the outcome satisfies $m^d{\equiv}1$(mod n) or $m^{2^rd}{\equiv}-1$(mod n). This paper proposes a step-by-step primality testing algorithm that restricts m=2, hence achieving 98.8% probability. The proposed method, as a first step, rejects composite numbers that do not satisfy the equation, $n=6k{\pm}1$, $n_1{\neq}5$. Next, it determines prime by computing $2^{2^{s-1}d}{\equiv}{\beta}_{s-1}$(mod n) and $2^d{\equiv}{\beta}_0$(mod n). In the third step, it tests ${\beta}_r{\equiv}-1$ in the range of $1{\leq}r{\leq}s-2$ for ${\beta}_0$ > 1. In the case of ${\beta}_0$ = 1, it retests m=3,5,7,11,13,17 sequentially. When applied to n=[101,1000], the proposed algorithm determined 96.55% of prime in the initial stage. The remaining 3% was performed for ${\beta}_0$ >1 and 0.55% for ${\beta}_0$ = 1.