• Title/Summary/Keyword: 적응적 지역정렬

Search Result 6, Processing Time 0.019 seconds

An Adaptive Algorithm for Plagiarism Detection in a Controlled Program Source Set (제한된 프로그램 소스 집합에서 표절 탐색을 위한 적응적 알고리즘)

  • Ji, Jeong-Hoon;Woo, Gyun;Cho, Hwan-Gue
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.12
    • /
    • pp.1090-1102
    • /
    • 2006
  • This paper suggests a new algorithm for detecting the plagiarism among a set of source codes, constrained to be functionally equivalent, such are submitted for a programming assignment or for a programming contest problem. The typical algorithms largely exploited up to now are based on Greedy-String Tiling, which seeks for a perfect match of substrings, and analysis of similarity between strings based on the local alignment of the two strings. This paper introduces a new method for detecting the similar interval of the given programs based on an adaptive similarity matrix, each entry of which is the logarithm of the probabilities of the keywords based on the frequencies of them in the given set of programs. We experimented this method using a set of programs submitted for more than 10 real programming contests. According to the experimental results, we can find several advantages of this method compared to the previous one which uses fixed similarity matrix(+1 for match, -1 for mismatch, -2 for gap) and also can find that the adaptive similarity matrix can be used for detecting various plagiarism cases.

An Adaptive Algorithm for Plagiarism Detection in a Controlled Program Source Set (제한된 프로그램 소스 집합에서 표절 탐색을 위한 적응적 알고리즘)

  • Ji, Jung-Hoon;Woo, Gyun;Cho, Hwan-Gyu
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10b
    • /
    • pp.580-585
    • /
    • 2006
  • 본 논문에서는 대학생들의 프로그래밍 과제물이나 프로그래밍 경진대회에 제출된 프로그램과 같이 동일한 기능을 요구받는 프로그램 소스 집합들에서 표절 행위가 있었는지를 탐색하는 새로운 알고리즘을 제시한다. 본 논문에서는 프로그램의 소스 집합에서 추출된 키워드들의 빈도수에 기반한 로그 확률값을 가중치로 하는 적응적(adaptive) 유사도 행렬을 만들어 이를 기반으로 주어진 프로그램의 유사구간을 탐색하는 지역정렬(local alignment) 방법을 소개한다. 우리는 10여개 이상의 프로그래밍 대회에 제출된 실제 프로그램으로 본 방법론을 실험하였다. 실험결과 이 방법은 이전의 고정적 유사도 행렬(일치 +1, 불일치 -1, 갭(gap)을 이용한 일치 -2)에 의한 유사구간 탐색에 비하여 여러 장점이 있음을 알 수 있었으며, 보다 다양한 표절탐색 목적으로 제시한 적응적 유사도 행렬이 응용될 수 있음을 알 수 있었다.

  • PDF

A Plagiarism Detection Technique for Java Program Using Bytecode Analysis (바이트코드 분석을 이용한 자바 프로그램 표절검사기법)

  • Ji, Jeong-Hoon;Woo, Gyun;Cho, Hwan-Gue
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.7
    • /
    • pp.442-451
    • /
    • 2008
  • Most plagiarism detection systems evaluate the similarity of source codes and detect plagiarized program pairs. If we use the source codes in plagiarism detection, the source code security can be a significant problem. Plagiarism detection based on target code can be used for protecting the security of source codes. In this paper, we propose a new plagiarism detection technique for Java programs using bytecodes without referring their source codes. The plagiarism detection procedure using bytecode consists of two major steps. First, we generate the token sequences from the Java class file by analyzing the code area of methods. Then, we evaluate the similarity between token sequences using the adaptive local alignment. According to the experimental results, we can find the distributions of similarities of the source codes and that of bytecodes are very similar. Also, the correlation between the similarities of source code pairs and those of bytecode pairs is high enough for typical test data. The plagiarism detection system using bytecode can be used as a preliminary verifying tool before detecting the plagiarism by source code comparison.

