Search

Clouds are crucial in regulating the Earth's energy budget. Global cloud top heights have been easily retrieved from satellite measurements, but there are few methods for determining cloud base height (CBH) from satellite measurements. The Cloud Base Altitude Spatial Extrapolator (CBASE) algorithm was proposed to derive the height of the lower-troposphere liquid cloud base by using the Cloud-Aerosol Lidar with Orthogonal polarization cloud aerosol LiDAR (CALIOP) profiles and weather observations at airports from aviation routine and special weather report (METARs and SPECIs, called METAR) observation data in the United States. A modification to the CBASE algorithm over China (CNMETAR-CBASE) is presented in this paper. In this paper, the ability of the CBASE algorithm to calculate CBH in China is evaluated, and METAR observations over China (CNMETAR) were then used to modify the CBASE algorithm. The results including CNMETAR observation data in China can better retrieve CBH over China compared with the results using the original CBASE algorithm, and the accuracy of the global CBH results has been improved. Overestimations of CBH with the original algorithm range from 500 to 800 m in China, which have been reduced to about 300 m with an improved algorithm. The deviations calculated by the algorithm also have a significant reduction, from 480 m (CBASE) to 420 m (CNMETAR-CBASE). In conclusion, the modified CBASE algorithm not only calculates the CBH more accurately in China but also improves the results of the global CBH retrieved from satellites. [ABSTRACT FROM AUTHOR]

As enterprises increasingly rely on cloud-based Human Resource Management Systems (HRMS) deployed on the Hadoop platform, the optimization of weighting algorithms becomes imperative to enhance system efficiency. This paper addresses the complex challenge of load balancing in the cloud environment by proposing Effective Load Balancing Strategy (ELBS) a hybrid optimization approach that integrates both Genetic Algorithm (GA) and Grey Wolf Optimization (GWO). The optimization objective involves the allocation of N jobs submitted by cloud users to M processing units, each characterized by a Processing Unit Vector (PUV). The PUV encapsulates critical parameters such as Million Instructions Per Second (MIPS), execution cost α, and delay cost L. Concurrently, each job submitted by a cloud user is represented by a Job Unit Vector (JUV), considering service type, number of instructions (NIC), job arrival time (AT), and worst-case completion time (wc). The proposed hybrid GA-GWO aims to minimize a cost function ζ, incorporating weighted factors of execution cost and delay cost. The challenge lies in determining optimal weights, a task addressed by assigning user preferences or importance as weights. The hybrid algorithm iteratively evolves populations of processing units, applying genetic operators, such as crossover and mutation, along with the exploration capabilities of GWO, to efficiently explore the solution space. This research contributes a comprehensive algorithmic solution to the optimization of weighting algorithms in enterprise HRMS on the cloud and Hadoop platform. The adaptability of the hybrid ELBS to dynamic cloud environments and its efficacy in handling complex optimization problems position it as a promising tool for achieving load balancing in HRMS applications. The proposed approach provides a foundation for further empirical validation and implementation in practical enterprise settings. [ABSTRACT FROM AUTHOR]

INTRODUCTION: In present days, Automation of everything has become essential. Internet of things (IoT) play an important role among all medical advances of IT. In this paper, feasible solutions are discussed to compare and design better healthcare systems. A thorough investigation and survey of suitable approaches were done to select IoT based systems in hospitals consisting of various high precision sensors. OBJECTIVES: The challenge healthcare system face is to manage the real time patient’s data with high accuracy. Second challenge is at fog devices level to manage the load distribution to all sensors with limited availability of bandwidth. METHODS: This paper summarizes the selection criterions of suitable load balancing algorithms to reduce energy consumption and computational cost of fog devices and increase the network usage that are supposed to be used in IoT based healthcare systems. According to the survey BNBKnapack algorithm has been selected as best suitable approach to analyze the overall performance of fog devices and results are also verify the same. RESULTS: Comparative analysis of Overall performance of fog devices has been proposed with using SJF algorithm and Adaptive BNBKnapsack algorithm. It has been observed by analysing system performance, which is found as best among other load balancing algorithm Adaptive BNBKnapsack is successfully reduce the energy consumption by (99.29%), computational cost by (98.34%) and increase the network usage by (99.95%) of system CONCLUSION: It has been observed by analysing system performance, Adaptive BNBKnapsack Load balancing is successfully able to reduce the computational cost and energy consumption also increase the network usage of the fog network. The performance of the system is found best among other load balancing algorithm. [ABSTRACT FROM AUTHOR]

Co-resident attacks are serious security threats in multi-tenant public cloud platforms. They are often implemented by building side channels between virtual machines (VMs) hosted on the same cloud server. Traditional defense methods are troubled by the deployment cost. The existing tenant classification methods can hardly cope with the real dataset that is quite large and extremely unevenly distributed, and may have problems in the processing speed considering the computation complexity of the DBSCAN algorithm. In this paper, we propose a novel co-resident attack defense strategy which solve these problems through an improved and efficient multi-level clustering algorithm and semi-supervised classification method. We propose a novel multi-level clustering algorithm which can efficiently reduce the complexity, since only a few parameter adjustments are required. Built on the proposed clustering algorithm, a semi-supervised classification model is designed. The experimental results of the classification effect and training speed show that our model achieves F-scores of over 85% and is significantly faster than traditional SVM classification methods. Based on the classification of unlabeled tenants into different security groups, the cloud service provider may modify the VM placement policy to achieve physical isolation among different groups, reducing the co-residency probability between attackers and target tenants. Experiments are conducted on a large-scale dataset collected from Azure Cloud Platform. The results show that the proposed model achieves 97.86% accuracy and an average 96.06% F-score, proving the effectiveness and feasibility of the proposed defense strategy. [ABSTRACT FROM AUTHOR]

Offloading computation-intensive tasks of an application from a mobile device to a remote computation resource can improve the runtime of the application as well as improve the lifetime of the mobile device's battery. However, computation offloading is a complex endeavour: remote computation resources in the cloud and in the fog have different computation capabilities and costs, and the network bandwidth and latency between different resources need to be taken into account. In addition, the mobile device would ideally like to offload multiple applications simultaneously, further adding to the complexity of assigning different tasks of each application to available computation resources. In this paper, we introduce an open-source versatile computation offloading simulator (OVCOSim), capable of simulating and optimizing offloading multiple applications to different cloud and fog resources and visualizing the outcome for users. We demonstrate how OVCOSim can be used to optimize assignment of tasks to computation resources to accommodate different user objectives, runtime, battery life, cost, or a combination of these objectives, using a variety of assignment algorithms. We also provide several examples to demonstrate how OVCOSim can be used, as well as validate its functionality. [ABSTRACT FROM AUTHOR]

