This study aims to optimise computing for intricate jobs within the overlapping coverage of 6G network base stations. A multi-access edge computing network model is created by solving the issues of task offloading. This model involves many base stations and IoT devices. It takes into account factors such as task delay, energy consumption, societal impacts, and economic incentives. The objective of joint optimization is to maximize the revenues of base stations and the utilities of IoT devices by considering base station price, IoT device base station selection, and job offloading mechanisms. The IoT device base station selection is addressed using a many-to-one matching game model, while pricing and task offloading interactions are managed by a two-stage approach based on Stackelberg game theory. The suggested Optimal Pricing and Best Response Algorithm (OBGT), which is based on Game Theory, successfully reaches equilibrium solutions. It demonstrates rapid convergence in simulations and improves both base station profits and IoT device utility. This study integrates data-driven mobile computing systems assurance for futuristic smart vertical networks, enhancing the efficiency of task offloading and optimization.
mobile edge computingStackelberg gameenergy consumptiontask delay
Smart Cities refer to urban areas which exploits recent technologies for improving the performance, sustainability, and livability of their infrastructure and services. Crowd Density Analysis (CDA), a vital component of Smart Cities, involves the use of sensors, cameras, and data analytics to monitor and analyze the density and movement of people in public spaces. CDA utilizing DL harnesses the control of neural networks to mechanically and exactly evaluate the density of crowds in numerous settings, mainly in smart cities. DL techniques like Recurrent Neural Network (RNN) and Convolutional Neural Network (CNN), are trained on vast datasets of crowd videos or images to learn complex designs and features. These models can forecast crowd density levels, recognize crowd anomalies, and offer real-time visions into crowd behavior. This study designs an Artificial Intelligence Driven Crowd Density Analysis for Sustainable Smart Cities (AICDA-SSC) technique. The aim of the AICDA-SSC method is to analyze the crowd density and classify it into multiple classes by the use of hyperparameter-tuned DL models. To accomplish this, the AICDA-SSC technique applies contrast enhancement using the CLAHE approach. Besides, the complex and intrinsic features can be derived by the use of the Inception v3 model and its hyperparameters can be chosen by the use of the marine predator’s algorithm (MPA). For crowd density detection and classification, the AICDA-SSC technique applies a gated recurrent unit (GRU) model. Finally, a chaotic sooty tern optimizer algorithm (CSTOA) based hyperparameter selection procedure takes place to increase the effectiveness of the GRU system. The experimental evaluation of the AICDA-SSC technique takes place on a crowd-density image dataset. The experimentation values showcase the superior performance of the AICDA-SSC method to the recently developed DL models.
IEEE Transactions on Intelligent Transportation Systems · مجلد 26 (9) · 14067-14076
The importance of vehicular networking technology has grown significantly with advancements in autonomous driving and intelligent transportation systems over cyber-physical systems (CPS). Due to its open-access environment, vehicular networking presents significant security problems in assuring message reliability and vehicle trustworthiness. To overcome this problem, this study proposes a framework for managing trust in cars for safe transportation in cyber-physical systems (T-CPS). This framework builds on existing blockchain-based trust management systems to address issues with scalability and ineffective consensus approaches. The framework is divided into three modules: message trust evaluation, vehicle trust update, and trust block generation and agreement. The message trust evaluation module evaluates message reliability by taking into account both direct and indirect vehicle trust over T-CPS. This assessment leads to the identification of misleading messages originating from malicious nodes. Within the T-CPS trust update module, the aim is to mitigate any malicious actions vehicles perform successfully by adjusting the level of trust assigned to each vehicle in T-CPS, which is determined by evaluating the messages received and considering the vehicle’s past behaviour. Ultimately, the effectiveness of the framework is confirmed through simulation studies. The experimental results show clear enhancements in scalability and resilience using the proposed algorithm.
blockchaintrust managementInternet of Vehiclescyber-physical systems
Abstract The diversity of consumer demand for take-out food has led to the characteristic structure of one order with multiple items, where the different food items in a single order are provided by two or more merchants. In the context of multi-item delivery for take-out orders with time windows, this study investigates vehicle routing for order delivery. This research aims to improve the service level of merchants and the efficiency of delivery vehicles. Food vendors receive orders from consumers through online platforms, then package the food items according to the orders. This method is a preliminary exploration of the issue of fulfilment of takeout orders on online platforms, and can provide preliminary theoretical support for decision-making on the delivery process of takeout orders on online platforms. In the context of online catering sales platforms and offline food sales merchants, this paper studies the delivery problem of takeaway orders with a time window and the characteristics of one order and multiple items, and constructs a method that takes the order delivery time requirements into account and minimizes the total order fulfilment cost. Taking into account the time window constraints of both physical restaurants and consumers, genetic algorithms are utilized to solve the order delivery problem. Finally, through case studies and experiments, the effectiveness and feasibility of the mathematical model are validated. Practical recommendations and insights are provided from the perspective of management and route planning.
time windowsvehicle routingfood delivery appsgenetic algorithm
Abstract A large number of nodes, and significant system overhead are among the challenges. To tackle these problems, a new PBFT technique known as trace-PBFT (t-PBFT) is being contemplated for adoption in the food supply chain. The PBFT algorithm, short for Practical Byzantine Fault Tolerance, serves as the fundamental algorithm. The linkages throughout the supply chain may be categorized into three primary groups. As a response to the continuing discussion over the amount of data, the status of each node is continuously updated in real time. This metric is utilized to evaluate the dependability of the principal node and to analyze the overall performance of the nodes. To minimize the amount of data transmitted between nodes, we optimized the consensus process of the first algorithm. The distinct attributes of offering collaborative food technology were considered throughout this procedure. Experimental evidence indicates that the t-PBFT approach outperforms the PBFT algorithm in terms of throughput, request delay, and information overhead. An architectural paradigm is proposed by integrating the t-PBFT algorithm with a federated network. This model was developed in response to the distinct demands of the food supply chain. This model effectively captures data at each stage of the food supply chain to ensure information tracking while preserving the safety of the food technology flow process.
Journal of Computer Science · مجلد 20 (9) · 972-985
This study presents an extensive examination of CPU scheduling algorithms, focusing on the First-Come, First-Served (FCFS), Round-Robin (RR), and Shortest-Job-First (SJF) strategies through a carefully designed scenario-based approach. By deploying a Java-based simulation to dynamically generate random process arrival and burst times, this study simulates a variety of operational conditions to test these scheduling algorithms’ adaptability and performance in environments that closely resemble real-world computing scenarios. The research aims to explore the effects of dynamic quantum size allocation on RR scheduling and assess its impact on system performance metrics such as response time and context switching overhead. Through a detailed analysis, this study seeks to provide new insights into the operational efficiency of the FCFS, RR, and SJF scheduling strategies, highlighting their strengths, limitations, and applicability across different computing environments.
process schedulingfirst come first servedround robin schedulingshortest job first scheduling
Solar radiation prediction plays a crucial role in renewable energy management, impacting various decision-making processes aimed at optimizing the utilization of solar resources and promoting sustainability. Ensemble regression methods, notably VotingRegressor, have emerged as promising tools for accurate solar radiation forecasting. By integrating predictions from multiple base estimators, ensemble methods have the potential to capture intricate patterns inherent in solar radiation data. However, achieving optimal predictive performance with ensemble methods heavily relies on the careful weighting assigned to each base estimator, presenting a significant challenge. In this study, a novel approach is presented to enhance solar radiation prediction by utilizing meta-learning techniques to optimize the weighting mechanism in the VotingRegressor ensemble. Meta-learning, a subfield of machine learning focusing on learning algorithms across different tasks, provides a systematic framework for learning to learn. This enables models to adapt and generalize more effectively to new datasets and tasks. Our proposed methodology demonstrated significant improvements, with the VotingRegressor with meta-learning techniques achieving an RMSE of 8.7343, an MAE of 5.42145, and an R² of 0.991913. These results mitigate the need for manual weight tuning and improve the adaptability of the VotingRegressor to varying solar radiation conditions, ultimately contributing to the sustainability of renewable energy systems. The methodology involves a comprehensive exploration of meta-learning techniques, encompassing gradient-based optimization, reinforcement learning, and Bayesian optimization.
solar irradiance forecastingmeta-learningensemble regressionweight optimization
Early detection of brain tumors is essential, and a biopsy is required to determine the type of tumors in the brain and is only possible after extensive brain surgery. Brain tumors can be identified and classified by clinicians with the aid of computational intelligence algorithms. Here, we developed an novel and intelligent automated system, known as, Spatial Adaptive Dart Optimized Network (SADO-Net) for the diagnosis of brain tumor using MRIs. This will allow medical professionals to identify tumors in their early stages with a high degree of accuracy. Before classifying the diseases, the preprocessed brain MRIs are segmented using the Spatial Pattern based Image Segmentation (SPISeg) technique. The type of brain tumor is then promptly and reliably identified using the Weight Optimized Deep Network (WODNet) Classification model. The adoption of the Darts Game based Optimization (DGO) method for feature reduction expedites the classification process. This work uses a range of metrics and popular public datasets such as BRATS 2018, BRATS 2019, BRATS 2020 and Figshare to compare and validate the performance of the proposed SADO-Net model in tumor identification. Based on the results, the SADO-Net model exhibits good performance, with an average accuracy of 99.2 % and a loss rate of 0.5 %.
In the face of an aging population, smart healthcare services are now within reach, thanks to the proliferation of high-speed internet and other forms of digital technology. Data problems in smart healthcare, unfortunately, put artificial intelligence in this area to serious limitations. There are several issues, including a lack of standard samples, noisy data interference, and actual data that is missing. A three-stage AI-based data generating strategy is suggested to handle missing datasets, using a small sample dataset obtained from a smart healthcare program community in a specific city: Step one involves generating the dataset's basic attributes using a tree-based generation strategy that takes the original data distribution into account. Step two involves using the Naive Bayes algorithm to create basic indicators of behavioural capability assessment for the samples. Step three builds on stage two and uses a multivariate linear regression method to create evaluation criteria and indicators of high-level behavioural capability. Six problems involving multiple classifications and two tasks using multiple labels are implemented using various neural network-based training strategies on the obtained data to assess the usefulness of the dataset for downstream tasks. To ensure that the data collected is genuine and useful, the experimental data must be analysed and expert knowledge must be included.
synthetic data generationmissing data imputationsmart healthcaredisease prevention
IEEE International Conference on Innovations in High Speed Communication and Signal Processing (IHCSP) · 1-8
In Industry 4.0, industrial robot trajectory planning requires real-time collision avoidance. This is solved by our innovative Collision Criticality (CC) LSTM-DRL approach. This work suggests navigating many landscapes with diverse barriers using deep reinforcement learning (DRL) and long-short-term memory for data analytics in high Speed Communication. The robot's current state is used by Crit LSTM DRL to estimate collision timing and obstacle CC. Obstacle courses use CC ranks. Robotics creates a fixed-dimensional vector that accurately represents reality using LSTM models. After that, the robot's current state is added to this vector to complete its perception and cognition. Deep Reinforcement Learning (DRL) optimalizes state values using input data. At each time step, Deep Reinforcement Learning (DRL) and Long Short-Term Memory (LSTM) identify the next state values for all possible actions. System operation depends on the highest value's action. We learned three environmental models in this research. A scenario with five, 10, or one to ten barriers was classified. These models were tested for adaptability to different obstacle densities. In obstacle-rich situations, researchers tested these three models' strengths and weaknesses. Testing the algorithm in various settings proves its efficacy. The program also considers the combined influence of impediments on the robot by portraying them as a joint state. CC-LSTM-DRL performs well in Industry 4.0's dynamic and challenging conditions, according to experiments. Mobile robots can confidently navigate changing environments due to their versatility and flexibility, making them ideal industrial tools.
collision avoidanceLSTMdeep reinforcement learningobstacle density
IEEE Transactions on Intelligent Transportation Systems · مجلد 26 (9) · 14029-14038
With the advancement in Tiny Machine Learning (ML) technologies, their application in enhancing unmanned aerial vehicles (UAVs) for hydraulic engineering surveying and mapping has become increasingly significant. TinyML’s integration offers a leap in processing efficiency and capabilities, particularly in addressing challenges such as UAV search and monitoring due to loss of contact or forced landings. The usage of medical cyber-physical systems in healthcare can revolutionize existing service delivery methods. The study focuses into the spatial grid mapping technique for three-dimensional information, the PTZ camera spatial grid target locking algorithm, and the UAV detection and image correction algorithm. The UAV target is processed using the surveying UAV target tracking method. TinyML techniques are essential for processing and analyzing these photos quickly. Precise UAV identification and tracking are made possible by the combination of image recognition and radar data, which are then processed using TinyML algorithms. This study explores the complexities of algorithms designed specifically for TinyML, such as tracking, UAV detection, grid mapping, and 3D grid space division. Experimental results validate the enhanced capability of this. The results show how well the proposed technique maps and surveys water conservation regions while promptly catching, locking onto, and tracking drones. The algorithm in this study betters than the YOLO, SSD, and RetinaNet algorithms in the recognition and detection of image-oriented surveying and mapping drones.
Abstract In the realm of Drug‐Target Interaction (DTI) prediction, this research investigates and contrasts the efficacy of diverse evolutionary algorithms in fine‐tuning a sophisticated hybrid deep learning model. Recognizing the critical role of DTI in drug discovery and repositioning, we tackle the challenges of binary classification by reframing the problem as a regression task. Our focus lies on the Convolution Self‐Attention Network with Attention‐based bidirectional Long Short‐Term Memory Network (CSAN‐BiLSTM‐Att), a hybrid model combining convolutional neural network (CNN) blocks, self‐attention mechanisms, and bidirectional LSTM layers. To optimize this complex model, we employ Differential Evolution (DE), Particle Swarm Optimization (PSO), Memetic Particle Swarm Optimization Algorithm (MPSOA), Fire Hawk Optimization (FHO), and Artificial Hummingbird Algorithm (AHA). Through thorough comparative analysis, we evaluate the performance of these evolutionary algorithms in enhancing the CSAN‐BiLSTM‐Att model's effectiveness. By examining the strengths and weaknesses of each algorithm, our study aims to provide valuable insights into DTI prediction, identifying the most effective evolutionary algorithm for hyperparameter tuning in advanced deep learning models. Notably, Fire‐hawk optimization (FHO) emerges as particularly promising, achieving the highest Concordance Index (C‐index) as 0.974 for KIBA datasets and 0.894 for DAVIS datasets and demonstrating exceptional accuracy in ranking continuous predictions across both the datasets.
drug-target interaction predictionevolutionary algorithmshyperparameter optimizationhybrid deep learning model
In this study, the authors proposed a pain identification model using facial expressions. An image extraction technique was developed using the liquid neural network to extract diverse images from the video files. The authors used the DenseNet 201 and MobileNet V3 models to build a hybrid feature engineering technique. They applied quantization aware training to improve the efficiency of the models. The Prkachin and Solomon Pain Intensity score was used for the image classification. They fine-tuned the LightGBM model using the random search algorithm for identifying pain from the facial images. The authors used the Denver Intensity of Spontaneous Facial Action dataset to generalize the proposed model. The performance evaluation outlined the significant performance of the proposed model in identifying pain using the images. In addition, it demands limited computational resources to identify pain. Healthcare and rehabilitation centers can implement the proposed model to provide adequate services to disabled individuals.