Abstract Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by reallocating resources. In ...Abstract Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by reallocating resources. In this paper, authors consider a machine scheduling problem with controllable processing times. In the first part of this paper, a special case where the processing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O(n 2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case. An effective heuristic to the general problem will be presented.展开更多
Job-shop scheduling problem with discretely controllable processing times (JSP-DCPT) is modeled based on the disjunctive graph, and the formulation of JSP-DCPT is presented. A three-step decomposition approach is prop...Job-shop scheduling problem with discretely controllable processing times (JSP-DCPT) is modeled based on the disjunctive graph, and the formulation of JSP-DCPT is presented. A three-step decomposition approach is proposed so that JSP-DCPT can be handled by solving a job-shop scheduling problem (JSP) and a series of discrete time-cost tradeoff problems. To simplify the decomposition approach, the time-cost phase plane is introduced to describe tradeoffs of the discrete time-cost tradeoff problem, and an extreme mode-based set dominant theory is elaborated so that an upper bound is determined to cut discrete time-cost tradeoff problems generated by using the proposed decomposition approach. An extreme mode-based set dominant decomposition algorithm (EMSDDA) is then proposed. Experimental simulations for instance JSPDCPT_FT10, which is designed based on a JSP benchmark FT10, demonstrate the effectiveness of the proposed theory and the decomposition approach.展开更多
Due date quotation and scheduling are important tools to match demand with production capacity in the MTO （make-to-order） environment. We consider an order scheduling problem faced by a manufacturing f＇trm operatin...Due date quotation and scheduling are important tools to match demand with production capacity in the MTO （make-to-order） environment. We consider an order scheduling problem faced by a manufacturing f＇trm operating in an MTO environment, where the firm needs to quote a common due date for the customers, and simultaneously control the processing times of customer orders （by allocating extra resources to process the orders） so as to complete the orders before a given deadline. The objective is to minimize the total costs of earliness, tardiness, due date assignment and extra resource consumption. We show the problem is NP-hard, even if the cost weights for controlling the order processing times are identical. We identify several polynomially solvable cases of the problem, and develop a branch and bound algorithm and three Tabu search algorithms to solve the general problem. We then conduct computational experiments to evaluate the performance of the three Tabu-search algorithms and show that they are generally effective in terms of solution quality.展开更多
In this paper, a single-machine scheduling model with a given common due date is considered. Job processing time is a linear decreasing function of its starting time. The objective function is to minimize the total we...In this paper, a single-machine scheduling model with a given common due date is considered. Job processing time is a linear decreasing function of its starting time. The objective function is to minimize the total weighted earliness award and tardiness penalty. Our aim is to find an optimal schedule so as to minimize the objective function. As the problem is NP-hard, some properties and polynomial time solvable cases of this problem are given. A dynamic programming algorithm for the general case of the problem is provided.展开更多
A real time algorithm is presented here to recognize and analyze 8 channel simultaneous electro cardiograph(ECG). The algorithm transforms 8 channel simultaneous ECG into three orthogonal vectors and spatial veloc...A real time algorithm is presented here to recognize and analyze 8 channel simultaneous electro cardiograph(ECG). The algorithm transforms 8 channel simultaneous ECG into three orthogonal vectors and spatial velocity first, then forms the spatial velocity sample, and uses this spatial velocity sample to recognize each beat. The algorithm computes the averaged parameters by using averaged spatial velocity and the averaged ECG and the current parameters by using the current beat period and current width of QRS. The algorithm can recognize P, QRS and T onsets and ends of simultaneous 12 lead ECG precisely, and some arrhythmias such as premature ventricular beat, ventricular escape beat, R on T, bigeminy, trigeminy. The algorithm software works well on a real 8 channel ECG system and meets the demands of designing.展开更多
Big health data collection and storing for further analysis is a challenging task because this knowledge is big and has many features.Several cloud-based IoT health providers have been described in the literature prev...Big health data collection and storing for further analysis is a challenging task because this knowledge is big and has many features.Several cloud-based IoT health providers have been described in the literature previously.Furthermore,there are a number of issues related to time consumed and overall network performance when it comes to big data information.In the existing method,less performed optimization algorithms were used for optimizing the data.In the proposed method,the Chaotic Cuckoo Optimization algorithm was used for feature selection,and Convolutional Support Vector Machine(CSVM)was used.The research presents a method for analyzing healthcare information that uses in future prediction.The major goal is to take a variety of data while improving efficiency and minimizing process time.The suggested method employs a hybrid method that is divided into two stages.In the first stage,it reduces the features by using the Chaotic Cuckoo Optimization algorithm with Levy flight,opposition-based learning,and distributor operator.In the second stage,CSVM is used which combines the benefits of convolutional neural network(CNN)and SVM.The CSVM modifies CNN’s convolution product to learn hidden deep inside data sources.For improved economic flexibility,greater protection,greater analytics with confidentiality,and lower operating cost,the suggested approach is built on fog computing.Overall results of the experiments show that the suggested method can minimize the number of features in the datasets,enhances the accuracy by 82%,and decrease the time of the process.展开更多
In this paper, single machine scheduling problems with variable processing time are raised. The criterions of the problem considered are minimizing scheduling length of all jobs, flow time and number of tardy jobs and...In this paper, single machine scheduling problems with variable processing time are raised. The criterions of the problem considered are minimizing scheduling length of all jobs, flow time and number of tardy jobs and so on. The complexity of the problem is determined. [WT5HZ]展开更多
In this paper, by considering the fuzzy nature of the data in real-life problems, single machine scheduling problems with fuzzy processing time and multiple objectives are formulated and an efficient genetic algorithm...In this paper, by considering the fuzzy nature of the data in real-life problems, single machine scheduling problems with fuzzy processing time and multiple objectives are formulated and an efficient genetic algorithm which is suitable for solving these problems is proposed. As illustrative numerical examples, twenty jobs processing on a machine is considered. The feasibility and effectiveness of the proposed method have been demonstrated in the simulation.展开更多
In this paper, single machine scheduling problems with variable processing time is discussed according to published instances of management engineering. Processing time of a job is the product of a “coefficient' ...In this paper, single machine scheduling problems with variable processing time is discussed according to published instances of management engineering. Processing time of a job is the product of a “coefficient' of the job on position i and a “normal' processing time of the job. The criteria considered is to minimize scheduled length of all jobs. A lemma is proposed and proved. In no deadline constrained condition, the problem belongs to polynomial time algorithm. It is proved by using 3 partition that if the problem is deadline constrained, its complexity is strong NP hard. Finally, a conjuncture is proposed that is to be proved.展开更多
Seismological Bureau of Sichuan Province, Chengdu 610041, China2) Center for Analysis and Prediction, State Seismological Bureau, Beijing 100036, China3) Observation Center for Prediction of Earthquakes and Volcanic E...Seismological Bureau of Sichuan Province, Chengdu 610041, China2) Center for Analysis and Prediction, State Seismological Bureau, Beijing 100036, China3) Observation Center for Prediction of Earthquakes and Volcanic Eruptions, Faculty of Sciences, Tohoku University, Sendai 98077, Japan展开更多
Given the existing integrated scheduling algorithms,all processes are ordered and scheduled overall,and these algorithms ignore the influence of the vertical and horizontal characteristics of the product process tree ...Given the existing integrated scheduling algorithms,all processes are ordered and scheduled overall,and these algorithms ignore the influence of the vertical and horizontal characteristics of the product process tree on the product scheduling effect.This paper presents an integrated scheduling algorithm for the same equipment process sequencing based on the Root-Subtree horizontal and vertical pre-scheduling to solve the above problem.Firstly,the tree decomposition method is used to extract the root node to split the process tree into several Root-Subtrees,and the Root-Subtree priority is set from large to small through the optimal completion time of vertical and horizontal pre-scheduling.All Root-Subtree processes on the same equipment are sorted into the stack according to the equipment process pre-start time,and the stack-top processes are combined with the schedulable process set to schedule and dispatch the stack.The start processing time of each process is determined according to the dynamic start processing time strategy of the equipment process,to complete the fusion operation of the Root-Subtree processes under the constraints of the vertical process tree and the horizontal equipment.Then,the root node is retrieved to form a substantial scheduling scheme,which realizes scheduling optimization by mining the vertical and horizontal characteristics of the process tree.Verification by examples shows that,compared with the traditional integrated scheduling algorithms that sort the scheduling processes as an overall,the integrated scheduling algorithmin this paper is better.The proposed algorithmenhances the process scheduling compactness,reduces the length of the idle time of the processing equipment,and optimizes the production scheduling target,which is of universal significance to solve the integrated scheduling problem.展开更多
Internal model control （IMC） yields very good performance for set point tracking, but gives sluggish response for disturbance rejection problem. A two-degree-of-freedom IMC （2DOF-IMC） has been developed to overcom...Internal model control （IMC） yields very good performance for set point tracking, but gives sluggish response for disturbance rejection problem. A two-degree-of-freedom IMC （2DOF-IMC） has been developed to overcome the weakness. However, the setting of parameter becomes a complicated matter if there is an uncertainty model. The present study proposes a new tuning method for the controller. The proposed tuning method consists of three steps. Firstly, the worst case of the model uncertainty is determined. Secondly, the parameter of set point con- troller using maximum peak （Mp） criteria is specified, and finally, the parameter of the disturbance rejection con- troller using gain margin （GM） criteria is obtained. The proposed method is denoted as Mp-GM tuning method. The effectiveness of Mp-GM tuning method has evaluated and compared with IMC-controller tuning program （IMCTUNE） as bench mark. The evaluation and comparison have been done through the simulation on a number of first order plus dead time （FOPDT） and higher order processes. The FOPDT process tested includes processes with controllability ratio in the range 0.7 to 2.5. The higher processes include second order with underdarnped and third order with nonminimum phase processes. Although the two of higher order processes are considered as difficult processes, the proposed Mp-GM tuning method are able to obtain the good controller parameter even under process uncertainties.展开更多
The brief arts and crafts of the ordinary fourdrinier are introduced first. After the intractable points of paper basis weight (BW) control are analyzed, an autotuning PID/PI control algorithm based on relay feedback ...The brief arts and crafts of the ordinary fourdrinier are introduced first. After the intractable points of paper basis weight (BW) control are analyzed, an autotuning PID/PI control algorithm based on relay feedback identification is proposed, which has such advantages as simple parameter adjustment, little dependence on process model, strong robustness and easiness to implementation. And it is very suitable for controlling such processes as BW loop with large time delay.展开更多
Simple GNSS navigation receivers, developed for the mass market, can be used for positioning with sub centimeter accuracy in a wireless sensor network if the read-out of the carrier phase data is possible and all data...Simple GNSS navigation receivers, developed for the mass market, can be used for positioning with sub centimeter accuracy in a wireless sensor network if the read-out of the carrier phase data is possible and all data is permanently broadcast to a central computer for near real time processing of the respective base lines. Experiences gained in two research projects related to landslide monitoring are depicted in terms of quality and reliability of the results by the developed approach. As far as possible a modular system set up with commercial off-the-shelf components, e.g., standard WLAN fur commtmication, solar batteries with solar panels for autarkic power supply and in cooperation of existing proofed program tools is chosen. The challenge of the still ongoing development is to have a flexible and robust GNSS based sensor network available - concerned not only for landslide monitoring in future.展开更多
A water model and a high-speed video camera were utilized in the 300-t RH equipment to study the effect of steel flow patterns in a vacuum chamber on fast decarburization and a superior flow-pattern map was obtained d...A water model and a high-speed video camera were utilized in the 300-t RH equipment to study the effect of steel flow patterns in a vacuum chamber on fast decarburization and a superior flow-pattern map was obtained during the practical RH process. There are three flow patterns with different bubbling characteristics and steel surface states in the vacuum chamber： boiling pattern（BP）, transition pattern（TP）, and wave pattern（WP）. The effect of the liquid-steel level and the residence time of the steel in the chamber on flow patterns and decarburization reaction were investigated, respectively. The liquid-steel level significantly affected the flow-pattern transition from BP to WP, and the residence time and reaction area were crucial to evaluate the whole decarburization process rather than the circulation flow rate and mixing time. A superior flow-pattern map during the practical RH process showed that the steel flow pattern changed from BP to TP quickly, and then remained as TP until the end of decarburization.展开更多
This paper investigates the electron-vibrational（e-V）energy exchange in nitrogencontaining plasma,which is very efficient in the case of gas discharge and high speed flow.Based on Harmonic oscillator approximation a...This paper investigates the electron-vibrational（e-V）energy exchange in nitrogencontaining plasma,which is very efficient in the case of gas discharge and high speed flow.Based on Harmonic oscillator approximation and the assumption of the e-V relaxation through a continuous series of Boltzmann distributions over the vibrational states,an analytic approach is derived from the proposed scaling relation of e-V transition rates.A full kinetic model is then investigated by numerically solving the state-to-state master equation for all vibrational levels.The analytical approach leads to a Landau-Teller（LT）-type equation for relaxation of vibrational energy,and predicts the relaxation time on the right order of magnitude.By comparison with the kinetic model,the LT-type equation is valid in typical electron temperatures in gas discharge.However,the analytical approach is not capable of describing the vibrational distribution function during the e-V process in which a full kinetic model is required.展开更多
Ground condition and construction （excavation and support） time and costs are the key factors in decision-making during planning and design phases of a tunnel project. An innovative methodology for probabilistic est...Ground condition and construction （excavation and support） time and costs are the key factors in decision-making during planning and design phases of a tunnel project. An innovative methodology for probabilistic estimation of ground condition and construction time and costs is proposed, which is an integration of the ground prediction approach based on Markov process, and the time and cost variance analysis based on Monte-Carlo （MC） simulation. The former provides the probabilistic description of ground classification along tunnel alignment according to the geological information revealed from geological profile and boreholes. The latter provides the probabilistic description of the expected construction time and costs for each operation according to the survey feedbacks from experts. Then an engineering application to Hamro tunnel is presented to demonstrate how the ground condition and the construction time and costs are estimated in a probabilistic way. In most items, in order to estimate the data needed for this methodology, a number of questionnaires are distributed among the tunneling experts and finally the mean values of the respondents are applied. These facilitate both the owners and the contractors to be aware of the risk that they should carry before construction, and are useful for both tendering and bidding.展开更多
Englacial and subglacial drainage systems of temperate glaciers have a strong influence on glacier dynamics, glacier-induced floods, glacier-weathering processes, and runoff from glacierized drainage basins. Proglacia...Englacial and subglacial drainage systems of temperate glaciers have a strong influence on glacier dynamics, glacier-induced floods, glacier-weathering processes, and runoff from glacierized drainage basins. Proglacial discharge is partly controlled by the geometry of the glacial drainage network and by the process of producing meltwater. The glacial-drainage system of some alpine glaciers has been characterized using a model based on proglacial discharge analysis. In this paper, we apply cross-correlation analysis to hourly hydro-climatic data collected from China＇s Hailuogou Glacier, a typical temperate glacier in Mt. Gongga, to study the seasonal status changes of the englacial and subglacial drainage systems by discharge-temperature （Q-T） time lag analy-sis. During early ablation season （April-May） of 2003, 2004 and 2005, the change of englacial and subglacial drainage system usually leads several outburst flood events, which are also substantiated by observing the leakage of supraglacial pond and cre-vasses pond water during field works in April, 2008. At the end of ablation season （October-December）, the glacial-drainage net-works become less hydro-efficient. Those events are evidenced by hourly hydro-process near the terminus of Hailuogou Glacier, and the analysis of Q-T time lags also can be a good indicator of those changes. However, more detailed observations or experi-ments, e.g. dye-tracing experiment and recording borehole water level variations, are necessary to describe the evolutionary status and processes of englacial and subglacial drainage systems evolution during ablation season.展开更多
文摘Abstract Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by reallocating resources. In this paper, authors consider a machine scheduling problem with controllable processing times. In the first part of this paper, a special case where the processing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O(n 2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case. An effective heuristic to the general problem will be presented.
基金supported by the National Natural Science Foundation of China (Grant Nos. 51075337, 50705076, 50705077)the Natural Sci-ence Basic Research Plan in Shaanxi Province of China (Grant No. 2009JQ9002)
文摘Job-shop scheduling problem with discretely controllable processing times (JSP-DCPT) is modeled based on the disjunctive graph, and the formulation of JSP-DCPT is presented. A three-step decomposition approach is proposed so that JSP-DCPT can be handled by solving a job-shop scheduling problem (JSP) and a series of discrete time-cost tradeoff problems. To simplify the decomposition approach, the time-cost phase plane is introduced to describe tradeoffs of the discrete time-cost tradeoff problem, and an extreme mode-based set dominant theory is elaborated so that an upper bound is determined to cut discrete time-cost tradeoff problems generated by using the proposed decomposition approach. An extreme mode-based set dominant decomposition algorithm (EMSDDA) is then proposed. Experimental simulations for instance JSPDCPT_FT10, which is designed based on a JSP benchmark FT10, demonstrate the effectiveness of the proposed theory and the decomposition approach.
文摘Due date quotation and scheduling are important tools to match demand with production capacity in the MTO （make-to-order） environment. We consider an order scheduling problem faced by a manufacturing f＇trm operating in an MTO environment, where the firm needs to quote a common due date for the customers, and simultaneously control the processing times of customer orders （by allocating extra resources to process the orders） so as to complete the orders before a given deadline. The objective is to minimize the total costs of earliness, tardiness, due date assignment and extra resource consumption. We show the problem is NP-hard, even if the cost weights for controlling the order processing times are identical. We identify several polynomially solvable cases of the problem, and develop a branch and bound algorithm and three Tabu search algorithms to solve the general problem. We then conduct computational experiments to evaluate the performance of the three Tabu-search algorithms and show that they are generally effective in terms of solution quality.
文摘In this paper, a single-machine scheduling model with a given common due date is considered. Job processing time is a linear decreasing function of its starting time. The objective function is to minimize the total weighted earliness award and tardiness penalty. Our aim is to find an optimal schedule so as to minimize the objective function. As the problem is NP-hard, some properties and polynomial time solvable cases of this problem are given. A dynamic programming algorithm for the general case of the problem is provided.
文摘A real time algorithm is presented here to recognize and analyze 8 channel simultaneous electro cardiograph(ECG). The algorithm transforms 8 channel simultaneous ECG into three orthogonal vectors and spatial velocity first, then forms the spatial velocity sample, and uses this spatial velocity sample to recognize each beat. The algorithm computes the averaged parameters by using averaged spatial velocity and the averaged ECG and the current parameters by using the current beat period and current width of QRS. The algorithm can recognize P, QRS and T onsets and ends of simultaneous 12 lead ECG precisely, and some arrhythmias such as premature ventricular beat, ventricular escape beat, R on T, bigeminy, trigeminy. The algorithm software works well on a real 8 channel ECG system and meets the demands of designing.
基金The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work under grant number(RGP 2/158/43)Princess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2022R161)Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.
文摘Big health data collection and storing for further analysis is a challenging task because this knowledge is big and has many features.Several cloud-based IoT health providers have been described in the literature previously.Furthermore,there are a number of issues related to time consumed and overall network performance when it comes to big data information.In the existing method,less performed optimization algorithms were used for optimizing the data.In the proposed method,the Chaotic Cuckoo Optimization algorithm was used for feature selection,and Convolutional Support Vector Machine(CSVM)was used.The research presents a method for analyzing healthcare information that uses in future prediction.The major goal is to take a variety of data while improving efficiency and minimizing process time.The suggested method employs a hybrid method that is divided into two stages.In the first stage,it reduces the features by using the Chaotic Cuckoo Optimization algorithm with Levy flight,opposition-based learning,and distributor operator.In the second stage,CSVM is used which combines the benefits of convolutional neural network(CNN)and SVM.The CSVM modifies CNN’s convolution product to learn hidden deep inside data sources.For improved economic flexibility,greater protection,greater analytics with confidentiality,and lower operating cost,the suggested approach is built on fog computing.Overall results of the experiments show that the suggested method can minimize the number of features in the datasets,enhances the accuracy by 82%,and decrease the time of the process.
文摘In this paper, single machine scheduling problems with variable processing time are raised. The criterions of the problem considered are minimizing scheduling length of all jobs, flow time and number of tardy jobs and so on. The complexity of the problem is determined. [WT5HZ]
基金supported by the National Natural Science Foundation of China(NNSFC)(the grant No.60274043)supported by the National High-tech Research&Development Project(863)(the grant No.2002AA412610)
文摘In this paper, by considering the fuzzy nature of the data in real-life problems, single machine scheduling problems with fuzzy processing time and multiple objectives are formulated and an efficient genetic algorithm which is suitable for solving these problems is proposed. As illustrative numerical examples, twenty jobs processing on a machine is considered. The feasibility and effectiveness of the proposed method have been demonstrated in the simulation.
文摘In this paper, single machine scheduling problems with variable processing time is discussed according to published instances of management engineering. Processing time of a job is the product of a “coefficient' of the job on position i and a “normal' processing time of the job. The criteria considered is to minimize scheduled length of all jobs. A lemma is proposed and proved. In no deadline constrained condition, the problem belongs to polynomial time algorithm. It is proved by using 3 partition that if the problem is deadline constrained, its complexity is strong NP hard. Finally, a conjuncture is proposed that is to be proved.
文摘Seismological Bureau of Sichuan Province, Chengdu 610041, China2) Center for Analysis and Prediction, State Seismological Bureau, Beijing 100036, China3) Observation Center for Prediction of Earthquakes and Volcanic Eruptions, Faculty of Sciences, Tohoku University, Sendai 98077, Japan
基金supported by the National Natural Science Foundation of China[Grant No.61772160].
文摘Given the existing integrated scheduling algorithms,all processes are ordered and scheduled overall,and these algorithms ignore the influence of the vertical and horizontal characteristics of the product process tree on the product scheduling effect.This paper presents an integrated scheduling algorithm for the same equipment process sequencing based on the Root-Subtree horizontal and vertical pre-scheduling to solve the above problem.Firstly,the tree decomposition method is used to extract the root node to split the process tree into several Root-Subtrees,and the Root-Subtree priority is set from large to small through the optimal completion time of vertical and horizontal pre-scheduling.All Root-Subtree processes on the same equipment are sorted into the stack according to the equipment process pre-start time,and the stack-top processes are combined with the schedulable process set to schedule and dispatch the stack.The start processing time of each process is determined according to the dynamic start processing time strategy of the equipment process,to complete the fusion operation of the Root-Subtree processes under the constraints of the vertical process tree and the horizontal equipment.Then,the root node is retrieved to form a substantial scheduling scheme,which realizes scheduling optimization by mining the vertical and horizontal characteristics of the process tree.Verification by examples shows that,compared with the traditional integrated scheduling algorithms that sort the scheduling processes as an overall,the integrated scheduling algorithmin this paper is better.The proposed algorithmenhances the process scheduling compactness,reduces the length of the idle time of the processing equipment,and optimizes the production scheduling target,which is of universal significance to solve the integrated scheduling problem.
基金Supported by Postgraduate Fellowship of UMP,Fundamental Research Grant Scheme of Malaysia(GRS070120)Joint Research Grant between Universiti Malaysia Pahang (UMP) and Institut Teknologi Sepuluh Nopember (ITS) Surabaya
文摘Internal model control （IMC） yields very good performance for set point tracking, but gives sluggish response for disturbance rejection problem. A two-degree-of-freedom IMC （2DOF-IMC） has been developed to overcome the weakness. However, the setting of parameter becomes a complicated matter if there is an uncertainty model. The present study proposes a new tuning method for the controller. The proposed tuning method consists of three steps. Firstly, the worst case of the model uncertainty is determined. Secondly, the parameter of set point con- troller using maximum peak （Mp） criteria is specified, and finally, the parameter of the disturbance rejection con- troller using gain margin （GM） criteria is obtained. The proposed method is denoted as Mp-GM tuning method. The effectiveness of Mp-GM tuning method has evaluated and compared with IMC-controller tuning program （IMCTUNE） as bench mark. The evaluation and comparison have been done through the simulation on a number of first order plus dead time （FOPDT） and higher order processes. The FOPDT process tested includes processes with controllability ratio in the range 0.7 to 2.5. The higher processes include second order with underdarnped and third order with nonminimum phase processes. Although the two of higher order processes are considered as difficult processes, the proposed Mp-GM tuning method are able to obtain the good controller parameter even under process uncertainties.
基金This project was supported by the National Key Project in the Ninth Fivc-Year Plan(97-619-02-03).
文摘The brief arts and crafts of the ordinary fourdrinier are introduced first. After the intractable points of paper basis weight (BW) control are analyzed, an autotuning PID/PI control algorithm based on relay feedback identification is proposed, which has such advantages as simple parameter adjustment, little dependence on process model, strong robustness and easiness to implementation. And it is very suitable for controlling such processes as BW loop with large time delay.
文摘Simple GNSS navigation receivers, developed for the mass market, can be used for positioning with sub centimeter accuracy in a wireless sensor network if the read-out of the carrier phase data is possible and all data is permanently broadcast to a central computer for near real time processing of the respective base lines. Experiences gained in two research projects related to landslide monitoring are depicted in terms of quality and reliability of the results by the developed approach. As far as possible a modular system set up with commercial off-the-shelf components, e.g., standard WLAN fur commtmication, solar batteries with solar panels for autarkic power supply and in cooperation of existing proofed program tools is chosen. The challenge of the still ongoing development is to have a flexible and robust GNSS based sensor network available - concerned not only for landslide monitoring in future.
基金financially supported by the National Natural Science Foundation of China (No.51704203)the PhD Early Development Program of Taiyuan University of Science and Technology (Nos. 20152008, 20152013, and 20152018)+2 种基金Shanxi Province Science Foundation for Youths (No. 201601D202027)Key Project of Research and Development Plan of Shanxi Province (Nos. 201603D111004 and 201603D121010)NSFC-Shanxi Coal Based Low Carbon Joint Fund (No. U1510131)
文摘A water model and a high-speed video camera were utilized in the 300-t RH equipment to study the effect of steel flow patterns in a vacuum chamber on fast decarburization and a superior flow-pattern map was obtained during the practical RH process. There are three flow patterns with different bubbling characteristics and steel surface states in the vacuum chamber： boiling pattern（BP）, transition pattern（TP）, and wave pattern（WP）. The effect of the liquid-steel level and the residence time of the steel in the chamber on flow patterns and decarburization reaction were investigated, respectively. The liquid-steel level significantly affected the flow-pattern transition from BP to WP, and the residence time and reaction area were crucial to evaluate the whole decarburization process rather than the circulation flow rate and mixing time. A superior flow-pattern map during the practical RH process showed that the steel flow pattern changed from BP to TP quickly, and then remained as TP until the end of decarburization.
基金supported by National Natural Science Foundation of China(No.11505015)the National High-Tech Research and Development Program of China(863 Program)
文摘This paper investigates the electron-vibrational（e-V）energy exchange in nitrogencontaining plasma,which is very efficient in the case of gas discharge and high speed flow.Based on Harmonic oscillator approximation and the assumption of the e-V relaxation through a continuous series of Boltzmann distributions over the vibrational states,an analytic approach is derived from the proposed scaling relation of e-V transition rates.A full kinetic model is then investigated by numerically solving the state-to-state master equation for all vibrational levels.The analytical approach leads to a Landau-Teller（LT）-type equation for relaxation of vibrational energy,and predicts the relaxation time on the right order of magnitude.By comparison with the kinetic model,the LT-type equation is valid in typical electron temperatures in gas discharge.However,the analytical approach is not capable of describing the vibrational distribution function during the e-V process in which a full kinetic model is required.
文摘Ground condition and construction （excavation and support） time and costs are the key factors in decision-making during planning and design phases of a tunnel project. An innovative methodology for probabilistic estimation of ground condition and construction time and costs is proposed, which is an integration of the ground prediction approach based on Markov process, and the time and cost variance analysis based on Monte-Carlo （MC） simulation. The former provides the probabilistic description of ground classification along tunnel alignment according to the geological information revealed from geological profile and boreholes. The latter provides the probabilistic description of the expected construction time and costs for each operation according to the survey feedbacks from experts. Then an engineering application to Hamro tunnel is presented to demonstrate how the ground condition and the construction time and costs are estimated in a probabilistic way. In most items, in order to estimate the data needed for this methodology, a number of questionnaires are distributed among the tunneling experts and finally the mean values of the respondents are applied. These facilitate both the owners and the contractors to be aware of the risk that they should carry before construction, and are useful for both tendering and bidding.
基金supported by the National Natural Science Foundation of China (Grant No. 40801030 and 40801025)the Major State Basic Research Development Program of China (973 Program) (2007CB411506)+1 种基金the Innovation Project of Chinese Academy Sciences (Kzcx2-yw-301)the National Basic Work Program of Chinese MST (Glacier Inventory of China Ⅱ, Grant No. 2006FY110200)
文摘Englacial and subglacial drainage systems of temperate glaciers have a strong influence on glacier dynamics, glacier-induced floods, glacier-weathering processes, and runoff from glacierized drainage basins. Proglacial discharge is partly controlled by the geometry of the glacial drainage network and by the process of producing meltwater. The glacial-drainage system of some alpine glaciers has been characterized using a model based on proglacial discharge analysis. In this paper, we apply cross-correlation analysis to hourly hydro-climatic data collected from China＇s Hailuogou Glacier, a typical temperate glacier in Mt. Gongga, to study the seasonal status changes of the englacial and subglacial drainage systems by discharge-temperature （Q-T） time lag analy-sis. During early ablation season （April-May） of 2003, 2004 and 2005, the change of englacial and subglacial drainage system usually leads several outburst flood events, which are also substantiated by observing the leakage of supraglacial pond and cre-vasses pond water during field works in April, 2008. At the end of ablation season （October-December）, the glacial-drainage net-works become less hydro-efficient. Those events are evidenced by hourly hydro-process near the terminus of Hailuogou Glacier, and the analysis of Q-T time lags also can be a good indicator of those changes. However, more detailed observations or experi-ments, e.g. dye-tracing experiment and recording borehole water level variations, are necessary to describe the evolutionary status and processes of englacial and subglacial drainage systems evolution during ablation season.