These days, cloud computing usage has been increasing with the rapid growth of Internet coverage all over the world to serve as a pay-per-use model using shared computing resources. Internet of Things (IoT) is a growing technology which is used in different applications and it needs cloud computing however the distance between cloud computing resources and the end system in IoT can cause a delay which is intolerable for delay-sensitive applications. Fog computing is a computing resource between cloud computing and end system to reduce the delay for the delay-sensitive applications in IoT. Therefore, load balancing functionality is a significant role to provide the required quality of service (QoS), quality of experience (QoE), and performance. Load balancing can be done based on response time, throughput, energy consumption, and utilization metrics. In this paper, the papers published in Elsevier, ACM, IEEE, Springer and Wiley between 2018 and 2022 have been examined to extract the load-balancing algorithms, system architecture, tools and applications, advantages and disadvantages. This review is useful for those working on load-balancing performance improvement. [ABSTRACT FROM AUTHOR]

Cloud computing is a dynamic and rapidly evolving field, where the demand for resources fluctuates continuously. This paper delves into the imperative need for adaptability in the allocation of resources to applications and services within cloud computing environments. The motivation stems from the pressing issue of accommodating fluctuating levels of user demand efficiently. By adhering to the proposed resource allocation method, we aim to achieve a substantial reduction in energy consumption. This reduction hinges on the precise and efficient allocation of resources to the tasks that require those most, aligning with the broader goal of sustainable and eco-friendly cloud computing systems. To enhance the resource allocation process, we introduce a novel knowledge-based optimization algorithm. In this study, we rigorously evaluate its efficacy by comparing it to existing algorithms, including the Flower Pollination Algorithm (FPA), Spark Lion Whale Optimization (SLWO), and Firefly Algorithm. Our findings reveal that our proposed algorithm, Knowledge Based Flower Pollination Algorithm (KBFPA), consistently outperforms these conventional methods in both resource allocation efficiency and energy consumption reduction. This paper underscores the profound significance of resource allocation in the realm of cloud computing. By addressing the critical issue of adaptability and energy efficiency, it lays the groundwork for a more sustainable future in cloud computing systems. Our contribution to the field lies in the introduction of a new resource allocation strategy, offering the potential for significantly improved efficiency and sustainability within cloud computing infrastructures. [ABSTRACT FROM AUTHOR]

The rapid development of mobile Internet has promoted the rapid rise of cloud computing technology. Mobile terminal devices have greatly expanded the service capacity of mobile terminals by migrating complex computing tasks to run in the cloud. However, in the process of data exchange between mobile terminals and cloud computing centers, on the one hand, it consumes the limited power of mobile terminals, and on the other hand, it results in longer communication time, which negatively affects user QoE. Mobile cloud can effectively improve user QoE by shortening the data transmission distance, reducing the power consumption, and shortening the communication time at the same time. In this paper, we utilize the property that genetic algorithm can perform global search seeking the global optimal solution and construct a dynamic task scheduling model by combining the device-cloud link. The task scheduling model based on genetic algorithm and random scheduling algorithm is compared through comparison experiments, which show that the assignment time of the task scheduling model based on genetic algorithm is shortened by 11.82% to 48.51% and the energy consumption is reduced by 22.28% to 47.52% under different load conditions. [ABSTRACT FROM AUTHOR]

The advancements in computing and storage capabilities of machines and their fusion with new technologies like the Internet of Thing (IoT), 5G networks, and artificial intelligence, to name a few, has resulted in a paradigm shift in the way computing is done in a cloud environment. In addition, the ever‐increasing user demand for cloud services and resources has resulted in cloud service providers (CSPs) expanding the scale of their data center facilities. This has increased energy consumption leading to more carbon dioxide emission levels. Hence, it becomes all the more important to design scheduling algorithms that optimize the use of cloud resources with minimum energy consumption. This paper surveys state‐of‐the‐art algorithms for scheduling workflow tasks to cloud resources with a focus on reducing energy consumption. For this, we categorize different workflow scheduling algorithms based on the scheduling approaches used and provide an analytical discussion of the algorithms covered in the paper. Further, we provide a detailed classification of different energy‐efficient strategies used by CSPs for energy saving in data centers. Finally, we describe some of the popular real‐world workflow applications as well as highlight important emerging trends and open issues in cloud computing for future research directions. [ABSTRACT FROM AUTHOR]

Cloud computing and the increasing popularity of 5G have greatly increased the application of images on Internet of Things (IoT) devices. The storage of images on an untrusted cloud has high security and privacy risks. Several lightweight cryptosystems have been proposed in the literature as appropriate for resource-constrained IoT devices. These existing lightweight cryptosystems are, however, not only at the risk of compromising the integrity and security of the data but also, due to the use of substitution boxes (S-boxes), require more memory space for their implementation. In this paper, a secure lightweight cryptography algorithm, that eliminates the use of an S-box, has been proposed. An algorithm termed Enc, that accepts a block of size n divides the block into L n R bits of equal length and outputs the encrypted block as follows: E = L ⨂ R ⨁ R , where ⨂ and ⨁ are exclusive-or and concatenation operators, respectively, was created. A hash result, h a s R = S H A 256 P ⨁ K , was obtained, where SHA256, P, and K are the Secure Hash Algorithm (SHA−256), the encryption key, and plain image, respectively. A seed, S, generated from e n c h a s h = E n c h a s h e n c , K , where hashenc is the first n bits of hasR, was used to generate a random image, Rim. An intermediate image, i n t i m a g e = R i m ⨂ P , and cipher image, C = E n c i n t i m a g e , K , were obtained. The proposed scheme was evaluated for encryption quality, decryption quality, system sensitivity, and statistical analyses using various security metrics. The results of the evaluation showed that the proposed scheme has excellent encryption and decryption qualities that are very sensitive to changes in both key and plain images, and resistance to various statistical attacks alongside other security attacks. Based on the result of the security evaluation of the proposed cryptosystem termed Hash XOR Permutation (HXP), the study concluded that the security of the cryptography algorithm can still be maintained without the use of a substitution box. [ABSTRACT FROM AUTHOR]

