检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国矿业大学机电工程学院,江苏徐州市221008
出 处:《矿业研究与开发》2008年第3期40-42,共3页Mining Research and Development
摘 要:从图论的观点来解决信集闭系统中进路联锁表的自动生成问题。首先根据进路间不同的敌对关系,得到进路联锁表的生成判据。然后从图论的角度来认识系统中的进路,生成系统的进路图,在此基础上,利用矩阵计算,得到进路联锁表的生成算法。经实践验证,利用该算法自动生成的进路联锁表正确无误。This paper tries to solve the problem of automatic generating of admission passage interlocking table in signal concentrating and interlocking system for track haulage supervision of mine based on the viewpoint of graph theory. Firstly, the generation criterion of admission passage interlocking table can be created according to the different antagonism of admission passages. The admission passages in the system can be known from the graph theory~ angle and the admission passage graphic of system can be generated. On the basis of these, the generation algorithm of admission passage interlocking table can be received by matrix computation. The experiments prove that the admission passage interlocking table auto - generated by this algorithm is exactly correct.
分 类 号:TP273.5[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28