Saroj Kumar Pandey

Electromagnetic radiation (EMR) is increasingly utilized as a noninvasive stimulus for probing molecular processes and biomolecular signaling pathways. In this study, a two‐neuron Hopfield neural network (HNN) incorporating hyperbolic memristor‐based synapses is developed to model and analyze the dynamic behavior of molecular datasets under EMR exposure. The memristive synapses emulate molecular memory, adaptive coupling, and nonlinear interaction strengths, enabling the network to capture complex dependencies present in biochemical systems. By modulating EMR intensity, frequency, and exposure pattern, the proposed HNN reveals significant alterations in system trajectories, including shifts in chaotic regimes, transient instabilities, bifurcation behavior, and phase‐space evolution. The findings demonstrate that EMR‐driven modulation of a damaged or perturbed molecular pathway can serve as an effective control parameter for stabilizing or reshaping the global system dynamics. All computational experiments and circuit‐level validations are performed using PSpice, confirming the model’s capability to replicate EMR‐induced molecular responses with high fidelity.

Breast cancer is the most common cancer in women globally, imposing a significant burden on global public health due to high death rates. Data from the World Health Organization show an alarming annual incidence of nearly 2.3 million new cases, drawing the attention of patients, healthcare professionals, and governments alike. Through the examination of histopathological pictures, this study aims to revolutionize the early and precise identification of breast cancer by utilizing the capabilities of a deep convolutional neural network (CNN)-based model. The model’s performance is improved by including numerous classifiers, including support vector machine (SVM), decision tree, and K-nearest neighbors (KNN), using transfer learning techniques. The studies include evaluating two separate feature vectors, one with and one without principal component analysis (PCA). Extensive comparisons are made to measure the model’s performance against current deep learning models, including critical metrics such as false positive rate, true positive rate, accuracy, precision, and recall. The data show that the SVM algorithm with PCA features achieves excellent speed and accuracy, with an amazing accuracy of 99.5%. Furthermore, although being somewhat slower than SVM, the decision tree model has the greatest accuracy of 99.4% without PCA. This study suggests a viable strategy for improving early breast cancer diagnosis, opening the path for more effective healthcare treatments and better patient outcomes.

Air quality prediction is a critical component in environmental monitoring and public health management. Traditional forecasting methods often fall short in capturing the complex, non-linear interactions among various atmospheric factors. This paper introduces a novel approach to air quality prediction that leverages a combination of advanced machine learning techniques, including Long Short-Term Memory (LSTM) networks, and other deep learning models alongside robust optimization strategies. By integrating statistical models, deep learning, and machine learning algorithms, we aim to significantly enhance the accuracy and reliability of air quality forecasts. Our methodology employs an ensemble of models, such as LSTM, convolutional neural networks (CNNs), and gradient boosting machines (GBMs), to capture both temporal and spatial dependencies in air quality metrics. To further refine predictions, we incorporate various optimization techniques that improve the performance and efficiency of the learning process. Comparative analysis with traditional methods demonstrates the superiority of our approach in terms of prediction accuracy and computational efficiency. The results indicate a marked improvement in forecasting capabilities, which can be instrumental in devising timely interventions and mitigating adverse health effects associated with poor air quality. This research not only advances the state-of-the-art in air quality prediction but also provides a scalable framework applicable to other environmental monitoring applications.

Wireless sensor networks (WSNs) have emerged as a promising technology in healthcare, enabling continuous patient monitoring and early disease detection. This study introduces an innovative approach to WSN data collection tailored for disease detection through signal processing in healthcare scenarios. The proposed strategy leverages the DANA (data aggregation using neighborhood analysis) algorithm and a semi-supervised clustering-based model to enhance the precision and effectiveness of data collection in healthcare WSNs. The DANA algorithm optimizes energy consumption and prolongs sensor node lifetimes by dynamically adjusting communication routes based on the network’s real-time conditions. Additionally, the semi-supervised clustering model utilizes both labeled and unlabeled data to create a more robust and adaptable clustering technique. Through extensive simulations and practical deployments, our experimental assessments demonstrate the remarkable efficacy of the proposed method and model. We conducted a comparative analysis of data collection efficiency, energy utilization, and disease detection accuracy against conventional techniques, revealing significant improvements in data quality, energy efficiency, and rapid disease diagnosis. This combined approach of the DANA algorithm and the semi-supervised clustering-based model offers healthcare WSNs a compelling solution to enhance responsiveness and reliability in disease diagnosis through signal processing. This research contributes to the advancement of healthcare monitoring systems by offering a promising avenue for early diagnosis and improved patient care, ultimately transforming the landscape of healthcare through enhanced signal processing capabilities.

