期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到3篇文章
< 1 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Drifting model approach to modeling based on weighted support vector machines 认领 引用 被引量：1
1
作者 FengRui SongChunlin ShaoHuihe 《Journal of Systems Engineering and Electronics》 2004年第4期610-614,共5页
This paper proposes a novel drifting modeling (DM) method. Briefly, we first employ an improved SVMs algorithm named weighted support vector machines (W.SVMs), which is suitable for locally learning, and then the DM m... This paper proposes a novel drifting modeling (DM) method. Briefly, we first employ an improved SVMs algorithm named weighted support vector machines (W.SVMs), which is suitable for locally learning, and then the DM method using the algorithm is proposed. By applying the proposed modeling method to Fluidized Catalytic Cracking Unit (FCCU), the simulation results show that the property of this proposed approach is superior to global modeling method based on standard SVMs. 展开更多
暂未订购 下载PDF
Computing the SKT Reliability of Acyclic Directed Networks Using Factoring Method 认领 引用 被引量：3
2
作者 孔繁甲 王光兴 《Journal of Computer Science & Technology》 SCIE EI 1999年第1期56-63,共8页
This paper presents a factoring algorithm for computing source-to- K terminal (SKT) reliability, the probability that a source s can send message to a specified set of terminals K, in acyclic directed networks (AD-net... This paper presents a factoring algorithm for computing source-to- K terminal (SKT) reliability, the probability that a source s can send message to a specified set of terminals K, in acyclic directed networks (AD-networks) in which both nodes and edges can fail. Based on Pivotal decomposition theorem, a new formula is derived for computing the SKT reliability of AD-networks. By establishing a topological property of AD-networks, it is shown that the SKT reliability of AD- networks can be computed by recursively applying this formula. Two new Reliability- Preserving Reductions are also introduced. The recursion tree generated by the presented algorithm has at most 2 leaf nodes, where V and K are the numbers of nodes and terminals, respectively, while C is the number of the nodes satisfying some specified conditions. The computation complexity of the new algorithm is O (E. V. 2) in the worst case, where E is the number of edges. For source-to-all-terminal (SAT) reliability, its computation complexity is O(E). Comparison of the new algorithm with the existing ones indicates that the new algorithm is more efficient for computing the SKT reliability of AD-networks. 展开更多
关键词 network reliability acyclic directed network factoring algorithm reliability-preserving reduction
暂未订购 下载PDF
RPE Query Processing and Optimization Techniques for XML Databases 认领 引用 被引量：7
3
作者 Guo-RenWang BingSun Jian-HuaLv GeYu 《Journal of Computer Science & Technology》 SCIE EI 2004年第2期224-237,共14页
An extent join to compute path expressions containing parent-children andancestor-descendent operations and two path expression optimization rules, path-shortening andpath-complementing, are presented in this paper. P... An extent join to compute path expressions containing parent-children andancestor-descendent operations and two path expression optimization rules, path-shortening andpath-complementing, are presented in this paper. Path-shortening reduces the number of joins byshortening the path while path-complementing optimizes the path execution by using an equivalentcomplementary path expression to compute the original one. Experimental results show that thealgorithms proposed are more efficient than traditional algorithms. 展开更多
关键词 XML regular path expressions query processing and optimization
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