TRS Scheduling for Improved QoS Performance in Cloud System

Numerous methods are analysed in detail to improve task schedulingand data security performance in the cloud environment. The methodsinvolve scheduling according to the factors like makespan, waiting time,cost, deadline, and popularity. However, the methods are inappropriate forachieving higher scheduling performance. Regarding data security, existingmethods use various encryption schemes but introduce significant serviceinterruption. This article sketches a practical Real-time Application CentricTRS (Throughput-Resource utilization–Success) Scheduling with Data Security(RATRSDS) model by considering all these issues in task scheduling anddata security. The method identifies the required resource and their claim timeby receiving the service requests. Further, for the list of resources as services,the method computes throughput support (Thrs) according to the number ofstatements executed and the complete statements of the service. Similarly, themethod computes Resource utilization support (Ruts) according to the idletime on any duty cycle and total servicing time. Also, the method computesthe value of Success support (Sus) according to the number of completions forthe number of allocations. The method estimates the TRS score (ThroughputResource utilization Success) for different resources using all these supportmeasures. According to the value of the TRS score, the services are rankedand scheduled. On the other side, based on the requirement of service requests,the method computes Requirement Support (RS). The selection of service isperformed and allocated. Similarly, choosing the route according to the RouteSupport Measure (RSM) enforced route security. Finally, data security hasgets implemented with a service-based encryption technique. The RATRSDSscheme has claimed higher performance in data security and scheduling.

Real-Time Multi-Feature Approximation Model-Based Efficient Brain Tumor Classification Using Deep Learning Convolution Neural Network Model

The deep learning models are identified as having a significant impact on various problems.The same can be adapted to the problem of brain tumor classification.However,several deep learning models are presented earlier,but they need better classification accuracy.An efficient Multi-Feature Approximation Based Convolution Neural Network(CNN)model(MFACNN)is proposed to handle this issue.The method reads the input 3D Magnetic Resonance Imaging(MRI)images and applies Gabor filters at multiple levels.The noise-removed image has been equalized for its quality by using histogram equalization.Further,the features like white mass,grey mass,texture,and shape are extracted from the images.Extracted features are trained with deep learning Convolution Neural Network(CNN).The network has been designed with a single convolution layer towards dimensionality reduction.The texture features obtained from the brain image have been transformed into a multi-dimensional feature matrix,which has been transformed into a single-dimensional feature vector at the convolution layer.The neurons of the intermediate layer are designed to measure White Mass Texture Support(WMTS),GrayMass Texture Support(GMTS),WhiteMass Covariance Support(WMCS),GrayMass Covariance Support(GMCS),and Class Texture Adhesive Support(CTAS).In the test phase,the neurons at the intermediate layer compute the support as mentioned above values towards various classes of images.Based on that,the method adds a Multi-Variate Feature Similarity Measure(MVFSM).Based on the importance ofMVFSM,the process finds the class of brain image given and produces an efficient result.

Computer-Aided Diagnosis Model Using Machine Learning for Brain Tumor Detection and Classification

The Brain Tumor(BT)is created by an uncontrollable rise of anomalous cells in brain tissue,and it consists of 2 types of cancers they are malignant and benign tumors.The benevolent BT does not affect the neighbouring healthy and normal tissue;however,the malignant could affect the adjacent brain tissues,which results in death.Initial recognition of BT is highly significant to protecting the patient’s life.Generally,the BT can be identified through the magnetic resonance imaging(MRI)scanning technique.But the radiotherapists are not offering effective tumor segmentation in MRI images because of the position and unequal shape of the tumor in the brain.Recently,ML has prevailed against standard image processing techniques.Several studies denote the superiority of machine learning(ML)techniques over standard techniques.Therefore,this study develops novel brain tumor detection and classification model using met heuristic optimization with machine learning(BTDC-MOML)model.To accomplish the detection of brain tumor effectively,a Computer-Aided Design(CAD)model using Machine Learning(ML)technique is proposed in this research manuscript.Initially,the input image pre-processing is performed using Gaborfiltering(GF)based noise removal,contrast enhancement,and skull stripping.Next,mayfly optimization with the Kapur’s thresholding based segmentation process takes place.For feature extraction proposes,local diagonal extreme patterns(LDEP)are exploited.At last,the Extreme Gradient Boosting(XGBoost)model can be used for the BT classification process.The accuracy analysis is performed in terms of Learning accuracy,and the validation accuracy is performed to determine the efficiency of the proposed research work.The experimental validation of the proposed model demonstrates its promising performance over other existing methods.

Region Centric GL Feature Approximation Based Secure Routing for Improved QoS in MANET

Secure routing in Mobile Adhoc Network(Manet)is the key issue now a day in providing secure access to different network services.As mobile devices are used in accessing different services,performing secure routing becomes a challenging task.Towards this,different approaches exist whichfind the trusted route based on their previous transmission details and behavior of different nodes.Also,the methods focused on trust measurement based on tiny information obtained from local nodes or with global information which are incomplete.How-ever,the adversary nodes are more capable and participate in each transmission not just to steal the data also to generate numerous threats in degrading QoS(Quality of Service)parameters like throughput,packet delivery ratio,and latency of the network.This encourages us in designing efficient routing scheme to max-imize QoS performance.To solve this issue,a two stage trust verification scheme and secure routing algorithm named GL-Trust(Global-Local-Trust)is presented.The method involves in route discovery as like popular AODV(Adaptive On-demand Distance Vector)which upgrades the protocol to collect other information like transmission supported,successful transmissions,energy,mobility,the num-ber of neighbors,and the number of alternate route to the same destination and so on.Further,the method would perform global trust approximation to measure the value of global trust and perform local trust approximation to measure local trust.Using both the measures,the method would select a optimal route to perform routing.The protocol is designed to perform localized route selection when there is a link failure which supports the achievement of higher QoS performance.By incorporating different features in measuring trust value towards secure routing,the proposed GL-Trust scheme improves the performance of secure routing as well as other QoS factors.