The overwhelming growth of cloud computing has introduced new challenges for the cloud infrastructure. Many cloud service providers (CSPs) have been adopting renewable energy (RE) sources to increase profitability and reduce carbon emissions. Therefore, recent literature focuses on managing cloud infrastructure with RE sources in addition to traditional non-renewable energy (NRE) sources whenever required. However, these works aim to maximize the usage of RE or minimize the cost without considering the uncertainty (UN). This paper presents three user request-based scheduling algorithms, namely UN-based future-aware best fit, UN-based round-robin, and UN-based highest available renewable first, by managing the UN of RE and NRE. These algorithms consider two types of UN, namely UN-RE and UN-NRE, concerning the user request. The proposed algorithms undergo a rigorous simulation process with 200 to 2000 user requests and 20 to 200 datacenters and are compared using overall cost, UN cost and time, and the number of used RE resources. [ABSTRACT FROM AUTHOR]

Due to easier access, improved performance, and lower costs, the use of cloud services has increased dramatically. However, cloud service providers are still looking for ways to complete users' jobs at a high speed to increase profits and reduce energy consumption costs. To achieve such a goal, many algorithms for scheduling problem have been introduced. However, most techniques consider an objective in the scheduling process. This paper presents a new hybrid multi-objective algorithm, called SMO_ACO, for addressing the scheduling problem. The proposed SMO_ACO algorithm combines Spider Monkey Optimization (SMO) and Ant Colony Optimization (ACO) algorithm. Additionally, a fitness function is formulated to tackle 4 objectives of the scheduling problem. The proposed fitness function considers parameters like schedule length, execution cost, consumed energy, and resource utilization. The proposed algorithm is implemented using the Cloud Sim toolkit and evaluated for different workloads. The performance of the proposed technique is verified using several performance metrics and the results are compared with the most recent existing algorithms. The results prove that the proposed SMO_ACO approach allocates resources efficiently while maintaining cloud performance that increases profits. [ABSTRACT FROM AUTHOR]

To address the challenge of distinguishing the health status of bearings, in this paper, a health index (HI) is developed through utilization of the multiple target time-varying black widow optimization–bidirectional gating recurrent unit (MTBWO-BiGRU) model and the Bray–Curtis distance. This index offers a visual representation of the health status of bearings, enabling more intuitive monitoring and prediction. The first step involves utilizing L1 regularization to extract effective features as degradation elements from the current bearing vibration data. Additionally, the characteristics of the initial time window of the vibration data serve as the health features. Next, the HI of the bearing is constructed by computing the Bray–Curtis distance between the bearing's degradation characteristics and health features. The cloud monitoring platform constantly tracks the health of the bearing and employs the MTBWO-BiGRU model to anticipate the forthcoming state of health. The platform generates an immediate alert when the HI of the bearing overtakes the alteration rate threshold and foresees the condition of the bearing. We compare the MTBWO-BiGRU model with the bidirectional long short-term memory (BiLSTM) and BiGRU models. The results indicate an accuracy level of 92.57%, which is evidently higher than that obtained when using the other two models. Moreover, the MTBWO-BiGRU model is lighter, demonstrating the practicality of the proposed approach. [ABSTRACT FROM AUTHOR]

The difficulty of scheduling jobs or workloads increases due to the stochastic and transient characteristics of the cloud network. As a key prerequisite for establishing QoS, it asserts that effective work scheduling must be developed and executed. Maximum profit is made possible for cloud service providers by proper resource management. The most effective scheduling algorithm considers resources given by providers rather than the task set that users have accumulated. This paper developed a model that works in a two-level hierarchical model comprising global scheduling and local schedules to handle the heterogeneous type of request in real-time. These two levels of scheduling communicate with each other to produce an optimal scheduling scheme. Initially, all the requests are passed to the global scheduler, whose task is to categorize the type of request and pass it to the corresponding queue for assigning it to the related local scheduler using a parabolic intuitionistic fuzzy scheduler. In this work, the heterogeneous types of files are handled by maintaining different queues, in which each queue handles only a specific type of file like text doc, audio, image and video. Once the type of req is initiated by the clients, the global scheduler identifies the type of request and passes it to their relevant queue. In the next level, the local scheduler is assigned to each type of web server cluster. Once the work request is dispatched from the global workload scheduler, it is allocated to the local queue of the local scheduler, which allocates the resources of web servers by adapting the Quantum Honey Badger Algorithm, which searches the best-suited server for completing the assigned work based on the available resource parameters. [ABSTRACT FROM AUTHOR]

Cloud computing is a domain that provides the on-demand availability of IT resources, which can be accessed from a remote server over the internet. A widely used cloud service model is Infrastructure as a Service (IAAS). Clients offload their documents, images, and multimedia files to the cloud storage service. Securing the information of the clients is the challenging job of the cloud service providers (CSP). To ensure the Quality of Service (QoS) of the information CSP follows efficient encryption algorithms. To enhance the security of the image files this paper proposes a new Simplified Image Encryption Algorithm (SIEA) using an efficient key generation module, which uses the basic structure of Feistel cipher. The proposed secure algorithm encrypts the images and stores them in the cloud storage to overcome the data attack. The plain image is converted into corresponding pixel values and the converted plaintext is divided into blocks of 128 bits each. The 128-bit cipher key is used to find the sub-keys for 10 rounds. Five sub keys (K0 to K4) are generated with 32-bit each. It also contains 5 keys used in the 10 rounds of the process and after 10 rounds data will be shuffled again in the post-round step to generate the 128-bit cipher text. To ensure Shannon's confusion and diffusion logic the substitution and permutation concepts are used in the proposed algorithm. To show the performance of the algorithm the images of three categories black and white, gray-scale, and color images are taken as input and the algorithm produces encrypted images. The cloud storage devices store the encrypted images. This proposed SIEA algorithm is compared with standard AES algorithms and other recent and competitive algorithms in terms of various statistical analysis methods like key sensitivity, information entropy, correlation, histogram, and differential attack analysis shows that the proposed algorithm outperforms other algorithms in terms of security and robustness with its lightweight process. [ABSTRACT FROM AUTHOR]

Network function virtualization (NFV) has been proposed to enable flexible management and deployment of the network service in cloud. In NFV architecture, a network service needs to invoke several service functions (SFs) in a particular order following the service chain function. The placement of SFs has significant impact on the performance of network services. However, stochastic nature of the network service arrivals and departures as well as meeting the end-to-end Quality of Service(QoS) makes the SFs placement problem even more challenging. In this paper, we firstly provide a system architecture for the SFs placement of cloud service with end-to-end QoS deadline. We then formulate the end-to-end service placement as a Markov decision process (MDP) which aims to minimize the placement cost and the end-to-end delay. In our MDP, the end-to-end delay of active services in the network is considered to be the state of the system, and the placement (nonplacement or placement) of SF is considered as the action. Also, we discuss the rationality of our analytical model by analyzing the Markov stochastic property of the end-to-end service placement. To obtain the optimal placement policy, we then propose an algorithm (Algorithm 1) for dynamic SFs placement based on our model and use successive approximations, i.e. |$\epsilon $| -iteration algorithm (Algorithm 2) to obtain action distribution. Finally, we evaluate the proposed MDP by comparing our optimal method with DDQP, DRL-QOR, MinPath and MinDelay for QoS optimization, including acceptance probability, average delay, resource utilization, load-balancing and reliability. [ABSTRACT FROM AUTHOR]

