This paper proposes a family of PWM modulation strategies for boostfull-bridge (FB) converters. The modulation strategies can be classified into two kinds according tothe turn-on sequence of the diagonal switches. The...This paper proposes a family of PWM modulation strategies for boostfull-bridge (FB) converters. The modulation strategies can be classified into two kinds according tothe turn-on sequence of the diagonal switches. The concept of leading switches and lagging switchesis introduced to realize soft-switching. According to the soft-switching realized by the leadingswitches and the lagging switches, two kinds of soft-switching techniques for PWM boost FBconverters yield: zero-current-switching (ZCS) and zero-current and zero-voltage-switching (ZCZVS).Simulation results verify the analysis.展开更多
This paper proposes two kinds of approximate proximal point algorithms （APPA） for monotone variational inequalities, both of which can be viewed as two extended versions of Solodov and Svaiter＇s APPA in the paper ...This paper proposes two kinds of approximate proximal point algorithms （APPA） for monotone variational inequalities, both of which can be viewed as two extended versions of Solodov and Svaiter＇s APPA in the paper ＂Error bounds for proximal point subproblems and associated inexact proximal point algorithms＂ published in 2000. They are both prediction- correction methods which use the same inexactness restriction; the only difference is that they use different search directions in the correction steps. This paper also chooses an optimal step size in the two versions of the APPA to improve the profit at each iteration. Analysis also shows that the two APPAs are globally convergent under appropriate assumptions, and we can expect algorithm 2 to get more progress in every iteration than algorithm 1. Numerical experiments indicate that algorithm 2 is more efficient than algorithm 1 with the same correction step size,展开更多
The 1 195 bp 5′ flanking region of rice ( Oryza sativa L.) cytosolic fructose_1, 6_bisphosphatase (cyFBPase) can direct tissue, cell specific expression in transgenic rice. In order to identify sequence elements ...The 1 195 bp 5′ flanking region of rice ( Oryza sativa L.) cytosolic fructose_1, 6_bisphosphatase (cyFBPase) can direct tissue, cell specific expression in transgenic rice. In order to identify sequence elements responsible for the regulation of mesophyll_specific expression, the 5′ flanking regions of -1 195 bp, -1 102 bp, -768 bp, and -644 bp upstream of the translation initiation ATG codon were fused to the reporter gene encoding β_glucuronidase (GUS) and transferred to rice via particle bombardment. Analysis of the 5′ promoter deletions identified that a 93 bp fragment between -1 195 bp and -1 102 bp is essential for directing mesophyll specific expression. High constitutive expression of GUS reporter gene was found in the -768 deletion lines and another two deletion series. These results indicate the great potential utility of the promoter in rice biotechnology.展开更多
Proximal point algorithms （PPA） are attractive methods for solving monotone variational inequalities （MVI）. Since solving the sub-problem exactly in each iteration is costly or sometimes impossible, various approx...Proximal point algorithms （PPA） are attractive methods for solving monotone variational inequalities （MVI）. Since solving the sub-problem exactly in each iteration is costly or sometimes impossible, various approximate versions ofPPA （APPA） are developed for practical applications. In this paper, we compare two APPA methods, both of which can be viewed as prediction-correction methods. The only difference is that they use different search directions in the correction-step. By extending the general forward-backward splitting methods, we obtain Algorithm Ⅰ; in the same way, Algorithm Ⅱ is proposed by spreading the general extra-gradient methods. Our analysis explains theoretically why Algorithm Ⅱ usually outperforms Algorithm Ⅰ. For computation practice, we consider a class of MVI with a special structure, and choose the extending Algorithm Ⅱ to implement, which is inspired by the idea of Gauss-Seidel iteration method making full use of information about the latest iteration. And in particular, self-adaptive techniques are adopted to adjust relevant parameters for faster convergence. Finally, some numerical experiments are reported on the separated MVI. Numerical results showed that the extending Algorithm II is feasible and easy to implement with relatively low computation load.展开更多
Mehrotra's recent suggestion of a predictor corrector variant of primal dual interior point method for linear programming is currently the interior point method of choice for linear programming. In this work t...Mehrotra's recent suggestion of a predictor corrector variant of primal dual interior point method for linear programming is currently the interior point method of choice for linear programming. In this work the authors give a predictor corrector interior point algorithm for monotone variational inequality problems. The algorithm was proved to be equivalent to a level 1 perturbed composite Newton method. Computations in the algorithm do not require the initial iteration to be feasible. Numerical results of experiments are presented.展开更多
文摘This paper proposes a family of PWM modulation strategies for boostfull-bridge (FB) converters. The modulation strategies can be classified into two kinds according tothe turn-on sequence of the diagonal switches. The concept of leading switches and lagging switchesis introduced to realize soft-switching. According to the soft-switching realized by the leadingswitches and the lagging switches, two kinds of soft-switching techniques for PWM boost FBconverters yield: zero-current-switching (ZCS) and zero-current and zero-voltage-switching (ZCZVS).Simulation results verify the analysis.
文摘This paper proposes two kinds of approximate proximal point algorithms （APPA） for monotone variational inequalities, both of which can be viewed as two extended versions of Solodov and Svaiter＇s APPA in the paper ＂Error bounds for proximal point subproblems and associated inexact proximal point algorithms＂ published in 2000. They are both prediction- correction methods which use the same inexactness restriction; the only difference is that they use different search directions in the correction steps. This paper also chooses an optimal step size in the two versions of the APPA to improve the profit at each iteration. Analysis also shows that the two APPAs are globally convergent under appropriate assumptions, and we can expect algorithm 2 to get more progress in every iteration than algorithm 1. Numerical experiments indicate that algorithm 2 is more efficient than algorithm 1 with the same correction step size,
文摘The 1 195 bp 5′ flanking region of rice ( Oryza sativa L.) cytosolic fructose_1, 6_bisphosphatase (cyFBPase) can direct tissue, cell specific expression in transgenic rice. In order to identify sequence elements responsible for the regulation of mesophyll_specific expression, the 5′ flanking regions of -1 195 bp, -1 102 bp, -768 bp, and -644 bp upstream of the translation initiation ATG codon were fused to the reporter gene encoding β_glucuronidase (GUS) and transferred to rice via particle bombardment. Analysis of the 5′ promoter deletions identified that a 93 bp fragment between -1 195 bp and -1 102 bp is essential for directing mesophyll specific expression. High constitutive expression of GUS reporter gene was found in the -768 deletion lines and another two deletion series. These results indicate the great potential utility of the promoter in rice biotechnology.
基金Project (No. 1027054) supported by the National Natural Science Foundation of China
文摘Proximal point algorithms （PPA） are attractive methods for solving monotone variational inequalities （MVI）. Since solving the sub-problem exactly in each iteration is costly or sometimes impossible, various approximate versions ofPPA （APPA） are developed for practical applications. In this paper, we compare two APPA methods, both of which can be viewed as prediction-correction methods. The only difference is that they use different search directions in the correction-step. By extending the general forward-backward splitting methods, we obtain Algorithm Ⅰ; in the same way, Algorithm Ⅱ is proposed by spreading the general extra-gradient methods. Our analysis explains theoretically why Algorithm Ⅱ usually outperforms Algorithm Ⅰ. For computation practice, we consider a class of MVI with a special structure, and choose the extending Algorithm Ⅱ to implement, which is inspired by the idea of Gauss-Seidel iteration method making full use of information about the latest iteration. And in particular, self-adaptive techniques are adopted to adjust relevant parameters for faster convergence. Finally, some numerical experiments are reported on the separated MVI. Numerical results showed that the extending Algorithm II is feasible and easy to implement with relatively low computation load.
文摘Mehrotra's recent suggestion of a predictor corrector variant of primal dual interior point method for linear programming is currently the interior point method of choice for linear programming. In this work the authors give a predictor corrector interior point algorithm for monotone variational inequality problems. The algorithm was proved to be equivalent to a level 1 perturbed composite Newton method. Computations in the algorithm do not require the initial iteration to be feasible. Numerical results of experiments are presented.
