Publication Search

Combinatorial optimization is a fundamental area in operations research and computer science, focusing on identifying optimal solutions from a finite set of possibilities. This study explores the integration of branch and bound methods with heuristic algorithms to address optimization problems in graph theory and discrete mathematics. Python was employed for algorithm implementation due to its flexibility and comprehensive computational libraries, enabling efficient data analysis and visualization. Several benchmark problems were examined, including the Traveling Salesman Problem (TSP), Minimum Spanning Tree (MST), and Graph Coloring. Simulations were conducted using datasets of varying sizes (small, medium, and large) to evaluate performance across different scales. The results demonstrate that the hybrid approach achieves a balance between solution quality and computational efficiency, outperforming brute-force methods in terms of speed while maintaining near-optimal accuracy. Tabulated results and graphical comparisons highlight the reduction in computation time and improved scalability of the proposed method. The findings suggest that combining systematic search strategies with heuristics offers a practical and effective framework for solving complex combinatorial optimization problems. Recommendations for future research include testing scalability with larger datasets, incorporating advanced metaheuristics, and applying the approach to real-world domains such as logistics and network design.

This research explores the use of iterative methods in conjunction with the Finite Difference Method (FDM) for solving partial differential equations (PDE). The central challenge addressed is the computational inefficiency and slow convergence that often arise when utilizing traditional numerical methods, particularly in large-scale systems. The study aims to develop a more efficient iterative approach to solve PDEs by minimizing computational time while ensuring the stability of the obtained solutions. The primary methods proposed include iterative solvers such as Gauss-Seidel and Successive Over-Relaxation (SOR), which are applied to numerical solutions derived from FDM. The research demonstrates that iterative methods, especially SOR, achieve faster convergence with fewer iterations compared to conventional methods like the Finite Element Method (FEM), which tends to be slower and more resource-intensive for large-scale problems. The study highlights the advantages of iterative solvers in efficiently handling large, sparse linear systems and reducing computational costs. In addition, it shows that these methods are capable of providing stable solutions, thereby maintaining accuracy with significantly lower computational effort. The results suggest that iterative methods, when applied in combination with FDM, offer a practical and scalable solution for solving complex PDEs. These methods are especially beneficial in engineering and theoretical physics applications where large-scale simulations are prevalent. The study concludes with recommendations for future research, which should focus on further optimizing solver parameters, exploring hybrid approaches, and extending the methods to more complex PDEs with non-linearities or irregular geometries. By doing so, these techniques could contribute to even more efficient and practical solutions for real-world applications.

This paper explores the Time-Based One-Time Password (TOTP) authentication mechanism enhanced with lightweight cryptographic algorithms, presenting it as an advanced solution to the limitations of traditional OTP systems. There are a lot of applications and systems where this mechanism is applied. For example, bank applications, e-commerce websites, access control system, healthcare system, etc. TOTP generates dynamic, time-sensitive passwords using the current time and a secret key processed through a cryptographic hash function, significantly improving security by reducing vulnerabilities to code reused and interception. The adoption of lightweight algorithms ensures that TOTP can be efficiently implemented on resource-constrained devices, such as those on the Internet of Things (IoT) ecosystem. Despite its benefits, TOTP faces challenges including synchronization issues between client devices and servers, and a trade-off between computational efficiency and security strength. This paper discusses the implications of these challenges and evaluates how TOTP, with appropriate design considerations, can provide a robust, secure, and efficient authentication method suitable for various applications, from digital banking to IoT environments.

Big data has revolutionized the landscape of natural sciences by providing extensive datasets that enable deeper insights and more accurate predictions. However, effectively analyzing such vast and complex data requires optimized machine learning algorithms tailored to specific applications. This study focuses on enhancing the performance of machine learning models in big data analysis for applications in natural sciences. The research aims to identify key optimization techniques, including feature selection, hyperparameter tuning, and algorithm customization, to improve model accuracy and computational efficiency. A combination of supervised and unsupervised learning approaches was applied to real-world datasets in fields such as climate science, genomics, and ecology. The findings demonstrate significant improvements in predictive accuracy and processing speed, highlighting the potential of optimized machine learning techniques in solving complex problems in natural sciences. The implications of this research extend to more efficient resource utilization and improved decision-making in scientific exploration and environmental management.

Quantum computing offers promising alternatives to classical approaches for solving complex linear algebra problems. This paper presents a comparative study of the performance of quantum algorithms versus classical algorithms in solving systems of linear equations and matrix operations. Through simulation and analysis, we demonstrate that while quantum computing holds advantages in specific problem sets, classical computing remains efficient for general applications. These findings highlight the current limitations and potential of quantum computing.