In today's fast‐paced society, the Internet of Things (IoT) is revolutionizing businesses by bridging the gap between the digital and physical realms. This transformative technology enables rapid changes in the way people conduct business. Its fundamental aim is to connect everything in our world—objects, individuals, locations, and processes—under a unified infrastructure, providing valuable information and control over the state of our environment. The IoT represents a novel approach to developing diverse and distributed systems, which have now evolved into a pervasive computing cloud infrastructure. However, due to limitations in computing power and storage resources dedicated to handling the vast amounts of IoT data, a cloud‐based architecture is often employed in the IoT realm. Unfortunately, this shift has introduced a range of complex security and trust concerns within the cloud‐based IoT environment. As the demand for widespread deployment of cloud‐based IoT continues to soar, significant security‐related threats have emerged, prompting numerous researchers to develop cryptographic algorithms aimed at enhancing the security of both the Cloud and IoT. This paper provides an overview of cloud‐based IoT technology and seeks to fulfill the primary objective of conducting a survey on encryption algorithms in the context of the cloud and IoT. The research delves into the strategies, challenges, and variations associated with encryption in cloud and IoT systems. Additionally, this work includes a comparative analysis of the computational complexity of these techniques. [ABSTRACT FROM AUTHOR]

Cloud Computing has the ability to provide on-demand access to a shared resource pool. It has completely changed the way businesses are managed, implement applications, and provide services. The rise in popularity has led to a significant increase in the user demand for services. However, in cloud environments efficient load balancing is essential to ensure optimal performance and resource utilization. This systematic review targets a detailed description of load balancing techniques including static and dynamic load balancing algorithms. Specifically, metaheuristic-based dynamic load balancing algorithms are identified as the optimal solution in case of increased traffic. In a cloud-based context, this paper describes load balancing measurements, including the benefits and drawbacks associated with the selected load balancing techniques. It also summarizes the algorithms based on implementation, time complexity, adaptability, associated issue(s), and targeted QoS parameters. Additionally, the analysis evaluates the tools and instruments utilized in each investigated study. Moreover, comparative analysis among static, traditional dynamic and metaheuristic algorithms based on response time by using the CloudSim simulation tool is also performed. Finally, the key open problems and potential directions for the state-of-the-art metaheuristic-based approaches are also addressed. [ABSTRACT FROM AUTHOR]

After the service provider temporarily selects the required edge nodes based on social and storage capabilities, application execution causes the edge nodes to cache part of the application data. Therefore, offloading part of the application computing tasks to the selected edge nodes can effectively improve application execution performance. However, in cases where the resources of user's IoT devices are insufficient, tasks can be further offloaded to traditional edge servers or even to the cloud to maximize application execution efficiency. In this paper, the entire uninstall utility is modeled as a weighted sum of task completion time and energy consumption. Under the premise of considering users' preferences for completion time and energy consumption, a game-based uninstallation algorithm is proposed. The algorithm performs uninstallation by optimizing the uninstallation decision. Based on user preferences, the total system overhead is relatively small. The subsequent simulation experiments show that the algorithm can reduce system overhead on the basis of satisfying user preferences and has relatively good adaptability. [ABSTRACT FROM AUTHOR]

Due to the wide variety of distant information transmission, data encryption has become an absolute necessity for practically all data transaction applications. Sensitive data gets uploaded to the cloud every day through many methods. AES algorithm is now the best option for many applications that require security services. Because of this, a lot of research has been carried out to improve the performance and efficiency of the algorithm. This paper's main goal is to propose an improved method for encrypting and decrypting data. As key sharing was a significant problem in the symmetric approach, we generate the key using the ECC and will encrypt and decrypt data using the AES using this key. The suggested algorithm, which is simpler than ECC and solely utilized for key generation-not data encryption or decryption-is more secure than AES because it circumvents the key-sharing issue that plagued AES. [ABSTRACT FROM AUTHOR]

ith the rapid development of technology, processing the explosive growth of meteorological data on traditional standalone computing has become increasingly time-consuming, which cannot meet the demands of scientific research and business. Therefore, this paper proposes the implementation of the parallel Clustering Large Application based upon RANdomized Search (CLARANS) clustering algorithm on the Spark cloud computing platform to cluster China’s climate regions using meteorological data from 1988 to 2018. The aim is to address the challenge of applying clustering algorithms to large datasets. In this paper, the morphological similarity distance is adopted as the similarity measurement standard instead of Euclidean distance, which improves clustering accuracy. Furthermore, the issue of local optima caused by an improper selection of initial clustering centers is addressed by utilizing the max-distance criterion. Compared to the k-means clustering algorithm already implemented in the Spark platform, the proposed algorithm has strong robustness, can reduce the interference of outliers in the dataset on clustering results, and has higher parallel performance than the frequently used serial algorithms, thus improving the efficiency of big data analysis. This experiment compares the clustered centroid data with the annual average meteorological data of representative cities in the five typical meteorological regions that exist in China, and the results show that the clustering results are in good agreement with the meteorological data obtained from the National Meteorological Science Data Center. This algorithm has a positive effect on the clustering analysis of massive meteorological data and deserves attention in scientific research activities. [ABSTRACT FROM AUTHOR]

With the rapid development of technology, processing the explosive growth of meteorological data on traditional standalone computing has become increasingly time-consuming, which cannot meet the demands of scientific research and business. Therefore, this paper proposes the implementation of the parallel Clustering Large Application based upon RANdomized Search (CLARANS) clustering algorithm on the Spark cloud computing platform to cluster China’s climate regions using meteorological data from 1988 to 2018. The aim is to address the challenge of applying clustering algorithms to large datasets. In this paper, the morphological similarity distance is adopted as the similarity measurement standard instead of Euclidean distance, which improves clustering accuracy. Furthermore, the issue of local optima caused by an improper selection of initial clustering centers is addressed by utilizing the max-distance criterion. Compared to the k-means clustering algorithm already implemented in the Spark platform, the proposed algorithm has strong robustness, can reduce the interference of outliers in the dataset on clustering results, and has higher parallel performance than the frequently used serial algorithms, thus improving the efficiency of big data analysis. This experiment compares the clustered centroid data with the annual average meteorological data of representative cities in the five typical meteorological regions that exist in China, and the results show that the clustering results are in good agreement with the meteorological data obtained from the National Meteorological Science Data Center. This algorithm has a positive effect on the clustering analysis of massive meteorological data and deserves attention in scientific research activities. [ABSTRACT FROM AUTHOR]

