Study on Automatic Test Paper Generation Algorithm Based on the Maximum Flow of the Upper and Lower Bounds

Ying Zhang; Shi Hang Huang; Ying Liu; Zhen Fang; De Peng Dang

doi:10.4028/www.scientific.net/AMR.756-759.3065

Paper Titles

Research of Software Development Model Based on the Theory of Software Engineering
p.3048

Hebei Electric Power Energy Structure and the Power Supply and Demand Prediction under the Low-Carbon Economy - Analysis Based on the Gray GM (1,1) Model
p.3052

Research on Computer Virus Prevention Strategies
p.3057

Finding Influentials Based on the User's Behavior in Microblogging
p.3061

Study on Automatic Test Paper Generation Algorithm Based on the Maximum Flow of the Upper and Lower Bounds
p.3065

The Recursive Algorithms of Yule-Walker Equation in Generalized Stationary Prediction
p.3070

Human Factor Analysis Model of Civil Aviation Incidents Based on Bayesian Network
p.3074

Comprehensive Evaluation of the Level of Consumption Based on Principal Component Analysis and Cluster Analysis
p.3079

Regular (ϵ,ϵνq_k) - Fuzzy Duo Ordered Semigroups
p.3084

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 756-759Study on Automatic Test Paper Generation Algorithm...

Study on Automatic Test Paper Generation Algorithm Based on the Maximum Flow of the Upper and Lower Bounds

Abstract:

The core of exam management system is how to generate test paper automatically. The existing algorithmic is difficult to simultaneously achieve the requirements with efficient, random, flexible and expansive performance. In this paper, we introduce the maximum flow algorithm of the upper and lower bounds in the graph theory, create a test paper generation model based on constraint conditions, and implement the test paper generation under complex constraints. In addition, to illustrate the success rate and efficiency, the system generated automatically test papers on proposition needs. In turn, it verifies the correctness and rationality of the model. The algorithm proposed in this paper will provide theoretical and technical support for other systems, and it further promotes the development of the exam management system.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 756-759)

Pages:

3065-3069

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.756-759.3065

Citation:

Cite this paper

Online since:

September 2013

Authors:

Ying Zhang, Shi Hang Huang, Ying Liu, Zhen Fang, De Peng Dang

Keywords:

Automatic Test Paper Generation Algorithm, Constraint Model, Exam Management System

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Wang Yuying, HouShuang, GuoMaozu. Algorithm for automatic test paper generation[J]. Journal of Harbin Institute of Technology, 2003, 35(3), 342-346.

Google Scholar

[2] Gong Lei. The Research and Implementation of Item Bank System Based on Evaluation Criterion Restraint Algorithm[D]. Master Dissertation of Beijing forestry University, 2012: 1-3.

Google Scholar

[3] Wu Renjie. Study on Intelligently Composing Test Paper Based on Ant Colony Optimization[J]. Computer Simulation, 2011, 28(8): 380-384.

Google Scholar

[4] Parameswaran, Aditya and Venetis, Petros and Garcia-Molina. Recommendation Systems with Complex Constraints: A Course Rank Perspective. ACM Transactions on Information Systems (TOIS), 2011, 29(4): A1-A33.

DOI: 10.1145/2037661.2037665

Google Scholar

[5] Koutrika, Georgia and Bercovitz, Benjamin and Garcia-Molina. FlexRecs: Expressing and Combining Flexible Recommendations. In: SIGMOD (2009).

DOI: 10.1145/1559845.1559923

Google Scholar

[6] Levner, E. V. and Nemirovsky, A. S. A network ﬂow algorithm for just-in-time project scheduling. European J. of O. R. 1994, 79(2): 167–175.

DOI: 10.1016/0377-2217(94)90348-4

Google Scholar

[7] Franz J. Brandenburg and Mao-cheng Cai. Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains. Computer Science, 2009, 5598, Frontiers in Algorithmics: 4-15.

DOI: 10.1007/978-3-642-02270-8_4

Google Scholar