期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Fast Algorithms of Mining Probability Functional Dependency Rules in Relational Database 被引量:1
1
作者 陶晓鹏 周傲英 胡运发 《Journal of Computer Science & Technology》 SCIE EI CSCD 2000年第3期261-270,共10页
This paper defines a new kind of rule, probability functional dependency rule. The functional dependency degree can be depicted by this kind of rule. Five algorithms, from the simple to the complex, are presefited to ... This paper defines a new kind of rule, probability functional dependency rule. The functional dependency degree can be depicted by this kind of rule. Five algorithms, from the simple to the complex, are presefited to mine this kind of rule in different condition. The related theorems are proved to ensure the high efficiency and the correctness of the above algorithms. 展开更多
关键词 data mining functional dependency relationship (FD) probability functional dependency rule (PFDR) relational database
原文传递
NEW NONSTANDARD JOB SHOP SCHEDULING ALGORITHM 被引量:10
2
作者 XIE Zhiqiang YE Guangjie +1 位作者 ZHANG Dali TAN Guangyu 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2008年第4期97-100,共4页
Considering the complex constraint between operations in nonstandard job shop scheduling problem (NJSSP), critical path of job manufacturing tree is determined according to priority scheduling function constructed. ... Considering the complex constraint between operations in nonstandard job shop scheduling problem (NJSSP), critical path of job manufacturing tree is determined according to priority scheduling function constructed. Operations are divided into dependent operations and independent operations with the idea of subsection, and corresponding scheduling strategy is put forward according to operation characteristic in the segment and the complementarities of identical function machines. Forward greedy rule is adopted mainly for dependent operations to make operations arranged in the right position of machine selected, then each operation can be processed as early as possible, and the total processing time of job can be shortened as much as possible. For independent operations optimum scheduling rule is adopted mainly, the inserting position of operations will be determined according to the gap that the processing time of operations is subtracted from idle time of machine, and the operation will be inserted in the position with minimal gap. Experiments show, under the same conditions, the result that operations are scheduled according to the object function constructed, and the scheduling strategy adopted is better than the result that operations are scheduled according to efficiency scheduling algorithm. 展开更多
关键词 Nonstandard job shop scheduling Priority scheduling function Subsection Forward greedy rule Optimum scheduling rule
下载PDF
A comprehensive revisit of the ρ meson with improved Monte-Carlo based QCD sum rules
3
作者 王齐男 张珠峰 +2 位作者 T.G.Steele 金洪英 黄卓然 《Chinese Physics C》 SCIE CAS CSCD 2017年第7期96-106,共11页
We improve the Monte-Carlo based QCD sum rules by introducing the rigorous Hoolder-inequalitydetermined sum rule window and a Breit-Wigner type parametrization for the phenomenological spectral function.In this improv... We improve the Monte-Carlo based QCD sum rules by introducing the rigorous Hoolder-inequalitydetermined sum rule window and a Breit-Wigner type parametrization for the phenomenological spectral function.In this improved sum rule analysis methodology, the sum rule analysis window can be determined without any assumptions on OPE convergence or the QCD continuum. Therefore, an unbiased prediction can be obtained for the phenomenological parameters(the hadronic mass and width etc.). We test the new approach in the ρ meson channel with re-examination and inclusion of αs corrections to dimension-4 condensates in the OPE. We obtain results highly consistent with experimental values. We also discuss the possible extension of this method to some other channels. 展开更多
关键词 QCD sum rules Hlder inequality phenomenological spectral function αs corrections to dimension-4 operators
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部