Cloud computing has experienced extraordinary development across a wide range of industries by giving customers the flexibility to employ computing resources as needed. The task scheduling problem is one of several major challenges in cloud computing, and it should be scheduled effectively to minimize makespan and maximize resource utilization. Therefore, this paper put forward an improved scheduling efficiency algorithm called Enhanced Marine Predator Algorithm (EMPA). Firstly, task scheduling model with makespan and resource utilization is constructed. Secondly, each individual represents a result of task scheduling, and the purpose of algorithms is to find the optimal scheduling result, therefore the operator of WOA, nonlinear inertia weight coefficient and golden sine strategy are introduced into Marine Predator Algorithm. In the simulation experiment, EMPA is compared with Grey Wolf Optimizer (GWO), Sine Cosine Algorithm (SCA), Particle Swarm Optimization (PSO), and Whale Optimization Algorithm (WOA) under different number of tasks in synthetic datasets and GoCJ datasets.The experimental results show that the EMPA algorithm has more advantages in terms of makespan, degree of imbalance, and resource utilization. [ABSTRACT FROM AUTHOR]

The distributed architecture of cloud computing necessitates robust defense mechanisms to secure network-accessible resources against a diverse and dynamic threat landscape. A Network Intrusion Detection System (NIDS) is pivotal in this context, with its efficacy in cloud environments hinging on its adaptability to evolving threat vectors while mitigating false positives. In this paper, we present a novel NIDS algorithm, anchored in the Transformer model and finely tailored for cloud environments. Our algorithm melds the fundamental aspects of network intrusion detection with the sophisticated attention mechanism inherent to the Transformer model, facilitating a more insightful examination of the relationships between input features and diverse intrusion types, thereby bolstering detection accuracy. We provide a detailed design of our approach and have conducted a thorough comparative evaluation. Our experimental results demonstrate that the accuracy of our model is over 93%, which is comparable to that of the CNN-LSTM model, underscoring the effectiveness and viability of our Transformer-based intrusion detection algorithm in bolstering cloud security. [ABSTRACT FROM AUTHOR]

In application scenarios such as cloud storage, a symmetric algorithm can be used to encrypt massive data. However, using the symmetric operation and keys in encryption and decryption, it is very difficult to realize an efficient access control system. The asymmetric encryption algorithm ciphertext-policy attribute-based encryption (CP-ABE), as a versatile one-to-many encryption algorithm, is considered an ideal access control tool to solve the user's distrust of the service provider of cloud storage. However, in a traditional CP-ABE system, the malicious users may deliberately leak their attribute keys to others or build a decryption black box (DB) to provide illegal decryption services for benefits, while no one can determine their identities. To deal with the problems, especially the problem of tracing the DB builder, CP-ABE schemes with black-box traceability have been proposed in the past few years. But in this paper, we point out that for now, the tracing algorithms in all existing schemes actually work on an impractical assumption. That is, whenever a DB receives a decryption request, it always performs the decryption algorithm honestlycorrectly. We argue that if a DB finds the decryption request comes from the tracing algorithm, it may intentionally output incorrect decryption results to counter the tracing. Thus, we present the structural defect of the tracing algorithm applied to all known traceable CP-ABE schemes. We describe the construction of an alert decryption black box (ADB) that is capable of distinguishing a tracing ciphertext from a normal one. We also show how an ADB frustrates the tracing algorithm, and furthermore, malicious users can even apply an ADB to frame innocent users. [ABSTRACT FROM AUTHOR]

Cloud computing is considered a key Internet technology. Cloud providers offer services through the Internet, such as infrastructure, platforms, and software. The scheduling process of cloud providers' tasks concerns allocating clients' tasks to providers' resources. Several mechanisms have been developed for task scheduling in cloud computing. Still, these mechanisms need to be optimized for execution time and makespan. This paper presents a new task-scheduling mechanism based on Discrete Prey–Predator to optimize the task-scheduling process in the cloud environment. The proposed Discrete Prey–Predator mechanism assigns each scheduling solution survival values. The proposed mechanism denotes the prey's maximum surviving value and the predator's minimum surviving value. The proposed Discrete Prey–Predator mechanism aims to minimize the execution time of tasks in cloud computing. This paper makes a significant contribution to the field of cloud task scheduling by introducing a new mechanism based on the Discrete Prey–Predator algorithm. The Discrete Prey–Predator mechanism presents distinct advantages, including optimized task execution, as the mechanism is purpose-built to optimize task execution times in cloud computing, improving overall system efficiency and resource utilization. Moreover, the proposed mechanism introduces a survival-value-based approach, as the mechanism introduces a unique approach for assigning survival values to scheduling solutions, differentiating between the prey's maximum surviving value and the predator's minimum surviving value. This improvement enhances decision-making precision in task allocation. To evaluate the proposed mechanism, simulations using the CloudSim simulator were conducted. The experiment phase considered different scenarios for testing the proposed mechanism in different states. The simulation results revealed that the proposed Discrete Prey–Predator mechanism has shorter execution times than the firefly algorithm. The average of the five execution times of the Discrete Prey–Predator mechanism was 270.97 s, while the average of the five execution times of the firefly algorithm was 315.10 s. [ABSTRACT FROM AUTHOR]

