• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.12
• /
• pp.3016-3022
• /
• 2013

In this paper, we propose a novel design and implementation method to detect musical plagiarism which can provide human experts evidences to decide plagiarism using cutting-edge information technologies and thereby can solve exhaustive disputes on cases of musical plagiarism when the cases are decided by human experts' emotional preferences. We first search digital music elements to analyze music source and examine how to use these in plagiarism analysis using IT techniques. Therefore we designed music plagiarism analysis system by using MusicString which is supported in JFugue and construct AST to manipulate music plagiarism analysis efficiently.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.8
• /
• pp.43-52
• /
• 2013

The purpose of this paper is researching musical elements to analyze plagiarism between two sources. We first search digital music elements to analyze music source and examine how to use these in plagiarism analysis using compiler techniques. In addition we are used open source Java API JFugue to process complex MIDI music data simply. Therefore we designed music plagiarism analysis system by using MusicString which is supported in JFugue and construct AST after investigate MusicString's syntax processing elements to manipulate music plagiarism analysis efficiently. So far music plagiarism analysis is evaluated emotionally and subjectively. But this paper suggests first step to build plagiarism analysis systemically. If this research is well utilized, this is very meaningful to standardize systemically which music is plagiarized or not.

• Journal of Information Technology Applications and Management
• /
• v.16 no.1
• /
• pp.21-36
• /
• 2009

As the World Wide Web (WWW) has become a major channel for information delivery, the data accumulated in the Internet increases at an incredible speed, and it derives the advances of information search technologies. It is the search engine that solves the problem of information overloading and helps people to identify relevant information. However, as search engines become a powerful tool for finding information, the opportunities of plagiarizing have increased significantly in e-Learning. In this paper, we developed an online plagiarism detection system for detecting plagiarized documents that incorporates the functions of search engines and acts in exactly the same way of plagiarizing. The plagiarism detection system uses morpheme analysis to improve the performance and sentence-based comparison to investigate document comes from multiple sources. As a result of applying this system in e-Learning, the performance of plagiarism detection was improved.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.453-462
• /
• 2009

Studies on software plagiarism detection, prevention and judgement have become widespread due to the growing of interest and importance for the protection and authentication of software intellectual property. Many previous studies focused on comparing all pairs of submitted codes by using attribute counting, token pattern, program parse tree, and similarity measuring algorithm. It is important to provide a clear-cut model for distinguishing plagiarism and collaboration. This paper proposes a source code clustering algorithm using a probability model on extreme value distribution. First, we propose an asymmetric distance measure pdist($P_a$, $P_b$) to measure the similarity of $P_a$ and $P_b$ Then, we construct the Plagiarism Direction Graph (PDG) for a given program set using pdist($P_a$, $P_b$) as edge weights. And, we transform the PDG into a Gumbel Distance Graph (GDG) model, since we found that the pdist($P_a$, $P_b$) score distribution is similar to a well-known Gumbel distribution. Second, we newly define pseudo-plagiarism which is a sort of virtual plagiarism forced by a very strong functional requirement in the specification. We conducted experiments with 18 groups of programs (more than 700 source codes) collected from the ICPC (International Collegiate Programming Contest) and KOI (Korean Olympiad for Informatics) programming contests. The experiments showed that most plagiarized codes could be detected with high sensitivity and that our algorithm successfully separated real plagiarism from pseudo plagiarism.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.6
• /
• pp.189-196
• /
• 2014

Though the plagiarism is illegal and should be avoided, it still occurs frequently. Particularly, the plagiarism of source codes is more frequently committed than others since it is much easier to copy them because of their digital nature. To prevent code plagiarism, there have been reported a variety of studies. However, previous studies for plagiarism detection techniques on source codes do not consider the data structures although a source code consists both of data structures and algorithms. In this paper, a plagiarism detection technique for source codes considering data structures is proposed. Specifically, the data structures of two source codes are represented as sets of trees and compared with each other using Hungarian Method. To show the usefulness of this technique, an experiment has been performed on 126 source codes submitted as homework results in an object-oriented programming course. When both the data structures and the algorithms of the source codes are considered, the precision and the F-measure score are improved 22.6% and 19.3%, respectively, than those of the case where only the algorithms are considered.