The rapid growth of data-intensive applications has posed significant challenges for classical machine learning (ML) algorithms, particularly in terms of computational efficiency and scalability. This study explores the role of quantum computing in optimizing machine learning performance through the implementation of Quantum Machine Learning (QML), specifically using the Quantum Support Vector Machine (QSVM) model. The research adopts a Design Science Research approach, involving problem identification, model development, system implementation, and performance evaluation. Both classical Support Vector Machine (SVM) and QSVM models are developed and tested using benchmark classification datasets. The results indicate that QSVM outperforms the classical SVM model across multiple evaluation metrics, including accuracy, precision, recall, and F1-score. Additionally, QSVM demonstrates improved computational efficiency by reducing training time, particularly when handling high-dimensional data. These improvements are attributed to the ability of quantum computing to utilize quantum kernel methods and map data into higher-dimensional feature spaces, enabling better pattern recognition and classification performance.  Despite these promising outcomes, the study also identifies several limitations related to current quantum hardware, such as noise, decoherence, and limited qubit availability, which may affect scalability and practical implementation. Therefore, further research is required to enhance quantum hardware reliability and develop hybrid quantum-classical models. In conclusion, quantum machine learning offers a promising solution to overcome the limitations of classical approaches, providing enhanced performance and efficiency for complex data processing tasks in future intelligent systems.

This paper explores the use of genetic algorithms (GAs) for optimizing nonlinear systems in resource allocation. By simulating various allocation scenarios, we demonstrate the efficiency of GAs in finding near-optimal solutions in complex environments. The study provides a comparison of GA performance against traditional optimization methods and identifies scenarios where GAs outperform. The results emphasize the utility of GAs in real-world applications, especially when conventional approaches struggle with large solution spaces.

This study compares different machine learning models for time series forecasting in financial data analysis. Models including ARIMA, LSTM, and GRU are applied to predict stock price movements. We measure the accuracy and computational efficiency of each model on various datasets and discuss their strengths and weaknesses in financial forecasting contexts. The findings suggest that deep learning models show significant improvement in capturing complex temporal patterns over traditional methods.

This study explores the integration of hybrid AI control models, combining reinforcement learning (RL) and robust adaptive control, to improve the adaptability, performance, and stability of autonomous manufacturing systems. Traditional control systems, while effective under stable conditions, often struggle to cope with disturbances and varying production demands. Hybrid AI models, which integrate classical control methods such as Proportional Integral Derivative (PID) with machine learning techniques like RL, deep Q-networks (DQN), and deep deterministic policy gradient (DDPG), enhance decision-making capabilities in dynamic production environments. The study develops a hybrid RL robust control framework and tests it in both simulation and real-world scenarios. Performance metrics, including production efficiency, system stability, and adaptability, are assessed under various disturbance conditions, such as machine failures and fluctuating demands. The hybrid model significantly outperforms traditional PID control in terms of efficiency and stability, demonstrating faster convergence and better adaptability in dynamic environments. Statistical analysis confirms the superiority of the hybrid system over standalone RL models and traditional PID control. This model’s scalability and adaptability make it a promising solution for Industry 4.0 applications, addressing key challenges in real-world manufacturing systems by ensuring computational efficiency and the ability to manage large-scale data. The findings contribute to the development of more robust and efficient control strategies for autonomous manufacturing systems in uncertain environments.

This paper introduces a hybrid optimization approach that combines genetic algorithms with gradient descent for effective nonlinear function approximation in highdimensional data. Traditional methods struggle with computational efficiency and accuracy in such complex spaces. By integrating genetic algorithms to provide a global search strategy with gradient descent for finetuning, the proposed method achieves faster convergence and improved accuracy. Simulations and case studies demonstrate its effectiveness in applications like data mining, image recognition, and financial modeling.

Artificial Intelligence (AI)-based Decision Support Systems (DSS) have become a central component of digital transformation initiatives across various industries. While prior studies have primarily emphasized technical aspects such as accuracy, performance, and computational efficiency, less attention has been given to the integration of human-centered principles and scalable architectural design. This study aims to examine how AI-based DSS can be enhanced through the combined application of Human-Centered Artificial Intelligence (HCAI) principles and scalable AI architecture. Using a qualitative, literature-based research methodology, this study systematically analyzes peer-reviewed publications indexed in Scopus to identify key dimensions influencing the effectiveness and sustainability of AI-driven DSS. The findings indicate that technical capabilities alone are insufficient to ensure successful adoption and long term impact. Instead, transparency, explainability, ethical governance, and user empowerment core elements of HCAI are critical for fostering trust and user acceptance. Furthermore, scalable architectural principles, including modularity, interoperability, and adaptability, are essential for enabling AI-based DSS to operate reliably in large-scale and dynamic environments. This study contributes a unified conceptual framework that bridges technical scalability and human-centered design, offering theoretical insights and practical guidance for developing trustworthy, scalable, and sustainable AI-based Decision Support Systems in digital transformation contexts.