Electronic Function Generator
نویسندگان
چکیده
منابع مشابه
Electronic Transmission Wave Function of Disordered Graphene by Direct Method and Green's Function Method
We describe how to obtain electronic transport properties of disordered graphene, including the tight binding model and nearest neighbor hopping. We present a new method for computing, electronic transport wave function and Greens function of the disordered Graphene. In this method, based on the small rectangular approximation, break up the potential barriers in to small parts. Then using the f...
متن کاملResilient Function based Sequence Generator-RFSG
The main focus of this paper is to apply suitable combiner function for cryptographic use which possesses multiple cryptographic properties such as balanced, correlation immune and high algebraic degree. Resilient function which is the generalization of correlation immune Boolean function is thus considered. In this paper we presents RFSG, a new sequence generator which uses (q, m+1, m, 1) resi...
متن کاملGPERF: A Perfect Hash Function Generator
gperf is a “software-tool generating-tool” designed to automate the generation of perfect hash functions. This paper describes the features, algorithms, and object-oriented design and implementation strategies incorporated in gperf. It also presents the results from an empirical comparison between gperf-generated recognizers and other popular techniques for reserved word lookup. gperf is distri...
متن کاملDevelopment of a Compact Optical Function Generator
Abstract: We have demonstrated that ultrafast optical waveforms can be obtained by Fourier synthesis of octave spanning frequency combs. There are two effective approaches of producing the combs. The first is by adiabatically driving the molecular vibrational coherence of H2 to its maximum. Using line-by-line shaping of five of the frequencies of this comb, we synthesized periodic waveforms in ...
متن کاملIterative Universal Hash Function Generator for Minhashing
Minhashing is a technique used to estimate the Jaccard Index between two sets by exploiting the probability of collision in a random permutation. In order to speed up the computation, a random permutation can be approximated by using an universal hash function such as the ha,b function proposed by Carter and Wegman. A better estimate of the Jaccard Index can be achieved by using many of these h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1947
ISSN: 0028-0836,1476-4687
DOI: 10.1038/159743a0