Prediction of Lubricant Physicochemical Properties Based on Gaussian Copula Data Expansion

The composition of base oils affects the performance of lubricants made from them.This paper proposes a hybrid model based on gradient-boosted decision tree(GBDT)to analyze the effect of different ratios of KN4010,PAO40,and PriEco3000 component in a composite base oil system on the performance of lubricants.The study was conducted under small laboratory sample conditions,and a data expansion method using the Gaussian Copula function was proposed to improve the prediction ability of the hybrid model.The study also compared four optimization algorithms,sticky mushroom algorithm(SMA),genetic algorithm(GA),whale optimization algorithm(WOA),and seagull optimization algorithm(SOA),to predict the kinematic viscosity at 40℃,kinematic viscosity at 100℃,viscosity index,and oxidation induction time performance of the lubricant.The results showed that the Gaussian Copula function data expansion method improved the prediction ability of the hybrid model in the case of small samples.The SOA-GBDT hybrid model had the fastest convergence speed for the samples and the best prediction effect,with determination coefficients(R^(2))for the four indicators of lubricants reaching 0.98,0.99,0.96 and 0.96,respectively.Thus,this model can significantly reduce the model’s prediction error and has good prediction ability.

Improvised Seagull Optimization Algorithm for Scheduling Tasks in Heterogeneous Cloud Environment

Well organized datacentres with interconnected servers constitute the cloud computing infrastructure.User requests are submitted through an interface to these servers that provide service to them in an on-demand basis.The scientific applications that get executed at cloud by making use of the heterogeneous resources being allocated to them in a dynamic manner are grouped under NP hard problem category.Task scheduling in cloud poses numerous challenges impacting the cloud performance.If not handled properly,user satisfaction becomes questionable.More recently researchers had come up with meta-heuristic type of solutions for enriching the task scheduling activity in the cloud environment.The prime aim of task scheduling is to utilize the resources available in an optimal manner and reduce the time span of task execution.An improvised seagull optimization algorithm which combines the features of the Cuckoo search(CS)and seagull optimization algorithm(SOA)had been proposed in this work to enhance the performance of the scheduling activity inside the cloud computing environment.The proposed algorithm aims to minimize the cost and time parameters that are spent during task scheduling in the heterogeneous cloud environment.Performance evaluation of the proposed algorithm had been performed using the Cloudsim 3.0 toolkit by comparing it with Multi objective-Ant Colony Optimization(MO-ACO),ACO and Min-Min algorithms.The proposed SOA-CS technique had produced an improvement of 1.06%,4.2%,and 2.4%for makespan and had reduced the overall cost to the extent of 1.74%,3.93%and 2.77%when compared with PSO,ACO,IDEA algorithms respectively when 300 vms are considered.The comparative simulation results obtained had shown that the proposed improvised seagull optimization algorithm fares better than other contemporaries.

Task Offloading and Resource Allocation in IoT Based Mobile Edge Computing Using Deep Learning

Recently,computation offloading has become an effective method for overcoming the constraint of a mobile device(MD)using computationintensivemobile and offloading delay-sensitive application tasks to the remote cloud-based data center.Smart city benefitted from offloading to edge point.Consider a mobile edge computing(MEC)network in multiple regions.They comprise N MDs and many access points,in which everyMDhasM independent real-time tasks.This study designs a new Task Offloading and Resource Allocation in IoT-based MEC using Deep Learning with Seagull Optimization(TORA-DLSGO)algorithm.The proposed TORA-DLSGO technique addresses the resource management issue in the MEC server,which enables an optimum offloading decision to minimize the system cost.In addition,an objective function is derived based on minimizing energy consumption subject to the latency requirements and restricted resources.The TORA-DLSGO technique uses the deep belief network(DBN)model for optimum offloading decision-making.Finally,the SGO algorithm is used for the parameter tuning of the DBN model.The simulation results exemplify that the TORA-DLSGO technique outperformed the existing model in reducing client overhead in the MEC systems with a maximum reward of 0.8967.

Sailfish Optimization with Deep Learning Based Oral Cancer Classification Model

