• Title/Summary/Keyword: 유한소수

Search Result 56, Processing Time 0.017 seconds

An Improved Reversible Secret Image Sharing Scheme based on GF(28) (유한 체 기반의 개선된 가역 비밀이미지 공유 기법)

  • Kim, Dong-Hyun;Kim, Jung-Joon;Yoo, Kee-Young
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.23 no.3
    • /
    • pp.359-370
    • /
    • 2013
  • Lin and Chan proposed a reversible secret image sharing scheme in 2010. The advantages of their scheme are as follows: the low distortion ratio, high embedding capacity of shadow images and usage of the reversible. However, their scheme has some problems. First, the number of participants is limited because of modulus prime number m. Second, the overflow can be occurred by additional operations (quantized value and the result value of polynomial) in the secret sharing procedure. Finally, if the coefficient of (t-1)th degree polynomial become zero, (t-1) participants can access secret data. In this paper, an improved reversible secret image sharing scheme which solves the problems of Lin and Chan's scheme while provides the low distortion ratio and high embedding capacity is proposed. The proposed scheme solves the problems that are a limit of a total number of participants, and occurrence of overflow by new polynomial operation over GF($2^8$). Also, it solve problem that the coefficient of (t-1)th degree polynomial become zero by fixed MSB 4-bit constant. In the experimental results, PSNR of their scheme is decreased with the increase of embedding capacity. However, even if the embedding capacity increase, PSNR value of about 45dB or more is maintained uniformly in the proposed scheme.

Analysis of Code Sequence Generating Algorithm and Its Implementation based on Normal Bases for Encryption (암호화를 위한 정규기저 기반 부호계열 발생 알고리즘 분석 및 발생기 구성)

  • Lee, Jeong-Jae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.15 no.2
    • /
    • pp.48-54
    • /
    • 2014
  • For the element ${\alpha}{\in}GF(p^n)$, two kinds of bases are known. One is a conventional polynomial basis of the form $\{1,{\alpha},{\alpha}^2,{\cdots},{\alpha}^{n-1}\}$, and the other is a normal basis of the form $\{{\alpha},{\alpha}^p,{\alpha}^{p^2},{\cdots},{\alpha}^{p^{n-1}}\}$. In this paper we consider the method of generating normal bases which construct the finite field $GF(p^n)$, as an n-dimensional extension of the finite field GF(p). And we analyze the code sequence generating algorithm and derive the implementation functions of code sequence generator based on the normal bases. We find the normal polynomials of degrees, n=5 and n=7, which can generate normal bases respectively, design, and construct the code sequence generators based on these normal bases. Finally, we produce two code sequence groups(n=5, n=7) by using Simulink, and analyze the characteristics of the autocorrelation function, $R_{i,i}(\tau)$, and crosscorrelation function, $R_{i,j}(\tau)$, $i{\neq}j$ between two different code sequences. Based on these results, we confirm that the analysis of generating algorithms and the design and implementation of the code sequence generators based on normal bases are correct.

Refining Rules of Decision Tree Using Extended Data Expression (확장형 데이터 표현을 이용하는 이진트리의 룰 개선)

  • Jeon, Hae Sook;Lee, Won Don
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.6
    • /
    • pp.1283-1293
    • /
    • 2014
  • In ubiquitous environment, data are changing rapidly and new data is coming as times passes. And sometimes all of the past data will be lost if there is not sufficient space in memory. Therefore, there is a need to make rules and combine it with new data not to lose all the past data or to deal with large amounts of data. In making decision trees and extracting rules, the weight of each of rules is generally determined by the total number of the class at leaf. The computational problem of finding a minimum finite state acceptor compatible with given data is NP-hard. We assume that rules extracted are not correct and may have the loss of some information. Because of this precondition. this paper presents a new approach for refining rules. It controls their weight of rules of previous knowledge or data. In solving rule refinement, this paper tries to make a variety of rules with pruning method with majority and minority properties, control weight of each of rules and observe the change of performances. In this paper, the decision tree classifier with extended data expression having static weight is used for this proposed study. Experiments show that performances conducted with a new policy of refining rules may get better.

