A class of nonlinear and continuous type Leontief model and its corresponding conditional input-output equation are introduced, and two basic problems under the so called positive or negative boundary assumption are p...A class of nonlinear and continuous type Leontief model and its corresponding conditional input-output equation are introduced, and two basic problems under the so called positive or negative boundary assumption are presented. By approaches of nonlinear analysis some solvability results of this equation and continuous perturbation properties of the relative solution sets are obtained, and some economic significance are illustrated by the remark.展开更多
Existing works have addressed the interference mitigation by any two of the three approaches: link scheduling, power control, and successive interference cancellation(SIC). In this paper, we integrate the above approa...Existing works have addressed the interference mitigation by any two of the three approaches: link scheduling, power control, and successive interference cancellation(SIC). In this paper, we integrate the above approaches to further improve the spectral efficiency of the wireless networks and consider the max-min fairness to guarantee the transmission demand of the worst-case link. We formulate the link scheduling with joint power control and SIC(PCSIC) problem as a mixed-integer non-linear programming(MINLP), which has been proven to be NP-complete. Consequently, we propose an iterative algorithm to tackle the problem by decomposing it into a series of linear subproblems, and then the analysis shows that the algorithm has high complexity in the worst case. In order to reduce the computational complexity, we have further devised a two-stage algorithm with polynomial-time complexity. Numerical results show the performance improvements of our proposed algorithms in terms of the network throughput and power consumption compared with the link scheduling scheme only with SIC.展开更多
We investigate perturbation for continuous-time Markov chains(CTMCs) on a countable state space. Explicit bounds on ?D and D are derived in terms of a drift condition, where ? and D represent the perturbation of the i...We investigate perturbation for continuous-time Markov chains(CTMCs) on a countable state space. Explicit bounds on ?D and D are derived in terms of a drift condition, where ? and D represent the perturbation of the intensity matrices and the deviation matrix, respectively. Moreover, we obtain perturbation bounds on the stationary distributions, which extends the results by Liu(2012) for uniformly bounded CTMCs to general(possibly unbounded) CTMCs. Our arguments are mainly based on the technique of augmented truncations.展开更多
文摘A class of nonlinear and continuous type Leontief model and its corresponding conditional input-output equation are introduced, and two basic problems under the so called positive or negative boundary assumption are presented. By approaches of nonlinear analysis some solvability results of this equation and continuous perturbation properties of the relative solution sets are obtained, and some economic significance are illustrated by the remark.
基金supported by National Natural Science Foundation of China(Grant Nos.61231008,61172079,61201141,61301176,91338114)Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory Fund Project+1 种基金Programme of Introducing Talents of Discipline to Universities(Grant No.B08038)National High Technology Research and Development Program of China(Grant No.2014AA01A701)
文摘Existing works have addressed the interference mitigation by any two of the three approaches: link scheduling, power control, and successive interference cancellation(SIC). In this paper, we integrate the above approaches to further improve the spectral efficiency of the wireless networks and consider the max-min fairness to guarantee the transmission demand of the worst-case link. We formulate the link scheduling with joint power control and SIC(PCSIC) problem as a mixed-integer non-linear programming(MINLP), which has been proven to be NP-complete. Consequently, we propose an iterative algorithm to tackle the problem by decomposing it into a series of linear subproblems, and then the analysis shows that the algorithm has high complexity in the worst case. In order to reduce the computational complexity, we have further devised a two-stage algorithm with polynomial-time complexity. Numerical results show the performance improvements of our proposed algorithms in terms of the network throughput and power consumption compared with the link scheduling scheme only with SIC.
基金supported by National Natural Science Foundation of China(Grant No.11211120144)the Fundamental Research Funds for the Central Universities(Grant No.2010QYZD001)
文摘We investigate perturbation for continuous-time Markov chains(CTMCs) on a countable state space. Explicit bounds on ?D and D are derived in terms of a drift condition, where ? and D represent the perturbation of the intensity matrices and the deviation matrix, respectively. Moreover, we obtain perturbation bounds on the stationary distributions, which extends the results by Liu(2012) for uniformly bounded CTMCs to general(possibly unbounded) CTMCs. Our arguments are mainly based on the technique of augmented truncations.
