We obtain a new class of polynomial identities on the ring of n × n matrices over any commutative ring with 1 by using the Swan’s graph theoretic method [1] in the proof of Amitsur-Levitzki theorem. Let be an Eu...We obtain a new class of polynomial identities on the ring of n × n matrices over any commutative ring with 1 by using the Swan’s graph theoretic method [1] in the proof of Amitsur-Levitzki theorem. Let be an Eulerian graph with k vertices and d edges. Further let be an integer and assume that . We prore that is an PI on Mn(C). Standard and Chang [2] -Giambruno-Sehgal [3] polynomial identities are the spectial examples of our conclusions.展开更多
在现有全加器研究基础上,提出一种高性能全加器改进电路(improved full adder circuit,IFAC),通过改进全加器电路结构,优化电路元件工作数量,旨在提升加法器逻辑功能与运行状态。采用Candence软件搭载130 nm芯片锻造工艺,引入欧拉路径...在现有全加器研究基础上,提出一种高性能全加器改进电路(improved full adder circuit,IFAC),通过改进全加器电路结构,优化电路元件工作数量,旨在提升加法器逻辑功能与运行状态。采用Candence软件搭载130 nm芯片锻造工艺,引入欧拉路径快速判寻法设计其电路版图,验证版图规则的合理性,并利用版图验证工具Dracula对电路进行仿真测试,结果表明本文所设计的全加器较常规全加器在处理复杂网络精确度、传输延迟时间、低功耗稳定运行及芯片面积方面有所提升。展开更多
The present research considers the problem of covering a graph with minimal number of trails satisfying the pre-defined local restrictions. The research is devoted to the problem of graph covering by minimal number of...The present research considers the problem of covering a graph with minimal number of trails satisfying the pre-defined local restrictions. The research is devoted to the problem of graph covering by minimal number of trails satisfying some local restrictions. Algotithm of allowed Eulerian cycle construction is considered. The authors showed that it is possible to recognize the system of transitions and solve the problem of constructing the allowable path by linear time. It’s also possible to find allowable Eulerian cycle for Eulerian graph or to proclaim that such a cycle does not exist by the time O(|V(G)|.|E(G)|). All presented algorithms have the software realization.展开更多
文摘We obtain a new class of polynomial identities on the ring of n × n matrices over any commutative ring with 1 by using the Swan’s graph theoretic method [1] in the proof of Amitsur-Levitzki theorem. Let be an Eulerian graph with k vertices and d edges. Further let be an integer and assume that . We prore that is an PI on Mn(C). Standard and Chang [2] -Giambruno-Sehgal [3] polynomial identities are the spectial examples of our conclusions.
文摘在现有全加器研究基础上,提出一种高性能全加器改进电路(improved full adder circuit,IFAC),通过改进全加器电路结构,优化电路元件工作数量,旨在提升加法器逻辑功能与运行状态。采用Candence软件搭载130 nm芯片锻造工艺,引入欧拉路径快速判寻法设计其电路版图,验证版图规则的合理性,并利用版图验证工具Dracula对电路进行仿真测试,结果表明本文所设计的全加器较常规全加器在处理复杂网络精确度、传输延迟时间、低功耗稳定运行及芯片面积方面有所提升。
文摘The present research considers the problem of covering a graph with minimal number of trails satisfying the pre-defined local restrictions. The research is devoted to the problem of graph covering by minimal number of trails satisfying some local restrictions. Algotithm of allowed Eulerian cycle construction is considered. The authors showed that it is possible to recognize the system of transitions and solve the problem of constructing the allowable path by linear time. It’s also possible to find allowable Eulerian cycle for Eulerian graph or to proclaim that such a cycle does not exist by the time O(|V(G)|.|E(G)|). All presented algorithms have the software realization.
