英语释义

• unchanged in value following multiplication by itself;

  "this matrix is idempotent"

片语

primitive idempotent本原幂等元

idempotent semiring幂等半环

idempotent rings幂等环

similar idempotent相似幂等元素

Idempotent matrixes幂等矩阵

idempotent procedure幂等过程

idempotent operation幂等运算

idempotent completion幂等完备化

英汉例句

• in the end we prove that idempotent operator is similar to its adjoint.

  最后还证明了幂等算子和它的伴随是相似的。

• so we have prove that each p-congruence on p-regular semigroups is uniquely determined by its partial kernel normal systems containing idempotent elements.

  由此推出了p-正则半群上的每个p-同余完全是由其包含幂等元的部分核正规系所决定的。

• for requests that don「t change the server state and only pull back data (this is called an idempotent action), use get.

  如果请求不改变服务器状态只是取回数据（又称作幂等动作）则使用get。

• if that would be the case, other mule」s smart router would become handy, like the one allowing you to create idempotent receivers.

  如果事实如此，那其他的mule路由就唾手可得了，比如可以创建幂等接收者的路由。

• we first define the algebra of(finite) independent subsets of the ordered monoid m, and prove that the algebra of finite independent subsets of m is an idempotent semiring.

  首先定义了一个序幺半群m的无关子集的代数和有限无关子集代数，证明了结构是幂等半环。

• the conception of weak completely idempotent rings is introduced.

  首先利用弱理想，引入了弱全幂等环的概念。

• the idempotent receiver ensures that only unique messages are received by a service by checking the unique message id of the incoming message.

  幂等接收器（idempotentreceiver）通过核对输入消息的唯一消息id来保证只有拥有唯一id的消息才能被服务所接收。

• chapter one and chapter two use normal form of idempotent matrices and antisymmetric matrices over finite fields to construct cartesian authentication codes respectively.

  第一章、第二章分别利用幂等矩阵及反对称矩阵的标準型构造了卡氏认证码。

• the maximum idempotent - separating congruence on a s - semigroup is characterized and a fundamental representation of a such semigroup is given.

  刻划了s-正则半群上的极大幂等元分离同余并给每个s-正则半群一个基本表示。

• an idempotent business service that fails with a concurrency related failure can be retried

  由于并发相关操作的失败而导致失败的等幂业务服务可以重试。

• for example, get should be a safe, read-only idempotent call and should not alter the state of the resource in any manner.

  例如，get应该是安全的只读幂等（idempotent）调用，它不应该以任何方式更改资源的状态。

• a second problem was handling sequential messages in an idempotent fashion, such that they are executed once and only once.

  第二个问题是以幂等方式处理序列消息，这样这些消息被执行一次，且一次。

• write operations are idempotent and commutative, based on the time they enter the system.

  基于进入系统的时间，写操作具有幂等性(不管操作多少次结果都不变的性质，比如取绝对值的函数就具有幂等性)和交换性(操作顺序不影响结果，比如加法就具有交换性)。