维普中文期刊产品整合服务
3篇 您的检索式:作者名="Shichen Zou"
    题名 作者 年代 出处 被引量
1Hybrid Semantic Service Matchmaking Method Based on a Random Forest显示文摘Semantic Service Matchmaking(SSM)can be leveraged for mining the most suitable service to accommodate a diversity of user demands.However,existing research on SSM mostly involves logical or non-logical matching,leading to unavoidable false-positive and false-negative problems.Combining different types of SSM methods is an effective way to improve this situation,but the adaptive combination of different service matching methods is still a difficult issue.To conquer this difficulty,a hybrid SSM method,which is based on a random forest and combines the advantages of existing SSM methods,is proposed in this paper.The result of each SSM method is treated as a multi-dimensional feature vector input for the random forest,converting the service matching into a two classification problem.Therefore,our method avoids the flaws found in manual threshold setting.Experimental results show that the proposed method achieves an outstanding performance.Wei Jiang Junyu Lin Huiqiang Wang Shichen Zou 2020Tsinghua Science and Technology2020,25,6:2
2论冷水机组台架设备效率提升方法研究与实践显示文摘发动机冷水机组台架[1]主要用于进行内燃机深度冷热冲击试验,因能耗高、冷却能力有限导致效率低下一直是行业痛点。文对内燃机典型深度冷热冲击试验工况及试验过程中存在的发动机冷浸时间过长问题进行研究,对设备进行微小改进,通过试验验证发现效率有显著提升。罗富胜 邹仕臣 Zou Shichen 2021时代汽车2021,,14:0
3An effective method for service components selection based on micro-canonical annealing considering dependability assurance显示文摘Distributed virtualization changes the pattern of building software systems. However, it brings some problems on dependability assurance owing to the complex social relationships and interactions between service components. The best way to solve the problems in a distributed virtualized environment is dependable service components selection. Dependable service components selection can be modeled as finding a dependable service path, which is a multiconstrained optimal path problem. In this paper, a service components selection method that searches for the dependable service path in a distributed virtualized environment is proposed from the perspective of dependability assurance. The concept of Quality of Dependability is introduced to describe and constrain software system dependability during dynamic composition. Then, we model the dependable service components selection as a multiconstrained optimal path problem, and apply the Adaptive Bonus-Penalty Microcanonical Annealing algorithm to find the optimal dependable service path. The experimental results show that the proposed algorithm has high search success rate and quick converges.Shichen ZOU Junyu LIN Huiqiang WANG Hongwu LV Guangsheng FENG 2019Frontiers of Computer Science2019,13,2:0
返回顶部 每页显示:
共1页 首页 上一页 第1页 下一页 末页 /1 跳转

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1 渝公网安备 50019002500403号 违法和不良信息举报中心

互联网出版许可证 新出网证(渝)字10号 全国400电话 - 免长途话费