https://publikasi.dinus.ac.id/jcta/issue/feed Journal of Computing Theories and Applications 2026-11-30T00:00:00+00:00 JTCA Editorial editorial.jcta@dinus.id Open Journal Systems <div style="border: 3px #086338 Dashed; padding: 10px; background-color: #ffffff; text-align: left;"> <ol> <li><strong>Journal Title </strong>: Journal of Computing Theories and Applications</li> <li><strong>Online ISSN </strong>: <a href="https://portal.issn.org/resource/ISSN/3024-9104">3024-9104</a> </li> <li><strong>Frequency </strong>: Quarterly (February, May, August, and November) </li> <li><strong>DOI Prefix</strong>: 10.62411/jcta</li> <li><strong>Publisher </strong>: Universitas Dian Nuswantoro</li> </ol> </div> <div id="focusAndScope"> <p><strong data-start="133" data-end="190">Journal of Computing Theories and Applications (JCTA)</strong> is a peer-reviewed international journal that covers all aspects of foundations, theories, and applications in computer science. All accepted articles are published online, assigned a <strong data-start="527" data-end="547">DOI via Crossref</strong>, and made <strong data-start="558" data-end="593" data-is-only-node="">freely accessible (Open Access)</strong>. The journal follows a rapid editorial and peer-review process. Authors typically receive the first decision within one week, while the overall first-round peer-review process is generally completed within four weeks.</p> <p>Artificial Intelligence<br />Big Data<br />Bioinformatics<br />Biometrics<br />Cloud Computing<br />Computer Graphics<br />Computer Vision<br />Cryptography<br />Data Mining<br />Fuzzy Systems<br />Game Technology<br />Image Processing<br />Information Security<br />Internet of Things<br />Intelligent Systems<br />Machine Learning<br />Mobile Computing<br />Multimedia Technology<br />Natural Language Processing<br />Network Security<br />Pattern Recognition<br />Quantum Informatics<br />Signal Processing<br />Soft Computing<br />Speech Processing</p> <p><br />Special emphasis is given to recent trends related to cutting-edge research within the domain.</p> </div> https://publikasi.dinus.ac.id/jcta/article/view/16538 CAMMRF: A Conflict-Aware Missing-Modality Robust Fusion Framework for Multimodal Sentiment Analysis under Heterogeneous Observability 2026-07-16T07:53:22+00:00 Kajal Chourasiya kajalchourasiya9798@gmail.com Parul Saxena gaur1parul2007@mitsgwalior.in Praphula Kumar Jain praphulajain@mitsgwalior.in <p>Multimodal sentiment analysis combines linguistic, acoustic, and visual evidence, yet deployment commonly violates the benchmark assumption that every modality is present and mutually consistent. Missing-modality systems generally reconstruct absent channels while conflict-aware systems generally assume full observation, even though absence and disagreement both change how far an observed modality should be trusted. We therefore treat the two jointly and hypothesise that conditioning modality reliability on both availability and cross-modal compatibility, and applying it across aligned and disagreement-preserving representations, yields more consistent performance across observability regimes than matched fusion controls without this coupling. We introduce CAMMRF, a framework that couples a mask- and peer-conditioned reliability estimator, an alignment/conflict subspace decomposition, and stochastic modality dropout with cross-view consistency. We evaluate one frozen protocol on the official CMU-MOSI train/validation/test partitions under eight observability regimes; five independent training seeds (42, 43, 44, 45, and 46) completed, each retaining predictions, checkpoints, and logs. In the full-modality regime CAMMRF is best on all four metrics simultaneously—MAE 1.050 ± 0.028, Pearson correlation 0.593 ± 0.009, weighted F1 75.01 ± 1.72%, and Acc-2 74.91 ± 1.80%—rather than on accuracy alone, and it ranks first by mean Acc-2 in 5 of eight regimes. The advantage persists when audio or vision is missing and under the controlled conflict stress (mean Acc-2 73.81%, a 1.10-point decrease, with matching small changes in MAE, weighted F1, and correlation); however, all four metrics degrade together when text is absent—correlation most steeply—so robustness is regime-dependent rather than universal. Full-budget ablations show that several component removals improve full-observation point estimates, supporting an accuracy–robustness trade-off rather than an independent-component claim. The evidence is limited to one corpus and controlled surrogate baselines and does not establish external generalisation. A single Colab notebook regenerates the protocol and exports a machine-readable result registry.</p> 2026-09-11T00:00:00+00:00 Copyright (c) 2026 Kajal Chourasiya, Parul Saxena, Praphula Kumar Jain https://publikasi.dinus.ac.id/jcta/article/view/17214 Exhaustive Entanglement-Topology Enumeration and Edge-Vertex-Level Attribution in Quantum Feature Map Design for Classification 2026-07-13T09:21:23+00:00 Natanael Natanael natanael@calvin.ac.id Hendrik Sugiarto hendrik.sugiarto@calvin.ac.id Yozef Tjandra yozef.tjandra@calvin.ac.id <p>Quantum kernel methods encode classical data into quantum states using specially designed feature-map circuits and then train a classical SVM on the resulting kernel matrix. Prior studies of entanglement structure typically compare only a few basic topologies, such as linear, circular, and full entanglement, leaving the broader space of entanglement graphs largely unexplored. This study exhaustively evaluates all possible entanglement topologies of a TwoLocal feature map and benchmarks them against classical methods and standard quantum feature maps on two synthetic datasets (Adhoc3_150 and Adhoc4_150) and two real-world datasets (Blood and Banknote). On Adhoc4_150, the best TwoLocal topology achieves an accuracy of 0.7556, matching Pauli Z; on Blood, it reaches 0.6889, exceeding RBF SVM and Pauli Z at 0.6667; and on Banknote, it achieves 1.0000, compared with 0.9778 for RBF SVM. In contrast, Random Forest achieves the highest accuracy on Adhoc3_150 at 0.8222, exceeding all evaluated quantum configurations. Across all four datasets, increasing the number of entangling pairs does not consistently improve accuracy, while the standard linear, circular, and full Pauli ZZ topologies never outperform Pauli Z. To further characterize this behavior, we propose a factorial linear modeling approach that quantifies the contribution of individual entanglement edges and qubit connectivity to classification accuracy. On Adhoc4_150, two edges exhibit significant negative effects, whereas Blood and Banknote show both significant positive and negative edge effects. The q0q1 edge is significant across all three four-feature datasets but reverses direction across datasets. These results indicate that the effect of entanglement depends jointly on the feature-map architecture, dataset, and specific qubit connections rather than on entanglement density alone. The proposed framework can also be applied to sampled topology sets, providing a basis for targeted entanglement analysis beyond exhaustively enumerable low-qubit systems.</p> 2026-09-11T00:00:00+00:00 Copyright (c) 2026 Natanael, Hendrik Sugiarto, Yozef Tjandra https://publikasi.dinus.ac.id/jcta/article/view/17476 Beyond Reported Accuracy: A Verifiability-Focused, Multi-Axis Review of Content and Context Based Fake News Detection 2026-07-31T02:22:38+00:00 Long Dinh Tuan dinhtuanlong@hou.edu.vn Le Ngoc An anln@hou.edu.vn Duong Dinh Thai dinhthaiduong123456@gmail.com <p class="abstractJCTA">Fake news undermines information integrity, and the proliferation of large language models (LLMs) has intensified both its generation and its detection. Prior surveys catalogue methods but rarely verify the performance figures they synthesize, restrict comparison to same-benchmark settings, or assess risk of bias, so reported accuracies are often over-read. This verifiability-focused review analyzes an enumerated, non-exhaustive corpus of 45 content- and context-based detection studies (2018-2025; 42 quantitative-core) in which each reported headline metric is traced to its primary source and confirmed against it wherever the source is accessible (36 of 45; the nine paywalled studies are flagged as reported-but-unconfirmed), and released with the corpus. Studies are grouped into five method families, Transformer/PLM (31.0%), multimodal (26.2%), LLM-based (21.4%), graph/propagation (16.7%), and traditional machine learning (4.8%), and interpreted through a four-axis framework of evidence source, detection time, data dependence, and deployment objective. Without metric conversion or pooling, reported accuracies are strongly heterogeneous and not comparable across families (Transformer 74.8-99.36%, multimodal 82.4-99.97%, graph 84.4-94.36% or 0.75-0.93 AUC, LLM-based 48.6-89.0%); within Weibo, seven multimodal models span 82.4-91.8%, and GPT-4 attains 68.2% (not the ~95% often cited) on LIAR-binary. Three findings follow. First, reported performance appears shaped as much by data and evaluation design as by architecture, so architecture-only interpretations can be misleading; near-perfect results may reflect dataset-specific separability, leakage, or favorable evaluation designs rather than superior transferable capability. Second, the field has evolved cumulatively from static content cues toward multi-source evidence integration and reasoning, so the families are complementary evidence sources rather than exclusive choices. Third, no family is optimal across scenarios, and a central open problem is sustaining reliability under drift, new languages, attacks, and AI-generated content. We derive a dependency-ordered research agenda and, from a Vietnamese case study, transferable design principles for low-resource languages.</p> 2026-09-11T00:00:00+00:00 Copyright (c) 2026 Long Dinh Tuan, Le Ngoc An, Dinh Thai Duong https://publikasi.dinus.ac.id/jcta/article/view/17721 Explainable Machine Learning for Predicting Indonesian Vocational School Accreditation: Geographic Validation, Probability Calibration, and Subgroup Auditing 2026-08-26T06:31:15+00:00 Muhamad Riyan Maulana muhamadriyan.2025@student.uny.ac.id Putu Sudira putupanji@uny.ac.id Priyanto Priyanto priyanto@uny.ac.id Yanuar Agung Fadlullah yanuaragung.2025@student.uny.ac.id Dian Nurdiana dian.nurdiana@ecampus.ut.ac.id Amir Hamzah bin Sofhi @ Subhi jurnaledd@gmail.com <p class="abstractJCTA">Vocational school accreditation is a high-stakes institutional classification, yet the geographic transferability and probability reliability of models based on routinely collected administrative data remain underexplored. This study developed a reproducible, leakage-controlled machine-learning framework for classifying the recorded accreditation classes C, B, and A among Indonesian vocational schools. Its main contribution is an integrated evaluation design that combines province-disjoint validation, probability calibration, cluster-aware uncertainty, and subgroup auditing to test reliability beyond conventional random-validation performance. A cross-sectional dataset containing 149,376 program-level records was deterministically aggregated into 14,391 schools, including 14,134 with valid labels. Eight provinces comprising 1,536 schools were locked before feature selection, model comparison, tuning, and calibration; 12,598 schools from 31 provinces supported development. The selected CatBoost model used 35 structural and vocational features with grouped out-of-fold temperature scaling. On the locked holdout, the calibrated model achieved balanced accuracy of 0.586, Macro F1 of 0.533, quadratic weighted kappa of 0.499, Macro ROC-AUC of 0.757, and expected calibration error of 0.049. School size, teacher resources, vocational staffing, program diversity, and status were most in-fluential. Class B had the lowest recall, and performance varied across school groups and provinces. The framework supports calibrated, auditable preliminary screening, but not automated accreditation or replacement of professional assessors.</p> 2026-09-12T00:00:00+00:00 Copyright (c) 2026 Muhamad Riyan Maulana, Putu Sudira, Priyanto, Yanuar Agung Fadlullah, Dian Nurdiana, Amir Hamzah bin Sofhi @ Subhi