Ahmad Nasikun
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
Research Subjects
Ahmad Nasikun has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Klaus Hildebrandt
Computer Graphics and Visualization Lab, TU Delft, Delft, The Netherlands
2 shared publications - Achmad Rio Dessiar
Universitas Gadjah Mada
1 shared publication - Canggih Puspo Wibowo
Department of Electrical Engineering and Information Technology Faculty of Engineering Universitas Gadjah Mada (UGM) Yogyakarta Indonesia
1 shared publication Christopher Brandt
Delft University of Technology
1 shared publication- Dimas Agil Marenda
Department of Electrical Engineering and Information Technology Faculty of Engineering Universitas Gadjah Mada (UGM) Yogyakarta Indonesia
1 shared publication - Dyonisius Dony Ariananda
Universitas Gadjah Mada
1 shared publication
Latest Publications
- 13 October 2025
- Published by Trans Tech Publications, Ltd. in Engineering Headway
- Vol. 27, 356-363
Memoria: A Serious Game for Enhancing Short-Term Memory in Residual Schizophrenia
Schizophrenia is a highly debilitating mental disorder, disrupting the thought processes, emotions, and behaviors of those afflicted, often blurring the line between reality and imagination. Residual schizophrenia is a specific subtype of Schizophrenia, in which the patients experience short-term memory impairment that hinders their ability to think and carry out daily activities. We have developed an innovative method to boost short-term memory in residual schizophrenia patients. Our approach takes the form of a serious game, named Memoria, developed using GDLC (Game Development Life Cycle) framework. During the treatment, participants are tasked to navigate a specific path, aiming to memorize it once the path traversal is completed. Over the course of five consecutive days, participants engage with Memoria, and we compare their short- term memory capabilities before and after the treatment. Our findings indicate a significant improvement in short-term memory for those who underwent the treatment (8.44 points, 9.40%), in contrast to those who did not (1.55 points, 1.69%).
- 13 October 2025
- Published by Trans Tech Publications, Ltd. in Engineering Headway
- Vol. 27, 356-363
Memoria: A Serious Game for Enhancing Short-Term Memory in Residual Schizophrenia
Schizophrenia is a highly debilitating mental disorder, disrupting the thought processes, emotions, and behaviors of those afflicted, often blurring the line between reality and imagination. Residual schizophrenia is a specific subtype of Schizophrenia, in which the patients experience short-term memory impairment that hinders their ability to think and carry out daily activities. We have developed an innovative method to boost short-term memory in residual schizophrenia patients. Our approach takes the form of a serious game, named Memoria, developed using GDLC (Game Development Life Cycle) framework. During the treatment, participants are tasked to navigate a specific path, aiming to memorize it once the path traversal is completed. Over the course of five consecutive days, participants engage with Memoria, and we compare their short- term memory capabilities before and after the treatment. Our findings indicate a significant improvement in short-term memory for those who underwent the treatment (8.44 points, 9.40%), in contrast to those who did not (1.55 points, 1.69%).
- Open Access
- 1 July 2025
- Published by Institute of Advanced Engineering and Science in Indonesian Journal of Electrical Engineering and Computer Science
- Vol. 39 (1) , 545-553
HangeulVR: an immersive and interactive Korean alphabet learning on virtual reality
Learning a new foreign language promises numerous benefits, such are career advantage, culture exposure, and traveling opportunity. However, it comes with a cost of considerably significant efforts and time commitment. The challenge intensifies when dealing with languages characterized by distinctive scripts, such as Hangeul in Korean language. The requisite mastery of Hangeul characters precedes the exploration of fundamental linguistic elements, including grammar, pronunciation, speaking, and writing. In this research, we propose an innovative, immersive, and interactive methodology for Hangeul acquisition employing virtual reality (VR). Our study transports participants into a virtual environment, guided by a gamification framework designed to facilitate Hangeul learning. Participants are able to learn basic pronunciation, listening, and Hangeul writing, three fundamental aspects of learning the Korean alphabet. Empirical findings from our experiments show the potential of its usage, indicated by its system usability scale (SUS) of 74.4.
- 1 July 2025
- Published by Institute of Advanced Engineering and Science in Indonesian Journal of Electrical Engineering and Computer Science
- Vol. 39 (1) , 545-553
Open AccessHangeulVR: an immersive and interactive Korean alphabet learning on virtual reality
Learning a new foreign language promises numerous benefits, such are career advantage, culture exposure, and traveling opportunity. However, it comes with a cost of considerably significant efforts and time commitment. The challenge intensifies when dealing with languages characterized by distinctive scripts, such as Hangeul in Korean language. The requisite mastery of Hangeul characters precedes the exploration of fundamental linguistic elements, including grammar, pronunciation, speaking, and writing. In this research, we propose an innovative, immersive, and interactive methodology for Hangeul acquisition employing virtual reality (VR). Our study transports participants into a virtual environment, guided by a gamification framework designed to facilitate Hangeul learning. Participants are able to learn basic pronunciation, listening, and Hangeul writing, three fundamental aspects of learning the Korean alphabet. Empirical findings from our experiments show the potential of its usage, indicated by its system usability scale (SUS) of 74.4.
- Open Access
- 23 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-11
A Fast Geometric Multigrid Method for Curved Surfaces
- 23 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessA Fast Geometric Multigrid Method for Curved Surfaces
- Open Access
- 4 January 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 41 (2) , 1-14
The Hierarchical Subspace Iteration Method for Laplace–Beltrami Eigenproblems
Sparse eigenproblems are important for various applications in computer graphics. The spectrum and eigenfunctions of the Laplace–Beltrami operator, for example, are fundamental for methods in shape analysis and mesh processing. The Subspace Iteration Method is a robust solver for these problems. In practice, however, Lanczos schemes are often faster. In this article, we introduce the Hierarchical Subspace Iteration Method (HSIM) , a novel solver for sparse eigenproblems that operates on a hierarchy of nested vector spaces. The hierarchy is constructed such that on the coarsest space all eigenpairs can be computed with a dense eigensolver. HSIM uses these eigenpairs as initialization and iterates from coarse to fine over the hierarchy. On each level, subspace iterations, initialized with the solution from the previous level, are used to approximate the eigenpairs. This approach substantially reduces the number of iterations needed on the finest grid compared to the non-hierarchical Subspace Iteration Method. Our experiments show that HSIM can solve Laplace–Beltrami eigenproblems on meshes faster than state-of-the-art methods based on Lanczos iterations, preconditioned conjugate gradients, and subspace iterations.
- 4 January 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 41 (2) , 1-14
Open AccessThe Hierarchical Subspace Iteration Method for Laplace–Beltrami Eigenproblems
Sparse eigenproblems are important for various applications in computer graphics. The spectrum and eigenfunctions of the Laplace–Beltrami operator, for example, are fundamental for methods in shape analysis and mesh processing. The Subspace Iteration Method is a robust solver for these problems. In practice, however, Lanczos schemes are often faster. In this article, we introduce the Hierarchical Subspace Iteration Method (HSIM) , a novel solver for sparse eigenproblems that operates on a hierarchy of nested vector spaces. The hierarchy is constructed such that on the coarsest space all eigenpairs can be computed with a dense eigensolver. HSIM uses these eigenpairs as initialization and iterates from coarse to fine over the hierarchy. On each level, subspace iterations, initialized with the solution from the previous level, are used to approximate the eigenpairs. This approach substantially reduces the number of iterations needed on the finest grid compared to the non-hierarchical Subspace Iteration Method. Our experiments show that HSIM can solve Laplace–Beltrami eigenproblems on meshes faster than state-of-the-art methods based on Lanczos iterations, preconditioned conjugate gradients, and subspace iterations.
- 8 August 2018
- Published by Wiley in Computer Graphics Forum
- Vol. 37 (5) , 121-134
Fast Approximation of Laplace‐Beltrami Eigenproblems
The spectrum and eigenfunctions of the Laplace‐Beltrami operator are at the heart of effective schemes for a variety of problems in geometry processing. A burden attached to these spectral methods is that they need to numerically solve a large‐scale eigenvalue problem, which results in costly precomputation. In this paper, we address this problem by proposing a fast approximation algorithm for the lowest part of the spectrum of the Laplace‐Beltrami operator. Our experiments indicate that the resulting spectra well‐approximate reference spectra, which are computed with state‐of‐the‐art eigensolvers. Moreover, we demonstrate that for different applications that comparable results are produced with the approximate and the reference spectra and eigenfunctions. The benefits of the proposed algorithm are that the cost for computing the approximate spectra is just a fraction of the cost required for numerically solving the eigenvalue problems, the storage requirements are reduced and evaluation times are lower. Our approach can help to substantially reduce the computational burden attached to spectral methods for geometry processing.
- 8 August 2018
- Published by Wiley in Computer Graphics Forum
- Vol. 37 (5) , 121-134
Fast Approximation of Laplace‐Beltrami Eigenproblems
The spectrum and eigenfunctions of the Laplace‐Beltrami operator are at the heart of effective schemes for a variety of problems in geometry processing. A burden attached to these spectral methods is that they need to numerically solve a large‐scale eigenvalue problem, which results in costly precomputation. In this paper, we address this problem by proposing a fast approximation algorithm for the lowest part of the spectrum of the Laplace‐Beltrami operator. Our experiments indicate that the resulting spectra well‐approximate reference spectra, which are computed with state‐of‐the‐art eigensolvers. Moreover, we demonstrate that for different applications that comparable results are produced with the approximate and the reference spectra and eigenfunctions. The benefits of the proposed algorithm are that the cost for computing the approximate spectra is just a fraction of the cost required for numerically solving the eigenvalue problems, the storage requirements are reduced and evaluation times are lower. Our approach can help to substantially reduce the computational burden attached to spectral methods for geometry processing.
- Open Access
Digitory, A Smart Way of Learning Islamic History in Digital Era
In this paper, we would like to propose our web-based application for Islamic history learning system, named Digitory-Digital History. There are two main navigations to browse historical stories on the web. One is location-based navigation using on-line map which gives users access to understand events during Islamic introduction to Indonesia based on the location. Alternatively, users can browse on time base using sliding navigation marked timely, so they can comprehend history in time sequence. Implementing semantic web, this web-app can suggest users related articles, either based on time series, location similarities, or time-domain similarities, and also suggest pictures related to the articles. AJAX strengthen the real-time access and interactivity as users navigate around the web. By the end of this research, we will have the web-app prototype completed with its fundamental location-based navigation, semantic relationship among articles and pictures, and time- based navigation system. As the web-app deployed, we have some volunteers to try our application so that we can evaluate its result, particularly its effectiveness.
Open AccessDigitory, A Smart Way of Learning Islamic History in Digital Era
In this paper, we would like to propose our web-based application for Islamic history learning system, named Digitory-Digital History. There are two main navigations to browse historical stories on the web. One is location-based navigation using on-line map which gives users access to understand events during Islamic introduction to Indonesia based on the location. Alternatively, users can browse on time base using sliding navigation marked timely, so they can comprehend history in time sequence. Implementing semantic web, this web-app can suggest users related articles, either based on time series, location similarities, or time-domain similarities, and also suggest pictures related to the articles. AJAX strengthen the real-time access and interactivity as users navigate around the web. By the end of this research, we will have the web-app prototype completed with its fundamental location-based navigation, semantic relationship among articles and pictures, and time- based navigation system. As the web-app deployed, we have some volunteers to try our application so that we can evaluate its result, particularly its effectiveness.