항만개발에 의한 조석조류 및 수질변화 예측을 위한 시뮬레이션 모델 연구

  • 박석순;김소연;이진희
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1997.04a
    • /
    • pp.114-114
    • /
    • 1997
  • 항만개발 사업은 매립이나 준설과 같은 해안선과 해저지형을 변화시키는 공사가 이루어지며 이는 조석조류 현상의 변화를 유발하게 된다. 특히 해안지형이 복잡한 항만이나 하구에서는 변화정도가 크게 나타나며 방파제나 선박접안 시설과 같은 항내 구조물을 축조 할 경우에도 조석조류 변화가 야기된다. 조석조류 현상의 변화는 해양 수질과 생물상에 영 향을 줄뿐만 아니라 인접한 육지에 이르기까지 크다란 피해를 유발할 수가 있다. 창조시 해 수를 육지로 범람하게 하거나 퇴적이나 침식조건을 변화시킬 수도 있으며 오염물질이 외해 로 확산되는 과정을 방해하고 해양생물의 서식조건을 악화시켜 부근 해역의 어업에 피해를 유발할 수도 있다. 또한 해안 공사 과정에 해수로 유입되는 토사나 항만 이용시에 배출되는 폐수 등이 항내 수질과 생태계를 변화시킬 수 있다. 따라서 조석조류와 수질변화를 사전에 예측하고 이를 최소화하는 방안이 강구되어야 한다. 조석조류와 수질 변화를 사전에 예측하 는 방법으로 축소모형 실험과 컴퓨터 시뮬레이션이 사용된다. 축소모형 실험은 현장을 재현 하는데 많은 경비와 시간이 소모되며 예측에 한계가 있다. 반면에 컴퓨터 시뮬레이션은 대 상해역의 지형과 조류 그리고 수질특성에 적합하게 모델을 개발할 경우 예측력이 매우 높기 때문에 현재 가장 널리 이용되고 있다. 본 연구는 유한 요소법에 기초하여 미국 공병단 (United States Army Corps of Engineers)에서 개발한 TABS-2 모델을 이용하여 온산항에 서 시행되는 부두건설에 따른 조석조류 및 수질변화를 시뮬레이션하였다. 측정된 자료로 모 델 계수를 보정하고 검증하였으며 항내 매립과 준설이 이루어질 때 나타나는 조위와 조속변 화를 예측하였다. 매립과 준설공사시 유출되는 토사가 조석조류현상에 따라 이동 확산되는 범위와 농도분포를 예측하였다.ophobic components)은 75~80%, 친수성 물질(hydrophilic components)은 30~33%정도의 분포를 보였고, 전염소 및 전오존 공정을 거친 처리수에서는 각각 62.2-62.8%, 43.9~49.0% 및 50~ 55%, 40~57% 정도의 분포를 보였다. 그리고 웅집-침전을 거친 처리수에서는 그 분포가 77~82%, 24-48%였다. 전주리 공정을 통하여 소수성 물질(byoghobic components)의 분포가 감 소하는 것을 볼 때 전염소 및 전오존 처리가 용존유기물의 응집에는 오히려 역 효과를 나타내는 것으로 판단된다. 것으로 판단된다.여 황토 2g에 대하여 Hieltijes and Lijklema 방법에 의해 Adsorbed-p, Nonapatite inorganic-P(NAI-P), Apatite-p, Organic-P로 구분하여 분석하고, 총인(Total Phosphorus)을 Standard Methods에 따라 Persulfate digestion후 0.45 m membrane 여지 여과하여 여액에 대해 PO3-4-P의 농도를 Ascorbic Acid 법으로 측정한 결과, NAI-P가 가장 큰 비율을 차지하였고, 부원료로 첨가된 금속 양이온 중 Fe3-이온이 흡착에 기여하는 정도가 가장 큰 것으로 평가되었다.다당류 T-AS의 보체 활성화 기작은 classical과 alternative complement pathway의 양 경로를 통해 활성화 되었다. T-AS 분획은 mouse내의 특정 혈청단백을 증가시켰으며, 항체 생성능의 증가가 관찰되어 effect T 세포의 활성화가 나타나고 있음을 알 수 있었다. T-AS는 생체내 투여시에 대식세포의 탐식능이 증진되었으며, 대식세포 기능 저해제에 의한 대식세포의 기능 저해 현상이 회복되었다. 이와 같은 결과들로부터, T-AS의 항암 활성은 활성

  • PDF

The Effect of Pile Distallation on the Reduction of Cumulative Plastic Settlement (말뚝 설치를 통한 콘크리트궤도의 누적소성침하 감소 효과)

  • Lee, Su-Hyung;Lee, Il-Wha;Lee, Sung-Jin;Kim, Dae-Sang
    • Journal of the Korean Geotechnical Society
    • /
    • v.24 no.5
    • /
    • pp.129-137
    • /
    • 2008
  • An active application of concrete track is being expected far the future constructions of Korean railroad. In comparison with the existing ballasted tract, a concrete track is very susceptible for the settlement, since its rehabilitation requires much time and cost. When a concrete track is constructed on fine-grained subgrade soil, excessive cumulative plastic settlements due to repetitive train road may occur. In this case, the settlement of the concrete track may be effectively reduced by installing a small number of small-diameter piles beneath the track. This paper presents the effect of pile installation on the reduction of cumulative plastic settlement of concrete track. A method combining experiential equation and numerical method is proposed. Using an existing experiential equation and the estimated earth pressure distribution, the cumulative plastic strain was calculated. From the results, it is verified that the effects of the pile installation is significant to effectively reduce the cumulative plastic settlement of concrete track. The reduction effects of the cumulative plastic settlement according to the pile number and pile arrangement are presented.

Optimum Design of Soil Nailing Excavation Wall System Using Genetic Algorithm and Neural Network Theory (유전자 알고리즘 및 인공신경망 이론을 이용한 쏘일네일링 굴착벽체 시스템의 최적설계)

  • 김홍택;황정순;박성원;유한규
    • Journal of the Korean Geotechnical Society
    • /
    • v.15 no.4
    • /
    • pp.113-132
    • /
    • 1999
  • Recently in Korea, application of the soil nailing is gradually extended to the sites of excavations and slopes having various ground conditions and field characteristics. Design of the soil nailing is generally carried out in two steps, The First step is to examine the minimum safety factor against a sliding of the reinforced nailed-soil mass based on the limit equilibrium approach, and the second step is to check the maximum displacement expected to occur at facing using the numerical analysis technique. However, design parameters related to the soil nailing system are so various that a reliable design method considering interrelationships between these design parameters is continuously necessary. Additionally, taking into account the anisotropic characteristics of in-situ grounds, disturbances in collecting the soil samples and errors in measurements, a systematic analysis of the field measurement data as well as a rational technique of the optimum design is required to improve with respect to economical efficiency. As a part of these purposes, in the present study, a procedure for the optimum design of a soil nailing excavation wall system is proposed. Focusing on a minimization of the expenses in construction, the optimum design procedure is formulated based on the genetic algorithm. Neural network theory is further adopted in predicting the maximum horizontal displacement at a shotcrete facing. Using the proposed procedure, various effects of relevant design parameters are also analyzed. Finally, an optimized design section is compared with the existing design section at the excavation site being constructed, in order to verify a validity of the proposed procedure.

  • PDF