Recent results in interactive proof systems [?][?] [?] seem to indicate that it is easier for a prover in a single prover interactive proof system to cheat the verifier than it is for a prover in a multiple prover interactive proof system. We show that this is not the case for a single prover in which all but a fixed polynomial of the prover’s space is erased between each round. One consequence...

Based on denoising, segmentation and restoration problems of image processing and combined with two-phase flow mathematical theory, this paper proposes a class of nonlinear parabolic equations with nonlocal term. By fixed point theorem, the existence of initial boundary value problem is gotten. And then this paper establishes solution uniqueness and stability about initial value u0 and free ter...

This paper describes a reservation protocol to provide real-time services to mobile users in an Integrated Services Packet Network. Mobility of hosts has significant impact on the quality of service provided to a real-time application. The currently proposed network system architecture and mechanisms to provide real-time services to fixed hosts are inadequate to accommodate the mobile hosts whi...

This study introduces the scalability problem of many WDMA protocols for ring networks. We present a slotted access protocol and a scalable network architecture suitable for WDM ring metropolitan area networks. Each node is equipped with a pair of tunable transceivers to communicate exploiting all the fiber data wavelengths. Also, each node uses a pair of fixed tuned transceivers to exchange co...

We conducted a sensitivity analysis of the results of weighted voting experiments by varying two features of the experimental protocol by Montero et al. (2008): (1) the way in which the roles of subjects are reassigned in each round (random role versus fixed role) and (2) the number of proposals that subjects can simultaneously approve (multiple approval versus single approval). It was observed...