• Title/Summary/Keyword: 은닉성

Search Result 457, Processing Time 0.03 seconds

Least Square Prediction Error Expansion Based Reversible Watermarking for DNA Sequence (최소자승 예측오차 확장 기반 가역성 DNA 워터마킹)

  • Lee, Suk-Hwan;Kwon, Seong-Geun;Kwon, Ki-Ryong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.11
    • /
    • pp.66-78
    • /
    • 2015
  • With the development of bio computing technology, DNA watermarking to do as a medium of DNA information has been researched in the latest time. However, DNA information is very important in biologic function unlikely multimedia data. Therefore, the reversible DNA watermarking is required for the host DNA information to be perfectively recovered. This paper presents a reversible DNA watermarking using least square based prediction error expansion for noncodng DNA sequence. Our method has three features. The first thing is to encode the character string (A,T,C,G) of nucleotide bases in noncoding region to integer code values by grouping n nucleotide bases. The second thing is to expand the prediction error based on least square (LS) as much as the expandable bits. The last thing is to prevent the false start codon using the comparison searching of adjacent watermarked code values. Experimental results verified that our method has more high embedding capacity than conventional methods and mean prediction method and also makes the prevention of false start codon and the preservation of amino acids.

Development of water elevation prediction algorithm using unstructured data : Application to Cheongdam Bridge, Korea (비정형화 데이터를 활용한 수위예측 알고리즘 개발 : 청담대교 적용)

  • Lee, Seung Yeon;Yoo, Hyung Ju;Lee, Seung Oh
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2019.05a
    • /
    • pp.121-121
    • /
    • 2019
  • 특정 지역에 집중적으로 비가 내리는 현상인 국지성호우가 빈번히 발생함에 따라 하천 주변 사회기반시설의 침수 위험성이 증가하고 있다. 침수 위험성 판단 여부는 주로 수위정보를 이용하며 수위 예측은 대부분 수치모형을 이용한다. 본 연구에서는 빅데이터 기반의 RNN(Recurrent Neural Networks)기법 알고리즘을 활용하여 수위를 예측하였다. 연구대상지는 조위의 영향을 많이 받는 한강 전역을 대상으로 하였다. 2008년~2018년(10개년)의 실제 침수 피해 실적을 조사한 결과 잠수교, 한강대교, 청담대교 등에서 침수 피해 발생률이 높게 나타났고 SNS(Social Network Services)와 같은 비정형화 자료에서는 청담대교가 가장 많이 태그(Tag)되어 청담대교를 연구범위로 설정하였다. 본 연구에서는 Python에서 제공하는 Tensor flow Library를 이용하여 수위예측 알고리즘을 적용하였다. 데이터는 정형화 데이터와 비정형 데이터를 사용하였으며 정형화 데이터는 한강홍수 통제소나 기상청에서 제공하는 최근 10년간의 (2008~2018) 수위 및 강우량 자료를 수집하였다. 비정형화 데이터는 SNS를 이용하여 민간 정보를 수집하여 정형화된 자료와 함께 전체자료를 구축하였다. 민감도 분석을 통하여 모델의 은닉층(5), 학습률(0.02) 및 반복횟수(100)의 최적값을 설정하였고, 24시간 동안의 데이터를 이용하여 3시간 후의 수위를 예측하였다. 2008년~ 2017년 까지의 데이터는 학습 데이터로 사용하였으며 2018년의 수위를 예측 및 평가하였다. 2018년의 관측수위 자료와 비교한 결과 90% 이상의 데이터가 10% 이내의 오차를 나타내었으며, 첨두수위도 비교적 정확하게 예측되는 것을 확인하였다. 향후 수위와 강우량뿐만 아니라 다양한 인자들도 고려한다면 보다 신속하고 정확한 예측 정보를 얻을 수 있을 것으로 기대된다.

  • PDF

