Biomass is a key factor in fermentation process, directly influencing the performance of the fermentation system as well as the quality and yield of the targeted product. Therefore, the on-line estimation of biomass i...Biomass is a key factor in fermentation process, directly influencing the performance of the fermentation system as well as the quality and yield of the targeted product. Therefore, the on-line estimation of biomass is indispensable. The soft-sensor based on support vector machine （SVM） for an on-line biomass estimation was analyzed in detail, and the improved SVM called the weighted least squares support vector machine was presented to follow the dynamic feature of fermentation process. The model based on the modified SVM was developed and demonstrated using simulation experiments.展开更多
Biomass is a key factor in fermentation process, directly influencing the performance of the fermenta- tion system as well as the quality and yield of the targeted product. Therefore, the on-line estimation of biomass...Biomass is a key factor in fermentation process, directly influencing the performance of the fermenta- tion system as well as the quality and yield of the targeted product. Therefore, the on-line estimation of biomass is indispensable. The soft-sensor based on support vector machine (SVM) for an on-line biomass estimation was ana- lyzed in detail, and the improved SVM called the weighted least squares support vector machine was presented to follow the dynamic feature of fermentation process. The model based on the modified SVM was developed and demonstrated using simulation experiments.展开更多
On-line chatter detection can avoid unstable cutting through monitoring the machining process.In order to identify chatter in a timely manner,an improved Support Vector Machine(SVM)is developed in this paper,based on ...On-line chatter detection can avoid unstable cutting through monitoring the machining process.In order to identify chatter in a timely manner,an improved Support Vector Machine(SVM)is developed in this paper,based on extracted features.In the SVM model,the penalty factor(e)and the core parameter(g)have important influence on the classification,more than from Kernel Functions(KFs).Hence,first the classification results are conducted using different KFs.Then two methods are presented for exploring the best parameters.The chatter identification results show that the Genetic Algorithm(GA)approach is more suitable for deciding the parameters than the Grid Explore(GE)approach.展开更多
Several industrial computers and a server are combined to set up the on-line monitoring and diagnostic system of turbo-generator sets. The main function of the system is to monitor machine sets' running condition....Several industrial computers and a server are combined to set up the on-line monitoring and diagnostic system of turbo-generator sets. The main function of the system is to monitor machine sets' running condition. Through analyzing running data, technicians can detect whether there exist faults and where they occur. To share and transmit the dynamic information of the turbo-generator sets, a distributed network system is introduced. NetWare network operating system is used in the LAN (Local Area Network) system. The LAN is extended to realize the sharing of data and remote transmission of information. Furthermore, functions of monitoring and diagnostic clients are listed.展开更多
Based on the theory of multi-body system (MBS), bine’s and huston’s methods are applied to an on-line measuring system of machining center in this paper. Through the study on modeling technique, the comprehensive mo...Based on the theory of multi-body system (MBS), bine’s and huston’s methods are applied to an on-line measuring system of machining center in this paper. Through the study on modeling technique, the comprehensive model for errors calculation in an on-line measuring System of machining center have been built for the first time. Using this model, the errors can be compensated by soft.ware and the measuring accuracy can be enhanced without any more inveSt. This model can be used in all kinds of machining center.展开更多
On-line estimation of unmeasurable biological variables is important in fermentation processes,directly influencing the optimal control performance of the fermentation system as well as the quality and yield of the ta...On-line estimation of unmeasurable biological variables is important in fermentation processes,directly influencing the optimal control performance of the fermentation system as well as the quality and yield of the targeted product.In this study,a novel strategy for state estimation of fed-batch fermentation process is proposed.By combining a simple and reliable mechanistic dynamic model with the sample-based regressive measurement model,a state space model is developed.An improved algorithm,swarm energy conservation particle swarm optimization(SECPSO) ,is presented for the parameter identification in the mechanistic model,and the support vector machines(SVM) method is adopted to establish the nonlinear measurement model.The unscented Kalman filter(UKF) is designed for the state space model to reduce the disturbances of the noises in the fermentation process.The proposed on-line estimation method is demonstrated by the simulation experiments of a penicillin fed-batch fermentation process.展开更多
In this paper, we consider the on-line scheduling of unit time jobs with rejection on rn identical parallel machines. The objective is to minimize the total completion time of the accepted jobs plus the total penalty ...In this paper, we consider the on-line scheduling of unit time jobs with rejection on rn identical parallel machines. The objective is to minimize the total completion time of the accepted jobs plus the total penalty of the rejected jobs. We give an on-line algorithm for the problem with competitive ratio 1/2 （2 ＋√3） ≈ 1.86602.展开更多
The authors consider the problem of on-line scheduling of unit execution time jobs on uniform machines with rejection penalty. The jobs arrive one by one and can be either accepted and scheduled, or be rejected. The o...The authors consider the problem of on-line scheduling of unit execution time jobs on uniform machines with rejection penalty. The jobs arrive one by one and can be either accepted and scheduled, or be rejected. The objective is to minimize the total completion time of the accepted jobs and the total penalty of the rejection jobs. The authors propose an on-line algorithm and prove that the competitive ratio is 1/2 （2 W √3） ≈ 1.86602.展开更多
We address the problem of preemptively schedule on-line jobs on arbitrary m uniformly related machines with the objective of minimizing the schedule length. We provide the first on-line algorithm for this general prob...We address the problem of preemptively schedule on-line jobs on arbitrary m uniformly related machines with the objective of minimizing the schedule length. We provide the first on-line algorithm for this general problem, and show that the algorithm has a competitive ratio of 1 ± σ, where a (m - 1)s1/(si +…+ sm), S1 S2 Sm being the speeds of the m machines.展开更多
In this paper, the authors consider an on-line scheduling problem of rn （m≥ 3） identical machines with common maintenance time interval and nonresumable availability. For the case that the length of maintenance tim...In this paper, the authors consider an on-line scheduling problem of rn （m≥ 3） identical machines with common maintenance time interval and nonresumable availability. For the case that the length of maintenance time interval is larger than the largest processing time of jobs, the authors prove that any on-line algorithm has not a constant competitive ratio. For the case that the length of maintenance time interval is less than or equal to the largest processing time of jobs, the authors prove a lower bound of 3 on the competitive ratio. The authors give an on-line algorithm with competitive 1 ratio 4 - 1/m. In particular, for the case of m = 3, the authors prove the competitive ratio of the on-line algorithm is 10/3.展开更多
At present,iron and steel enterprises mainly use“after spot test ward”to control final product quality.However,it is impossible to realize on-line quality predetermining for all products by this traditional approach...At present,iron and steel enterprises mainly use“after spot test ward”to control final product quality.However,it is impossible to realize on-line quality predetermining for all products by this traditional approach,hence claims and returns often occur,resulting in major eco-nomic losses of enterprises.In order to realize the on-line quality predetermining for steel products during manufacturing process,the predic-tion models of mechanical properties based on deep learning have been proposed in this work.First,the mechanical properties of deep drawing steels were predicted by using LSTM(long short team memory),GRU(gated recurrent unit)network,and GPR(Gaussian process regression)model,and prediction accuracy and learning efficiency for different models were also discussed.Then,on-line re-learning methods for transfer learning models and model parameters were proposed.The experimental results show that not only the prediction accuracy of optimized trans-fer learning models has been improved,but also predetermining time was shortened to meet real time requirements of on-line property prede-termining.The industrial production data of interstitial-free(IF)steel was used to demonstrate that R2 value of GRU model in training stage reaches more than 0.99,and R2 value in testing stage is more than 0.96.展开更多
基金Supported by the National Natural Science Foundation of China （No.20476007）.
文摘Biomass is a key factor in fermentation process, directly influencing the performance of the fermentation system as well as the quality and yield of the targeted product. Therefore, the on-line estimation of biomass is indispensable. The soft-sensor based on support vector machine （SVM） for an on-line biomass estimation was analyzed in detail, and the improved SVM called the weighted least squares support vector machine was presented to follow the dynamic feature of fermentation process. The model based on the modified SVM was developed and demonstrated using simulation experiments.
基金National Natural Science Foundation of China (No.20476007).
文摘Biomass is a key factor in fermentation process, directly influencing the performance of the fermenta- tion system as well as the quality and yield of the targeted product. Therefore, the on-line estimation of biomass is indispensable. The soft-sensor based on support vector machine (SVM) for an on-line biomass estimation was ana- lyzed in detail, and the improved SVM called the weighted least squares support vector machine was presented to follow the dynamic feature of fermentation process. The model based on the modified SVM was developed and demonstrated using simulation experiments.
文摘On-line chatter detection can avoid unstable cutting through monitoring the machining process.In order to identify chatter in a timely manner,an improved Support Vector Machine(SVM)is developed in this paper,based on extracted features.In the SVM model,the penalty factor(e)and the core parameter(g)have important influence on the classification,more than from Kernel Functions(KFs).Hence,first the classification results are conducted using different KFs.Then two methods are presented for exploring the best parameters.The chatter identification results show that the Genetic Algorithm(GA)approach is more suitable for deciding the parameters than the Grid Explore(GE)approach.
文摘Several industrial computers and a server are combined to set up the on-line monitoring and diagnostic system of turbo-generator sets. The main function of the system is to monitor machine sets' running condition. Through analyzing running data, technicians can detect whether there exist faults and where they occur. To share and transmit the dynamic information of the turbo-generator sets, a distributed network system is introduced. NetWare network operating system is used in the LAN (Local Area Network) system. The LAN is extended to realize the sharing of data and remote transmission of information. Furthermore, functions of monitoring and diagnostic clients are listed.
文摘Based on the theory of multi-body system (MBS), bine’s and huston’s methods are applied to an on-line measuring system of machining center in this paper. Through the study on modeling technique, the comprehensive model for errors calculation in an on-line measuring System of machining center have been built for the first time. Using this model, the errors can be compensated by soft.ware and the measuring accuracy can be enhanced without any more inveSt. This model can be used in all kinds of machining center.
基金Supported by the National Natural Science Foundation of China（20476007 20676013）
文摘On-line estimation of unmeasurable biological variables is important in fermentation processes,directly influencing the optimal control performance of the fermentation system as well as the quality and yield of the targeted product.In this study,a novel strategy for state estimation of fed-batch fermentation process is proposed.By combining a simple and reliable mechanistic dynamic model with the sample-based regressive measurement model,a state space model is developed.An improved algorithm,swarm energy conservation particle swarm optimization(SECPSO) ,is presented for the parameter identification in the mechanistic model,and the support vector machines(SVM) method is adopted to establish the nonlinear measurement model.The unscented Kalman filter(UKF) is designed for the state space model to reduce the disturbances of the noises in the fermentation process.The proposed on-line estimation method is demonstrated by the simulation experiments of a penicillin fed-batch fermentation process.
基金This work is supported by Natural Science Foundation of China under Grant No. 10171054.
文摘In this paper, we consider the on-line scheduling of unit time jobs with rejection on rn identical parallel machines. The objective is to minimize the total completion time of the accepted jobs plus the total penalty of the rejected jobs. We give an on-line algorithm for the problem with competitive ratio 1/2 （2 ＋√3） ≈ 1.86602.
基金the National Natural Science Foundation of China under Grant No.10671108
文摘The authors consider the problem of on-line scheduling of unit execution time jobs on uniform machines with rejection penalty. The jobs arrive one by one and can be either accepted and scheduled, or be rejected. The objective is to minimize the total completion time of the accepted jobs and the total penalty of the rejection jobs. The authors propose an on-line algorithm and prove that the competitive ratio is 1/2 （2 W √3） ≈ 1.86602.
基金This research is supported by National Natural Science Foundation of China Shandong Province the Foundation for University
文摘We address the problem of preemptively schedule on-line jobs on arbitrary m uniformly related machines with the objective of minimizing the schedule length. We provide the first on-line algorithm for this general problem, and show that the algorithm has a competitive ratio of 1 ± σ, where a (m - 1)s1/(si +…+ sm), S1 S2 Sm being the speeds of the m machines.
基金supported by the National Natural Science Foundation of China under Grant Nos.11271338,11171313,61070229,10901144,11001117supported by the Ph.D.Programs Foundation of Ministry ofEducation of China under Grant No.20111401110005the Henan Province Natural Science Foundation under Grant No.112300410047
文摘In this paper, the authors consider an on-line scheduling problem of rn （m≥ 3） identical machines with common maintenance time interval and nonresumable availability. For the case that the length of maintenance time interval is larger than the largest processing time of jobs, the authors prove that any on-line algorithm has not a constant competitive ratio. For the case that the length of maintenance time interval is less than or equal to the largest processing time of jobs, the authors prove a lower bound of 3 on the competitive ratio. The authors give an on-line algorithm with competitive 1 ratio 4 - 1/m. In particular, for the case of m = 3, the authors prove the competitive ratio of the on-line algorithm is 10/3.
基金financially supported by the National Natural Science Foundation of China (No. 52175284)the State Key Lab of Advanced Metals and Materials in University of Science and Technology Beijing (No. 2021ZD08)
文摘At present,iron and steel enterprises mainly use“after spot test ward”to control final product quality.However,it is impossible to realize on-line quality predetermining for all products by this traditional approach,hence claims and returns often occur,resulting in major eco-nomic losses of enterprises.In order to realize the on-line quality predetermining for steel products during manufacturing process,the predic-tion models of mechanical properties based on deep learning have been proposed in this work.First,the mechanical properties of deep drawing steels were predicted by using LSTM(long short team memory),GRU(gated recurrent unit)network,and GPR(Gaussian process regression)model,and prediction accuracy and learning efficiency for different models were also discussed.Then,on-line re-learning methods for transfer learning models and model parameters were proposed.The experimental results show that not only the prediction accuracy of optimized trans-fer learning models has been improved,but also predetermining time was shortened to meet real time requirements of on-line property prede-termining.The industrial production data of interstitial-free(IF)steel was used to demonstrate that R2 value of GRU model in training stage reaches more than 0.99,and R2 value in testing stage is more than 0.96.
