随着网络应用的普及,网络教学已经成为教育的新形势。为了保证网络教学的效果,公平地对学生进行考核,就需要有庞大的题库来支撑。题库的构建繁杂且费时,如何自动地建立题库是非常值得研究的。本文的研究目的是通过自动组题来生成各种题...随着网络应用的普及,网络教学已经成为教育的新形势。为了保证网络教学的效果,公平地对学生进行考核,就需要有庞大的题库来支撑。题库的构建繁杂且费时,如何自动地建立题库是非常值得研究的。本文的研究目的是通过自动组题来生成各种题目,丰富题库。自动组题系统中,用户可以设计组题规则,自动生成题目及答案。本文对自动组题的方法和形式进行了研究,可以实现二叉树、哈夫曼树、无向图、有向图、无向网、有向网的图形自动生成,并将生成的图形和相同或不同的题干组合形成不同问题,供练习和考试使用。组题系统不仅可以帮助教师提高效率,提升教学和考试的质量,还可以提供完备和有针对性的题目,提高学生的学习体验感和教学效果。With the popularization of online applications, online teaching has become a new form of education. A large question bank is needed to support the effectiveness of online teaching and the fair assessment of students. The construction of question banks is complex and time-consuming, and it is worth studying how to automatically establish a question bank. This article aims to study the generation of various questions and enrich the question bank through automatic question combinations. In the automatic question combination system, users can design question rules and automatically generate questions and answers. This article studies the methods and forms of online question combinations, which can automatically generate graphs from binary trees, Huffman trees, undirected graphs, directed graphs, undirected networks, and directed networks. The generated graphs can be combined with the same or different question stems to form different questions for practice and examination. The question system can not only help teachers improve efficiency and enhance the quality of teaching and exams, but also provide comprehensive and targeted questions to enhance students’ learning experience and teaching effectiveness.展开更多
This paper states a new metaheuristic based on Deterministic Finite Automata （DFA） for the multi - objective optimization of combinatorial problems. First, a new DFA named Multi - Objective Deterministic Finite Auto...This paper states a new metaheuristic based on Deterministic Finite Automata （DFA） for the multi - objective optimization of combinatorial problems. First, a new DFA named Multi - Objective Deterministic Finite Automata （MDFA） is defined. MDFA allows the representation of the feasible solutions space of combinatorial problems. Second, it is defined and implemented a metaheuritic based on MDFA theory. It is named Metaheuristic of Deterministic Swapping （MODS）. MODS is a local search strategy that works using a MDFA. Due to this, MODS never take into account unfeasible solutions. Hence, it is not necessary to verify the problem constraints for a new solution found. Lastly, MODS is tested using well know instances of the Bi-Objective Traveling Salesman Problem （TSP） from TSPLIB. Its results were compared with eight Ant Colony inspired algorithms and two Genetic algorithms taken from the specialized literature. The comparison was made using metrics such as Spacing, Generational Distance, Inverse Generational Distance and No-Dominated Generation Vectors. In every case, the MODS results on the metrics were always better and in some of those cases, the superiority was 100%.展开更多
文摘随着网络应用的普及,网络教学已经成为教育的新形势。为了保证网络教学的效果,公平地对学生进行考核,就需要有庞大的题库来支撑。题库的构建繁杂且费时,如何自动地建立题库是非常值得研究的。本文的研究目的是通过自动组题来生成各种题目,丰富题库。自动组题系统中,用户可以设计组题规则,自动生成题目及答案。本文对自动组题的方法和形式进行了研究,可以实现二叉树、哈夫曼树、无向图、有向图、无向网、有向网的图形自动生成,并将生成的图形和相同或不同的题干组合形成不同问题,供练习和考试使用。组题系统不仅可以帮助教师提高效率,提升教学和考试的质量,还可以提供完备和有针对性的题目,提高学生的学习体验感和教学效果。With the popularization of online applications, online teaching has become a new form of education. A large question bank is needed to support the effectiveness of online teaching and the fair assessment of students. The construction of question banks is complex and time-consuming, and it is worth studying how to automatically establish a question bank. This article aims to study the generation of various questions and enrich the question bank through automatic question combinations. In the automatic question combination system, users can design question rules and automatically generate questions and answers. This article studies the methods and forms of online question combinations, which can automatically generate graphs from binary trees, Huffman trees, undirected graphs, directed graphs, undirected networks, and directed networks. The generated graphs can be combined with the same or different question stems to form different questions for practice and examination. The question system can not only help teachers improve efficiency and enhance the quality of teaching and exams, but also provide comprehensive and targeted questions to enhance students’ learning experience and teaching effectiveness.
文摘This paper states a new metaheuristic based on Deterministic Finite Automata （DFA） for the multi - objective optimization of combinatorial problems. First, a new DFA named Multi - Objective Deterministic Finite Automata （MDFA） is defined. MDFA allows the representation of the feasible solutions space of combinatorial problems. Second, it is defined and implemented a metaheuritic based on MDFA theory. It is named Metaheuristic of Deterministic Swapping （MODS）. MODS is a local search strategy that works using a MDFA. Due to this, MODS never take into account unfeasible solutions. Hence, it is not necessary to verify the problem constraints for a new solution found. Lastly, MODS is tested using well know instances of the Bi-Objective Traveling Salesman Problem （TSP） from TSPLIB. Its results were compared with eight Ant Colony inspired algorithms and two Genetic algorithms taken from the specialized literature. The comparison was made using metrics such as Spacing, Generational Distance, Inverse Generational Distance and No-Dominated Generation Vectors. In every case, the MODS results on the metrics were always better and in some of those cases, the superiority was 100%.
