240 0

Enhancing the Assessment Item Rearrangement with Bin Packing Algorithms

Title
Enhancing the Assessment Item Rearrangement with Bin Packing Algorithms
Author
차재혁
Keywords
Computer aided instruction; Computer and education; E-learning; IMS QTI; Web content management
Issue Date
2015-12
Publisher
IEEE eXpress
Citation
2015 IEEE 2nd International Conference on InformationScience and Security, ICISS 2015, Page. 219-222
Abstract
Online test system has been used widely in various distance learning and training systems. As more and more intelligent online systems appeared, lots of teachers could generate items and tests by diverse e-learning tools. An assessment test contains a set of items. There exist only two typical test delivery approaches supported by most online test systems. One is that a group of items are represented in a single page, and other one is that an item is presented in a single page. In case of the former approach, we need to discuss about how many items should be represented in a single page. In other words, space utilization is an important performance measure of test delivery engine. Firstly, this paper describes the design and implementation of the test generation module and the test delivery engine. And, we apply bin packing algorithms to typical items rearrangement method for responsive test sheet of multiple screen sizes. It enables each item not to be divided into two or more pages and each page to be filled efficiently with items. Lastly, our experiment shows our proposed method based on Best-Fit algorithm is superior to other algorithms with the number of pages spent. © 2015 IEEE.
URI
http://ieeexplore.ieee.org/document/7371000/http://hdl.handle.net/20.500.11754/29582
ISBN
978-1-4673-8611-1
DOI
10.1109/ICISSEC.2015.7371000
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > COMPUTER SCIENCE AND ENGINEERING(컴퓨터공학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE