期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
腹膜外剖宫产术式的临床分析
1
作者 李晓萍 《中国保健营养(临床医学学刊)》 2010年第5期56-57,共2页
目的对硕入式与侧入式两种腹膜外剖宫产术式的临床效果进行比较分析。结果侧入式组总手术时间、手术至胎儿娩出时间均较顶入式组显著缩短(P〈0.01)。手术成功率高(P〉0.01)。手术出血量、术后24h疼痛、切口愈合率及术后发病率无... 目的对硕入式与侧入式两种腹膜外剖宫产术式的临床效果进行比较分析。结果侧入式组总手术时间、手术至胎儿娩出时间均较顶入式组显著缩短(P〈0.01)。手术成功率高(P〉0.01)。手术出血量、术后24h疼痛、切口愈合率及术后发病率无明显差别。结论侧入式腹膜外剖宫术较顶入式腹膜外剖宫产术更易掌握,手术成功率高, 展开更多
关键词 项入式 侧入 腹膜外剖宫产术
下载PDF
A Part-Refund Model for Airline Overbooking Problem 被引量:1
2
作者 胡盈 薛丹 胡良剑 《Journal of Donghua University(English Edition)》 EI CAS 2009年第5期572-574,共3页
In this paper, a mathematical model about the optimal booking level problem in airline overbooking rnanageanent is proposed. Firstly, the normal distribution is employed to approximate Poisson requests and binomial go... In this paper, a mathematical model about the optimal booking level problem in airline overbooking rnanageanent is proposed. Firstly, the normal distribution is employed to approximate Poisson requests and binomial goshows. By calculating the mean loss, a model to describe the relationship between booking level and flight revenue is established. Then, an equation is deduced to decide the optimal booking level. Finally, a numerical example is utilized to illustrate the proposed model and discuss the impact of refund rate on the optimal booking level and the mean loss. 展开更多
关键词 OVERBOOKING REVENUE booking level refund rate denied boarding
下载PDF
DISCOVERING NON-TERMINATING INPUTS FOR MULTI-PATH POLYNOMIAL PROGRAMS 被引量:1
3
作者 LIU Jiang XU Ming +1 位作者 ZHAN Naijun ZHAO Hengjun 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2014年第6期1286-1304,共19页
This paper investigates the termination problems of multi-path polynomial programs (MPPs) with equational loop guards. To establish sufficient conditions for termination and nontermination simultaneously, the author... This paper investigates the termination problems of multi-path polynomial programs (MPPs) with equational loop guards. To establish sufficient conditions for termination and nontermination simultaneously, the authors propose the notion of strong/weak non-termination which under/over- approximates non-termination. Based on polynomial ideal theory, the authors show that the set of all strong non-terminating inputs (SNTI) and weak non-terminating inputs (WNTI) both correspond to tile real varieties of certain polynomial ideals. Furthermore, the authors prove that the variety of SNTI is computable, and under some sufficient conditions the variety of WNTI is also computable. Then by checking the computed SNTI and WNTI varieties in parallel, termination properties of a consid- ered MPP can be asserted. As a consequence, the authors establish a new framework for termination analysis of MPPs. 展开更多
关键词 Polynomial ideals polynomial programs termination analysis.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部