Multi-resource collaborative optimization for adaptive virtual machine placement
Ontology highlight
ABSTRACT:
SUBMITTER: Li Z
PROVIDER: S-EPMC8771770 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:The demand for virtual machine requests has increased recently due to the growing number of users and applications. Therefore, virtual machine placement (VMP) is now critical for the provision of efficient resource management in cloud data centers. The VMP process considers the placement of a set of virtual machines onto a set of physical machines, in accordance with a set of criteria. The optimal solution for multi-objective VMP can be determined by using a fitness function that combines the objectives. This paper proposes a novel model to enhance the performance of the VMP decision-making process. Placement decisions are made based on a fitness function that combines three criteria: placement time, power consumption, and resource wastage. The proposed model aims to satisfy minimum values for the three objectives for placement onto all available physical machines. To optimize the VMP solution, the proposed fitness function was implemented using three optimization algorithms: particle swarm optimization with Lévy flight (PSOLF), flower pollination optimization (FPO), and a proposed hybrid algorithm (HPSOLF-FPO). Each algorithm was tested experimentally. The results of the comparative study between the three algorithms show that the hybrid algorithm has the strongest performance. Moreover, the proposed algorithm was tested against the bin packing best fit strategy. The results show that the proposed algorithm outperforms the best fit strategy in total server utilization.
| S-EPMC8771797 | biostudies-literature
Project description:Collaboration among logistics facilities in a multicenter logistics delivery network can significantly improve the utilization of logistics resources through resource sharing including logistics facilities, vehicles, and customer services. This study proposes and tests different resource sharing schemes to solve the optimization problem of a collaborative multicenter logistics delivery network based on resource sharing (CMCLDN-RS). The CMCLDN-RS problem aims to establish a collaborative mechanism of allocating logistics resources in a manner that improves the operational efficiency of a logistics network. A bi-objective optimization model is proposed with consideration of various resource sharing schemes in multiple service periods to minimize the total cost and number of vehicles. An adaptive grid particle swarm optimization (AGPSO) algorithm based on customer clustering is devised to solve the CMCLDN-RS problem and find Pareto optimal solutions. An effective elite iteration and selective endowment mechanism is designed for the algorithm to combine global and local search to improve search capabilities. The solution of CMCLDN-RS guarantees that cost savings are fairly allocated to the collaborative participants through a suitable profit allocation model. Compared with the computation performance of the existing nondominated sorting genetic algorithm-II and multi-objective evolutionary algorithm, AGPSO is more computationally efficient. An empirical case study in Chengdu, China suggests that the proposed collaborative mechanism with resource sharing can effectively reduce total operational costs and number of vehicles, thereby enhancing the operational efficiency of the logistics network.
| S-EPMC7682872 | biostudies-literature
Project description:Fine-tuning is an important technique in transfer learning that has achieved significant success in tasks that lack training data. However, as it is difficult to extract effective features for single-source domain fine-tuning when the data distribution difference between the source and the target domain is large, we propose a transfer learning framework based on multi-source domain called adaptive multi-source domain collaborative fine-tuning (AMCF) to address this issue. AMCF utilizes multiple source domain models for collaborative fine-tuning, thereby improving the feature extraction capability of model in the target task. Specifically, AMCF employs an adaptive multi-source domain layer selection strategy to customize appropriate layer fine-tuning schemes for the target task among multiple source domain models, aiming to extract more efficient features. Furthermore, a novel multi-source domain collaborative loss function is designed to facilitate the precise extraction of target data features by each source domain model. Simultaneously, it works towards minimizing the output difference among various source domain models, thereby enhancing the adaptability of the source domain model to the target data. In order to validate the effectiveness of AMCF, it is applied to seven public visual classification datasets commonly used in transfer learning, and compared with the most widely used single-source domain fine-tuning methods. Experimental results demonstrate that, in comparison with the existing fine-tuning methods, our method not only enhances the accuracy of feature extraction in the model but also provides precise layer fine-tuning schemes for the target task, thereby significantly improving the fine-tuning performance.
| S-EPMC11232598 | biostudies-literature
Project description:Regarding the fulfillment optimization of online retail orders, many researchers focus more on warehouse optimization and distribution center optimization. However, under the background of new retailing, traditional retailers carry out online services, forming an order fulfillment model with physical stores as front warehouses. Studies that focus on physical stores and consider both order splitting and store delivery are rare, which cannot meet the order optimization needs of traditional retailers. To this end, this study proposes a new problem called the “Multi-Store Collaborative Delivery Optimization (MCDO)”, in which not only make the order-split plans for stores but also design the order-delivery routes for them, such that the order fulfillment cost is minimized. To solve the problem, a Top-K breadth-first search and a local search are integrated to construct a hybrid heuristic algorithm, named “Top-K Recommendation & Improved Local Search (TKILS)”. This study optimizes the search efficiency of the breadth-first search by controlling the number of sub-orders and improving the initial solution of the local search using a greedy cost function. Then achieve the joint optimization of order-split and order-delivery by improving the local optimization operators. Finally, extensive experiments on synthetic and real datasets validate the effectiveness and applicability of the algorithm this study proposed.
| S-EPMC9997996 | biostudies-literature
Project description:Guiding experiments to find materials with targeted properties is a crucial aspect of materials discovery and design, and typically multiple properties, which often compete, are involved. In the case of two properties, new compounds are sought that will provide improvement to existing data points lying on the Pareto front (PF) in as few experiments or calculations as possible. Here we address this problem by using the concept and methods of optimal learning to determine their suitability and performance on three materials data sets; an experimental data set of over 100 shape memory alloys, a data set of 223 M2AX phases obtained from density functional theory calculations, and a computational data set of 704 piezoelectric compounds. We show that the Maximin and Centroid design strategies, based on value of information criteria, are more efficient in determining points on the PF from the data than random selection, pure exploitation of the surrogate model prediction or pure exploration by maximum uncertainty from the learning model. Although the datasets varied in size and source, the Maximin algorithm showed superior performance across all the data sets, particularly when the accuracy of the machine learning model fits were not high, emphasizing that the design appears to be quite forgiving of relatively poor surrogate models.
| S-EPMC5829239 | biostudies-literature
Project description:ObjectiveWe sought to several develop parsimonious machine learning models to predict resource utilization and clinical outcomes following cardiac operations using only preoperative factors.MethodsAll patients undergoing coronary artery bypass grafting and/or valve operations were identified in the 2015-2021 University of California Cardiac Surgery Consortium repository. The primary end point of the study was length of stay (LOS). Secondary endpoints included 30-day mortality, acute kidney injury, reoperation, postoperative blood transfusion and duration of intensive care unit admission (ICU LOS). Linear regression, gradient boosted machines, random forest, extreme gradient boosting predictive models were developed. The coefficient of determination and area under the receiver operating characteristic (AUC) were used to compare models. Important predictors of increased resource use were identified using SHapley summary plots.ResultsCompared with all other modeling strategies, gradient boosted machines demonstrated the greatest performance in the prediction of LOS (coefficient of determination, 0.42), ICU LOS (coefficient of determination, 0.23) and 30-day mortality (AUC, 0.69). Advancing age, reduced hematocrit, and multiple-valve procedures were associated with increased LOS and ICU LOS. Furthermore, the gradient boosted machine model best predicted acute kidney injury (AUC, 0.76), whereas random forest exhibited greatest discrimination in the prediction of postoperative transfusion (AUC, 0.73). We observed no difference in performance between modeling strategies for reoperation (AUC, 0.80).ConclusionsOur findings affirm the utility of machine learning in the estimation of resource use and clinical outcomes following cardiac operations. We identified several risk factors associated with increased resource use, which may be used to guide case scheduling in times of limited hospital capacity.
| S-EPMC9510828 | biostudies-literature
Project description:CO2 emission influences not only global climate change but also international economic and political situations. Thus, reducing the emission of CO2, a major greenhouse gas, has become a major issue in China and around the world as regards preserving the environmental ecology. Energy consumption from coal, oil, and natural gas is primarily responsible for the production of greenhouse gases and air pollutants such as SO2 and NOX, which are the main air pollutants in China. In this study, a mathematical multi-objective optimization method was adopted to analyze the collaborative emission reduction of three kinds of gases on the basis of their common restraints in different ways of energy consumption to develop an economic, clean, and efficient scheme for energy distribution. The first part introduces the background research, the collaborative emission reduction for three kinds of gases, the multi-objective optimization, the main mathematical modeling, and the optimization method. The second part discusses the four mathematical tools utilized in this study, which include the Granger causality test to analyze the causality between air quality and pollutant emission, a function analysis to determine the quantitative relation between energy consumption and pollutant emission, a multi-objective optimization to set up the collaborative optimization model that considers energy consumption, and an optimality condition analysis for the multi-objective optimization model to design the optimal-pole algorithm and obtain an efficient collaborative reduction scheme. In the empirical analysis, the data of pollutant emission and final consumption of energies of Tianjin in 1996-2012 was employed to verify the effectiveness of the model and analyze the efficient solution and the corresponding dominant set. In the last part, several suggestions for collaborative reduction are recommended and the drawn conclusions are stated.
| S-EPMC4806840 | biostudies-literature
Project description:BACKGROUND:Development of a fast and accurate scoring function in virtual screening remains a hot issue in current computer-aided drug research. Different scoring functions focus on diverse aspects of ligand binding, and no single scoring can satisfy the peculiarities of each target system. Therefore, the idea of a consensus score strategy was put forward. Integrating several scoring functions, consensus score re-assesses the docked conformations using a primary scoring function. However, it is not really robust and efficient from the perspective of optimization. Furthermore, to date, the majority of available methods are still based on single objective optimization design. RESULTS:In this paper, two multi-objective optimization methods, called MOSFOM, were developed for virtual screening, which simultaneously consider both the energy score and the contact score. Results suggest that MOSFOM can effectively enhance enrichment and performance compared with a single score. For three different kinds of binding sites, MOSFOM displays an excellent ability to differentiate active compounds through energy and shape complementarity. EFMOGA performed particularly well in the top 2% of database for all three cases, whereas MOEA_Nrg and MOEA_Cnt performed better than the corresponding individual scoring functions if the appropriate type of binding site was selected. CONCLUSION:The multi-objective optimization method was successfully applied in virtual screening with two different scoring functions that can yield reasonable binding poses and can furthermore, be ranked with the potentially compromised conformations of each compound, abandoning those conformations that can not satisfy overall objective functions.
| S-EPMC2753843 | biostudies-literature
Project description:The pursuit of potential inhibitors for novel targets has become a very important problem especially over the last 2 years with the world in the midst of the COVID-19 pandemic. This entails performing high throughput screening exercises on drug libraries to identify potential "hits". These hits are identified using analysis of their physical properties like binding affinity to the target receptor, octanol-water partition coefficient (LogP) and more. However, drug libraries can be extremely large and it is infeasible to calculate and analyze the physical properties for each of those molecules within acceptable time and moreover, each molecule must possess a multitude of properties apart from just the binding affinity. To address this problem, in this study, we propose an extension to the Machine learning framework for Enhanced MolEcular Screening (MEMES) framework for multi-objective Bayesian optimization. This approach is capable of identifying over 90% of the most desirable molecules with respect to all required properties while explicitly calculating the values of each of those properties on only 6% of the entire drug library. This framework would provide an immense boost in identifying potential hits that possess all properties required for a drug molecules.
| S-EPMC9537730 | biostudies-literature
Project description:BackgroundThere is a growing demand for total joint arthroplasty (TJA) surgery. The applications of machine learning (ML), mathematical optimization, and computer simulation have the potential to improve efficiency of TJA care delivery through outcome prediction and surgical scheduling optimization, easing the burden on health-care systems. The purpose of this study was to evaluate strategies using advances in analytics and computational modeling that may improve planning and the overall efficiency of TJA care.MethodsA systematic review including MEDLINE, Embase, and IEEE Xplore databases was completed from inception to October 3, 2022, for identification of studies generating ML models for TJA length of stay, duration of surgery, and hospital readmission prediction. A scoping review of optimization strategies in elective surgical scheduling was also conducted.ResultsTwenty studies were included for evaluating ML predictions and 17 in the scoping review of scheduling optimization. Among studies generating linear or logistic control models alongside ML models, only 1 found a control model to outperform its ML counterpart. Furthermore, neural networks performed superior to or at the same level as conventional ML models in all but 1 study. Implementation of mathematical and simulation strategies improved the optimization efficiency when compared to traditional scheduling methods at the operational level.ConclusionsHigh-performing predictive ML-based models have been developed for TJA, as have mathematical strategies for elective surgical scheduling optimization. By leveraging artificial intelligence for outcome prediction and surgical optimization, there exist greater opportunities for improved resource utilization and cost-savings in TJA than when using traditional modeling and scheduling methods.
| S-EPMC10014272 | biostudies-literature