Nasiru Muhammad Dankolo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Nasiru Muhammad Dankolo has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
Nor Haizan Mohamed Radzi
Faculty of Computing, Universiti Teknologi Malaysia, Johor Bahru, Malaysia
5 shared publicationsDanlami Gabi
Department of Computer Science, Kebbi State University of Science and Technology Aliero, Aliero, Nigeria
4 shared publicationsNoorfa Haszlinna Mustaffa
Faculty of Computing, Universiti Teknologi Malaysia, Johor Bahru, Malaysia
3 shared publications- Abubakar Ahmad Aliero
Department of Computer Science, Faculty of Computing, Abdullahi Fodio University of Science and Technology, Aliero
2 shared publications - Danlami Gabi
Department of Computer Science, Faculty of Computing, Universiti Teknologi, Malaysia, 81310 Skudai, Johor, Malaysia
2 shared publications Mohd Shukor Talib
Department of Computer Science, Faculty of Computing, Universiti Teknologi Malaysia, Johor, Malaysia
2 shared publications
Latest Publications
- 1 January 2026
- Published by Valley International in International Journal Of Engineering And Computer Science
- Vol. 15 (08) , 28869-28875
Improving Machine Translation Using an Efficient Dual-Bert Adversarial Network (DBAN) Model for User-Generated Content
Machine Translation (MT) has achieved significant progress with the emergence of Transformer-based Neural Machine Translation (NMT) models. However, translating user-generated content (UGC) remains challenging due to the presence of noisy and informal linguistic features such as abbreviations, spelling errors, slang, emojis, code-switching, and inconsistent grammatical structures. These characteristics often degrade translation quality because conventional NMT systems are primarily trained on clean and well-structured corpora. This study proposes an Efficient Dual-BERT Adversarial Network (DBAN) to improve the translation of noisy UGC by integrating contextual representation learning with adversarial training. The proposed framework employs two pretrained BERT encoders to independently learn contextual representations of source and target sentences, while a cross-attention mechanism enhances semantic alignment between both languages. An adversarial discriminator is incorporated to distinguish authentic target representations from generated representations, encouraging the model to learn robust and domain-invariant semantic features. Furthermore, parameter sharing, knowledge distillation, and layer-freezing techniques are introduced to reduce computational complexity without compromising translation performance. The proposed model was evaluated against Standard Transformer NMT and BERT-enhanced NMT using parallel corpora containing informal user-generated text. Translation performance was assessed using Bilingual Evaluation Understudy (BLEU), Metric for Evaluation of Translation with Explicit Ordering (METEOR), Translation Error Rate (TER), and robustness under noisy input conditions. Experimental results demonstrate that the proposed DBAN consistently outperforms the baseline models by producing more accurate translations, preserving semantic meaning more effectively, and exhibiting greater robustness to noisy and domain-diverse user-generated text. The integration of dual contextual encoders and adversarial learning significantly improves contextual understanding and cross-lingual semantic alignment while maintaining computational efficiency. These findings demonstrate that the proposed framework provides a practical and scalable solution for enhancing machine translation of user-generated content and contributes to the development of more robust and context-aware multilingual translation systems suitable for real-world digital communication.
- 1 January 2026
- Published by Valley International in International Journal Of Engineering And Computer Science
- Vol. 15 (08) , 28869-28875
Improving Machine Translation Using an Efficient Dual-Bert Adversarial Network (DBAN) Model for User-Generated Content
Machine Translation (MT) has achieved significant progress with the emergence of Transformer-based Neural Machine Translation (NMT) models. However, translating user-generated content (UGC) remains challenging due to the presence of noisy and informal linguistic features such as abbreviations, spelling errors, slang, emojis, code-switching, and inconsistent grammatical structures. These characteristics often degrade translation quality because conventional NMT systems are primarily trained on clean and well-structured corpora. This study proposes an Efficient Dual-BERT Adversarial Network (DBAN) to improve the translation of noisy UGC by integrating contextual representation learning with adversarial training. The proposed framework employs two pretrained BERT encoders to independently learn contextual representations of source and target sentences, while a cross-attention mechanism enhances semantic alignment between both languages. An adversarial discriminator is incorporated to distinguish authentic target representations from generated representations, encouraging the model to learn robust and domain-invariant semantic features. Furthermore, parameter sharing, knowledge distillation, and layer-freezing techniques are introduced to reduce computational complexity without compromising translation performance. The proposed model was evaluated against Standard Transformer NMT and BERT-enhanced NMT using parallel corpora containing informal user-generated text. Translation performance was assessed using Bilingual Evaluation Understudy (BLEU), Metric for Evaluation of Translation with Explicit Ordering (METEOR), Translation Error Rate (TER), and robustness under noisy input conditions. Experimental results demonstrate that the proposed DBAN consistently outperforms the baseline models by producing more accurate translations, preserving semantic meaning more effectively, and exhibiting greater robustness to noisy and domain-diverse user-generated text. The integration of dual contextual encoders and adversarial learning significantly improves contextual understanding and cross-lingual semantic alignment while maintaining computational efficiency. These findings demonstrate that the proposed framework provides a practical and scalable solution for enhancing machine translation of user-generated content and contributes to the development of more robust and context-aware multilingual translation systems suitable for real-world digital communication.
- Open Access
- 1 January 2026
- Published by Valley International in International Journal Of Engineering And Computer Science
- Vol. 15 (08) , 28869-28876
Improving Machine Translation Using an Efficient Dual-Bert Adversarial Network (DBAN) Model for User-Generated Content
Machine Translation (MT) has achieved significant progress with the emergence of Transformer-based Neural Machine Translation (NMT) models. However, translating user-generated content (UGC) remains challenging due to the presence of noisy and informal linguistic features such as abbreviations, spelling errors, slang, emojis, code-switching, and inconsistent grammatical structures. These characteristics often degrade translation quality because conventional NMT systems are primarily trained on clean and well-structured corpora. This study proposes an Efficient Dual-BERT Adversarial Network (DBAN) to improve the translation of noisy UGC by integrating contextual representation learning with adversarial training. The proposed framework employs two pretrained BERT encoders to independently learn contextual representations of source and target sentences, while a cross-attention mechanism enhances semantic alignment between both languages. An adversarial discriminator is incorporated to distinguish authentic target representations from generated representations, encouraging the model to learn robust and domain-invariant semantic features. Furthermore, parameter sharing, knowledge distillation, and layer-freezing techniques are introduced to reduce computational complexity without compromising translation performance. The proposed model was evaluated against Standard Transformer NMT and BERT-enhanced NMT using parallel corpora containing informal user-generated text. Translation performance was assessed using Bilingual Evaluation Understudy (BLEU), Metric for Evaluation of Translation with Explicit Ordering (METEOR), Translation Error Rate (TER), and robustness under noisy input conditions. Experimental results demonstrate that the proposed DBAN consistently outperforms the baseline models by producing more accurate translations, preserving semantic meaning more effectively, and exhibiting greater robustness to noisy and domain-diverse user-generated text. The integration of dual contextual encoders and adversarial learning significantly improves contextual understanding and cross-lingual semantic alignment while maintaining computational efficiency. These findings demonstrate that the proposed framework provides a practical and scalable solution for enhancing machine translation of user-generated content and contributes to the development of more robust and context-aware multilingual translation systems suitable for real-world digital communication.
- 1 January 2026
- Published by Valley International in International Journal Of Engineering And Computer Science
- Vol. 15 (08) , 28869-28876
Open AccessImproving Machine Translation Using an Efficient Dual-Bert Adversarial Network (DBAN) Model for User-Generated Content
Machine Translation (MT) has achieved significant progress with the emergence of Transformer-based Neural Machine Translation (NMT) models. However, translating user-generated content (UGC) remains challenging due to the presence of noisy and informal linguistic features such as abbreviations, spelling errors, slang, emojis, code-switching, and inconsistent grammatical structures. These characteristics often degrade translation quality because conventional NMT systems are primarily trained on clean and well-structured corpora. This study proposes an Efficient Dual-BERT Adversarial Network (DBAN) to improve the translation of noisy UGC by integrating contextual representation learning with adversarial training. The proposed framework employs two pretrained BERT encoders to independently learn contextual representations of source and target sentences, while a cross-attention mechanism enhances semantic alignment between both languages. An adversarial discriminator is incorporated to distinguish authentic target representations from generated representations, encouraging the model to learn robust and domain-invariant semantic features. Furthermore, parameter sharing, knowledge distillation, and layer-freezing techniques are introduced to reduce computational complexity without compromising translation performance. The proposed model was evaluated against Standard Transformer NMT and BERT-enhanced NMT using parallel corpora containing informal user-generated text. Translation performance was assessed using Bilingual Evaluation Understudy (BLEU), Metric for Evaluation of Translation with Explicit Ordering (METEOR), Translation Error Rate (TER), and robustness under noisy input conditions. Experimental results demonstrate that the proposed DBAN consistently outperforms the baseline models by producing more accurate translations, preserving semantic meaning more effectively, and exhibiting greater robustness to noisy and domain-diverse user-generated text. The integration of dual contextual encoders and adversarial learning significantly improves contextual understanding and cross-lingual semantic alignment while maintaining computational efficiency. These findings demonstrate that the proposed framework provides a practical and scalable solution for enhancing machine translation of user-generated content and contributes to the development of more robust and context-aware multilingual translation systems suitable for real-world digital communication.
- Open Access
- 25 April 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-23
Optimizing resource allocation for IoT applications in the edge cloud continuum using hybrid metaheuristic algorithms
The rise of Internet of Things (IoT) applications has heightened the need for efficient resource allocation across the edge-cloud continuum, combining low-latency edge nodes with high powered cloud servers. Optimizing this resource allocation is challenging, especially when balancing cost and task completion time (makespan). Traditional algorithms often fall short in these dynamic environments, leading to suboptimal solutions. This paper introduces a hybrid Flower Pollination Algorithm and Tabu Search (FPA–TS) algorithm to address IoT-specific requirements for multi objective optimization. The enhanced FPA incorporates adaptive probability based on solution diversity and dynamic levy flight control for effective global search, while Tabu Search contributes memory guided local refinement to further minimize makespan and costs. Extensive simulations with IoT scenarios show that the hybrid FPA–TS outperforms existing algorithms, offering a robust approach to optimizing resource allocation for IoT-driven applications in the edge-cloud continuum.
- 25 April 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-23
Open AccessOptimizing resource allocation for IoT applications in the edge cloud continuum using hybrid metaheuristic algorithms
The rise of Internet of Things (IoT) applications has heightened the need for efficient resource allocation across the edge-cloud continuum, combining low-latency edge nodes with high powered cloud servers. Optimizing this resource allocation is challenging, especially when balancing cost and task completion time (makespan). Traditional algorithms often fall short in these dynamic environments, leading to suboptimal solutions. This paper introduces a hybrid Flower Pollination Algorithm and Tabu Search (FPA–TS) algorithm to address IoT-specific requirements for multi objective optimization. The enhanced FPA incorporates adaptive probability based on solution diversity and dynamic levy flight control for effective global search, while Tabu Search contributes memory guided local refinement to further minimize makespan and costs. Extensive simulations with IoT scenarios show that the hybrid FPA–TS outperforms existing algorithms, offering a robust approach to optimizing resource allocation for IoT-driven applications in the edge-cloud continuum.
- 8 March 2025
- Published by Springer Nature in Neural Computing and Applications
- Vol. 37 (16) , 9861-9886
Adaptive hybrid enhanced flower pollination-based simulated annealing scheme for task scheduling in edge-cloud continuum
- 8 March 2025
- Published by Springer Nature in Neural Computing and Applications
- Vol. 37 (16) , 9861-9886
Adaptive hybrid enhanced flower pollination-based simulated annealing scheme for task scheduling in edge-cloud continuum
- Open Access
- 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 162299-162310
Enhanced Task Scheduling and Resource Allocation in Edge-Cloud Continuum Using Modified Flower Pollination Algorithm
The edge-cloud continuum integrates edge computing and cloud computing to optimize resource use and improve performance by bringing computation closer to data sources while leveraging vast cloud resources. Efficient resource allocation within this continuum is crucial for optimizing performance and minimizing delays. This paper proposes a novel approach to resource allocation using a modified Flower Pollination Algorithm (FPA). By incorporating dynamic switch probability, inertia weight for Levy flight balancing, and enhancing the initial solution using a chaotic map, the modified FPA enhances exploration and exploitation capabilities. Additionally, a network model is introduced to monitor network performance metrics, and a task dependency model ensures tasks are executed based on their dependencies. Experimental results demonstrate that the proposed approach significantly reduces delay and improves resource utilization compared to existing methods. This work provides a comprehensive framework for addressing the challenges.
- 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 162299-162310
Open AccessEnhanced Task Scheduling and Resource Allocation in Edge-Cloud Continuum Using Modified Flower Pollination Algorithm
The edge-cloud continuum integrates edge computing and cloud computing to optimize resource use and improve performance by bringing computation closer to data sources while leveraging vast cloud resources. Efficient resource allocation within this continuum is crucial for optimizing performance and minimizing delays. This paper proposes a novel approach to resource allocation using a modified Flower Pollination Algorithm (FPA). By incorporating dynamic switch probability, inertia weight for Levy flight balancing, and enhancing the initial solution using a chaotic map, the modified FPA enhances exploration and exploitation capabilities. Additionally, a network model is introduced to monitor network performance metrics, and a task dependency model ensures tasks are executed based on their dependencies. Experimental results demonstrate that the proposed approach significantly reduces delay and improves resource utilization compared to existing methods. This work provides a comprehensive framework for addressing the challenges.
- Open Access
- 25 February 2024
- Published by College of Science for Women, University of Baghdad in Baghdad Science Journal
- Vol. 21 (2(SI)) , 0740
Efficient Task Scheduling Approach in Edge-Cloud Continuum based on Flower Pollination and Improved Shuffled Frog Leaping Algorithm
The rise of edge-cloud continuum computing is a result of the growing significance of edge computing, which has become a complementary or substitute option for traditional cloud services. The convergence of networking and computers presents a notable challenge due to their distinct historical development. Task scheduling is a major challenge in the context of edge-cloud continuum computing. The selection of the execution location of tasks, is crucial in meeting the quality-of-service (QoS) requirements of applications. An efficient scheduling strategy for distributing workloads among virtual machines in the edge-cloud continuum data center is mandatory to ensure the fulfilment of QoS requirements for both customer and service provider. Existing research used metaheuristic algorithm to solve tak scheduling problem, however, must of the existing metaheuristics used suffers from falling into local mina due to their inefficiency to avoid unfeasible region in the solution search space. Therefore, there is a dire need for an efficient metaheuristic algorithm for task scheduling. This study proposed an FPA-ISFLA task scheduling model using hybrid flower pollination and improved shuffled frog leaping algorithms. The simulation results indicate that the FPA-ISFLA algorithm is superior to the PSO algorithm in terms of makespan time, resource utilization, and execution cost reduction, especially with an increasing number of tasks.
- 25 February 2024
- Published by College of Science for Women, University of Baghdad in Baghdad Science Journal
- Vol. 21 (2(SI)) , 0740
Open AccessEfficient Task Scheduling Approach in Edge-Cloud Continuum based on Flower Pollination and Improved Shuffled Frog Leaping Algorithm
The rise of edge-cloud continuum computing is a result of the growing significance of edge computing, which has become a complementary or substitute option for traditional cloud services. The convergence of networking and computers presents a notable challenge due to their distinct historical development. Task scheduling is a major challenge in the context of edge-cloud continuum computing. The selection of the execution location of tasks, is crucial in meeting the quality-of-service (QoS) requirements of applications. An efficient scheduling strategy for distributing workloads among virtual machines in the edge-cloud continuum data center is mandatory to ensure the fulfilment of QoS requirements for both customer and service provider. Existing research used metaheuristic algorithm to solve tak scheduling problem, however, must of the existing metaheuristics used suffers from falling into local mina due to their inefficiency to avoid unfeasible region in the solution search space. Therefore, there is a dire need for an efficient metaheuristic algorithm for task scheduling. This study proposed an FPA-ISFLA task scheduling model using hybrid flower pollination and improved shuffled frog leaping algorithms. The simulation results indicate that the FPA-ISFLA algorithm is superior to the PSO algorithm in terms of makespan time, resource utilization, and execution cost reduction, especially with an increasing number of tasks.
- 1 January 2023
- Published by ELS Publishing Co. Limited in Proceedings: Computer Science
- Vol. 1, 10-20
Flower pollination algorithm for dynamic task scheduling in edge-cloud continuum
In response to advancements in virtualization technologies, such as containers and virtual machines, the adoption of data-driven methodologies, and the emergence of softwaredefined networking technol...
- 1 January 2023
- Published by ELS Publishing Co. Limited in Proceedings: Computer Science
- Vol. 1, 10-20
Flower pollination algorithm for dynamic task scheduling in edge-cloud continuum
In response to advancements in virtualization technologies, such as containers and virtual machines, the adoption of data-driven methodologies, and the emergence of softwaredefined networking technol...
- Open Access
- 21 April 2022
- Published by Springer Nature in Neural Computing and Applications
- Vol. 34 (16) , 14085-14105
Dynamic scheduling of heterogeneous resources across mobile edge-cloud continuum using fruit fly-based simulated annealing optimization scheme
Achieving sustainable profit advantage, cost reduction and resource utilization are always a bottleneck for resource providers, especially when trying to meet the computing needs of resource hungry applications in mobile edge-cloud (MEC) continuum. Recent research uses metaheuristic techniques to allocate resources to large-scale applications in MECs. However, some challenges attributed to the metaheuristic techniques include entrapment at the local optima caused by premature convergence and imbalance between the local and global searches. These may affect resource allocation in MECs if continually implemented. To address these concerns and ensure efficient resource allocation in MECs, we propose a fruit fly-based simulated annealing optimization scheme (FSAOS) to serve as a potential solution. In the proposed scheme, the simulated annealing is incorporated to balance between the global and local search and to overcome its premature convergence. We also introduce a trade-off factor to allow application owners to select the best service quality that will minimize their execution cost. Implementation of the FSAOS is carried out on EdgeCloudSim Simulator tool. Simulation results show that the FSAOS can schedule resources effectively based on tasks requirement by returning minimum makespan and execution costs, and achieve better resource utilization compared to the conventional fruit fly optimization algorithm and particle swarm optimization. To further unveil how efficient the FSAOSs, a statistical analysis based on 95% confidential interval is carried out. Numerical results show that FSAOS outperforms the benchmark schemes by achieving higher confidence level. This is an indication that the proposed FSAOS can provide efficient resource allocation in MECs while meeting customers’ aspirations as well as that of the resource providers.
- 21 April 2022
- Published by Springer Nature in Neural Computing and Applications
- Vol. 34 (16) , 14085-14105
Open AccessDynamic scheduling of heterogeneous resources across mobile edge-cloud continuum using fruit fly-based simulated annealing optimization scheme
Achieving sustainable profit advantage, cost reduction and resource utilization are always a bottleneck for resource providers, especially when trying to meet the computing needs of resource hungry applications in mobile edge-cloud (MEC) continuum. Recent research uses metaheuristic techniques to allocate resources to large-scale applications in MECs. However, some challenges attributed to the metaheuristic techniques include entrapment at the local optima caused by premature convergence and imbalance between the local and global searches. These may affect resource allocation in MECs if continually implemented. To address these concerns and ensure efficient resource allocation in MECs, we propose a fruit fly-based simulated annealing optimization scheme (FSAOS) to serve as a potential solution. In the proposed scheme, the simulated annealing is incorporated to balance between the global and local search and to overcome its premature convergence. We also introduce a trade-off factor to allow application owners to select the best service quality that will minimize their execution cost. Implementation of the FSAOS is carried out on EdgeCloudSim Simulator tool. Simulation results show that the FSAOS can schedule resources effectively based on tasks requirement by returning minimum makespan and execution costs, and achieve better resource utilization compared to the conventional fruit fly optimization algorithm and particle swarm optimization. To further unveil how efficient the FSAOSs, a statistical analysis based on 95% confidential interval is carried out. Numerical results show that FSAOS outperforms the benchmark schemes by achieving higher confidence level. This is an indication that the proposed FSAOS can provide efficient resource allocation in MECs while meeting customers’ aspirations as well as that of the resource providers.
- 22 November 2017
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 1905 (1) , 040010
A study of metaheuristic algorithms for high dimensional feature selection on microarray data
Microarray systems enable experts to examine gene profile at molecular level using machine learning algorithms. It increases the potentials of classification and diagnosis of many diseases at gene expression level. Though, numerous difficulties may affect the efficiency of machine learning algorithms which includes vast number of genes features comprised in the original data. Many of these features may be unrelated to the intended analysis. Therefore, feature selection is necessary to be performed in the data pre-processing. Many feature selection algorithms are developed and applied on microarray which including the metaheuristic optimization algorithms. This paper discusses the application of the metaheuristics algorithms for feature selection in microarray dataset. This study reveals that, the algorithms have yield an interesting result with limited resources thereby saving computational expenses of machine learning algorithms.
- 22 November 2017
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 1905 (1) , 040010
A study of metaheuristic algorithms for high dimensional feature selection on microarray data
Microarray systems enable experts to examine gene profile at molecular level using machine learning algorithms. It increases the potentials of classification and diagnosis of many diseases at gene expression level. Though, numerous difficulties may affect the efficiency of machine learning algorithms which includes vast number of genes features comprised in the original data. Many of these features may be unrelated to the intended analysis. Therefore, feature selection is necessary to be performed in the data pre-processing. Many feature selection algorithms are developed and applied on microarray which including the metaheuristic optimization algorithms. This paper discusses the application of the metaheuristics algorithms for feature selection in microarray dataset. This study reveals that, the algorithms have yield an interesting result with limited resources thereby saving computational expenses of machine learning algorithms.