期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
基于数据流相似查询的SCT整合优化算法
1
作者 左利云 《茂名学院学报》 2009年第6期43-46,共4页
提出了一种新的基于数据流相似查询的sct整合优化算法,解决了数据流系统中数据流序列庞大且速度慢的问题。算法先对数据流进行提取和整合形成相似数据流摘要,然后进行相似性查询。经实验证明算法确实有效,并比传统相似查询算法提高了查... 提出了一种新的基于数据流相似查询的sct整合优化算法,解决了数据流系统中数据流序列庞大且速度慢的问题。算法先对数据流进行提取和整合形成相似数据流摘要,然后进行相似性查询。经实验证明算法确实有效,并比传统相似查询算法提高了查询速度和精确率。 展开更多
关键词 数据流 相似性查询 整合优化算法 sct相似性
下载PDF
Modeling and Optimization for Short-term Scheduling of Multipurpose Batch Plants 被引量:3
2
作者 陈国辉 鄢烈祥 史彬 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2014年第6期682-689,共8页
In the past two decades, short-term scheduling of multipurpose batch plants has received significant attention. Most scheduling problems are modeled using either state-task-network or resource-task-network(RTN) proces... In the past two decades, short-term scheduling of multipurpose batch plants has received significant attention. Most scheduling problems are modeled using either state-task-network or resource-task-network(RTN) process representation. In this paper, an improved mixed integer linear programming model for short-term schedul-ing of multipurpose batch plants under maximization of profit is proposed based on RTN representation and unit-specific events. To solve the model, a hybrid algorithm based on line-up competition algorithm and linear programming is presented. The proposed model and hybrid algorithm are applied to two benchmark examples in literature. The simulation results show that the proposed model and hybrid algorithm are effective for short-term scheduling of multipurpose batch plants. 展开更多
关键词 batch plants resource-task-network unit-specific event line-up competition algorithm linear programming
下载PDF
ON THE CONVERGENCE OF A NEW HYBRID PROJECTION ALGORITHM
3
作者 Qian LIU Changyu WANG Xinmin YANG 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2006年第3期423-430,共8页
For unconstrained optimization, a new hybrid projection algorithm is presented m the paper. This algorithm has some attractive convergence properties. Convergence theory can be obtained under the condition that Δ↓f... For unconstrained optimization, a new hybrid projection algorithm is presented m the paper. This algorithm has some attractive convergence properties. Convergence theory can be obtained under the condition that Δ↓f(x) is uniformly continuous. If Δ↓f(x) is continuously differentiable pseudo-convex, the whole sequence of iterates converges to a solution of the problem without any other assumptions. Furthermore, under appropriate conditions one shows that the sequence of iterates has a cluster-point if and only if Ω* ≠ θ. Numerical examples are given at the end of this paper. 展开更多
关键词 Global convergence hybrid projection unconstrained optimization.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部