检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安铁路职业技术学院,陕西西安710016 [2]陕西师范大学数学与信息科学学院,陕西西安710062
出 处:《电子设计工程》2015年第22期4-6,10,共4页Electronic Design Engineering
基 金:国家自然科学基金资助项目(10871122;11171199)
摘 要:针对储药柜优化设计问题,提出逐步分裂的迭代算法。该方法是在类型最少方案的基础上,为获得大幅冗余降低率,对隔板间距类型进行逐步拆分,以减少冗余。首先,通过Excel对数据进行统计分析,其次,利用Matlab给出分类冗余曲线拟合图,确立合理的横版和竖版间距类型,最后,根据药品日需量计算出最少需要的储药柜个数。结果证明了该方法确立储药柜规格的合理性。A gradually splitting iterative algorithm is suggested in this article to optimizing the medicine storing cabinet design. This method, basing on the least type solution, analyses the baffle spacing type to achieve a substantial redundancy reduction rate, thus to reduce the redundancy, This is done by firstly statistically analyzing the data via Excel, and secondly providing a classified redundant curve fitting chart via matlab to establish a reasonable horizontal and vertical version of spacing type, as well as by calculating the least number of storing cabinets needed, which turns out to prove the rationality of applying this method to establish storing cabinets' specifications.
分 类 号:TN102[电子电信—物理电子学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.209