{"id":{"repo_id":"sdstate","oai_identifier":"oai:openprairie.sdstate.edu:etd2-2682"},"canonical_url":"https://search.ndltd.org/etd/sdstate/oai:openprairie.sdstate.edu:etd2-2682","repository":{"repo_id":"sdstate","name":"South Dakota State University","base_url":"https://openprairie.sdstate.edu/do/oai/"},"display":{"title":"IRIS-A New Plagiarized Code Detection System","abstract":"Plagiarism is defined as an activity to use someone's work without the author's agreement or without a proper citation about the reference[l]. To detect plagiarized programming source codes should be performed by instructors to promote the quality of school education. However, it is virtually impossible to detect those source codes completely within the limited time by only using human's ability. Therefore, it is natural to try to adopt computing power to this operation. Most of the existing plagiarism detection systems use an algorithm to find Longest Common Subsection to measure the similarity between two program sources, but does not provide a way to compare algorithms used for those program source files[2-6]. In this paper, we discuss how to build a new detection system named IRIS that uses Strict Binary Tree structure that was introduced in JK system[7] and execution function call sequences in order to determine the algorithms used in program source files, which will be the major factor to measure the similarity of two compared files by applying Software Metrics additionally.","abstract_html":"Plagiarism is defined as an activity to use someone&#x27;s work without the author&#x27;s agreement or without a proper citation about the reference[l]. To detect plagiarized programming source codes should be performed by instructors to promote the quality of school education. However, it is virtually impossible to detect those source codes completely within the limited time by only using human&#x27;s ability. Therefore, it is natural to try to adopt computing power to this operation. Most of the existing plagiarism detection systems use an algorithm to find Longest Common Subsection to measure the similarity between two program sources, but does not provide a way to compare algorithms used for those program source files[2-6]. In this paper, we discuss how to build a new detection system named IRIS that uses Strict Binary Tree structure that was introduced in JK system[7] and execution function call sequences in order to determine the algorithms used in program source files, which will be the major factor to measure the similarity of two compared files by applying Software Metrics additionally.","abstract_has_math":false,"creators":["Park, Sangjun"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis - University Access Only","degree_discipline":"Electrical Engineering and Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T09:05:44Z","subjects":[],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://openprairie.sdstate.edu/etd2/1684","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://openprairie.sdstate.edu/etd2/1684","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://openprairie.sdstate.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopenprairie.sdstate.edu%3Aetd2-2682","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Park, Sangjun"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2025-07-17T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2010-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical Engineering and Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - University Access Only"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://openprairie.sdstate.edu/etd2/1684"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Plagiarism is defined as an activity to use someone's work without the author's agreement or without a proper citation about the reference[l]. To detect plagiarized programming source codes should be performed by instructors to promote the quality of school education. However, it is virtually impossible to detect those source codes completely within the limited time by only using human's ability. Therefore, it is natural to try to adopt computing power to this operation. Most of the existing plagiarism detection systems use an algorithm to find Longest Common Subsection to measure the similarity between two program sources, but does not provide a way to compare algorithms used for those program source files[2-6]. In this paper, we discuss how to build a new detection system named IRIS that uses Strict Binary Tree structure that was introduced in JK system[7] and execution function call sequences in order to determine the algorithms used in program source files, which will be the major factor to measure the similarity of two compared files by applying Software Metrics additionally."]},{"key":"dc:title","label":"Title","values":["IRIS-A New Plagiarized Code Detection System"]}]}],"canonical_facts":{"dc:creator":["Park, Sangjun"],"dc:date.available":["2025-07-17T07:00:00Z"],"dc:date.created":["2010-01-01T08:00:00Z"],"dc:description.abstract":["Plagiarism is defined as an activity to use someone's work without the author's agreement or without a proper citation about the reference[l]. To detect plagiarized programming source codes should be performed by instructors to promote the quality of school education. However, it is virtually impossible to detect those source codes completely within the limited time by only using human's ability. Therefore, it is natural to try to adopt computing power to this operation. Most of the existing plagiarism detection systems use an algorithm to find Longest Common Subsection to measure the similarity between two program sources, but does not provide a way to compare algorithms used for those program source files[2-6]. In this paper, we discuss how to build a new detection system named IRIS that uses Strict Binary Tree structure that was introduced in JK system[7] and execution function call sequences in order to determine the algorithms used in program source files, which will be the major factor to measure the similarity of two compared files by applying Software Metrics additionally."],"dc:identifier":["https://openprairie.sdstate.edu/etd2/1684"],"dc:title":["IRIS-A New Plagiarized Code Detection System"],"thesis:degree_discipline":["Electrical Engineering and Computer Science"],"thesis:degree_level":["Thesis - University Access Only"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T09:05:44Z"}