电梯集群控制系统可根据乘客呼梯信号作出最有利的响应,以实现呼梯人员的目的。针对当前自动化远程监控应用水平较低及电梯异常情况频繁出现的情况,构建了一个基于WinCC(Windows Control Center,视窗控制中心)、最小等待时间电梯群控调...电梯集群控制系统可根据乘客呼梯信号作出最有利的响应,以实现呼梯人员的目的。针对当前自动化远程监控应用水平较低及电梯异常情况频繁出现的情况,构建了一个基于WinCC(Windows Control Center,视窗控制中心)、最小等待时间电梯群控调度算法、S7-1200 PLC、PC的一套电梯监控系统。所设计的系统能够实现集中运行和远程监控,在WinCC平台完成电梯用户登录系统、电梯运行状态监控子界面设计、关键数据报表输出功能,最后利用电梯仿真平台对系统进行了验证测试。仿真测试结果显示,所设计的控制系统稳定可靠。展开更多
Based on the idea of the set-membership identification, a modified recursive least squares algorithm with variable gain, variable forgetting factor and resetting is presented. The concept of the error tolerance level ...Based on the idea of the set-membership identification, a modified recursive least squares algorithm with variable gain, variable forgetting factor and resetting is presented. The concept of the error tolerance level is proposed. The selection criteria of the error tolerance level are also given according to the min-max principle. The algorithm is particularly suitable for tracing time-varying systems and is similar in computational complexity to the standard recursive least squares algorithm. The superior performance of the algorithm is verified ma simulation studies on a dynamic fermentation process.展开更多
The transfer system,an important subsystem in urban citizen passenger transport system,is a guarantee of public transport priority and is crucial in the whole urban passenger transport traffic.What the majority of bus...The transfer system,an important subsystem in urban citizen passenger transport system,is a guarantee of public transport priority and is crucial in the whole urban passenger transport traffic.What the majority of bus passengers consider is the convenience and comfort of the bus ride,which reduces the transfer time of bus passengers."Transfer time" is considered to be the first factor by the majority of bus passengers who select the routes.In this paper,according to the needs of passengers,optimization algorithm,with the minimal distance being the first goal,namely,the improved Dijkstra algorithm based on the minimal distance,is put forward on the basis of the optimization algorithm with the minimal transfer time being the first goal.展开更多
This paper considers two parallel machine scheduling problems, where the objectives of both problems are to minimize the makespan, and the jobs arrive over time, on two uniform machines with speeds 1 and s （s 〉 1）,...This paper considers two parallel machine scheduling problems, where the objectives of both problems are to minimize the makespan, and the jobs arrive over time, on two uniform machines with speeds 1 and s （s 〉 1）, and on m identical machines, respectively. For the first problem, the authors show that the on-line LPT algorithm has a competitive ratio of （1 ＋ √5）/2 ≈ 1.6180 and the bound is tight. Furthermore, the authors prove that the on-line LPT algorithm has the best possible competitive ratio if s ≥ 1.8020. For the second problem, the authors present a lower bound of （15 - √17）/8 ≈ 1.3596 on the competitive ratio of any deterministic on-line algorithm. This improves a previous result of 1.3473.展开更多
文摘电梯集群控制系统可根据乘客呼梯信号作出最有利的响应,以实现呼梯人员的目的。针对当前自动化远程监控应用水平较低及电梯异常情况频繁出现的情况,构建了一个基于WinCC(Windows Control Center,视窗控制中心)、最小等待时间电梯群控调度算法、S7-1200 PLC、PC的一套电梯监控系统。所设计的系统能够实现集中运行和远程监控,在WinCC平台完成电梯用户登录系统、电梯运行状态监控子界面设计、关键数据报表输出功能,最后利用电梯仿真平台对系统进行了验证测试。仿真测试结果显示,所设计的控制系统稳定可靠。
文摘Based on the idea of the set-membership identification, a modified recursive least squares algorithm with variable gain, variable forgetting factor and resetting is presented. The concept of the error tolerance level is proposed. The selection criteria of the error tolerance level are also given according to the min-max principle. The algorithm is particularly suitable for tracing time-varying systems and is similar in computational complexity to the standard recursive least squares algorithm. The superior performance of the algorithm is verified ma simulation studies on a dynamic fermentation process.
基金supported by School Foundation of North University of ChinaPostdoctoral granted financial support from China Postdoctoral Science Foundation(20100481307)+1 种基金Natural Science Foundation of Shanxi(2009011018-3)National Natural Science Foundation of China(60876077)
文摘The transfer system,an important subsystem in urban citizen passenger transport system,is a guarantee of public transport priority and is crucial in the whole urban passenger transport traffic.What the majority of bus passengers consider is the convenience and comfort of the bus ride,which reduces the transfer time of bus passengers."Transfer time" is considered to be the first factor by the majority of bus passengers who select the routes.In this paper,according to the needs of passengers,optimization algorithm,with the minimal distance being the first goal,namely,the improved Dijkstra algorithm based on the minimal distance,is put forward on the basis of the optimization algorithm with the minimal transfer time being the first goal.
基金supported by the Special Funds of the National Natural Science Foundation of China under Grant No.61340045the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No.20123705110003Innovation Project of Shangdong Graduate Education under Grant No.SDYC13036
文摘This paper considers two parallel machine scheduling problems, where the objectives of both problems are to minimize the makespan, and the jobs arrive over time, on two uniform machines with speeds 1 and s （s 〉 1）, and on m identical machines, respectively. For the first problem, the authors show that the on-line LPT algorithm has a competitive ratio of （1 ＋ √5）/2 ≈ 1.6180 and the bound is tight. Furthermore, the authors prove that the on-line LPT algorithm has the best possible competitive ratio if s ≥ 1.8020. For the second problem, the authors present a lower bound of （15 - √17）/8 ≈ 1.3596 on the competitive ratio of any deterministic on-line algorithm. This improves a previous result of 1.3473.
