checking computations

checking computations的基本解释

-

验算

与checking computations相关的网络例句 [注：此内容来源于网络，仅供参考]

The matching device automatic test-board is the checking tool checked the matching device capability, precision and reliability are the technique of the the matching device, the precision is the precondition of checking the matching device, the reliability is credibility degree of the decision checking consequent.the topic in view of the existing technique level, the main factors, which influence the measurement precision of the large scale test system, are analyzed in this paper, and the solutions improving the precision are put forward.1 using the multi-channel independent ac to transfer dc module, the power supply of the digit part and the simulation part is discerption, reducing the crosstalk between the digital signal and the simulated signal;2the feedback self-checking module is constructed by singlechip compositive 16 high accuracy a/d , established a closed-loop control system through this module and improved system's overall precision effectively.

匹配装置自动测试台是检测匹配装置性能的检测工具，其重要的技术指标是精度与可靠性，其高精度是作为检测匹配装置的前提，可靠性是决定了检测结果的可靠度。本课题针对现有的技术水平，分析了影响大型检测系统测量精度的主要因素，提出了提高精度的具体方案和办法：1采用了多路独立交流转直流模块，数字部分与模拟部分分开供电，减小了数字信号与模拟信号之间的串扰。2利用单片机集成的16位高精度a/d构建了反馈自检模块，通过该模块建立了一个闭环控制系统，有效地改善了系统的整体精度。

Analysis is conducted on model checking for three valued logic formulae of modal transition system using existing model checking techniques. We reduce the three valued logic model checking problem for modal transition system to the two valued model checking problem under Kripke structure. This reduction is linear in the number of states, size of transition relations, and number of atomic propositional formulae in the new formed model compared with those in the original model. It does not increase the comple...

分析了现有的模型检验技术应用于模态转移系统的三值逻辑公式的模型检验中存在的问题·提出了把模态转移系统转换成Kripke结构的算法以及三值逻辑公式转换成2个二值逻辑的算法，经过转换后可用现有的模型检验技术进行模型检验·用该算法转换后，状态数、转移数和原子命题数目与原模型呈线性关系，没有增加模型检验的复杂度

To study the limit behavior of computations, the procedure scheme (Li, 1992, 1999) is generalized to model convergent infinite computations for analyzing how an infinite computation interacts and evolves in changing environments and what the limit of the evolution might be. The model is based on classical computation model Turing machine and Li's limit theory of sequences of formal systems.

收敛无穷计算的模型过程模式：本文将李未提出的过程模式推广为更一般的刻画收敛无穷计算的模型，该模型是基于经典计算模型Turing机和形式系统序列及其极限的理论的，可以用过程模式刻画网络上长期运行程序的计算特性与动态行为。

与checking computations相关的网络解释 [注：此内容来源于网络，仅供参考]

checking computations：验算

checking 检验 | checking computations 验算 | chess board problem 棋盘问题

self checking code：自校验代码

self-checking capability 自检能力 | self-checking code 自校验代码 | self-checking equipment 自检设备

checking by resubstitution：重新代入检查

检查位 checking bit | 重新代入检查 checking by resubstitution | 检查计算 checking calculation