In the modern era, image captioning has become one of most widely required tools. Moreover, there are inbuilt applications that generate and provide a caption for certain image, all these things done with help deep neural network models. The process generating description an is called captioning. It requires recognizing important objects, their attributes, relationships among objects in image. ...

A Boolean function is said to have maximal sensitivity s if s is the largest number of Hamming neighbors of a point which differ from it in function value. We construct a pseudorandom generator with seed-length 2O( √ s) · log(n) that fools Boolean functions on n variables with maximal sensitivity at most s. Prior to our work, the best pseudorandom generators for this class of functions required...

A simple construction of pseudorandom generator is appear.This pseudorandom generator is always passed by NIST statistical test.This paper reports a pseudorandom number generator which has good property is able to construct using only permutation and data rewriting by XOR.

We show how a pseudorandom generator can provide a bit-commitment protocol. We also analyze the number of bits communicated when parties commit to many bits simultaneously, and show that the assumption of the existence of pseudorandom generators suffices to assure amortized O(1) bits of communication per bit commitment.

Number-theoretic pseudorandom generators work by iterating an algebraic map F (public or private) over a residue ring ZN on a secret random initial seed value v0 ∈ ZN to compute values vn+1 = F (vn) mod N for n ∈ N. They output some consecutive bits of the state value vn at each iteration and their efficiency and security are thus strongly related to the number of output bits. In 2005, Blackbur...

Q: Why are we using circuit lower bounds here, as opposed to a claim such as E ̸⊆ P for example? A: The proof of the Nisan-Wigderson pseudorandom generator relies on nonuniformity, by showing that distinguishing a pseudorandom generator implies a circuit for solving a hard problem – this reduction involves hardwiring advice into a circuit in order to solve the hard problem. A contradiction requi...

We introduce a new approach to construct extractors — combinatorial objects akin to expander graphs that have several applications. Our approach is based on error correcting codes and on the Nisan-Wigderson pseudorandom generator. An application of our approach yields a construction that is simple to describe and analyze, does not utilize any of the standard techniques used in related results, ...

We describe the design of a family of aperiodic PRNGs (APRNGs) introduced in [3]. We show how a one dimensional two tile cut and project quasicrystal (2TQC) used in conjunction with LCGs in an APRNG generates an infinite aperiodic pseudorandom sequence. In the suggested design, any 2TQC corresponding to unitary quadratic Pisot number combined with either one or two different LCGs can be used. 1...