Study of Hardware AES Module Backdoor Detection through Formal Method (정형 기법을 이용한 하드웨어 AES 모듈 백도어 탐색 연구)

  • Park, Jae-Hyeon;Kim, Seung-joo
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.29 no.4
    • /
    • pp.739-751
    • /
    • 2019
  • Security in embedded devices has become a significant issue. Threats on the sup-ply chain, like using counterfeit components or inserting backdoors intentionally are one of the most significant issues in embedded devices security. To mitigate these threats, high-level security evaluation and certification more than EAL (Evaluation Assurance Level) 5 on CC (Common Criteria) are necessary on hardware components, especially on the cryptographic module such as AES. High-level security evaluation and certification require detecting covert channel such as backdoors on the cryptographic module. However, previous studies have a limitation that they cannot detect some kinds of backdoors which leak the in-formation recovering a secret key on the cryptographic module. In this paper, we present an expanded definition of backdoor on hardware AES module and show how to detect the backdoor which is never detected in Verilog HDL using model checker NuSMV.

Research on Mac OS X Physical Memory Analysis (Mac OS X 물리 메모리 분석에 관한 연구)

  • Lee, Kyeong-Sik;Lee, Sang-Jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.21 no.4
    • /
    • pp.89-100
    • /
    • 2011
  • Physical memory analysis has been an issue on a field of live forensic analysis in digital forensics until now. It is very useful to make the result of analysis more reliable, because record of user behavior and data can be founded on physical memory although process is hided. But most memory analysis focuses on windows based system. Because the diversity of target system to be analyzed rises up, it is very important to analyze physical memory based on other OS, not Windows. Mac OS X, has second market share in Operating System, is operated by loading kernel image to physical memory area. In this paper, We propose a methodology for physical memory analysis on Mac OS X using symbol information in kernel image, and acquire a process information, mounted device information, kernel information, kernel extensions(eg. KEXT) and system call entry for detecting system call hooking. In additional to the methodology, we prove that physical memory analysis is very useful though experimental study.

Analysis of Trading Performance on Intelligent Trading System for Directional Trading (방향성매매를 위한 지능형 매매시스템의 투자성과분석)

  • Choi, Heung-Sik;Kim, Sun-Woong;Park, Sung-Cheol
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.3
    • /
    • pp.187-201
    • /
    • 2011
  • KOSPI200 index is the Korean stock price index consisting of actively traded 200 stocks in the Korean stock market. Its base value of 100 was set on January 3, 1990. The Korea Exchange (KRX) developed derivatives markets on the KOSPI200 index. KOSPI200 index futures market, introduced in 1996, has become one of the most actively traded indexes markets in the world. Traders can make profit by entering a long position on the KOSPI200 index futures contract if the KOSPI200 index will rise in the future. Likewise, they can make profit by entering a short position if the KOSPI200 index will decline in the future. Basically, KOSPI200 index futures trading is a short-term zero-sum game and therefore most futures traders are using technical indicators. Advanced traders make stable profits by using system trading technique, also known as algorithm trading. Algorithm trading uses computer programs for receiving real-time stock market data, analyzing stock price movements with various technical indicators and automatically entering trading orders such as timing, price or quantity of the order without any human intervention. Recent studies have shown the usefulness of artificial intelligent systems in forecasting stock prices or investment risk. KOSPI200 index data is numerical time-series data which is a sequence of data points measured at successive uniform time intervals such as minute, day, week or month. KOSPI200 index futures traders use technical analysis to find out some patterns on the time-series chart. Although there are many technical indicators, their results indicate the market states among bull, bear and flat. Most strategies based on technical analysis are divided into trend following strategy and non-trend following strategy. Both strategies decide the market states based on the patterns of the KOSPI200 index time-series data. This goes well with Markov model (MM). Everybody knows that the next price is upper or lower than the last price or similar to the last price, and knows that the next price is influenced by the last price. However, nobody knows the exact status of the next price whether it goes up or down or flat. So, hidden Markov model (HMM) is better fitted than MM. HMM is divided into discrete HMM (DHMM) and continuous HMM (CHMM). The only difference between DHMM and CHMM is in their representation of state probabilities. DHMM uses discrete probability density function and CHMM uses continuous probability density function such as Gaussian Mixture Model. KOSPI200 index values are real number and these follow a continuous probability density function, so CHMM is proper than DHMM for the KOSPI200 index. In this paper, we present an artificial intelligent trading system based on CHMM for the KOSPI200 index futures system traders. Traders have experienced on technical trading for the KOSPI200 index futures market ever since the introduction of the KOSPI200 index futures market. They have applied many strategies to make profit in trading the KOSPI200 index futures. Some strategies are based on technical indicators such as moving averages or stochastics, and others are based on candlestick patterns such as three outside up, three outside down, harami or doji star. We show a trading system of moving average cross strategy based on CHMM, and we compare it to a traditional algorithmic trading system. We set the parameter values of moving averages at common values used by market practitioners. Empirical results are presented to compare the simulation performance with the traditional algorithmic trading system using long-term daily KOSPI200 index data of more than 20 years. Our suggested trading system shows higher trading performance than naive system trading.

