As data volumes have increased and difficulty in tackling vast and complicated problems has emerged, the need for innovative and intelligent solutions to handle these difficulties has become essential. Data clustering is a data mining approach that clusters a huge amount of data into a number of clusters; in other words, it finds symmetric and asymmetric objects. In this study, we developed a novel strategy that uses intelligent optimization algorithms to tackle a group of issues requiring sophisticated methods to solve. Three primary components are employed in the suggested technique, named GNDDMOA: Dwarf Mongoose Optimization Algorithm (DMOA), Generalized Normal Distribution (GNF), and Opposition-based Learning Strategy (OBL). These parts are used to organize the executions of the proposed method during the optimization process based on a unique transition mechanism to address the critical limitations of the original methods. Twenty-three test functions and eight data clustering tasks were utilized to evaluate the performance of the suggested method. The suggested method’s findings were compared to other well-known approaches. In all of the benchmark functions examined, the suggested GNDDMOA approach produced the best results. It performed very well in data clustering applications showing promising performance.

For future wireless communication, millimeter wave (mmWave) coupled with the massive multiple-input multiple-output (MIMO) are key technologies to overcome the huge data rate requirements. Although massive MIMO greatly improves the spectral efficiency (SE) of the system, the use of large antenna arrays not only increases the computational complexity it may also decrease the energy efficiency. Focusing on improvement in energy efficiency, we propose a low-complexity solution for joint transmit antenna selection and hybrid precoder design for multi-user mmWave Massive MIMO communication systems. Particularly, considering a partially connected hybrid architecture, binary particle swarm optimization and deep neural network (DNN) algorithms are employed for transmit antenna selection and analog precoder design, respectively. Results show that the proposed solution performs very close, in terms of spectral efficiency, to the optimal exhaustive search based antenna selection and singular value decomposition based precoder design with lower computational complexity. It is also shown that the proposed solution also improves the energy efficiency of the system. Finally, the proposed solution is not very sensitive to channel imperfections.

Resource allocation in software projects is a critical challenge, with inefficiencies in handling dynamic constraints such as skill mismatches, evolving task dependencies, and budget overruns leading to widespread cost and schedule overruns. To address these issues, this paper introduces CAMP-GNN, a novel constraint-aware graph neural network (GNN) framework designed to optimize resource allocation in software projects, addressing challenges like skill mismatches, evolving task dependencies, and budget overruns. These issues often lead to significant cost and schedule overruns, and CAMP-GNN aims to resolve them by dynamically adapting to project constraints. The framework integrates urgency, skill alignment, and budget slack directly into its message-passing layers, allowing for more precise and context-aware task-resource assignments. A key contribution is SoftStat, the first structured dataset that combines resource pools, allocations, and project details, enabling the modeling of complex task-resource dependencies and financial/temporal constraints. CAMP-GNN also introduces domain-specific message aggregation rules to unify urgency, skill alignment, and budget slack, advancing GNNs beyond basic relational modeling. A novel preprocessing pipeline is proposed to convert raw project timelines, skill dependencies, and budget thresholds into machine-learnable features, ensuring effective integration with computational models. Validated on both synthetic and real-world datasets, CAMP-GNN demonstrates superior performance with a 0.12 MAE, RMSE of 0.18 in allocation, F1 of 0.89 in budget violations, and 085 in deadline violations, 18% cost savings, and a 27% reduction in deadline breaches, outperforming existing methods. Future work will focus on scaling the framework for large-scale projects and improving interpretability for broader adoption.

This study investigates the application of a Bidirectional Long Short-Term Memory (BiLSTM) model for Human Activity Recognition (HAR) using the PAMAP2 dataset. The aim was to enhance the accuracy and efficiency of recognizing daily activities captured by wearable sensors. The proposed BiLSTM-based model achieved outstanding performance, with 98.75% training accuracy and 99.27% validation accuracy. It also demonstrated high precision, recall, and F1 scores (all 0.99). Comparative analysis with state-of-the-art models, including Deep-HAR and CNN-BiLSTM-BiGRU, revealed that the proposed BiLSTM model surpassed their performance. These results highlight the potential of the proposed approach for real-time HAR applications in edge computing, particularly where accurate and efficient activity recognition is crucial.

Precision Agriculture (PA) techniques employing Internet of Things (IoT) can significantly improve crop yields and enhance productivity. Radio frequency identification (RFID) based IoT systems can enhance precision livestock farming by enabling livestock traceability and identification in large farms, but congestion is a major challenge. In such conditions, livestock estimation using RFID is a complex task because of high chances of tag collision due to significant increase in interference at the gates. Several anti-collision algorithms have been explored in recent past to address this issue with the aid of a single antenna. However, the throughput gains from a single antenna are limited particularly for dense scenarios like gates at a small ruminant farm. Therefore, we propose a multi-antenna RFID reader system with a dynamic frame slotted ALOHA (DFSA) anti-collision algorithm to address the tag collision problem by exploiting the spatial diversity of the multiple inputs and multiple outputs (MIMO) backscattering channel. The proposed technique is simulated in MATLAB for several tag population figures both with and without interference actions of various intensities. Results have shown that significant throughput gains can be achieved, in comparison with gains attained by anti-collision algorithms based on a single antenna. The simulation testbed enables us to evaluate the proposed technique for multiple receive antenna configurations.