MS900轧机液压锁的故障及分析

针对MS900轧机生产中遇到的问题,重点对因双锁取代单锁、液压锁安装位置错误及配套使用的换向阀型号不符等引发的故障及产生原因进行了分析。     

保域上矩阵可交换｛1｝-逆的线性映射

设F是一个特征不为2且至少含有5个元素的域.令Mn(F)为F上的n×n全矩阵代数.刻画了Mn(F)上保持矩阵可交换{1}-逆的线性映射的形式.利用保幂等结论证明了f为Mn(F)上的保持矩阵可交换{1}-逆的非零线性映射,当且仅当存在P∈GLn(F),使得f(A)=εPAP-1,A∈Mn(F),ε=±1∈F;或者存在P∈GLn(F),使得f(A)=εPAtP-1,A∈Mn(F),ε=±1∈F.     

推导可交换上下文无关语言

提出了推导可交换上下文无关语言及其文法,证明了正规语言类和有界上下文无关语言类都是推导可交换上下文无关语言类的子集,而推导可交换上下文无关语言类是上下文无关语言类的一个子集;定义了该类语言的α闭包等有关运算,给出了推导可交换上下文无关语言表达式,证明了推导可交换上下文无关文法、推导可交换上下文无关语言表达式之间的等价转换.     

姚氏百万富翁问题的高效解决方案

姚氏百万富翁问题是安全多方计算的典型问题,但已有解决方案多数存在效率低的问题。通过采用０编码与１编码,将百万富翁问题转换为集合交集问题,提出一种基于可交换加密函数的百万富翁问题高效解决方案,并进行了安全性证明。该方案无需复杂的模指数运算,加解密运算为O(n),通信轮数为4,整体性能优于其他方案。     

阶段时间对CMICAO工艺低温运行特性的影响

研究了低温下多点交替进水阶式A2/O(CMICAO)工艺阶段运行时间对污染物去除率的影响,探讨了DO、ORP以及pH状态参数与污染物去除率之间的关系。结果表明,水温8~10 ℃,泥龄13 d,水力停留时间16 h,污泥浓度2 680~3 560 mg/L,污泥回流比30%,阶段1至6的运行时间为3、2.5、2、3、2.5、2 h时,工艺出水TN、氨氮、NO3--N和TP浓度的平均值分别为10.1、1.1、7.4和0.8 mg/L。硝化反应结束时,pH由下降转为上升,ORP上升趋于平缓,DO上升趋缓;反硝化结束时,ORP曲线明显跌落,pH由上升趋于平缓并略有下降;释磷结束后ORP曲线由下降趋于平缓。降低前好氧池DO浓度,有助于同步硝化反硝化作用的发生,从而提高脱氮效率,节省能耗。     

A Fully Syntactic AC-RPO

We present the first fully syntactic (i.e., non-interpretation-based) AC-compatible recursive path ordering (RPO). It is simple, and hence easy to implement, and its behaviour is intuitive as in the standard RPO. The ordering is AC-total and defined uniformly for both ground and nonground terms, as well as for partial precedences. More important, it is the first one that can deal incrementally with partial precedences, an aspect that is essential, together with its intuitive behaviour, for interactive applications such as Knuth–Bendix completion.     

关于(i,j;m,n)型拟可换BCK-代数的"一点扩张"

证明了BCK-代数通过"一点扩张"可生成真BCI-代数,(i,j;m,n)型拟可换BCK-代数通过"一点扩张"可生成真BCI-代数并保持同型拟可换性.给出了实现"一点扩张"应满足的条件.     

Complexity of unification problems with associative-commutative operators

The unification problem for terms containing associative and commutative functions is of importance in theorem provers based on term rewriting and resolution methods as well as in logic programming. The complexity of determining whether two such terms are unifiable was known to be NP-hard. It is proved that the problem is NP-complete by describing a nondeterministic polynomial time algorithm for it. The case where the terms are linear and have no common variables is shown to be in P. The NP-completeness of other similar unification problems, in particular, when a function symbol is also idempotent and/or has a unit (identity), is also discussed. Finally, a table of the complexity of E-matching and E-unification problems is given.Partially supported by the National Science Foundation grant nos. DCR-8408461 and CCR-8906678. A preliminary version of this paper appeared earlier as a technical report of General Electric Corporate Research and Development, Dec. 1986.     

换向与不换向蓄热式燃烧技术的优劣比较

叙述了蓄热式燃烧技术的工作原理,并对燃料换向蓄热式燃烧技术和燃料不换向蓄热式燃烧技术进行了比较,发现换向蓄热式燃烧技术熔化速度快,造价高,适用于10t以上的熔铝炉;不换向蓄热式燃烧技术熔化速度慢,故障率低,适用于10t以下,特别是燃重油的小型熔铝炉。     

Bowker's test for symmetry and modifications within the algebraic framework

Categorical data occur in a wide range of statistical applications. If the data are observed in matched pairs, it is often of interest to examine the differences between the responses. The focus is on tests of axial symmetry in two-way tables. A commonly used procedure is the Bowker test which is a generalization of the McNemar test. The test decision is based on a chi-squared approximation which might not be adequate, for example if the table is sparse. Therefore, modifications of the test statistic have been discussed. A test of symmetry based on Bowker's test and Markov Chain Monte Carlo methods is proposed. A simulation study is carried out to determine and compare the performances of the simulation test, the Bowker test and two modifications.