Concealing Communication Source and Destination in Wireless Sensor Networks (Part I) : Protocol Evaluation (무선 센서 네트워크에서의 통신 근원지 및 도착지 은닉(제2부) : 프로토콜 평가)

  • Tscha, Yeong-Hwan
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.3
    • /
    • pp.379-387
    • /
    • 2013
  • In large-scale wireless sensor networks, tremendous amount of dummy packets is usually accompanied by keeping location privacy of the communication source and destination against global eavesdropping. In our earlier work we designed a location privacy routing protocol, ELPR(End-node Location Privacy Routing) in which the generation of dummy packets at each idle time-slot while transferring data packets are restricted to only the nodes within certain areas of encompassing the source and destination, respectively. In this paper, it is given that ELPR provides various degrees of location privacy while PCM(Periodic Collection Method) allows the only fixed level. Simulation results show that as the number of nodes or data packets increases ELPR permits in terms of the number of generated packets more cost-effective location privacy than PCM.

Block-based Image Authentication Algorithm using Differential Histogram-based Reversible Watermarking (차이값 히스토그램 기반 가역 워터마킹을 이용한 블록 단위 영상 인증 알고리즘)

  • Yeo, Dong-Gyu;Lee, Hae-Yeoun
    • The KIPS Transactions:PartB
    • /
    • v.18B no.6
    • /
    • pp.355-364
    • /
    • 2011
  • In most applications requiring high-confidential images, reversible watermarking is an effective way to ensure the integrity of images. Many watermarking researches which have been adapted to authenticate contents cannot recover the original image after authentication. However, reversible watermarking inserts the watermark signal into digital contents in such a way that the original contents can be restored without any quality loss while preserving visual quality. To detect malicious tampering, this paper presents a new block-based image authentication algorithm using differential histogram-based reversible watermarking. To generate an authentication code, the DCT-based authentication feature from each image block is extracted and combined with user-specific code. Then, the authentication code is embedded into image itself with reversible watermarking. The image can be authenticated by comparing the extracted code and the newly generated code and restored into the original image. Through experiments using multiple images, we prove that the presented algorithm has achieved over 97% authentication rate with high visual quality and complete reversibility.

