共查询到10条相似文献,搜索用时 406 毫秒
1.
2.
V. I. Levin 《Cybernetics and Systems Analysis》2003,39(3):394-401
The problem of determination of the conditions of formation and splitting of a collective (a team) and the problem of determination of the response of a dynamic automaton to specified input processes are shown to be equivalent. Based on this fact, an automaton model of a collective is constructed. The apparatus of continuous logic and logical determinants are used to analyze the model. 相似文献
3.
4.
5.
为优化网络资源配置,提高设备实占率,要求非主流机型NEAX61∑程控交换机退网,并介绍了由NEAX61∑割接至主流机型S1240程控交换机的实现方法。 相似文献
6.
对于通信公司(比如中国电信)来说,通信网络的安全稳定无疑是最重要的一件事情,没有了安全与稳定,其他一切都是空谈.本着从维护通信系统的安全稳定出发,针对湖南电信ECI网管的数据安全,从操作系统的恢复和网管中通信设备的电路数据库的备份2个方面进行阐述,重点讨论了如何实现网管数据的全自动备份,并将代码编写成脚本. 相似文献
7.
测试预言是一种用来检测被测系统的测试执行是否正确的方法。文中,作者设计并实现了一种根据程序的线性时序逻辑(LTL)的性质产生测试预言的方法。首先,作者将一线性时序逻辑公式转换为一个有限状态自动机,然后,管理源代码,以便抽取与线性时序逻辑性质有关的状态序列。最后,用谊信息来模拟状态自动机,并决定程序执行是否满足线性时序逻辑的性质。 相似文献
8.
毕业生就业率预测及质量评估研究 总被引:1,自引:0,他引:1
本文针对我校毕业生历年就业数据的变化特点,采用多项式回归和多元线性回归两种不同的算法对就业数据进行数学建模,进而实现就业率的预测,并且利用残差对两种模型的质量进行了分析评估。 相似文献
9.
10.
Translation separability of sets of polygons 总被引:1,自引:1,他引:0
We consider the problem of separating a set of polygons by a sequence of translations (one such collision-free translation motion for each polygon). If all translations are performed in a common direction the separability problem so obtained has been referred to as the uni-directional separability problem; for different translation directions, the more general multi-directional separability problem arises. The class of such separability problems has been studied previously and arises e.g. in computer graphics and robotics. Existing solutions to the uni-directional problem typically assume the objects to have a certain predetermined shape (e.g., rectangular or convex objects), or to have a direction of separation already available. Here we show how to compute all directions of unidirectional separability for sets of arbitrary simple polygons.The problem of determining whether a set of polygons is multi-directionally separable had been posed by G.T. Toussaint. Here we present an algorithm for solving this problem which, in addition to detecting whether or not the given set is multidirectionally separable, also provides an ordering in which to separate the polygons. In case that the entire set is not multi-directionally separable, the algorithm will find the largest separable subset.Research supported by NSERC under grant No. A9173 and A0392, respectively 相似文献