This paper focuses on the problem of non-fragile guaranteed cost control for a class of T-S discrete-time fuzzy bilinear systems（DFBS）.Based on the parallel distributed compensation（PDC） approach,the sufficient co...This paper focuses on the problem of non-fragile guaranteed cost control for a class of T-S discrete-time fuzzy bilinear systems（DFBS）.Based on the parallel distributed compensation（PDC） approach,the sufficient conditions are derived such that the closed-loop system is asymptotically stable and the cost function value is no more than a certain upper bound in the presence of the additive controller gain perturbations.The non-fragile guaranteed cost controller can be obtained by solving a set of bilinear matrix inequalities（BMIs）.The Van de Vusse model is utilized to demonstrate the validity and effectiveness of the proposed approach.展开更多
Crossover designs are well-known to have major advantages when comparing the effects of various non-curative treatments. We compare efficiencies of several crossover designs along with the Balaam’s design with that o...Crossover designs are well-known to have major advantages when comparing the effects of various non-curative treatments. We compare efficiencies of several crossover designs along with the Balaam’s design with that of a parallel group design pertaining to longitudinal studies where event time can only be measured in discrete time intervals. With equally sized sequences, the parallel group design results in the greater efficiency if the number of time periods is small. However, the crossover and Balaam’s designs tend to be more efficient as the study duration increases. The degree to which these designs add efficiency depends on the baseline hazard function and effect size. Additionally, we incorporate different cost considerations at the subject level when comparing the designs to determine the most cost-efficient design. Researchers might consider the crossover or Balaam’s design more efficient if the duration of the study is long enough, especially if the costs of applying the baseline treatment are higher.展开更多
This article explores controllable Borel spaces, stationary, homogeneous Markov processes, discrete time with infinite horizon, with bounded cost functions and using the expected total discounted cost criterion. The p...This article explores controllable Borel spaces, stationary, homogeneous Markov processes, discrete time with infinite horizon, with bounded cost functions and using the expected total discounted cost criterion. The problem of the estimation of stability for this type of process is set. The central objective is to obtain a bounded stability index expressed in terms of the Lévy-Prokhorov metric;likewise, sufficient conditions are provided for the existence of such inequalities.展开更多
The problems of robust stability and robust stability with a guaranteeing cost for discrete time-delay systems with nonlinear perturbation are discussed. A sufficient criterion for robust stability is established in a...The problems of robust stability and robust stability with a guaranteeing cost for discrete time-delay systems with nonlinear perturbation are discussed. A sufficient criterion for robust stability is established in an LMI framework and a linear convex optimization problem with LMI constraints for computing maximal perturbation bound is proposed. Meanwhile, a sufficient criterion for robust stability with a guaranteeing cost for such systems is obtained, and an optimal procedure for decreasing the value of guaranteeing cost is put forward. Two examples are used to illustrate the efficiency of the results.展开更多
This paper considers the departure process and the optimal control strategy for a discretetime Geo/G/1 queueing model in which the system operates under the control of multiple server vacations and Min(N, V)-policy. U...This paper considers the departure process and the optimal control strategy for a discretetime Geo/G/1 queueing model in which the system operates under the control of multiple server vacations and Min(N, V)-policy. Using the law of total probability decomposition, the renewal theory and the probability generating function technique, the transient and the steady-state probabilities that the server is busy at any epoch n^+ are derived. The authors also obtain the explicit expression of the probability generating function for the expected number of departures occurring in the time interval (0^+, n^+] from any initial state. Meanwhile, the relationship among departure process, server's state process and service renewal process in server busy period is found, which shows the special structure of departure process. Especially, some corresponding results of departure process for special discrete-time queues are directly gained by our results. Furthermore, the approximate expansion for calculating the expected number of departures is presented. In addition, some other important performance measures,including the expected length of server busy period, server's actual vacation period and busy cycle period etc., are analyzed. Finally, some numerical results are provided to determine the optimum value N*for minimizing the system cost under a given cost structure.展开更多
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.展开更多
For the completelv observed discrete-time stochastic system the adaptivecontrol is given so that a quadratic cost is minimized and the unknown coefficients of thesystem are consistently estimated.The feature of the pr...For the completelv observed discrete-time stochastic system the adaptivecontrol is given so that a quadratic cost is minimized and the unknown coefficients of thesystem are consistently estimated.The feature of the proposed adaptive control scheme isthat it a priori requires neither stability nor minimum-phase of the system.展开更多
基金supported by the National Natural Science Foundation of China(60374015)
文摘This paper focuses on the problem of non-fragile guaranteed cost control for a class of T-S discrete-time fuzzy bilinear systems（DFBS）.Based on the parallel distributed compensation（PDC） approach,the sufficient conditions are derived such that the closed-loop system is asymptotically stable and the cost function value is no more than a certain upper bound in the presence of the additive controller gain perturbations.The non-fragile guaranteed cost controller can be obtained by solving a set of bilinear matrix inequalities（BMIs）.The Van de Vusse model is utilized to demonstrate the validity and effectiveness of the proposed approach.
文摘Crossover designs are well-known to have major advantages when comparing the effects of various non-curative treatments. We compare efficiencies of several crossover designs along with the Balaam’s design with that of a parallel group design pertaining to longitudinal studies where event time can only be measured in discrete time intervals. With equally sized sequences, the parallel group design results in the greater efficiency if the number of time periods is small. However, the crossover and Balaam’s designs tend to be more efficient as the study duration increases. The degree to which these designs add efficiency depends on the baseline hazard function and effect size. Additionally, we incorporate different cost considerations at the subject level when comparing the designs to determine the most cost-efficient design. Researchers might consider the crossover or Balaam’s design more efficient if the duration of the study is long enough, especially if the costs of applying the baseline treatment are higher.
文摘This article explores controllable Borel spaces, stationary, homogeneous Markov processes, discrete time with infinite horizon, with bounded cost functions and using the expected total discounted cost criterion. The problem of the estimation of stability for this type of process is set. The central objective is to obtain a bounded stability index expressed in terms of the Lévy-Prokhorov metric;likewise, sufficient conditions are provided for the existence of such inequalities.
基金This research is supported by the National Natural Science Foundation of China(Grant No. 60024301) Natural Science Fund of Shanxi Province, China(Grant No. 20051032).
文摘The problems of robust stability and robust stability with a guaranteeing cost for discrete time-delay systems with nonlinear perturbation are discussed. A sufficient criterion for robust stability is established in an LMI framework and a linear convex optimization problem with LMI constraints for computing maximal perturbation bound is proposed. Meanwhile, a sufficient criterion for robust stability with a guaranteeing cost for such systems is obtained, and an optimal procedure for decreasing the value of guaranteeing cost is put forward. Two examples are used to illustrate the efficiency of the results.
基金supported by the National Natural Science Foundation of China under Grant Nos.71571127and 71171138
文摘This paper considers the departure process and the optimal control strategy for a discretetime Geo/G/1 queueing model in which the system operates under the control of multiple server vacations and Min(N, V)-policy. Using the law of total probability decomposition, the renewal theory and the probability generating function technique, the transient and the steady-state probabilities that the server is busy at any epoch n^+ are derived. The authors also obtain the explicit expression of the probability generating function for the expected number of departures occurring in the time interval (0^+, n^+] from any initial state. Meanwhile, the relationship among departure process, server's state process and service renewal process in server busy period is found, which shows the special structure of departure process. Especially, some corresponding results of departure process for special discrete-time queues are directly gained by our results. Furthermore, the approximate expansion for calculating the expected number of departures is presented. In addition, some other important performance measures,including the expected length of server busy period, server's actual vacation period and busy cycle period etc., are analyzed. Finally, some numerical results are provided to determine the optimum value N*for minimizing the system cost under a given cost structure.
基金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.
基金Project Stupported by the National Natural science Foundation of china.
文摘For the completelv observed discrete-time stochastic system the adaptivecontrol is given so that a quadratic cost is minimized and the unknown coefficients of thesystem are consistently estimated.The feature of the proposed adaptive control scheme isthat it a priori requires neither stability nor minimum-phase of the system.
