Our previous work has introduced the newly generated program using the code transformation model GPT-2,verifying the generated programming codes through simhash(SH)and longest common subsequence(LCS)algo-rithms.Howeve...Our previous work has introduced the newly generated program using the code transformation model GPT-2,verifying the generated programming codes through simhash(SH)and longest common subsequence(LCS)algo-rithms.However,the entire code transformation process has encountered a time-consuming problem.Therefore,the objective of this study is to speed up the code transformation process signicantly.This paper has proposed deep learning approaches for modifying SH using a variational simhash(VSH)algorithm and replacing LCS with a piecewise longest common subsequence(PLCS)algorithm to faster the verication process in the test phase.Besides the code transformation model GPT-2,this study has also introduced MicrosoMASS and Facebook BART for a comparative analysis of their performance.Meanwhile,the explainable AI technique using local interpretable model-agnostic explanations(LIME)can also interpret the decision-making ofAImodels.The experimental results show that VSH can reduce the number of qualied programs by 22.11%,and PLCS can reduce the execution time of selected pocket programs by 32.39%.As a result,the proposed approaches can signicantly speed up the entire code transformation process by 1.38 times on average compared with our previous work.展开更多
为了提高运动目标轨迹分类的准确性,该文综合考虑了轨迹的位置信息和方向信息,提出了一种结合Hausdorff距离和最长公共子序列(Longest Common SubSequence,LCSS)的轨迹分类算法。该算法首先采用改进的Hausdorff距离对轨迹的位置信息进...为了提高运动目标轨迹分类的准确性,该文综合考虑了轨迹的位置信息和方向信息,提出了一种结合Hausdorff距离和最长公共子序列(Longest Common SubSequence,LCSS)的轨迹分类算法。该算法首先采用改进的Hausdorff距离对轨迹的位置信息进行相似性测量,然后采用改进的LCSS算法对轨迹的方向信息进行相似性测量。与其他轨迹聚类算法不同,该算法融合了Hausdorff距离和LCSS两种算法的优点,提高了轨迹分类的准确性。此外,为了进一步降低计算复杂度,该文还实现了一种基于插值的保距变换算法和一种LCSS快速算法。实验结果表明,该轨迹分类算法可以明显提高轨迹的聚类准确率,聚类准确率可达到96%;基于插值的保距变换算法和LCSS快速算法可以很大程度上降低算法的计算复杂度,下降幅度最大可达到80%。该方法可以同时满足轨迹分类对精确度、实时性和鲁棒性的要求。展开更多
基金supported by the Ministry of Science and Technology,Taiwan,under Grant Nos.MOST 111-2221-E-390-012 and MOST 111-2622-E-390-001.
文摘Our previous work has introduced the newly generated program using the code transformation model GPT-2,verifying the generated programming codes through simhash(SH)and longest common subsequence(LCS)algo-rithms.However,the entire code transformation process has encountered a time-consuming problem.Therefore,the objective of this study is to speed up the code transformation process signicantly.This paper has proposed deep learning approaches for modifying SH using a variational simhash(VSH)algorithm and replacing LCS with a piecewise longest common subsequence(PLCS)algorithm to faster the verication process in the test phase.Besides the code transformation model GPT-2,this study has also introduced MicrosoMASS and Facebook BART for a comparative analysis of their performance.Meanwhile,the explainable AI technique using local interpretable model-agnostic explanations(LIME)can also interpret the decision-making ofAImodels.The experimental results show that VSH can reduce the number of qualied programs by 22.11%,and PLCS can reduce the execution time of selected pocket programs by 32.39%.As a result,the proposed approaches can signicantly speed up the entire code transformation process by 1.38 times on average compared with our previous work.
文摘为了提高运动目标轨迹分类的准确性,该文综合考虑了轨迹的位置信息和方向信息,提出了一种结合Hausdorff距离和最长公共子序列(Longest Common SubSequence,LCSS)的轨迹分类算法。该算法首先采用改进的Hausdorff距离对轨迹的位置信息进行相似性测量,然后采用改进的LCSS算法对轨迹的方向信息进行相似性测量。与其他轨迹聚类算法不同,该算法融合了Hausdorff距离和LCSS两种算法的优点,提高了轨迹分类的准确性。此外,为了进一步降低计算复杂度,该文还实现了一种基于插值的保距变换算法和一种LCSS快速算法。实验结果表明,该轨迹分类算法可以明显提高轨迹的聚类准确率,聚类准确率可达到96%;基于插值的保距变换算法和LCSS快速算法可以很大程度上降低算法的计算复杂度,下降幅度最大可达到80%。该方法可以同时满足轨迹分类对精确度、实时性和鲁棒性的要求。