Cloud Computing (CC) is a solution that efficiently maps cloud tasks to resources, ensuring high-performance utilization in computing. But, the challenge lies in managing attacks while managing a large data flow. For this reason, Lightweight deep learning model to secure authentication (LDLSA) was developed using Deep Convolutional Neural Network (DCNN) and Homomorphic Encryption (HE) is developed for deep face recognition authentication, enhancing privacy protection in CC. However, these models are computationally expensive, require extensive training data and lack information on cloud-stored authentication data for privacy preservation. In this paper, DL with Cloud Authentication (dCAuth) is proposed to resolve the above mentioned issues to provide efficient cloud authentication with lesser complexity. This method employs a spurring algorithm for dwindling DCNN with recall (dDCNNr) to handle the number of parameters in DCNN to handle a large number of parameters for cloud authentication. dDCNNr model reduces execution time and improves classification accuracy, but it necessitates faster training time. To solve this, Fully Connected (FC) layers of DCNN is replaced with Hopfield Neural Network (HNN). The model utilises a DCNN for feature extraction and HNN for pattern recognition highly focusing on authentication, both the process have similar training phase with known patterns by adjusted weights. The proposed authentication method stores encrypted Neural Network (NN) weights in the cloud, eliminating the need for a verification table. The weights for unknown input patterns are generated during pattern recall. The HNN weight matches input indicating a known or legal pattern, aiming to identify a known pattern that best fits the input with minimum processing resources. The proposed authentication model integrates DCNN and HNN to rapidly and precisely recall the legitimate user ID and face image (password) information. The model effectively manages the large training data and parameters, ensuring privacy for cloud-stored authentication data, simultaneously reducing the time duration of registration and password changes (old to new face image). Finally, an extensive simulation reveals that the proposed model achieves accuracy of 94.15%, 94.53% and 94.38% on Georgia Tech face (GTF), Labelled Faces in the Wild (LFW) and Biometric Signature (BS) database respectively. [ABSTRACT FROM AUTHOR]

Virtual Machine Placement (VMP) plays a significant role in improving efficiency of Cloud Data Center (CDC). With the dramatic increase in the use of cloud computing, it seems necessary to apply effective algorithms to reduce the power consumption of CDC. VMP is known as a NP-Hard problem that cannot be solved by deterministic algorithms in polynomial time. In this paper, an algorithm named Combinated Random Best First Fit (CRBFF) is proposed with the aim of increasing the Quality of Service (QoS), in which Virtual Machines (VMs) are optimally placed on heterogeneous Physical Machines (PMs). The effectiveness of CRBFF is evaluated by different metrics on Google Compute Engine (GCE), Amazon Web Service Elastic Compute Cloud (AWS EC2) and Microsoft Azure scenarios and the results show that CRBFF performs better than other common algorithms. [ABSTRACT FROM AUTHOR]

The utilization of cloud computing environments is highly popular for carrying out workflow executions due to its ability to provide clients with immediate access to computing resources. Among the various workflow scheduling problems in the cloud, deadline-constrained workflow scheduling has garnered increasing attention in recent years. This paper introduces a hybrid scheduling algorithm known as Partial Critical Path–Ant Colony Optimization (PCP–ACO), which aims to minimize the execution cost of a workflow while ensuring that it meets the user-defined deadline in cloud environments. PCP–ACO is a list scheduling algorithm that combines the PCP heuristic algorithm with the meta-heuristic ACO to achieve faster convergence. The list scheduling algorithm consists of two phases: task ordering and resource selection. In the case of PCP–ACO, the first step involves calculating a topological sort of the workflow tasks to assign priority to each task. Subsequently, the ACO meta-heuristic is employed to allocate the appropriate resource to each task of the workflow, based on their respective sub-deadlines that are computed using the PCP heuristic. In order to evaluate the effectiveness of the proposed algorithm, several experiments were conducted using five real scientific workflows. The results demonstrate that PCP–ACO outperforms the IC-PCP, L-ACO, and HP-GA algorithms in terms of average execution cost, achieving reductions of 19%, 17.3%, and 21.5%, respectively. [ABSTRACT FROM AUTHOR]

Fog computing has emerged as a viable concept for expanding the capabilities of cloud computing to the periphery of the network allowing for efficient data processing and analysis from internet of things (IoT) devices. Load balancing is essential in fog computing because it ensures optimal resource utilization and performance among distributed fog nodes. This paper proposed an ensemble-based load-balancing approach for fog computing environments. An advanced ensemble load balancing approach (AELBA) uses real-time monitoring and analysis of fog node metrics, such as resource utilization, network congestion, and service response times, to facilitate effective load distribution. Based on the ensemble's collective decision-making, these metrics are fed into a centralized load-balancing controller, which dynamically adjusts the load distribution across fog nodes. Performance of the proposed ensemble load-balancing approach is evaluated and compared it to traditional load-balancing techniques in fog using extensive simulation experiments. The results demonstrate that our ensemble-based approach outperforms individual load-balancing algorithms regarding response time, resource utilization, and scalability. It adapts to dynamic fog environments, providing efficient load balancing even under varying workload conditions. [ABSTRACT FROM AUTHOR]

Many symmetric and asymmetric encryption algorithms have been developed in cloud computing to transmit data in a secure form. Cloud cryptography is a data encryption mechanism that consists of different steps and prevents the attacker from misusing the data. This paper has developed an efficient algorithm to protect the data from invaders and secure the data from misuse. If this algorithm is applied to the cloud network, the attacker will not be able to access the data. To encrypt the data, the values of the bytes have been obtained by converting the plain text to ASCII. A key has been generated using the Non-Deterministic Bit Generator (NRBG) mechanism, and the key is XNORed with plain text bits, and then Bit toggling has been implemented. After that, an efficient matrix cipher encryption algorithm has been developed, and this algorithm has been applied to this text. The capability of this algorithm is that with its help, a key has been obtained from the plain text, and only by using this key can the data be decrypted in the first steps. A plain text key will never be used for another plain text. The data has been secured by implementing different mechanisms in both stages, and after that, a ciphertext has been obtained. At the end of the article, the latest technique will be compared with different techniques. There will be a discussion on how the present technique is better than all the other techniques; then, the conclusion will be drawn based on comparative analysis. [ABSTRACT FROM AUTHOR]

This research paper puts emphasis on using cloud computing with Blockchain (BC) to improve the security and privacy in a cloud. The security of data is not guaranteed as there is always a risk of leakage of users' data. Blockchain can be used in a multi-tenant cloud environment (MTCE) to improve the security of data, as it is a decentralized approach. Data is saved in unaltered form. Also, Blockchain is not owned by a single organization. The encryption process can be done using a Homomorphic encryption (HE) algorithm along with hashing technique, hereby allowing computations on encrypted data without the need for decryption. This research paper is composed of four objectives: Analysis of cloud security using Blockchain technology; Exceptional scenario of Blockchain architecture in an enterprise-level MTCE; Implementation of cipher-text policy attribute-based encryption (CPABE) algorithm; Implementation of Merkle tree using Ethereum (MTuE) in a Multi-tenant system. Out of these four objectives, the main focus is on the implementation of CP-ABE algorithm. CP-ABE parameters are proposed for different levels of tenants. The levels include inner tenant, outer tenant, Inner-Outer-Tenant, Inner-Outer-External-Tenant, Outer-Inner-Tenant, External-Outer-Inner-Tenant and the parameters such as token, private key, public key, access tree, message, attribute set, node-level, cipher-text, salting which will help in providing better security using CP-ABE algorithm in a multitenant environment (MTE) where tenants can be provided with different levels of security and achieved 92 percentage of authenticity and access-control of the data. [ABSTRACT FROM AUTHOR]

