Jinshui Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jinshui Wang has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
Zhenchang Xing
Australian National University, Canberra, ACT, Australia
6 shared publicationsWenyun Zhao
4 shared publicationsXin Peng
Fudan University
4 shared publications- Zhengyi Tang
School of Computer Science and Mathematics, Fujian University of Technology, Fuzhou, China
4 shared publications - Pengchen Lin
School of Computer Science and Mathematics, Fujian University of Technology, Fuzhou, China
2 shared publications - Shuguang Chen
School of Computer Science and Mathematics, Fujian University of Technology, Fuzhou, China
2 shared publications
Latest Publications
- 20 August 2026
- Published by Elsevier in Neurocomputing
- Vol. 704
ANCHOR: Enhancing complex reasoning in large language models via metacognitive task anchoring
- 20 August 2026
- Published by Elsevier in Neurocomputing
- Vol. 704
ANCHOR: Enhancing complex reasoning in large language models via metacognitive task anchoring
- 18 February 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 314
CORE: A cognitive science-inspired framework for task-adaptive reasoning enhancement in large language models
- 18 February 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 314
CORE: A cognitive science-inspired framework for task-adaptive reasoning enhancement in large language models
- 10 December 2024
- Published by Springer Nature in Education and Information Technologies
- Vol. 30 (1) , 715-745
Enhancing SQL programming education: addressing cheating challenges in online judge systems
- 10 December 2024
- Published by Springer Nature in Education and Information Technologies
- Vol. 30 (1) , 715-745
Enhancing SQL programming education: addressing cheating challenges in online judge systems
- Open Access
- 24 May 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing Education
- Vol. 24 (3) , 1-23
False Positives and Deceptive Errors in SQL Assessment: A Large-Scale Analysis of Online Judge Systems
Online Judge Systems (OJSs) play a crucial role in evaluating SQL programming skills. However, OJSs may not accurately evaluate students’ queries as the error-detection capabilities of test sets are insufficient, resulting in false positives that can mislead students and hinder their learning. This study analyzes a large-scale OJS’s evaluation dataset and identifies more than 110,000 (1.94%) false-positive queries. It also validates existing SQL error categorization and reveals a new type of logical error called deceptive error, which occurs when students construct queries that pass specific test cases but fail to solve the actual problem. This type of error has been overlooked in previous research and can provide new insights into how to improve OJSs by enhancing test cases and feedback. This study contributes to the understanding of assessment and evaluation practices and processes in programming education, particularly the contribution that OJSs make to student learning and to course, staff, and institutional development. It also suggests error prevention and detection techniques that can improve the effectiveness and fairness of OJSs in programming education and competitions.
- 24 May 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing Education
- Vol. 24 (3) , 1-23
Open AccessFalse Positives and Deceptive Errors in SQL Assessment: A Large-Scale Analysis of Online Judge Systems
Online Judge Systems (OJSs) play a crucial role in evaluating SQL programming skills. However, OJSs may not accurately evaluate students’ queries as the error-detection capabilities of test sets are insufficient, resulting in false positives that can mislead students and hinder their learning. This study analyzes a large-scale OJS’s evaluation dataset and identifies more than 110,000 (1.94%) false-positive queries. It also validates existing SQL error categorization and reveals a new type of logical error called deceptive error, which occurs when students construct queries that pass specific test cases but fail to solve the actual problem. This type of error has been overlooked in previous research and can provide new insights into how to improve OJSs by enhancing test cases and feedback. This study contributes to the understanding of assessment and evaluation practices and processes in programming education, particularly the contribution that OJSs make to student learning and to course, staff, and institutional development. It also suggests error prevention and detection techniques that can improve the effectiveness and fairness of OJSs in programming education and competitions.
- Open Access
- 7 November 2019
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Human-Computer Interaction
- Vol. 3 (CSCW) , 1-22
Gallery D.C.: Design Search and Knowledge Discovery through Auto-created GUI Component Gallery
Online communities like Dribbble and GraphicBurger allow GUI designers to share their design artwork and learn from each other. These design sharing platforms are important sources for design inspiration, but our survey with GUI designers suggests additional information needs unmet by existing design sharing platforms. First, designers need to see the practical use of certain GUI designs in real applications, rather than just artworks. Second, designers want to see not only the overall designs but also the detailed design of the GUI components. Third, designers need advanced GUI design search abilities (e.g., multi-facets search) and knowledge discovery support (e.g., demographic investigation, cross-company design comparison). This paper presents Gallery D.C. http://mui-collection.herokuapp.com/, a gallery of GUI design components that harness GUI designs crawled from millions of real-world applications using reverse-engineering and computer vision techniques. Through a process of invisible crowdsourcing, Gallery D.C. supports novel ways for designers to collect, analyze, search, summarize and compare GUI designs on a massive scale. We quantitatively evaluate the quality of Gallery D.C. and demonstrate that Gallery D.C. offers additional support for design sharing and knowledge discovery beyond existing platforms.
- 7 November 2019
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Human-Computer Interaction
- Vol. 3 (CSCW) , 1-22
Open AccessGallery D.C.: Design Search and Knowledge Discovery through Auto-created GUI Component Gallery
Online communities like Dribbble and GraphicBurger allow GUI designers to share their design artwork and learn from each other. These design sharing platforms are important sources for design inspiration, but our survey with GUI designers suggests additional information needs unmet by existing design sharing platforms. First, designers need to see the practical use of certain GUI designs in real applications, rather than just artworks. Second, designers want to see not only the overall designs but also the detailed design of the GUI components. Third, designers need advanced GUI design search abilities (e.g., multi-facets search) and knowledge discovery support (e.g., demographic investigation, cross-company design comparison). This paper presents Gallery D.C. http://mui-collection.herokuapp.com/, a gallery of GUI design components that harness GUI designs crawled from millions of real-world applications using reverse-engineering and computer vision techniques. Through a process of invisible crowdsourcing, Gallery D.C. supports novel ways for designers to collect, analyze, search, summarize and compare GUI designs on a massive scale. We quantitatively evaluate the quality of Gallery D.C. and demonstrate that Gallery D.C. offers additional support for design sharing and knowledge discovery beyond existing platforms.
- 1 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 257-268
Know-How in Programming Tasks: From Textual Tutorials to Task-Oriented Knowledge Graph
Accomplishing a program task usually involves performing multiple activities in a logical order. Task-solving activities may have different relationships, such as subactivityof, precede-follow, and different attributes, such as location, condition, API, code. We refer to task-solving activities and their relationships and attributes as know-how knowledge. Programming task know-how knowledge is commonly documented in semi-structured textual tutorials. A formative study of the 20 top-viewed Android-tagged how-to questions on Stack Overflow suggests that developers are faced with three information barriers (incoherent modeling of task intent, tutorial information overload and unstructured task activity description) for effectively discovering and understanding task-solving knowledge in textual tutorials. Knowledge graph has been shown to be effective in representing relational knowledge and supporting knowledge search in a structured way. Unfortunately, existing knowledge graphs extract only know-what information (e.g., APIs, API caveats and API dependencies) from software documentation. In this paper, we devise open information extraction (OpenIE) techniques to extract candidates for task activities, activity attributes and activity relationships from programming task tutorials. The resulting knowledge graph, TaskKG, includes a hierarchical taxonomy of activities, three types of activities relationships and five types of activity attributes, and enables activity-centric knowledge search. As a proof-of-concept, we apply our approach to Android Developer Guide. A comprehensive evaluation of TaskKG shows high accuracy of our OpenIE techniques. A user study shows that TaskKG is promising in helping developers finding correct answers to programming how-to questions.
- 1 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 257-268
Know-How in Programming Tasks: From Textual Tutorials to Task-Oriented Knowledge Graph
Accomplishing a program task usually involves performing multiple activities in a logical order. Task-solving activities may have different relationships, such as subactivityof, precede-follow, and different attributes, such as location, condition, API, code. We refer to task-solving activities and their relationships and attributes as know-how knowledge. Programming task know-how knowledge is commonly documented in semi-structured textual tutorials. A formative study of the 20 top-viewed Android-tagged how-to questions on Stack Overflow suggests that developers are faced with three information barriers (incoherent modeling of task intent, tutorial information overload and unstructured task activity description) for effectively discovering and understanding task-solving knowledge in textual tutorials. Knowledge graph has been shown to be effective in representing relational knowledge and supporting knowledge search in a structured way. Unfortunately, existing knowledge graphs extract only know-what information (e.g., APIs, API caveats and API dependencies) from software documentation. In this paper, we devise open information extraction (OpenIE) techniques to extract candidates for task activities, activity attributes and activity relationships from programming task tutorials. The resulting knowledge graph, TaskKG, includes a hierarchical taxonomy of activities, three types of activities relationships and five types of activity attributes, and enables activity-centric knowledge search. As a proof-of-concept, we apply our approach to Android Developer Guide. A comprehensive evaluation of TaskKG shows high accuracy of our OpenIE techniques. A user study shows that TaskKG is promising in helping developers finding correct answers to programming how-to questions.
- 24 September 2017
- Published by Springer Nature
- Vol. 682, 344-351
A Hybrid BPSO-GA Algorithm for 0-1 Knapsack Problems
- 24 September 2017
- Published by Springer Nature
- Vol. 682, 344-351
A Hybrid BPSO-GA Algorithm for 0-1 Knapsack Problems
- 24 September 2017
- Published by Springer Nature
- p. 334-343
A Hybrid Central Force Optimization Algorithm for Optimizing Ontology Alignment
- 24 September 2017
- Published by Springer Nature
- p. 334-343
A Hybrid Central Force Optimization Algorithm for Optimizing Ontology Alignment
- 24 September 2017
- Published by Springer Nature
- p. 359-367
The Redundancy Problem in Composition of Parallel Finite Automata and Its Optimization Method
- 24 September 2017
- Published by Springer Nature
- p. 359-367
The Redundancy Problem in Composition of Parallel Finite Automata and Its Optimization Method