An Algorithm Proving the Resource-allocation-graph Algorithm
An Algorithm Proving the Resource-allocation-graph Algorithm
作 者:Wang jikui Lanzhou University of Finance and Economics Lanzhou China Tang shijie Guilin University of Electronic Technology Guilin Guangxi Wang huiyong Guilin University of Electronic Technology Guilin Guangxi
会议名称:《2010 International Conference on Intelligent Computing and Integrated Systems》
会议日期:2010年
学科分类:08[工学] 081202[工学-计算机软件与理论] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:supported by National Foundation:A Web Services based court doucument information numeric administrating open system. Foundation number:08C26226202388
关 键 词:Resource-allocation-graph algorithm Non reducible graph Simplification sequence
摘 要:正By analyzing the resource allocation graph algorithm,we state that the soundess of the algorithm depends on a fact:different simplification sequences of the resource allocation graph lead to a same Non-reducible *** analyzing the essence of the resource allocation algorithm,we give another algorithm to verify the resource-allocation-graph algorithm.
1、借阅数量:每证可借书6册,期刊2册,团体读者证可借书刊300册。
2、借阅时间:个人借期为30天,每本书可续借1次,借期为30天;团体借期为90天。
3、归还地点:3楼服务台、自助借还设备、还书箱、各分馆
4、馆际互借:读者未能在本馆获取所需文献资料,可至参考咨询阅览室服务台填写《南通市图书馆馆际互借读者申请表》,根据馆际互借协议,我馆将为读者向其他馆代借文献。馆际互借过程中所产生的费用(资料复印、邮寄费等),由读者个人承担。
5、服务电话
续借:59003605 59003606
咨询:81100100 59003600