There is a trend to deploy neural network on edge devices in recent years. While the mainstream of research often concerns with single edge device processing and edge-cloud two-layer neural network collaborative computing, in this paper, we propose partitioning multi-layer edge network for neural network collaborative computing. With the proposed method, sub-models of neural network are deployed on multi-layer edge devices along the communication path from end users to cloud. Firstly, we propose an optimal path selection method to form a neural network collaborative computing path with lowest communication overhead. Secondly, we establish a time-delay optimization mathematical model to evaluate the effects of different partitioning solutions. To find the optimal partition solution, an ordered elitist genetic algorithm (OEGA) is proposed. The experimental results show that, compared with traditional cloud computing, single-device edge computing and edge-cloud collaborative computing, the proposed multi-layer edge network collaborative computing has a smaller runtime delay with limited bandwidth resources, and because of the pipeline computing characteristics, the proposed method has a better response speed when processing large number of requests. Meanwhile, the OEGA algorithm has better performance than conventional methods, and the optimized partitioning method outperforms other methods like random and evenly partition. [ABSTRACT FROM AUTHOR]

IoT smart devices are a confluence of microprocessors, sensors, power source and transceiver modules to effectively sense, communicate and transfer data. Energy efficiency is a key governing value of the network performance of smart devices in distributed IoT networks. Low and discrete power and limited amount of memory and finite number of resources form some major bottlenecks in the workflow. Dynamic load balancing, reliability and flexibility are heavily relied upon by cloud computing for its accessibility. Resources are dynamically provided to the end client in an as-come on-demand fashion with the global network that is the Internet. Proportionally the need for services is increasing at a rate that is astonishing compared to any other forms of development. Load balancing seems a major challenge faced due to the architecture and the modular nature of our cloud environment. Loads need to be distributed dynamically to all the nodes. In this paper, we have introduced a technique that combines fuzzy logic with various nature inspired algorithms—grey wolf algorithm and firefly algorithm to effectively balance the load in a network of IoT devices. The performances of various nature inspired algorithms are compared with a brute force approach based on energy efficiency, network lifetime maximization, node failure rate and packet delivery ratio. [ABSTRACT FROM AUTHOR]

The evolution of cloud computing results in the development of numerous huge data-centers. These data-centers use large quantities of electrical energy, which in turn results in high operating cost and high emissions of CO 2 . The grounds for this excessive usage of energy is the inefficient usage of data-center resources (hosts). The resources in the data-center can be in either peak or idle or sleep state. It has been experimentally proven that hosts in the idle state consumes more energy than hosts in sleep state. Through an efficient and optimal VM placement strategy, an energy efficient resource utilization can be achieved, thereby reducing the number of idle hosts in the data-center. This paper introduces two energy efficient VM placement algorithms based on bin packing heuristics considering the physical machine's energy efficiency, Energy Efficient VM Placement (EEVMP) and Modified Energy Efficient VM Placement (MEEVMP), that can reduce the overall energy usage in the data-center. The EEVMP algorithm when compared with the default VM placement algorithm Power-Aware Best-Fit Decreasing algorithm (PABFD) of CloudSim, it reduces the energy consumption by 53%, average SLA violation by 3.5% and number of VM migrations by 64.47%. Further, we have performed MEEVMP algorithm where we achieve a reduction in energy consumption by 54.24%, average SLA violation by 4.39% and number of VM migrations by 67.713 % as compared to PABFD. [ABSTRACT FROM AUTHOR]

Recently, we are witnessing an enormous burst of data due to the ever-increasing number of Internet of Things (IoT) devices. The traditional cloud computing paradigm has failed to scale; to be specific, its latency and bandwidth utilization are remarkably increased and consequently, Quality of Service (QoS) is decreased. On the other hand, the data management scope in fog computing require much more considerations in terms of performance and scalability. This is because of deploying IoT applications over fog nodes considering their resource-limited and heterogeneity. However, to the best of our knowledge, there is not any literature review that systematically categorizes these issues. In this paper, we have presented a classification of data replica placement approaches considering four main categories: framework-based, graph-based, heuristic-based, and meta-heuristic-based algorithms. To sum up, the primary contribution of this study is as follows: studying articles on data replica placement in fog computing, as well as presenting their strengths and weaknesses, providing a comprehensive systematic review of current approaches and categorizing them comprehensively, discussing research challenges, and future works to improve computing and evaluation mechanisms in the fog computing environment. This paper generally provides a classification, briefly explains the reviewed techniques, and then compares these methods in the end. [ABSTRACT FROM AUTHOR]

Data mining algorithms can process target data and extract useful hidden information, which is helpful for decision making. However, current mining algorithms have some shortcomings such as time-consuming processing of big data or inability to process massive data. Since data mining technology cannot be used in the traditional cloud platform environment, it is necessary to improve the algorithm to make it more suitable for the cloud platform environment. By analyzing the actual application process of BP classification algorithm, this paper expounds the practicability of BP classification algorithm, analyzes the data mining process based on Hadoop cloud platform, and expounds the development ideas of BP classification algorithm. The source of data mining algorithm supported by cloud computing is discussed. Finally, Hadoop cloud platform. This paper designed the corresponding system architecture and data interface, and established a suitable test environment for this system, and completed the simulation experiment test through the design. The calculation time of this algorithm is proportional to the amount of data, showing a linear relationship. In data mining, the optimized BP algorithm in this paper can significantly save resources in terms of spatial features. This paper designs an optimized operating system based on Hadoop platform through comprehensive analysis and improvement algorithm. [ABSTRACT FROM AUTHOR]

Decentralised fog computing can provide real-time interaction, minimize latency, heterogeneity, and provide networking services between edge devices and cloud data centers. One of the biggest challenges in the fog layer network is finding a trustworthy fog node. Trust management encompasses the process of being trustworthy and the act of assessing the reliability of other nodes. It is essential to carry out a comprehensive review using a systematic approach in this field to advance our understanding, address emerging challenges, and foster secure and efficient trust management practices. This research paper considers a comprehensive analysis of high-quality fog computing trust management literature from 2018 to 2022. A variety of distinct approaches have been chosen by fog computing-based trust management and these techniques are classified into three categories: algorithms, challenges, and limitations. Further, it reviews the various trust attacks in fog environments, details the solutions proposed in the current literature, and concludes with a discussion of the open challenges and potential future research directions in fog computing. [ABSTRACT FROM AUTHOR]

