二进制粒子群优化组卷算法及其应用-计算机应用技术专业论文.docxVIP

专用浏览器对考生桌面浏览器进行深度个性化定制，屏蔽地址栏、各种常用键盘 快捷键，作为考试系统的补充用以解决考试中学生作弊问题，保证考试公平。最 后，给出了系统评价。实验表明，当题库小于 500 时，系统成功生成试卷的时间 维持在 5s 以下，当题库增大到 1000 时，组卷时间相应增加到 9-11s。算法实际运 行时间符合理论分析得到的算法时间复杂度 O(n)。系统前端采用 AJAX 技术提高 用户的可交互性。由于开发平台选用 J2EE，使得该系统具有较好的健壮性和可扩 展性。 关键词：组卷，Bayes 公式，二进制粒子群 APPLIED BINARY PARTICLE SWARM OPTIMIZE ALGORITHM TO TEST-SHEET COMPOSITION Abstract Test-sheet quality is the key to Online Examination System (OES), thus test-sheet composition algorithm plays an important role in OES. Whether the test-sheet generated by test-sheet composition algorithms is reasonable or scientific directly impact on students learning and schools teaching quality evaluation, further influence next semester‘s teaching plans and even affect the entire teaching reforms. So the test-sheet composition algorithm has a very important practical significance. According to specified parameters, such as item types, difficulty degree, concepts, answer time, score, etc. test-sheet composition algorithm extracts certain items from item bank to generate a test-sheet. It is a typical multiple-objective optimization problem. There is no algorithm that can be a mature perfect solution for test-sheet composition problem. Some algorithms have strong global search capability but poor local search ability and some have poor local search ability but strong global search capability, while some algorithms steps are more complex, have more iterations; some algorithms’ principles and mechanisms are simpler, but there is certain subjectivity in the parameter settings of these algorithms on the current status of research. We analyze the advantages and disadvantages of existing test-sheet composition algorithms. On the basic of that, we adopt a BPSO based on Bayes formula to solve the test-sheet composition problem. Comparing to other computational intelligence algorithms, this method has no crossover and mutation operator, thus its mechanism is simpler and the programming is easier. While comparing to standard PSO