Effective Method of Video Services over QoS Controlled Network (QoS 서비스 모델에서의 비디오 서비스의 효과적 적용 기법)

  • Jeong, Jun-Ho;Suh, Doug-Young;Shin, Ji-Tae;Seok, Joo-Myoung;Lee, Kyou-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.6
    • /
    • pp.672-686
    • /
    • 2002
  • 현재 단대단(End-to-End) 비디오 서비스의 질을 높이기 위해 많은 연구가 각 계층별로 진행되고 있다. 전송계층에서의 오류 제어(Error Control), 네트워크계층에서의 QoS (Quality of Service)모델, 표현 및 응용계층에서의 오류 강인성(Error resilience)/오류 은닉(Error concealment) 등이 연구 개발되고 있다. 그러나 계층 간의 연관성이 높은 부분에서의 통합을 통한 성능향상에 관한 연구는 그 필요성과 효율에 비해 아직도 미흡하다. 본 논문은 QoS 서비스 모델하에서의 적응적 FEC(Forward Error Correction) 적용 및 우선순위에 따른 비디오패킷(VP ,VideoPacket)을 통하여 효율적인 계층화 비디오 스트리밍을 단대단 QoS성능의 향상에 관점을 맞추어 제안한다. 제안하는 방식은 최소 화질 보장과 같은 효율에서 보다 적은 가격에서의 서비스를 제공할 수 있다. 이를 위하여 통합형 서비스(IntServ, IS, Integrated Service) 의 자원예약을 사용하는 방법과 높은 가격의 자원 예약을 사용하지 않는 차별화 서비스(DiffServ, DS, Differentiated Service)를 적용했으며 이에 보장형 서비스의 특징을 공통을 가지기 위해 계층화 FEC를 적용하였으며 적절한 가격의 조절을 위하여 비디오패킷을 통한 데이터 분할을 적용하였다. 본 논문은 또한 최종 사용자의 만족도를 PSNR(Picture Signal to Noise Ration)과 PSNR에서 표현하지 못하는 부분의 평가를 위해 손상프레임율(DFR, Damaged Frame Ratio)과 오류프레임율(EFR,Error Frame Ratio)을 제안 이를 통해 평가하고자 한다. 제안하는 방식의 실험 결과는 비디오 코딩계층과 전송 계층, 네트워크 계층의 결합된 성능이며 이는 또한 화질의 개선뿐만 아니라 사용자의 가격문제에 대하여서도 비교 분석하였다.

An Efficient Pixel Value Prediction Algorithm using the Similarity and Edge Characteristics Existing in Neighboring Pixels Scanned in Inverse s-order (역 s-순으로 스캔된 주변 픽셀들에 존재하는 유사성과 에지 특성을 이용한 효율적인 픽셀 값 예측 기법)

  • Jung, Soo-Mok
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.1
    • /
    • pp.95-99
    • /
    • 2018
  • In this paper, we propose an efficient pixel value prediction algorithm that can accurately predict pixel value using neighboring pixel values scanned in reverse s-order in the image. Generally, image has similarity with similar values between adjacent pixel values, and may have directional edge characteristics. In this paper, we proposed a method to improve pixel value prediction accuracy by improving GAP(Gradient Adjacent Pixel) algorithm for predicting pixel value by using similarity between adjacent pixels and edge characteristics. The proposed method increases the accuracy of the predicted pixel value by precisely predicting the pixel value using the positional weights of the neighboring pixels. Experiments on real images confirmed the superiority of the proposed algorithm. The proposed algorithm is useful for applications such as reversible data hiding, reversible watermarking, and data compression applications.

A Development of System for Flood Runoff Forecasting using Neural Network Model (신경망 모형을 이용한 홍수유출 예측시스템의 재발)

  • Ahn, Sang-Jin;Jun, Kye-Won
    • Journal of Korea Water Resources Association
    • /
    • v.37 no.9
    • /
    • pp.771-780
    • /
    • 2004
  • The purpose of this study is to test a development of system for flood runoff forecasting using neural network model. As the forecasting models for flood runoff the neural network model was tested with the observed flood data at Gongju and Buyeo stations. The neural network model consists of input layer, hidden layer, and output layer. For the flood events tested rainfall and runoff data were the input to the input layer and the flood runoff data were used in the output layer. To make a choice the forecasting model which would make up of runoff forecasting system properly, real-time runoff of river when flood periods were forecasted by using neural network model and state-space model. A comparison of the results obtained by the two forecasting models indicated the superiority and reliability of the neural network model over the state-space model. The neural network model was modified to work in the Web and developed to be the basic model of the forecasting system for the flood runoff. The neural network model developed to be used in the Web was loaded into the server and was applied to the main stream of Geum river. For the main stage gauging stations mentioned above the applicability of the selected forecasting model, the Neural Network Model, was verified in the Web.