personal project work

Which course does this assignment belong to? class link
where is this job requirement job link
The goal of this assignment Learn and use blog and GitHub, and get a general understanding of soft engineering
PSP2.1 Personal Software Process Stages Estimated time (minutes) Actual time (minutes)
Planning plan 20 20
Estimate Estimate how long this task will take 120 160
Development develop 200 180
Analysis Needs analysis (including learning new technologies) 60 80
Design Spec Generate design documentation 70 80
Design Review Design Review 60 60
Coding Standard Code Specifications (to develop appropriate specifications for current development) 30 40
Design specific design 80 100
Coding specific code 20 20
Code Review code review 20 30
Test Testing (self-testing, modifying code, committing changes) 30 30
Reporting Report 60 65
Test Repor testing report 60 60
Size Measurement Computational workload 20 20
Postmortem & Process Improvement Plan Post-event summary, and propose a process improvement plan 30 40
total 740 985
  • need

    • Described as follows:
    • Design a paper duplication checking algorithm, give an original document and a plagiarized version of the paper with additions, deletions and modifications on the original document, and output the duplication rate in the answer file.
    • Example of the original text: Today is Sunday, the weather is fine, and I am going to the movies tonight.
    • Example of plagiarism: Today is Sunday, the weather is fine, and I am going to the movies in the evening.
    • It is required that the input and output use file input and output, and the specifications are as follows:
    • Given from command line arguments: the absolute path to the file of the original paper.
    • Given from the command line arguments: the absolute path to the file of the plagiarized version of the paper.
    • Given from command line arguments: Absolute path to the output answer file.
  • Implementation principle: Calculate the text similarity by the cosine similarity algorithm. If the value is closer to 1, the similarity is greater, otherwise the similarity is smaller.

    • The picture is as follows:
  • Part of the code is as follows:

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.FileNotFoundException;
import java.io.IOException;
/**
 * Created by JackDan9 on 2017/5/23.
 */
public class AutoCheckTest {
//    private static final String filePath = "file path";
    private static final String filePath = "C:\\Users\\Desktop\\test\\orig.txt";
    private static final String secFilePath = "C:\\Users\\Desktop\\test\\orig_0.8_dis_1.txt";
    private static final String resFilePath = "C:\\Users\\Desktop\\test\\orig_0.8_add.txt";

    public static void main(String[] args) {
        long startTime = System.currentTimeMillis();
        // Read the first collection
        File file = new File(filePath);
        File secFile = new File(secFilePath);
        BufferedReader reader = null;
        BufferedReader secReader = null;
//        BufferedReader resReader = null;
        BufferedWriter resWriter = null;
        try {
            reader = new BufferedReader(new FileReader(file));
            secReader = new BufferedReader((new FileReader(secFile)));
            secReader.mark(90000000);
            resWriter = new BufferedWriter(new FileWriter(resFilePath));
            String lineText = null;
            while((lineText = reader.readLine()) != null) {
                String searchText = lineText.trim();
                searchAndSignProcess.searchAndSignProcess(searchText, secReader, resWriter);
            }
            long endTime = System.currentTimeMillis();
            System.out.println("======Process Over!======");
            System.out.println("Time Speeding: " + ((endTime - startTime) / 1000D) + "s");
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        } catch (IOException e) {
            e.printStackTrace();
        } finally {
            if(reader != null) {
                try {
                    reader.close();
                } catch (IOException e) {
                    e.printStackTrace();
                } finally {
                    if (secReader != null && resWriter != null) {
                        try {
                            secReader.close();
                            resWriter.close();
                        } catch (IOException e) {
                            e.printStackTrace();
                        }
                    }
                }
            }
        }
    }
}
  • Design and implementation process and performance improvement of computing module interface

  • Part of the unit test display of the computing module

  • Exception Handling Instructions for Calculation Modules

if(!os.path.exists(path_1)) {
        System.out.println("file does not exist");
        exit();
}

Posted by epicalex on Sat, 14 May 2022 16:46:21 +0300