In the atomic snapshot system model, the processes of an asynchronous distributed system communicate by atomic write and atomic snapshot read operations on a shared memory consisting of single-writer, multiple-reader registers. The processes may fail by crashing. It is shown that in this model, a wait-free, full-information protocol complex is homotopy equivalent to the underlying input complex...

Segmentation of handwritten input into individual characters is a crucial step in many connected handwriting recognition systems. This paper describes a segmentation algorithm for letters in Roman alphabets, curved pre-stroke cut (CPSC) segmentation. The CPSC algorithm evaluates large set of curved cuts through the image of the input string using dynamic programming and selects a small “optimal...

Experiments show that proteins are translated in sharp bursts; similar bursty phenomena have been observed for protein import into compartments. Here we investigate the effect of burstiness in protein expression and import on the stochastic properties of downstream pathways. We consider two identical pathways with equal mean input rates, except in one pathway proteins are input one at a time an...

Fast gradient sign attack series are popular methods that used to generate adversarial examples. However, most of the approaches based on fast cannot balance indistinguishability and transferability due limitations basic structure. To address this problem, we propose a method, called Adam Iterative Gradient Tanh Method (AI-FGTM), indistinguishable examples with high transferability. Besides, sm...

We begin by defining witness indistinguishability, or WI for short. A witness indistinguishable proof or argument system requires that the verifier does not learn anything about x after seeing a proof of x ∈ L; however, WI is a weaker property than zero knowledge. If the prover has both y and y′ as witnesses for x ∈ L, then under a WI system, the verifier cannot know whether y or y′ was used to...