Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
Academic research findings report level of cheating in exams involving students studying from each other. Several publications have examined means for preventing cheating by means of exam versions, rotations of questions, and addressing social factors. Yet one preventative aspect of exam cheating seems to be neglected and that is exam distribution. In this paper, the authors introduce the Exam Distribution Problem (EDP). Defining a given k versions of an exam in a classroom with n × m chairs, the paper attempts to find the optimal distribution of exam papers such that every two exams of the same version are at maximal distance from each other. Relevant works in Graph-Theory are examined with simulation of Naïve Algorithm (random) and Sequential Release Algorithm (common) for EDP are reviewed. A cost is assigned for instances where two papers of the same version appear in direct proximity thus associated with higher opportunity for cheating. The results showed that the Sequential Release Algorithm did on average no better than the Random Algorithm. Using Optimization Algorithm, the team presents a new approach, the Dichotomous Interleaved Pairing Algorithm (DIP) that achieves minimal adjacency between two identical exam papers and minimal risk of cheating.
Academic research findings report high level of cheating in exams involving students copying from each other. Several publications have examined means for preventing cheating by means of exam versions, rotations of questions, and addressing social factors. Yet one preventative aspect of exam cheating seems to be neglected and that is exam distribution. In this paper, the authors introduce the Exam Distribution Problem (EDP). Defining a given k versions of an exam in a classroom with n × m chairs, the paper attempts to find the optimal distribution of exam papers such that every two exams of the same version are at maximal distance from each other. Relevant works in Graph-Theory are examined with simulation of Naïve Algorithm (random) and Sequential Release Algorithm (common) for EDP are reviewed. A cost is assigned for instances where two papers of the same version appear in direct proximity thus associated with higher opportunity for cheating. The results showed that the Sequential Release Algorithm did on average no better than the Random Algorithm. Using Optimization Algorithm, the team presents a new approach, the Dichotomous Interleaved Pairing Algorithm (DIP) that achieves minimal adjacency between two identical exam papers and minimal risk of cheating.
In Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling, (PATAT 2010)
A construction approach for examination timetabling based on adaptive decomposition and ordering2010 •
In this study, we investigate an adaptive decomposition strategy that automatically divides examinations into difficult and easy sets for constructing an examination timetable. The examinations in the difficult set are considered to be hard to place and hence are listed before the ones in the easy set. Moreover, the examinations within each set are ordered using different strategies based on graph colouring heuristics. Initially, the examinations are placed into the easy set. During the construction process, the examinations that cannot be scheduled are identified as the ones causing infeasibility and are moved forward in the difficult set to ensure earlier assignment than the others for the subsequent attempts. On the other hand, the examinations that can be scheduled remain in the easy set. Within the easy set, a new subset called the boundary set is introduced to accommodate shuffling strategies to change the given ordering of examinations. The proposed approach which incorporates different ordering and shuffling strategies is explored on the Carter benchmark problems. The empirical results show that its performance is promising and comparable to existing constructive approaches.
Examination verification system using biometric is a system designed to eradicate examination malpractice and also enhance educational standards of institutions
Practice and Theory of Automated Timetabling …
Tabu search techniques for examination timetabling2001 •
Computers & Operations Research
A wide-ranging computational comparison of high-performance graph colouring algorithms2012 •
Business Process Management Journal
E-University Delivery Model: Handling the Evaluation Process2019 •
Purpose-The setting up of e-university has been slow going. Much of e-university slow progress has been attributed to poor business models, branding, disruptive technologies, lack of organisational structure that accommodates such challenges, and failure to integrate a blended approach. One of the stumbling blocks, among many, is the handling of evaluation process. E-university models do not provide much automation compared to the original brick and mortar classroom model of delivery. The underlining technologies may not have been supportive; however, the conditions are changing, and more evaluation tools are becoming available for academics. Approach-This paper identifies the extent of current online evaluation processes. In this process, the team reviews the case study of a UK e-university using Adobe Connect learning model that mirrors much of the physical processes as well as online exams and evaluation tools. Using Riva model, the paper compares the physical with the online evaluation processes for E-universities to identify differences in these processes to evaluate the benefits of e-learning. As a result, the models can help us to identify the processes where improvements can take place for automating the process and evaluate impact of this change. Findings-The paper concludes that this process can be significantly shortened, provide fairer outcome but there remain some challenges for e-university processes to overcome.
Lecture notes in Computer Science, Springer
Combating Misinformation Online: Identification of Variables and Proof-of-Concept Study2016 •
The spread of misinformation online is specifically amplified by use of social media, yet the tools for allowing online users to authenticate text and images are available though not easily accessible. The authors challenge this view suggesting that corporations' responsible for the development of browsers and social media websites need to incorporate such tools to combat the spread of misinformation. As a step stone towards developing a formula for simulating spread of misinformation, the authors ran theoretical simulations which demonstrate the unchallenged spread of misinformation which users are left to authenticate on their own, as opposed to providing the users means to authenticate such material. The team simulates five scenarios that gradually get complicated as variables are identified and added to the model. The results demonstrate a simulation of the process as proof-of-concept as well as identification of the key variables that influence the spread and combat of misinformation online.
In this paper, we present a hybridization of an electromagnetic- like mechanism (EM) and the great deluge (GD) algorithm. This tech- nique can be seen as a dynamic approach as an estimated quality of a new solution and a decay rate are calculated at every iteration during the search process. These values are depending on a force value calcu- lated using the EM approach. It is observed that applying these dynamic values help to generate high quality solutions. Experimental results on benchmark exam timetabling demonstrate the efiectiveness of this hybrid EM-GD approach compared with previous available methods. Possible extensions upon this simple approach are also discussed.
IEEE 2017 International Conference on Information and Digital Technologies (IDT)At: Zilina, Slovakia.
Right-click Authenticate Adoption: The Impact of Authenticating Social Media Postings on Information Quality2017 •
Getting the daily news from social media has nowadays become a common practice among people. Unreliable sources of information expose people to a dose of hoaxes, rumours, conspiracy theories and misleading news. Mixing both reliable and unreliable information on social media has made the truth to be hardly determined. Academic research indicates an increasing reliance of online users on social media as a main source of news. Researchers found that young users, in particular, are to believe what they read on social media without adequate verification. In previous work, we proposed the concept of 'Right-click Authenticate' where we suggested designing an accessible tool to authenticate and verify information online before sharing it. In this paper, we present a review of the problem of sharing misinformation online and extend our work by analysing how 'Right-click Authenticate' reduces the challenges of while improving key metrics within the Information Quality fields.
IEEE 2017 International Conference on Engineering & MIS (ICEMIS)At: Monastir, Tunisia, Tunisia
How to Stop Spread of Misinformation on Social Media: Facebook Plans vs. Right-click Authenticate Approach2017 •
Quarterly Journal of Economics
Rotten Apples: An Investigation of the Prevalence and Predictors of Teacher Cheating2003 •
Applied Soft Computing
An informed genetic algorithm for the examination timetabling problem2010 •
Proc. PlanSIG
VLEPpO: A visual language for problem representation2012 •
Informatics in Education
Detection and Evaluation of Cheating on College Exams using Supervised Classification2012 •
IEEE Conference: 2017 Computing Conference, London, United Kingdom.
Spread of Misinformation Online: Simulation Impact of Social Media Newsgroups2017 •
Lecture Notes in Economics and Mathematical Systems
An Introduction to Multiobjective Metaheuristics for Scheduling and Timetabling2004 •
IEEE Transactions on Evolutionary Computation
Finding Feasible Timetables Using Group-Based Operators2000 •
Journal of Scheduling
A survey of search methodologies and automated system development for examination timetabling2009 •
Journal of Academic Ethics
Academic Misconduct in Portugal: Results from a Large Scale Survey to University Economics/Business Students2010 •
Rough Set and Knowledge Technology
A tabu-based memetic approach for examination timetabling problems2010 •
2004 •
OR Spectrum
Investigating Ahuja–Orlin’s large neighbourhood search approach for examination timetabling2007 •
Brookings-wharton Papers on Urban Affairs
Catching Cheating Teachers: The Results of an Unusual Experiment in Implementing Theory2003 •
2010 •
Journal of Educational and Behavioral Statistics
Randomized Item Response Theory Models2005 •
European Journal of Operational Research
On a parallel genetic–tabu search based algorithm for solving the graph colouring problem2009 •
2008 •
2004 •
Frontiers in Psychology
Teacher enthusiasm: a potential cure of academic cheating2014 •
Lecture Notes in Computer Science
An Experimental Assessment of a Stochastic, Anytime, Decentralized, Soft Colourer for Sparse Graphs2001 •
Nursing Education Perspectives
Academic Policies and Practices to Deter Cheating in Nursing Education2014 •