A Study of Choosing Efficient Discriminative Seeds for Oligonucleotide Design (올리고뉴클레오타이드 제작을 위해 효율적이고 차별적인 시드를 고르는 방법에 대한 고찰)

  • Chung, Won-Hyong;Park, Seong-Bae
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.1
    • /
    • pp.1-8
    • /
    • 2009
  • Oligonucleotide design is known as a time-consuming work in Bioinformatics. In order to accelerate the oligonucleotide design process, one of the most widely used approaches is the prescreening unreliable regions using hashing(or seeding) method represented by BLAST. Since the seeding is originally proposed to increase the sensitivity for local alignment, the specificity should be considered as well as the sensitivity for the oligonucleotide design problem. However, a measure of evaluating the seeds regarding how adequate and efficient they are in the oligo design is not yet proposed. we propose a novel measure of evaluating the seeding algorithms based on the discriminability and the efficiency. By the proposed measure, five well-known seeding algorithms are examined. The spaced seed is recorded as the best efficient discriminative seed for oligo design.

Adaptive LSB Steganography for High Capacity in Spatial Color Images (컬러이미지 대상 고용량 적응형 LSB 스테가노그라피)

  • Lee, Haeyoung
    • Journal of the Korea Computer Graphics Society
    • /
    • v.24 no.1
    • /
    • pp.27-33
    • /
    • 2018
  • This paper presents a new adaptive LSB steganography for high capacity in spatial color images. The number of least signi ficant bit (LSB) of each RGB component in a color image pixel, to replace with the data bits to be hidden, was determine d through analysis of the worst case peak signal noise ratio (PSNR). In addition, the combination of the number of bits is determined adaptively according to image content. That is, 70% of the data to be hidden is proposed to be replaced with 3 bit LSB of two components, 2 bit LSB of the rest component, and 30% be replaced with 4 bit LSB of each RGB compon ent. To find edge areas in an image, delta sorting in local area is also suggested. Using the proposed method, the data cap acity is 9.2 bits per pixel (bpp). The average PSNR value of the tested images with concealed data of up to 60Kbyte was 43.9 db and also natural histograms were generated.

Studies on Chemical and Biological Processes in the Keum River Estuary, Korea 2. Factors controlling chlorophyll-a distribution (금강 하구에서의 화학적, 생물학적 제과정에 관한 연구 II. Chlorlphyll-a 분포 결정 요인에 관하여)

  • 기준학;김정렬
    • 한국해양학회지
    • /
    • v.22 no.3
    • /
    • pp.207-215
    • /
    • 1987
  • The Keum River Estuary was investigated two times in April and July, 1986, to study process controlling chlorophyll distribution in estuarine waters. During the surveys, distribution patterns were studied for chlorophyll-a, nutrients, ph, SPM (Suspended Particulate Matter), DO (Dissolved Oxygen), temperature, salinity, etc. During April survey(low-discharge period), sea water penetrated to Kangkyung, about 35km upstream from the constructing weir, while in July (high-discharge period) only to 3 km upstream from the weir,In April SPM showed very high concentrations (500mg/l)on the average. But very low concentrations(about10mg/l)were observed in July due to high discharge of fresh water.Chlorophyll-a concentrations showed large variations both in time and space :much higher concentraations in July than in April and sharp decrease in concentrations at the fresh water-sea water interface (April:$6.5\mu\textrm{g}/{\ell}$ for fresh waters and 41.4\mu\textrm{g}/{\ell}$ forestuarine waters). Differebce ub chlorophyll-a concentrations for these two surveys appear to be caused mainly by the difference in effectiveness of penetrating lights controlled by SPM in the waters. Sharp decrease in chlorophll-a at the fresh water-sea water interface is believed to be resulted from mass mortality of fresh water phytoplankton caused by changes in osmotic pressure in the region. Observations in the same regions such as increase in AOU(Apparent Oxygen Utilization)and ammonia, decrease in PH,probably resulted through decomposition processes of dead planktons,furtuer support the idea.

  • PDF