Recently,computer aided diagnosis(CAD)model becomes an effective tool for decision making in healthcare sector.The advances in computer vision and artificial intelligence(AI)techniques have resulted in the effective design of CAD models,which enables to detection of the existence of diseases using various imaging modalities.Oral cancer(OC)has commonly occurred in head and neck globally.Earlier identification of OC enables to improve survival rate and reduce mortality rate.Therefore,the design of CAD model for OC detection and classification becomes essential.Therefore,this study introduces a novel Computer Aided Diagnosis for OC using Sailfish Optimization with Fusion based Classification(CADOC-SFOFC)model.The proposed CADOC-SFOFC model determines the existence of OC on the medical images.To accomplish this,a fusion based feature extraction process is carried out by the use of VGGNet-16 and Residual Network(ResNet)model.Besides,feature vectors are fused and passed into the extreme learning machine(ELM)model for classification process.Moreover,SFO algorithm is utilized for effective parameter selection of the ELM model,consequently resulting in enhanced performance.The experimental analysis of the CADOC-SFOFC model was tested on Kaggle dataset and the results reported the betterment of the CADOC-SFOFC model over the compared methods with maximum accuracy of 98.11%.Therefore,the CADOC-SFOFC model has maximum potential as an inexpensive and non-invasive tool which supports screening process and enhances the detection efficiency.

High philopatry rates of Yellow-legged Gulls in the southeastern part of the Bay of Biscay

Background:Philopatry rate is one of the main factors shaping population dynamics in colonial seabirds.Low rates of philopatry are linked to populations with high dispersal,while high rates are linked to populations with a very high spatial structure pattern(i.e.,metapopulations).The Cantabrian Yellow-legged Gull(Larus michahellis)population is considered to be resident,with relatively low dispersal rates.Precise estimations of its philopatry rates are however still lacking.Here,we aimed to estimate philopatry rates in the main Yellow-legged Gull colonies of the province of Gipuzkoa,in the southeastern part of the Bay of Biscay.Methods:We analysed 734 resightings,during the breeding season at the colonies of Getaria,Santa Clara and Ulia,relative to a total of 3245 individuals ringed at birth in these same colonies during a period of 13 years.These data were analysed using Multi-State Recapture models in MARK.Results:After controlling survival and resighting probability,the average dispersal rate among colonies was 4%(±SD=2%)when individuals are immature,decreasing to 1±1%)for adult breeding gulls(i.e.,philopatry rate was 99%).Annual survival rates were assessed to be 0.27±0.02 for birds in their first year of life and 0.87±0.01 for older individuals.The probability of observing immature birds in the colonies was 0.08±0.01,as compared to 0.21±0.02 in adult birds.Conclusions:We obtained evidence of extremely high local philopatry rates,clearly within the upper limit found in gulls.A high philopatry favour a speciation in these species who are vulnerable to obtain the main food source(land-fills and fishing discard)which are transforming under new ecological process.

Graph-based robot optimal path planning with bio-inspired algorithms

Recently,bio-inspired algorithms have been increasingly explored for autonomous robot path planning on grid-based maps.However,these approaches endure performance degradation as problem complexity increases,often resulting in lengthy search times to find an optimal solution.This limitation is particularly critical for real-world applications like autonomous off-road vehicles,where highquality path computation is essential for energy efficiency.To address these challenges,this paper proposes a new graph-based optimal path planning approach that leverages a sort of bio-inspired algorithm,improved seagull optimization algorithm(iSOA)for rapid path planning of autonomous robots.A modified Douglas–Peucker(mDP)algorithm is developed to approximate irregular obstacles as polygonal obstacles based on the environment image in rough terrains.The resulting mDPderived graph is then modeled using a Maklink graph theory.By applying the iSOA approach,the trajectory of an autonomous robot in the workspace is optimized.Additionally,a Bezier-curve-based smoothing approach is developed to generate safer and smoother trajectories while adhering to curvature constraints.The proposed model is validated through simulated experiments undertaken in various real-world settings,and its performance is compared with state-of-the-art algorithms.The experimental results demonstrate that the proposed model outperforms existing approaches in terms of time cost and path length.