Wheeled mobile robots (WMRs) have been a focus of research for several decades, particularly concerning navigation strategies in static and dynamic environments. This review article carefully examines the extensive academic efforts spanning several decades addressing navigational complexities in the context of WMR route analysis. Several approaches have been explored by various researchers, with a notable emphasis on the inclusion of stability and intelligent capabilities in WMR controllers attracting the attention of the academic community. This study traces historical and contemporary WMR research, including the establishment of kinetic stability and the construction of intelligent WMR controllers. WMRs have gained prominence in various applications, with precise navigation and efficient control forming the basic prerequisites for their effective performance. The review presents a comprehensive overview of stability analysis and navigation techniques tailored for WMRs. Initially, the exposition covers the basic principles of WMR dynamics and kinematics, explaining the different wheel types and their associated constraints. Subsequently, various stability analysis approaches, such as Lyapunov stability analysis and passivation-based control, are discussed in depth in the context of WMRs. Starting an exploration of navigation techniques, the review highlights important aspects including path planning and obstacle avoidance, localization and mapping, and trajectory tracking. These techniques are carefully examined in both indoor and outdoor settings, revealing their benefits and limitations. Finally, the review ends with a comprehensive discussion of the current challenges and possible routes in the field of WMR. The discourse includes the fusion of advanced sensors and state-of-the-art control algorithms, the cultivation of more robust and reliable navigation strategies, and the continued exploration of novel WMR applications. This article also looks at the progress of mobile robotics during the previous three decades. Motion planning and path analysis techniques that work with single and multiple mobile robots have been discussed extensively. One common theme in this research is the use of soft computing methods to give mobile robot controllers cognitive behaviors, such as artificial neural networks (ANNs), fuzzy logic control (FLC), and genetic algorithms (GAs). Nevertheless, there is still a dearth of applications for mobile robot navigation that leverage nature-inspired algorithms, such as firefly and ant colony algorithms. Remarkably, most studies have focused on kinematics analysis, with a small number also addressing dynamics analysis.

The continuously evolving world of cloud computing presents new challenges in resource allocation as dispersed systems struggle with overloaded conditions. In this regard, we introduce OptiDJS+, a cutting-edge enhanced dynamic Johnson sequencing algorithm made to successfully handle resource scheduling challenges in cloud computing settings. With a solid foundation in the dynamic Johnson sequencing algorithm, OptiDJS+ builds upon it to suit the demands of modern cloud infrastructures. OptiDJS+ makes use of sophisticated optimization algorithms, heuristic approaches, and adaptive mechanisms to improve resource allocation, workload distribution, and task scheduling. To obtain the best performance, this strategy uses historical data, dynamic resource reconfiguration, and adaptation to changing workloads. It accomplishes this by utilizing real-time monitoring and machine learning. It takes factors like load balance and make-up into account. We outline the design philosophies, implementation specifics, and empirical assessments of OptiDJS+ in this work. Through rigorous testing and benchmarking against cutting-edge scheduling algorithms, we show the better performance and resilience of OptiDJS+ in terms of reaction times, resource utilization, and scalability. The outcomes underline its success in reducing resource contention and raising service quality generally in cloud computing environments. In contexts where there is distributed overloading, OptiDJS+ offers a significant advancement in the search for effective resource scheduling solutions. Its versatility, optimization skills, and improved decision-making procedures make it a viable tool for tackling the resource allocation issues that cloud service providers and consumers encounter daily. We think that OptiDJS+ opens the way for more dependable and effective cloud computing ecosystems, assisting in the full realization of cloud technologies’ promises across a range of application areas. In order to use the OptiDJS+ Johnson sequencing algorithm for cloud computing task scheduling, we provide a two-step procedure. After examining the links between the jobs, we generate a Gantt chart. The Gantt chart graph is then changed into a two-machine OptiDJS+ Johnson sequencing problem by assigning tasks to servers. The OptiDJS+ dynamic Johnson sequencing approach is then used to minimize the time span and find the best sequence of operations on each server. Through extensive simulations and testing, we evaluate the performance of our proposed OptiDJS+ dynamic Johnson sequencing approach with two servers to that of current scheduling techniques. The results demonstrate that our technique greatly improves performance in terms of makespan reduction and resource utilization. The recommended approach also demonstrates its ability to scale and is effective at resolving challenging work scheduling problems in cloud computing environments.