This article aims to explore effective ways to enhance the affinity of ideological and political course teachers in universities.By analyzing the connotation of affinity,the factors that affect the affinity of ideolog...This article aims to explore effective ways to enhance the affinity of ideological and political course teachers in universities.By analyzing the connotation of affinity,the factors that affect the affinity of ideological and political course teachers are analyzed,and corresponding improvement strategies are proposed.Research suggests that strengthening the construction of teacher ethics and conduct,improving teaching skills,enhancing emotional engagement,and enhancing practical training are key paths to enhance the affinity of ideological and political course teachers.The implementation of these paths will help improve the teaching quality and effectiveness of ideological and political courses,and promote the comprehensive development of students.展开更多
Virtual machine(VM)consolidation is an effective way to improve resource utilization and reduce energy consumption in cloud data centers.Most existing studies have considered VM consolidation as a bin-packing problem,...Virtual machine(VM)consolidation is an effective way to improve resource utilization and reduce energy consumption in cloud data centers.Most existing studies have considered VM consolidation as a bin-packing problem,but the current schemes commonly ignore the long-term relationship between VMs and hosts.In addition,there is a lack of long-term consideration for resource optimization in the VM consolidation,which results in unnecessary VM migration and increased energy consumption.To address these limitations,a VM consolidation method based on multi-step prediction and affinity-aware technique for energy-efficient cloud data centers(MPaAF-VMC)is proposed.The proposed method uses an improved linear regression prediction algorithm to predict the next-moment resource utilization of hosts and VMs,and obtains the stage demand of resources in the future period through multi-step prediction,which is realized by iterative prediction.Then,based on the multi-step prediction,an affinity model between the VM and host is designed using the first-order correlation coefficient and Euclidean distance.During the VM consolidation,the affinity value is used to select the migration VM and placement host.The proposed method is compared with the existing consolidation algorithms on the PlanetLab and Google cluster real workload data using the CloudSim simulation platform.Experimental results show that the proposed method can achieve significant improvement in reducing energy consumption,VM migration costs,and service level agreement(SLA)violations.展开更多
Affinity propagation(AP)is a widely used exemplar-based clustering approach with superior efficiency and clustering quality.Nevertheless,a common issue with AP clustering is the presence of excessive exemplars,which l...Affinity propagation(AP)is a widely used exemplar-based clustering approach with superior efficiency and clustering quality.Nevertheless,a common issue with AP clustering is the presence of excessive exemplars,which limits its ability to perform effective aggregation.This research aims to enable AP to automatically aggregate to produce fewer and more compact clusters,without changing the similarity matrix or customizing preference parameters,as done in existing enhanced approaches.An automatic aggregation enhanced affinity propagation(AAEAP)clustering algorithm is proposed,which combines a dependable partitioning clustering approach with AP to achieve this purpose.The partitioning clustering approach generates an additional set of findings with an equivalent number of clusters whenever the clustering stabilizes and the exemplars emerge.Based on these findings,mutually exclusive exemplar detection was conducted on the current AP exemplars,and a pair of unsuitable exemplars for coexistence is recommended.The recommendation is then mapped as a novel constraint,designated mutual exclusion and aggregation.To address this limitation,a modified AP clustering model is derived and the clustering is restarted,which can result in exemplar number reduction,exemplar selection adjustment,and other data point redistribution.The clustering is ultimately completed and a smaller number of clusters are obtained by repeatedly performing automatic detection and clustering until no mutually exclusive exemplars are detected.Some standard classification data sets are adopted for experiments on AAEAP and other clustering algorithms for comparison,and many internal and external clustering evaluation indexes are used to measure the clustering performance.The findings demonstrate that the AAEAP clustering algorithm demonstrates a substantial automatic aggregation impact while maintaining good clustering quality.展开更多
Drug target relationship(DTR)prediction is a rapidly evolving area of research in com-putational drug discovery.Despite recent advances in computational solutions that have overcome the challenges of in vitro and in v...Drug target relationship(DTR)prediction is a rapidly evolving area of research in com-putational drug discovery.Despite recent advances in computational solutions that have overcome the challenges of in vitro and in vivo experiments,most computational methods still focus on binary classification.They ignore the importance of binding affinity,which correctly distinguishes between on-targets and off-targets.In this study,we propose a deep learning model based on the microstruc-ture of compounds and proteins to predict drug-target binding affinity(DTA),which utilizes topo-logical structure information of drug molecules and sequence semantic information of proteins.In this model,graph attention network(GAT)is used to capture the deep features of the compound molecular graph,and bidirectional long short-term memory(BiLSTM)network is used to extract the protein sequence features,and the pharmacological context of DTA is obtained by combining the two.The results show that the proposed model has achieved superior performance in both cor-rectly predicting the value of interaction strength and correctly discriminating the ranking of bind-ing strength compared to the state-of-the-art baselines.A case study experiment on COVID-19 con-firms that the proposed DTA model can be used as an effective pre-screening tool in drug discovery.展开更多
The formulae for parameters of a negative electron affinity semiconductor(NEAS)with large mean escape depth of secondary electrons A(NEASLD)are deduced.The methods for obtaining parameters such asλ,B,E_(pom)and the m...The formulae for parameters of a negative electron affinity semiconductor(NEAS)with large mean escape depth of secondary electrons A(NEASLD)are deduced.The methods for obtaining parameters such asλ,B,E_(pom)and the maximumδandδat 100.0 keV≥E_(po)≥1.0 keV of a NEASLD with the deduced formulae are presented(B is the probability that an internal secondary electron escapes into the vacuum upon reaching the emission surface of the emitter,δis the secondary electron yield,E_(po)is the incident energy of primary electrons and E_(pom)is the E_(po)corresponding to the maximumδ).The parameters obtained here are analyzed,and it can be concluded that several parameters of NEASLDs obtained by the methods presented here agree with those obtained by other authors.The relation between the secondary electron emission and photoemission from a NEAS with large mean escape depth of excited electrons is investigated,and it is concluded that the presented method of obtaining A is more accurate than that of obtaining the corresponding parameter for a NEAS with largeλ_(ph)(λ_(ph)being the mean escape depth of photoelectrons),and that the presented method of calculating B at E_(po)>10.0 keV is more widely applicable for obtaining the corresponding parameters for a NEAS with largeλ_(ph).展开更多
针对传统近邻传播聚类算法以数据点对之间的相似度作为输入度量,由于需要预设偏向参数p和阻尼系数λ,算法精度无法精确控制的问题,提出了一种跳跃跟踪麻雀搜索算法优化的交叉迭代近邻传播聚类方法.首先,针对麻雀搜索算法中发现者和加入...针对传统近邻传播聚类算法以数据点对之间的相似度作为输入度量,由于需要预设偏向参数p和阻尼系数λ,算法精度无法精确控制的问题,提出了一种跳跃跟踪麻雀搜索算法优化的交叉迭代近邻传播聚类方法.首先,针对麻雀搜索算法中发现者和加入者位置更新不足的问题,设计了一种跳跃跟踪优化策略,通过考虑偏好阻尼因子的跳跃策略设计大步长更新发现者,增加麻雀搜索算法的全局勘探能力和寻优速度,加入者设计动态小步长跟踪领头雀更新位置,同时,利用自适应种群划分机制更新发现者和加入者的比重,增加算法的后期局部开发能力和寻优速度;其次,设计基于扰动因子的Tent映射,在此基础上增加3个参数,使映射分布范围增大,并避免了陷入小周期点和不稳周期点;最后,引入轮廓系数作为评价函数,跳跃跟踪麻雀搜索算法自动寻找较优的p和λ,代替手动输入参数,并融合基于扰动因子的Tent映射优化近邻传播算法,交叉迭代确定最优簇数.使用多种算法聚类University of California Irvine数据集的10种公共数据集,仿真结果表明,本文提出的聚类算法与经典近邻传播算法、基于差分改进的仿射传播聚类算法、基于麻雀搜索算法优化的近邻传播聚类算法和进化近邻传播算法相比具有更优的搜索效率以及聚类精度.对国家信息数据进行了聚类分析,提出的方法更加准确有效合理,具有较好的应用价值.展开更多
文摘This article aims to explore effective ways to enhance the affinity of ideological and political course teachers in universities.By analyzing the connotation of affinity,the factors that affect the affinity of ideological and political course teachers are analyzed,and corresponding improvement strategies are proposed.Research suggests that strengthening the construction of teacher ethics and conduct,improving teaching skills,enhancing emotional engagement,and enhancing practical training are key paths to enhance the affinity of ideological and political course teachers.The implementation of these paths will help improve the teaching quality and effectiveness of ideological and political courses,and promote the comprehensive development of students.
基金supported by the National Natural Science Foundation of China(62172089,61972087,62172090).
文摘Virtual machine(VM)consolidation is an effective way to improve resource utilization and reduce energy consumption in cloud data centers.Most existing studies have considered VM consolidation as a bin-packing problem,but the current schemes commonly ignore the long-term relationship between VMs and hosts.In addition,there is a lack of long-term consideration for resource optimization in the VM consolidation,which results in unnecessary VM migration and increased energy consumption.To address these limitations,a VM consolidation method based on multi-step prediction and affinity-aware technique for energy-efficient cloud data centers(MPaAF-VMC)is proposed.The proposed method uses an improved linear regression prediction algorithm to predict the next-moment resource utilization of hosts and VMs,and obtains the stage demand of resources in the future period through multi-step prediction,which is realized by iterative prediction.Then,based on the multi-step prediction,an affinity model between the VM and host is designed using the first-order correlation coefficient and Euclidean distance.During the VM consolidation,the affinity value is used to select the migration VM and placement host.The proposed method is compared with the existing consolidation algorithms on the PlanetLab and Google cluster real workload data using the CloudSim simulation platform.Experimental results show that the proposed method can achieve significant improvement in reducing energy consumption,VM migration costs,and service level agreement(SLA)violations.
基金supported by Research Team Development Funds of L.Xue and Z.H.Ouyang,Electronic Countermeasure Institute,National University of Defense Technology。
文摘Affinity propagation(AP)is a widely used exemplar-based clustering approach with superior efficiency and clustering quality.Nevertheless,a common issue with AP clustering is the presence of excessive exemplars,which limits its ability to perform effective aggregation.This research aims to enable AP to automatically aggregate to produce fewer and more compact clusters,without changing the similarity matrix or customizing preference parameters,as done in existing enhanced approaches.An automatic aggregation enhanced affinity propagation(AAEAP)clustering algorithm is proposed,which combines a dependable partitioning clustering approach with AP to achieve this purpose.The partitioning clustering approach generates an additional set of findings with an equivalent number of clusters whenever the clustering stabilizes and the exemplars emerge.Based on these findings,mutually exclusive exemplar detection was conducted on the current AP exemplars,and a pair of unsuitable exemplars for coexistence is recommended.The recommendation is then mapped as a novel constraint,designated mutual exclusion and aggregation.To address this limitation,a modified AP clustering model is derived and the clustering is restarted,which can result in exemplar number reduction,exemplar selection adjustment,and other data point redistribution.The clustering is ultimately completed and a smaller number of clusters are obtained by repeatedly performing automatic detection and clustering until no mutually exclusive exemplars are detected.Some standard classification data sets are adopted for experiments on AAEAP and other clustering algorithms for comparison,and many internal and external clustering evaluation indexes are used to measure the clustering performance.The findings demonstrate that the AAEAP clustering algorithm demonstrates a substantial automatic aggregation impact while maintaining good clustering quality.
文摘Drug target relationship(DTR)prediction is a rapidly evolving area of research in com-putational drug discovery.Despite recent advances in computational solutions that have overcome the challenges of in vitro and in vivo experiments,most computational methods still focus on binary classification.They ignore the importance of binding affinity,which correctly distinguishes between on-targets and off-targets.In this study,we propose a deep learning model based on the microstruc-ture of compounds and proteins to predict drug-target binding affinity(DTA),which utilizes topo-logical structure information of drug molecules and sequence semantic information of proteins.In this model,graph attention network(GAT)is used to capture the deep features of the compound molecular graph,and bidirectional long short-term memory(BiLSTM)network is used to extract the protein sequence features,and the pharmacological context of DTA is obtained by combining the two.The results show that the proposed model has achieved superior performance in both cor-rectly predicting the value of interaction strength and correctly discriminating the ranking of bind-ing strength compared to the state-of-the-art baselines.A case study experiment on COVID-19 con-firms that the proposed DTA model can be used as an effective pre-screening tool in drug discovery.
基金Project supported by the National Natural Science Foundation of China(Grant No.11873013)。
文摘The formulae for parameters of a negative electron affinity semiconductor(NEAS)with large mean escape depth of secondary electrons A(NEASLD)are deduced.The methods for obtaining parameters such asλ,B,E_(pom)and the maximumδandδat 100.0 keV≥E_(po)≥1.0 keV of a NEASLD with the deduced formulae are presented(B is the probability that an internal secondary electron escapes into the vacuum upon reaching the emission surface of the emitter,δis the secondary electron yield,E_(po)is the incident energy of primary electrons and E_(pom)is the E_(po)corresponding to the maximumδ).The parameters obtained here are analyzed,and it can be concluded that several parameters of NEASLDs obtained by the methods presented here agree with those obtained by other authors.The relation between the secondary electron emission and photoemission from a NEAS with large mean escape depth of excited electrons is investigated,and it is concluded that the presented method of obtaining A is more accurate than that of obtaining the corresponding parameter for a NEAS with largeλ_(ph)(λ_(ph)being the mean escape depth of photoelectrons),and that the presented method of calculating B at E_(po)>10.0 keV is more widely applicable for obtaining the corresponding parameters for a NEAS with largeλ_(ph).
文摘针对传统近邻传播聚类算法以数据点对之间的相似度作为输入度量,由于需要预设偏向参数p和阻尼系数λ,算法精度无法精确控制的问题,提出了一种跳跃跟踪麻雀搜索算法优化的交叉迭代近邻传播聚类方法.首先,针对麻雀搜索算法中发现者和加入者位置更新不足的问题,设计了一种跳跃跟踪优化策略,通过考虑偏好阻尼因子的跳跃策略设计大步长更新发现者,增加麻雀搜索算法的全局勘探能力和寻优速度,加入者设计动态小步长跟踪领头雀更新位置,同时,利用自适应种群划分机制更新发现者和加入者的比重,增加算法的后期局部开发能力和寻优速度;其次,设计基于扰动因子的Tent映射,在此基础上增加3个参数,使映射分布范围增大,并避免了陷入小周期点和不稳周期点;最后,引入轮廓系数作为评价函数,跳跃跟踪麻雀搜索算法自动寻找较优的p和λ,代替手动输入参数,并融合基于扰动因子的Tent映射优化近邻传播算法,交叉迭代确定最优簇数.使用多种算法聚类University of California Irvine数据集的10种公共数据集,仿真结果表明,本文提出的聚类算法与经典近邻传播算法、基于差分改进的仿射传播聚类算法、基于麻雀搜索算法优化的近邻传播聚类算法和进化近邻传播算法相比具有更优的搜索效率以及聚类精度.对国家信息数据进行了聚类分析,提出的方法更加准确有效合理,具有较好的应用价值.
