Load balancing is vital for the efficient and long-term operation of cloud data *** virtualization,post(reactive)migration of virtual machines(VMs)after allocation is the traditional way for load balancing and consoli...
详细信息
Load balancing is vital for the efficient and long-term operation of cloud data *** virtualization,post(reactive)migration of virtual machines(VMs)after allocation is the traditional way for load balancing and consoli***,it is not easy for reactive migration to obtain predefined load balance objectives and it may interrupt services and bring ***,we provide a new approach,called Prepartition,for load *** partitions a VM request into a few sub-requests sequentially with start time,end time and capacity demands,and treats each sub-request as a regular VM *** this way,it can proactively set a bound for each VM request on each physical machine and makes the scheduler get ready before VM migration to obtain the predefined load balancing goal,which supports the resource allocation in a fine-grained *** with real-world trace and synthetic data show that our proposed approach with offline version(PrepartitionOff)scheduling has 10%–20%better performance than the existing load balancing baselines under several metrics,including average utilization,imbalance degree,makespan and Capacity_*** also extend Prepartition to online load *** results show that our proposed approach also outperforms state-of-the-art online algorithms.
The Mobile Edge Computing (MEC) system located close to the client allows mobile smart devices to offload their computations onto edge servers, enabling them to benefit from low-latency computing services. Both cloud ...
详细信息
Modeling and simulating group behaviours have been an active research topic in the field of computer animation and game. This paper presents some novel approaches for supporting entity modeling and path generation in ...
详细信息
Modeling and simulating group behaviours have been an active research topic in the field of computer animation and game. This paper presents some novel approaches for supporting entity modeling and path generation in crowd simulation. It analyses related work about crowd simulation first. Then, an entity modeling approach based on CGA (Cellular genetic algorithm) and NURBS (Non uniform relational B splines) technologies is presented. Next, following the analysis to PSO (Particle swarm optimization) and ABC (Artificial bee colony) algorithms, a crowd path generative approach based on ABC- PSO is put forward. After that, a simulating example of crowd cohesion and performance comparison are exhibited for showing the efficiency of the algorithms. Finally, the current work is summarized and an outlook for the future work is given.
The rapid development of single-cell RNA sequencing (scRNA-seq) technology has enabled researchers to explore gene expression differences at the level of individual cells, revealing more refined cell types and states....
The rapid development of single-cell RNA sequencing (scRNA-seq) technology has enabled researchers to explore gene expression differences at the level of individual cells, revealing more refined cell types and states. However, due to the low expression and high noise of scRNA-seq data, feature selection has become particularly important in the analysis of single-cell data. Here, we introduce the Entropy Stepwise Regression (ESR) method for feature selection. This method utilizes the correlation between genes and the entropy values of each feature to filter out genes that are conducive to downstream analysis. In mouse kidney samples, we compared the performance of three methods in terms of Adjusted Rand Index and achieved good results. This indicates that the method can improve the accuracy of downstream analysis.
W-type barium-nickel ferrite(BaNi_(2)Fe_(16)O_(27))is a highly promising material for electromagnetic wave(EMW)absorption be-cause of its magnetic loss capability for EMW,low cost,large-scale production potential,high...
详细信息
W-type barium-nickel ferrite(BaNi_(2)Fe_(16)O_(27))is a highly promising material for electromagnetic wave(EMW)absorption be-cause of its magnetic loss capability for EMW,low cost,large-scale production potential,high-temperature resistance,and excellent chemical ***,the poor dielectric loss of magnetic ferrites hampers their utilization,hindering enhancement in their EMW-absorption *** efficient strategies that improve the EMW-absorption performance of ferrite is highly desired but re-mains ***,an efficient strategy substituting Ba^(2+)with rare earth La^(3+)in W-type ferrite was proposed for the preparation of novel La-substituted ferrites(Ba_(1-x)LaxNi_(2)Fe_(15.4)O_(27)).The influences of La^(3+)substitution on ferrites’EMW-absorption performance and the dissipative mechanism toward EMW were systematically explored and ***^(3+)efficiently induced lattice defects,enhanced defect-induced polarization,and slightly reduced the ferrites’bandgap,enhancing the dielectric properties of the ***^(3+)also enhanced the ferromagnetic resonance loss and strengthened magnetic *** effects considerably improved the EMW-absorption perform-ance of Ba_(1-x)LaxNi_(2)Fe_(15.4)O_(27)compared with pure W-type *** x=0.2,the best EMW-absorption performance was achieved with a minimum reflection loss of-55.6 dB and effective absorption bandwidth(EAB)of 3.44 GHz.
Deep learning methods for material property prediction have been widely explored to advance materials discovery. However, the prevailing pre-train then fine-tune paradigm often fails to address the inherent diversity ...
详细信息
Single-cell sequencing techniques are often impacted by technical noise, leading to the generation of very sparse expression matrices. This technical noise is referred to as dropouts and poses as a major challenge for...
Single-cell sequencing techniques are often impacted by technical noise, leading to the generation of very sparse expression matrices. This technical noise is referred to as dropouts and poses as a major challenge for downstream analysis. In this study, we introduce scIAMC (single-cell imputation via adaptive parameter matrix completion), which is based on matrix completion theory to recover missing values in expression matrices. To expedite the algorithm's running time and avoid any parameter tuning on data, we formulated an optimization problem. Our approach led to an enhanced cell population identification and minimal errors, while also restoring biological landscapes that were damaged by these dropouts.
Task scheduling is one of key issues in grid computing. This paper focused on the task scheduling problem with a large scale of independent and identical tasks. An improved task scheduling algorithm DMIP is put forwar...
详细信息
Task scheduling is one of key issues in grid computing. This paper focused on the task scheduling problem with a large scale of independent and identical tasks. An improved task scheduling algorithm DMIP is put forward, which is based on time and cost constrains combined with Integer programming but can control the max number of tasks dynamically. Compared with plain Integer programming algorithm, named IP, which only considering time constrains, DMIP algorithm reduced both loss ratios of tasks during the submitting process and the total execution cost by simulation experiments.
This paper presents a Distributed data mining platform on Grid services pool (DDM-GSP), which combines grid services pool with distributed data mining to solve problems of traditional distributed data mining. Meanwhil...
详细信息
This paper presents a Distributed data mining platform on Grid services pool (DDM-GSP), which combines grid services pool with distributed data mining to solve problems of traditional distributed data mining. Meanwhile, this paper implements parallel distributed genetic algorithm to resolve complex function optimization on basis of DDM-GSP. Simulation experiments show that for concentrative mining, with the augmentation of population sizes, the convergent speed of standard genetic algorithm is improved by 39 times and computing time is improved by 81 times. However, improvement of population dimensions, the average consumptive time of distributed genetic algorithm on grid is about 31.7% less than standard concentrative genetic algorithm, while about 28.6% by contrast to traditional parallel genetic algorithm.
暂无评论