• Journal of Digital Convergence
• /
• v.17 no.9
• /
• pp.327-335
• /
• 2019

In the 1970s, Korea actively produced so many animated works which is called the "golden age" of korean animation. However, Korea imported and subcontracted foreign animations than creating original works and, there has been a constant controversy that many of the korean animations imitated foreign works. Therefore, this paper aims to analyze the factors that caused this and its patterns, focusing on works suspected of plagiarism in Korean animation during the 1970s and 1980s. First, the focus will be on the definition and composition of plagiarism in art creation, secondly, on the political-ideological, industrial-administrational, production-structural, and copyright awareness aspects of the factors of plagiarized animation. Thirdly, 30 korean animations produced at the time will be analyzed on the degree of design theft and plagiarism based on six criteria focusing on characters' shapes and color arrangements. By analyzing the social factors and patterns of plagiarism, this study aims to provide a social and cultural understanding of academic value about the process of korean animation's development.

• Journal of The Korean Association of Information Education
• /
• v.11 no.1
• /
• pp.91-98
• /
• 2007

Plagiarism is a serious problem in school education due to current technologies such as the internet and word processors. This paper presents how to detect source code plagiarism using similarity based on string comparison methods. The main contribution is to use hierarchical agglomerative clustering technique to classify plagiarism groups, which are then visualized as a dendrogram. Graders can set an empirical threshold to the dendrogram to navigate plagiarism groups. We evaluated the performance of the presented method with a real world data. The result showed the usefulness and applicability of this method.

• Journal of Korea Multimedia Society
• /
• v.8 no.1
• /
• pp.1-8
• /
• 2005

Similar melody searching is an operation that finds such melodies similar to a given query melody from a music database. In this paper, we address the development of a system that detects plagiarism based on the similar melody searching. We first Propose a novel similarity model that supports alignment as well as shifting. Also, we suggest a method for indexing the features extracted from each melody, and a method for processing plagiarism detection by using the index. By our plagiarism detection system composers can easily searches for such melodies that are similar to their ones from music databases. Through performance evaluation via a series of experiments, we show the effectiveness of our approach. The results reveal that our approach outperforms the sequential-scan-based one in speed up to around 31 times.

• The KIPS Transactions:PartD
• /
• v.13D no.6 s.109
• /
• pp.833-838
• /
• 2006

Program Plagiarism is an infringement of software copyright. In detecting program plagiarism, many different source program comparison methods has been studied. But, it is not easy to detect plagiarized program that made a few cosmetic changes in program structures and variable names In this paper, we propose a new ground-breaking technique in detecting plagiarism by Memory Access Log Analysis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1627-1648
• /
• 2012

We propose an adaptive method for detecting plagiarized pairs from a large set of source code. This method is adaptive in that it uses an adaptive algorithm and it provides an adaptive threshold for determining plagiarism. Conventional algorithms are based on greedy string tiling or on local alignments of two code strings. However, most of them are not adaptive; they do not consider the characteristics of the program set, thereby causing a problem for a program set in which all the programs are inherently similar. We propose adaptive local alignment-a variant of local alignment that uses an adaptive similarity matrix. Each entry of this matrix is the logarithm of the probabilities of the keywords based on their frequency in a given program set. We also propose an adaptive threshold based on the local outlier factor (LOF), which represents the likelihood of an entity being an outlier. Experimental results indicate that our method is more sensitive than JPlag, which uses greedy string tiling for detecting plagiarism-suspected code pairs. Further, the adaptive threshold based on the LOF is shown to be effective, and the detection performance shows high sensitivity with negligible loss of specificity, compared with that using a fixed threshold.