目的介绍河南省脑瘫儿童登记及康复管理平台(HCPRRMS)建设过程,探讨区域性脑瘫登记管理及监测网络建设思路。方法系统性地介绍HCPRRMS建设过程、登记内容及初步结果。结果2014年开始自主开发HCPRRMS,2015年3月开始登记单中心住院脑瘫儿...目的介绍河南省脑瘫儿童登记及康复管理平台(HCPRRMS)建设过程,探讨区域性脑瘫登记管理及监测网络建设思路。方法系统性地介绍HCPRRMS建设过程、登记内容及初步结果。结果2014年开始自主开发HCPRRMS,2015年3月开始登记单中心住院脑瘫儿童相关信息,2018年底开始在河南省多家县市级医疗及康复机构推广应用,截止到2019年9月共23家儿童康复机构使用。共纳入1357例脑瘫儿童,登记内容包括性别、出生体质量、孕周、高危因素、脑瘫分型、粗大运动功能分级(GMFCS)以及并发症情况。其中,男性936例(68.98%);孕周小于37周501例(36.92%);出生体质量小于2500 g 443例(32.65%);出生时并发缺氧缺血性脑病者430例(31.69%);脑瘫类型中痉挛型最多,为1117例(86.74%);不同型别脑瘫儿童GMFCS分级有显著性差异(P<0.05);有头部MRI检查记录者1117例,其中侧脑室周围白质软化为主的白质损伤最多,为480例(42.97%);并发症方面,并发癫痫196例(14.44%),并发视觉障碍109例(8.03%),并发听觉障碍158例(11.64%),≥2岁769例中,并发语言-言语障碍424例(52.66%),≥4岁216例中,并发智力障碍82例(37.96%)。结论HCPRRMS有助于了解脑瘫儿童高危因素、临床和影像学特点及并发症情况。展开更多
It is well known that general 0-1 programming problems are NP-Complete and their optimal solutions cannot be found with polynomial-time algorithms unless P=NP. In this paper, we identify a specific class of 0-1 progra...It is well known that general 0-1 programming problems are NP-Complete and their optimal solutions cannot be found with polynomial-time algorithms unless P=NP. In this paper, we identify a specific class of 0-1 programming problems that is polynomially solvable, and propose two polynomial-time algorithms to find its optimal solutions. This class of 0-1 programming problems commits to a wide range of real-world industrial applications. We provide an instance of representative in the field of supply chain management.展开更多
文摘目的介绍河南省脑瘫儿童登记及康复管理平台(HCPRRMS)建设过程,探讨区域性脑瘫登记管理及监测网络建设思路。方法系统性地介绍HCPRRMS建设过程、登记内容及初步结果。结果2014年开始自主开发HCPRRMS,2015年3月开始登记单中心住院脑瘫儿童相关信息,2018年底开始在河南省多家县市级医疗及康复机构推广应用,截止到2019年9月共23家儿童康复机构使用。共纳入1357例脑瘫儿童,登记内容包括性别、出生体质量、孕周、高危因素、脑瘫分型、粗大运动功能分级(GMFCS)以及并发症情况。其中,男性936例(68.98%);孕周小于37周501例(36.92%);出生体质量小于2500 g 443例(32.65%);出生时并发缺氧缺血性脑病者430例(31.69%);脑瘫类型中痉挛型最多,为1117例(86.74%);不同型别脑瘫儿童GMFCS分级有显著性差异(P<0.05);有头部MRI检查记录者1117例,其中侧脑室周围白质软化为主的白质损伤最多,为480例(42.97%);并发症方面,并发癫痫196例(14.44%),并发视觉障碍109例(8.03%),并发听觉障碍158例(11.64%),≥2岁769例中,并发语言-言语障碍424例(52.66%),≥4岁216例中,并发智力障碍82例(37.96%)。结论HCPRRMS有助于了解脑瘫儿童高危因素、临床和影像学特点及并发症情况。
基金supported by National Natural Science Foundation of China (Grant Nos.70471008, 70971072)
文摘It is well known that general 0-1 programming problems are NP-Complete and their optimal solutions cannot be found with polynomial-time algorithms unless P=NP. In this paper, we identify a specific class of 0-1 programming problems that is polynomially solvable, and propose two polynomial-time algorithms to find its optimal solutions. This class of 0-1 programming problems commits to a wide range of real-world industrial applications. We provide an instance of representative in the field of supply chain management.