Software as a service (SaaS) provider hires resources from an Infrastructure as a Service (IaaS) provider and provides these sharable resources to user's applications on lease. However, it is becoming a more challenging issue for SaaS providers to meet user's Quality of Service (QoS) Parameter and maximize profit from cloud infrastructure. This proposed work satisfies both the user and the service provider by fulfilling service level agreement (SLA), user's QoS requirement, and increasing profit with efficient resources utilization. This paper proposes an Improved Quantum Salp Swarm Algorithm (IQSSA), which improves the Salp Swarm algorithm by incorporating the principles of Quantum computing to increase the convergence rate. Further, Quantum-inspired Salp Swarm Grey Wolf Algorithm (QSSGWA) embeds SSA with Grey Wolf Optimizer (GWO) to improve the global optimum solution, and quantum operator is used to initializing population. Proposed algorithms execute tasks under the user-defined deadline and budget constraints. Furthermore, the penalty cost is formulated and applied in the case of a deadline violation. IQSSA and QSSGWA are tested on 19 global benchmark functions, and results prove their superior performance compared to SSA, GWO, BAT, and Particle Swarm Optimization (PSO) algorithm. Furthermore, these algorithms are simulated on CloudSim, and performance matrices such as service provider's profit, makespan, SLA violation rate, task rejection rate, throughput, resource utilization, and response time are compared. The comparison analysis demonstrates that the proposed algorithms offer better performance and more efficient scheduling than existing metaheuristics. Furthermore, simulation results clearly show that QSSGWA gives the best results for all performance matrices. This proposed approach can be applied in many scientific domains, where distributed processing of data or large scale data analysis is required such as distributed and federated machine learning, serverless computing, medical applications, etc. [ABSTRACT FROM AUTHOR]

Cloud computing plays an essential role in various fields. However, the existing cloud services face a severe challenge, which is how to share the data among a large scale of devices securely. In this paper, we introduce a cloud-based privacy-preserving data sharing scheme, derived from identity-based matchmaking encryption. In our scheme, the access policies are designed by both the sender and receiver simultaneously, to support bilateral access control. To improve efficiency, we delegate the match algorithm to the cloud server, reducing the computation cost and communication overhead on end devices without revealing the users' privacy. Through formal security analysis, we show that our scheme holds security, authenticity, and privacy. Finally, we evaluate our scheme by conducting extensive experiments, indicating that our scheme is more efficient than the other data-sharing schemes in ME-based services in a real-world dataset. [ABSTRACT FROM AUTHOR]

With the development of computationally intensive applications, the demand for edge cloud computing systems has increased, creating significant challenges for edge cloud computing networks. In this paper, we consider a simple three-tier computational model for multiuser mobile edge computing (MEC) and introduce two major problems of task scheduling for federated learning in MEC environments: (1) the transmission power allocation (PA) problem, and (2) the dual decision-making problems of joint request offloading and computational resource scheduling (JRORS). At the same time, we factor in server pricing and task completion, in order to improve the user-friendliness and fairness in scheduling decisions. The solving of these problems simultaneously ensures both scheduling efficiency and system quality of service (QoS), to achieve a balance between efficiency and user satisfaction. Then, we propose an adaptive greedy dingo optimization algorithm (AGDOA) based on greedy policies and parameter adaptation to solve the PA problem and construct a binary salp swarm algorithm (BSSA) that introduces binary coding to solve the discrete JRORS problem. Finally, simulations were conducted to verify the better performance compared to the traditional algorithms. The proposed algorithm improved the convergence speed of the algorithm in terms of scheduling efficiency, improved the system response rate, and found solutions with a lower energy consumption. In addition, the search results had a higher fairness and system welfare in terms of system quality of service. [ABSTRACT FROM AUTHOR]

Any democratic country intends to conduct the elections in a smooth and fair manner such all the citizens of the country participate and elect their leader who can involve himself/herself for the development of the country. Inspite of wide publicity and measures taken for ensuring the participation of all the citizens in the election process, most of the countries are unable achieve 100% voting rate in elections. Among the many reasons for reduction in voting rate, migration of the voters is one of the major reasons for reduction in voting rate. Even though technology and online services have been used in almost all the aspects of day-to-day activities, online features have not been utilized in the process of voting during elections. This paper tries to analyze the performance of the cloud based secured framework by implementing it using PHP and mySQL. Security of the framework is implemented using rivest shamir adleman (RSA), advanced encryption standard (AES) and Blowfish cryptography algorithms. [ABSTRACT FROM AUTHOR]

Workflow applications are a popular tool used by scientists to model and run applications on cloud computing. With the rise of multi-core parallel systems and cloud computing high-performance computing is becoming more accessible to scientists, but it also presents new challenges. One pressing issue is the energy consumption of these systems, both for environmental and financial reasons. To minimize energy usage in cloud computing, methods such as energy-efficient scheduling are gaining attention. However, current scheduling solutions have limitations, or failing to address the problem as a multi-objective optimization balancing performance and energy. This problem is considered complex and NP-complete. Many researchers have attempted to resolve it using heuristic and meta-heuristic methods. Although these methods may not always provide optimal results, they are still a subject of active research. This paper proposes a new multi-objective optimization algorithm that combines the Heterogeneous Earliest Finish Time and BAT algorithm to optimize multiple conflicting objectives for energy, cost, makespan, and resource utilization. The results are verified using the Analysis of Variance statistical tool, and the proposed algorithm is shown to be superior to existing contemporary algorithms. [ABSTRACT FROM AUTHOR]

Connectivity and cloud computing are key elements in the future of electric mobility. They allow manufacturers to provide advanced fleet management and predictive diagnostic services. In particular, cloud computing dramatically enhances data availability and enables the use of more complex and accurate state estimation algorithms for electric vehicle lithium-ion batteries. A tuning procedure for a moving window least squares algorithm to estimate the parameters of a 2-RC equivalent circuit battery model is presented in this paper. The tuning procedure uses real data collected from a test vehicle and uploaded to the Stellantis-CRF cloud. The tuned algorithm was applied to eight months of road tests and showed very small estimation errors. The errors are comparable to other literature data, even when the literature results were obtained in laboratory tests. The estimated model parameters are tracked through time and seem accurate enough to show the first signs of battery aging. [ABSTRACT FROM AUTHOR]

Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)