- 更多网络例句与等价状态相关的网络例句 [注：此内容来源于网络，仅供参考]
-
Draw lessons from increment type observation implement with PI condition observation implement research achievement, combine heat to dominate a field complex control system designs bunchy form normally the actual condition of regulating system, offer observation of function of PI of increment style broad sense implement and the concept that its condition feedbacks, the tectonic regulating system that cluster form and observation implement feedback of shirt-sleeve broad sense condition controls a system, learn an analysis through number, give out the sufficient condition of IFO-PIO/BS reachs his corresponding theorem and deductive proof, announce give this to controlled systematic equivalence to be had at IFO-PIO/BS change the function that gain condition feedbacks.
借鉴增量式观测器和PI状态观测器的探究成果，并结合热控领域复杂控制系统通常设计成串级调节系统的实际情况，提出增量式广义PI函数观测器及其状态反馈的概念，构造串级调节系统和观测器相融合的广义状态反馈控制系统，通过数学分析，给出IFO-PIO/BS的充分条件及其相应定理和推论的证实，揭示出该控制系统等价于IFO-PIO/BS具有了变增益状态反馈的功能。
-
It′s topological properties are studied,three equivalent conditions of which topological space is discrete space and one equivalent condition of which topological space is mediocre space are abtained.
以离散参数马尔可夫链状态空间E为集合定义该集合上的一个拓扑T，研究它的拓扑性质，得到拓扑空间是离散空间的三个等价刻画以及是平庸空间的一个等价刻画。
-
A widely used method for checking real-time systems is,according to the real-time property to be checked,to use a proper bi-simulation equivalence relation to convert the infinite-timed state space to a finite equivalence class space.
一个被广泛用于验证实时系统的方法是根据被验证的实时性质，使用适当的双向模拟等价关系使无限的状态空间转化为有限的状态等价类空间。
-
The idea of our algorithm is equivalence class classification for continuous time is constrained by a relation between the remaining delay time of triggering event and time value of DTA clocks or the remaining delay time of other events.
和同类算法相比，我们的算法用更广义的延迟时间等价类取代同类算法中受事件先后顺序约束的单元延迟时间等价类，并且不必生成那些仅仅因为时间流逝而产生的状态等价类。
-
To do so, we define an equivalence relation with finite equivalence classes over state spaces of DTITL models.
通过定义DTITL无穷状态空间上的具有有限个数等价类的等价关系，把DTITL的连续状态模型离散化为一阶区间时序逻辑模型。
-
The new algorithm is composed of two parts: the first is called E-reduction, which contracts states that are equivalent and the second is called RE- reduction, which removes states which are in the maximal acyclic subgraph.
这个新算法包括两部分：第一部分是合并模糊自动机中的等价状态；第二部分是移出模糊自动机中的最大非循环子图中的状态。
-
As for a given automata,there exists three cases:for some state which did not being visited, for some state itself indeed being not reachable although it has been visited,for some state it is equivalent to other states though it can be reached to, in these three cases it is obviously redundant to construct these automata, and the only way for us is to delete,integrate and reduct these useless states in order to minimize the number of states.
对于一个给定的自动机，它的状态中有一些根本没有被访问过，有一些尽管被访问过，但是本身是不可达的，有一些状态尽管是可达的，但是在功能上却与另一些状态等价，这样的自动机在设计和应用中显然很累赘，可以将一些无用的状态删掉，将另外一些等价状态进行整合和约简，使之状态数达到极小。
-
Adopting generalized Jordan block and algebra equivalence transform method, all of the transfer functions at different load points can be transformed to state-space description with time variable. The steady robustness of three different mode of control systems were researched by mathematic analysis. It shows that: for the high order inertia controlled object with the characteristic of nonlinear and time-variable that described by the set of transfer functions, the Luenberger function observer established according to its any algebra equivalence state-space description, if some conditions can be met, there would be a matrix of T with n′n satisfied the Sylvester matrix equation TA- FT=GC.
采用广义约当块及代数等价变换方法，可将分段的传递函数描述转换为变参数的状态空间描述，对3种典型控制系统的稳定鲁棒性所进行的理论研究表明，对同一组传递函数描述的具有非线性和时变特性的高阶惯性受控对象，依据其任一代数等价的状态空间描述所构建的Luenberger函数观测器，在满足一定的条件时，存在n′n解阵T满足Sylvester矩阵方程TA- FT=GC。
-
From the equivalence relations, a minimal form is defined and a minimization algorithm of the Mealy type of fuzzy finite automata is obtained.
两类状态等价关系被引进，进而定义了该Mealy型模糊有限状态自动机的最小化形式，最后得到了该Mealy型模糊有限状态自动机的一种状态最小化约简的算法。
-
In Chapter 4, we not only give a new definition of fuzzy finite automata, of which the state transition accords with a compound fuzzy transition, but also present an important conclusion that the coarsest respecting compound fuzzy transition partition of states is same with the coarsest equivalent partition. In the discussion of coarsest partition, we give an algorithm respecting compound fuzzy transition which would be applied to get the coarsest respecting compound fuzzy transition partition.
第四章根据分明自动机的等价分类，通过重新定义模糊自动机识别过程，使得模糊自动机的识别过程与一个合成模糊变换一致，而且得到了尊重合成模糊变换的最粗分类即为状态集的最粗等价分类这一重要结论。
- 更多网络解释与等价状态相关的网络解释 [注：此内容来源于网络，仅供参考]
-
equivalent proposition：等值命题
equivalent point 等价点 | equivalent proposition 等值命题 | equivalent states 等价状态
-
equivalent states：等价状态
equivalent proposition 等值命题 | equivalent states 等价状态 | equivalent stochastic process 等价随机过程
-
equivalent stochastic process：等价随机过程
equivalent states 等价状态 | equivalent stochastic process 等价随机过程 | equivalent terms 等价项
-
interlock：联锁
共通(COMMON) 端子与机壳电位等价联锁(INTERLOCK) ...........端子间开放时为保护(PROTECTION) 状态瞬时(MOMENTARY) ......... 仅仅在按住测试开始(START) 按钮的期间进电源线:1根/ 联锁(INTERLOCK) 用跳线:1根/
-
loi d：平衡状态律
-active 积极平衡作用51 | 17-,loi d'平衡状态律49 | equivalence 等价28
-
unauthorized：未授权
授权状态最初可能为"未授权"(Unauthorized),是否能够变为"已授权"(Authorized)要取决于申请者的身份验证情况. 802.11规定,"关联"(associate)和"非关联"(dissociate)消息同以太网端口的"连接"和"未连接"相等价. 从而能够对何时进行身份验证加以控制.
-
code walkthrough：代码走查
●代码走查(code walkthrough) 和代码审查(code inspection) 是两种不同的代码评审方法,这两种方法的主要区别是____(14)____ . ●某一确定有限自动机(DFA) 的状态转换图如下图所示,该DFA接受的字符串集是____(28)___ ,与之等价的正规式是___(29)___ .
-
triggered update：触发更新
ABCA.OSPF基于链路状态算法,并根据开销 (cost)衡量路径的优劣D.支持可变长子网掩码,地址局和(address summy)E.不支持等价多路经(ECMP)A.水平分割(split horizon)B.触发更新(triggered update)C.毒性逆转(poison reverse)D.抑制定时器(h