期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
云南中蜂过箱及新分群稳定性研究
1
作者 余玉生 梁铖 +2 位作者 罗卫庭 马平 宗德琴 《中国蜂业》 2010年第10期29-30,共2页
通过对本所中蜂试验示范蜂场分出10群中蜂和建水普雄及蒙自冷泉19群土法饲养蜂群过箱蜂群的稳定性进行测试。发现新分出蜂群的稳定性为80%,土法饲养蜂群白天过箱,傍晚运回蜂群的稳定性只为53%。说明为了能使中蜂蜂群稳定,必须摸索出一... 通过对本所中蜂试验示范蜂场分出10群中蜂和建水普雄及蒙自冷泉19群土法饲养蜂群过箱蜂群的稳定性进行测试。发现新分出蜂群的稳定性为80%,土法饲养蜂群白天过箱,傍晚运回蜂群的稳定性只为53%。说明为了能使中蜂蜂群稳定,必须摸索出一套育王分蜂的办法及对山区土法饲养蜂群过箱蜂群在山区的稳定时间作出判断,这样才能稳定蜂群,减少开支,达到蜂群稳定且又快又好发展的目的。 展开更多
关键词 新分群 过箱 蜂群稳定性 稳定时间
下载PDF
Distribution network planning based on shortest path 被引量:2
2
作者 路志英 高山 姚丽 《Journal of Central South University》 SCIE EI CAS 2012年第9期2534-2540,共7页
In order to form an algorithm for distribution network routing,an automatic routing method of distribution network planning was proposed based on the shortest path.The problem of automatic routing was divided into two... In order to form an algorithm for distribution network routing,an automatic routing method of distribution network planning was proposed based on the shortest path.The problem of automatic routing was divided into two steps in the method:the first step was that the shortest paths along streets between substation and load points were found by the basic ant colony algorithm to form a preliminary radial distribution network,and the second step was that the result of the shortest path was used to initialize pheromone concentration and pheromone updating rules to generate globally optimal distribution network.Cases studies show that the proposed method is effective and can meet the planning requirements.It is verified that the proposed method has better solution and utility than planning method based on the ant colony algorithm. 展开更多
关键词 distribution network planning shortest path ant colony algorithm PHEROMONE
下载PDF
Validation of prognostic indices in Egyptian Budd-Chiari syndrome patients: A single-center study
3
作者 Mohammad Sakr Sara M Abdelhakam +7 位作者 Soheir A Elsayed Enas H Allam Amir M Farid Waleed Abdelmoaty Azza M Hassan Mohamed Shaker Mohamed El-Gharib Ahmed Eldorry 《World Journal of Gastroenterology》 SCIE CAS 2017年第4期629-637,共9页
AIMTo compare predictive ability of Budd-Chiari syndrome (BCS) prognostic indices (PIs) for one-year survival and Transjugular intrahepatic portosystemic shunt (TIPS) patency.METHODSThis retrospective study enrolled 1... AIMTo compare predictive ability of Budd-Chiari syndrome (BCS) prognostic indices (PIs) for one-year survival and Transjugular intrahepatic portosystemic shunt (TIPS) patency.METHODSThis retrospective study enrolled 194 Egyptian patients with primary BCS who presented to the Budd-Chiari Study Group of Ain Shams University Hospital. Calculation of the available PIs was performed using Child-Pugh and model for end-stage liver disease scores, BCS-specific PIs (Clichy, New Clichy and Rotterdam) for all patients, and BCS-TIPS PI only for patients who underwent TIPS. The overall one-year survival rate and the one-year shunt patency rate for TIPS were reported.RESULTSThe overall one-year survival rate was 69.6%, and the New Clichy PI revealed the best validity for its prediction at a cut-off value of 3.75, with sensitivity and specificity of 78% and 73.3%, respectively [area under receiver operating characteristic curve (AUC) = 0.806]. The one-year survival rate post-TIPS was 89.7%, and the BCS-TIPS score demonstrated validity for its prediction at a cut-off value of 3.92 (sensitivity and specificity were 71.4% and 64.5%, respectively) (AUC = 0.715). Logistic regression analysis revealed that the New Clichy PI (P = 0.030), high serum total bilirubin (P = 0.047) and low albumin (P &#x0003c; 0.001) were independent factors for predicting mortality within one year. The one-year shunt patency rate in TIPS was 80.2%, and none of the PIs exhibited significant validity for its prediction.CONCLUSIONThe New Clichy score could independently predict the one-year survival in Egyptian BCS patients. 展开更多
关键词 Budd-Chiari syndrome Prognostic indices New Clichy score One-year survival Transjugular intrahepatic portosystemic shunt
下载PDF
Modified constriction particle swarm optimization algorithm 被引量:4
4
作者 Zhe Zhang Limin Jia Yong Qin 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2015年第5期1107-1113,共7页
To deal with the demerits of constriction particle swarm optimization(CPSO), such as relapsing into local optima, slow convergence velocity, a modified CPSO algorithm is proposed by improving the velocity update formu... To deal with the demerits of constriction particle swarm optimization(CPSO), such as relapsing into local optima, slow convergence velocity, a modified CPSO algorithm is proposed by improving the velocity update formula of CPSO. The random velocity operator from local optima to global optima is added into the velocity update formula of CPSO to accelerate the convergence speed of the particles to the global optima and reduce the likelihood of being trapped into local optima. Finally the convergence of the algorithm is verified by calculation examples. 展开更多
关键词 particle swarm optimization random speed operator CONVERGENCE global optima
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部