期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Maintenance decision-making method for manufacturing system based on cost and arithmetic reduction of intensity model 被引量:4
1
作者 刘繁茂 朱海平 刘伯兴 《Journal of Central South University》 SCIE EI CAS 2013年第6期1559-1571,共13页
A cost-based selective maintenance decision-making method was presented.The purpose of this method was to find an optimal choice of maintenance actions to be performed on a selected group of machines for manufacturing... A cost-based selective maintenance decision-making method was presented.The purpose of this method was to find an optimal choice of maintenance actions to be performed on a selected group of machines for manufacturing systems.The arithmetic reduction of intensity model was introduced to describe the influence on machine failure intensity by different maintenance actions (preventive maintenance,minimal repair and overhaul).In the meantime,a resolution algorithm combining the greedy heuristic rules with genetic algorithm was provided.Finally,a case study of the maintenance decision-making problem of automobile workshop was given.Furthermore,the case study demonstrates the practicability of this method. 展开更多
关键词 selective maintenance preventive maintenance arithmetic reduction of intensity model hybrid genetic algorithm
下载PDF
The M-computations induced by accessibility relations in nonstandard models M of Hoare logic
2
作者 Cungen CAO Yuefei SUI Zaiyue ZHANG 《Frontiers of Computer Science》 SCIE EI CSCD 2016年第4期717-725,共9页
Hoare logic is a logic used as a way of specifying semantics of programming languages, which has been extended to be a separation logic to reason about mutable heap structure. In a model M of Hoare logic, each program... Hoare logic is a logic used as a way of specifying semantics of programming languages, which has been extended to be a separation logic to reason about mutable heap structure. In a model M of Hoare logic, each program α induces an M-computable function fα M on the universe of M; and the M-recursive functions are defined on M. It will be proved that the class of all the M-computable functions fα M induced by programs is equal to the class of all the M- recursive functions. Moreover, each M-recursive function is ∑ 1 NM -definable in M, where the universal quantifier is a num- ber quantifier ranging over the standard part of a nonstandard model M. 展开更多
关键词 Hoare logic recursive :Function computable function nonstandard model of Peano arithmetic
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部