Non-deterministic exponential time has two-prover interactive protocols

We determine the exact power of two-prover interactive proof systems introduced by Ben-Or, Goldwasser, Kilian, and Wigderson (1988). In this system, two all-powerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the inputx belongs to the languageL. We show that the class of languages having tow-prover interactive proof systems is nondeterministic exponential time.We also show that to prove membership in languages inEXP, the honest provers need the power ofEXP only.The first part of the proof of the main result extends recent techniques of polynomial extrapolation used in the single prover case by Lund, Fortnow, Karloff, Nisan, and Shamir.The second part is averification scheme for multilinearity of a function in several variables held by an oracle and can be viewed as an independent result onprogram verification. Its proof rests on combinatorial techniques employing a simple isoperimetric inequality for certain graphs:     

应用M68HC908LJ12设计单相复费率电能表

介绍了以Motorola公司的M68HC908LJ12高性能单片机为CPU的单相复费率电能表的硬、软件设计和抗干扰设计。     

MC68HC908QT4单片机键盘模块原理及应用

本文分析了MC68HC908QT4单片机键盘模块的结构原理和寄存器功能，结合其键盘模块的特点，给出了具体的键盘应用实例。     

The Berlekamp-Massey Algorithm revisited

We propose a slight modification of the Berlekamp-Massey Algorithm for obtaining the minimal polynomial of a given linearly recurrent sequence. Such a modification enables to explain it in a simpler way and to adapt it to lazy evaluation. partially supported by the Galois Theory and Explicit Methods in Arithmetic Project HPRN-CT-2000-00114 partially supported by the European Union funded project RAAG CT-2001-00271     

An efficient algorithm for characteristic tracking on two-dimensional triangular meshes

Tracking characteristics on unstructured meshes is an important part of many numerical methods in computational fluid mechanics. In this paper, we propose an efficient algorithm for characteristic tracking on two-dimensional unstructured triangular meshes. Numerical experiments, including an example for applying this algorithm with the Eulerian-Lagrangian localized adjoint method (ELLAM) to solve a convection-dominated convection-diffusion problem, are presented to demonstrate the efficiency of this algorithm.     

Efficient and optimal exponentiation in finite fields

Optimal sequential and parallel algorithms for exponentiation in a finite field containing F _q are presented, assuming thatqth powers can be computed for free.     

F68大单体/HEMA共聚水凝胶的制备及性能研究(Ⅰ):温度敏感性

本文以温度敏感性Pluronic F68与甲基丙烯酸缩水甘油酯(GMA)反应制备可光聚合的F68/GMA大分子单体,再在水溶液中与丙烯酸(AA)单体和甲基丙烯酸β-羟乙酯(HEMA)经紫外光原位聚合制备温度敏感水凝胶。详细地研究了水凝胶在不同温度下的溶胀性能。溶胀动力学测量的结果表明,该水凝胶具有温度响应性且具有可逆性。     

Invariance properties of RAMS and linear time

An operation on integers isLTTC if it is computable in linear time on a Turing machine (using the dyadic or binary representation of integers). AnLTTC-RAM (respectivelyI-RAM) is a RAM which only uses LTTC operations (respectively operations in the setI).The address-free time complexity measure of a RAM evaluates execution times using the logarithmic cost criterion but assumes that addressing operations are performed for free.     

Space-efficient recognition of sparse self-reducible languages

Mahaney and others have shown that sparse self-reducible sets have time-efficient algorithms, and have concluded that it is unlikely that NP has sparse complete sets. Mahaney's work, intuition, and a 1978 conjecture of Hartmanis notwithstanding, nothing has been known about the density of complete sets for feasible classes until now. This paper shows that sparse self-reducible sets have space-efficient algorithms, and in many cases, even have time-space-efficient algorithms. We conclude that NL, NC ^k , AC ^k , LOG(DCFL), LOG(CFL), and P lack complete (or even Turing-hard) sets of low density unless implausible complexity class inclusions hold. In particular, if NL (respectively P, _k , or NP) has a polylog-sparse logspace-hard set, then NLSC (respectively PSC, _k , or PHSC), and if P has subpolynomially sparse logspace-hard sets, then PPSPACE.     

Circuits constructed with MOD q gates cannot compute “AND” in sublinear size

Algebraic techniques are used to prove that any circuit constructed with MOD _q gates that computes the AND function must use (n) gates at the first level. The best bound previously known to be valid for arbitraryq was (logn).