The Design of ADAT: A Tool for Assessing Automata-Based Assignments

Shukur, Zarina; Mohamed, Nurul Fatihah

doi:10.3844/jcssp.2008.415.420

Cited by 4 publications

(3 citation statements)

References 20 publications

(17 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most of the available automatic diagram assessment systems were designed for a specific diagram type. Examples of these single diagram types addressed by existing systems are deterministic finite automata (DFA) [2,6], UML class diagrams [1,7], UML use case diagrams [10], Entity-Relationship diagrams [3], among others.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Reducing Large Semantic Graphs to Improve Semantic Relatedness

Costa

Leal

2015

Communications in Computer and Information Science

View full text Add to dashboard Cite

This paper proposes a structure driven approach to assess graph-based exercises. Given two graphs, a solution and an attempt of a student, this approach computes a mapping between the node sets of both graphs that maximizes the student's grade, as well as a description of the differences between the two graph. The proposed algorithm uses heuristics to test the most promising mappings first and prune the remaining when it is sure that a better mapping cannot be computed.The proposed algorithm is applicable to any type of document that can be parsed into its graph-inspired data model. This data model is able to accommodate diagram languages, such as UML or ER diagrams, for which this kind of assessment is typically used. However, the motivation for developing this algorithm is to combine it with other assessment models, such as the test case model used for programming language assessment.The proposed algorithm was validated with thousands of graphs with different features produced by a synthetic data generator. Several experiments were designed to analyse the impact of different features such as graph size, and amount of difference between solution and attempt.

show abstract

Section: Related Workmentioning

confidence: 99%

“…The automata-base graph analyser of Shukur and Mohamed [6] works in a way that is similar to that presented above. The system does two types of evaluation: static and dynamic.…”

Section: Related Workmentioning

confidence: 99%

Reducing Large Semantic Graphs to Improve Semantic Relatedness

Costa

Leal

2015

Communications in Computer and Information Science

View full text Add to dashboard Cite

show abstract

“…Nonetheless, many fields other than computer science have been explored. For instance, in [20], a tool for assessing automata-based assignments is proposed. Automatic assessment of formal specification coursework is addressed in [21].…”

Section: Related Workmentioning

confidence: 99%

Automatic Assessment of 3D Modeling Exams

Sanna

Lamberti

Paravati

et al. 2012

IEEE Trans. Learning Technol.

View full text Add to dashboard Cite

Computer-based assessment of exams provides teachers and students with two main benefits: fairness and effectiveness in the evaluation process. This paper proposes a fully automatic evaluation tool for the Graphic and Virtual Design curriculum at the First School of Architecture of the Politecnico di Torino, Italy. In particular, the tool is designed for the 3D modeling course, taught during the second year, where students have to prove their ability to model static scenes using the open source modeler Blender. During the final exam, students are required to create a 3D model as similar as possible to a reference object proposed by the teacher and shown through a set of 2D views; the similarity of the images is judged according to both model shape and materials. The traditional assessment process is particularly slow and strongly based on teachers subjective evaluation; the proposed solution efficiently implements an objective assessment mechanism that exploits computer vision and image analysis algorithms to automatically extract similarity indices. These indices are related to partial evaluation grades, which are then combined to obtain the final mark. A comparison with the traditional assessment process shows robustness and trustworthiness of the designed approach.

show abstract

A Structural Approach to Assess Graph-Based Exercises

Sousa

Leal

2015

Communications in Computer and Information Science

View full text Add to dashboard Cite

This paper proposes a structure driven approach to assess graph-based exercises. Given two graphs, a solution and an attempt of a student, this approach computes a mapping between the node sets of both graphs that maximizes the student's grade, as well as a description of the differences between the two graph. The proposed algorithm uses heuristics to test the most promising mappings first and prune the remaining when it is sure that a better mapping cannot be computed. The proposed algorithm is applicable to any type of document that can be parsed into its graph-inspired data model. This data model is able to accommodate diagram languages, such as UML or ER diagrams, for which this kind of assessment is typically used. However, the motivation for developing this algorithm is to combine it with other assessment models, such as the test case model used for programming language assessment. The proposed algorithm was validated with thousands of graphs with different features produced by a synthetic data generator. Several experiments were designed to analyse the impact of different features such as graph size, and amount of difference between solution and attempt.

show abstract

The Design of ADAT: A Tool for Assessing Automata-Based Assignments

Cited by 4 publications

References 20 publications

Reducing Large Semantic Graphs to Improve Semantic Relatedness

Reducing Large Semantic Graphs to Improve Semantic Relatedness

Automatic Assessment of 3D Modeling Exams

A Structural Approach to Assess Graph-Based Exercises

Contact Info

Product

Resources

About