• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1375
  • 494
  • 180
  • 165
  • 163
  • 101
  • 45
  • 42
  • 33
  • 28
  • 26
  • 26
  • 26
  • 26
  • 26
  • Tagged with
  • 3315
  • 712
  • 518
  • 309
  • 256
  • 223
  • 198
  • 174
  • 154
  • 151
  • 151
  • 144
  • 129
  • 127
  • 125
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
61

Rapid Prototyping and Design of a Fast Random Number Generator

Franco, Juan 12 1900 (has links)
Information in the form of online multimedia, bank accounts, or password usage for diverse applications needs some form of security. the core feature of many security systems is the generation of true random or pseudorandom numbers. Hence reliable generators of such numbers are indispensable. the fundamental hurdle is that digital computers cannot generate truly random numbers because the states and transitions of digital systems are well understood and predictable. Nothing in a digital computer happens truly randomly. Digital computers are sequential machines that perform a current state and move to the next state in a deterministic fashion. to generate any secure hash or encrypted word a random number is needed. But since computers are not random, random sequences are commonly used. Random sequences are algorithms that generate a pattern of values that appear to be random but after some time start repeating. This thesis implements a digital random number generator using MATLAB, FGPA prototyping, and custom silicon design. This random number generator is able to use a truly random CMOS source to generate the random number. Statistical benchmarks are used to test the results and to show that the design works. Thus the proposed random number generator will be useful for online encryption and security.
62

Rapid Prototyping and Design of a Fast Random Number Generator

Franco, Juan 05 1900 (has links)
Information in the form of online multimedia, bank accounts, or password usage for diverse applications needs some form of security. the core feature of many security systems is the generation of true random or pseudorandom numbers. Hence reliable generators of such numbers are indispensable. the fundamental hurdle is that digital computers cannot generate truly random numbers because the states and transitions of digital systems are well understood and predictable. Nothing in a digital computer happens truly randomly. Digital computers are sequential machines that perform a current state and move to the next state in a deterministic fashion. to generate any secure hash or encrypted word a random number is needed. But since computers are not random, random sequences are commonly used. Random sequences are algorithms that generate a pattern of values that appear to be random but after some time start repeating. This thesis implements a digital random number generator using MATLAB, FGPA prototyping, and custom silicon design. This random number generator is able to use a truly random CMOS source to generate the random number. Statistical benchmarks are used to test the results and to show that the design works. Thus the proposed random number generator will be useful for online encryption and security.
63

Analytic Number Theory and the Prime Number Theorem

Buchanan, Dan Matthews 07 May 2018 (has links)
No description available.
64

On the prime twins conjecture and almost-prime k-tuples

Ho, Kwan-hung., 何君雄. January 2002 (has links)
published_or_final_version / abstract / toc / Mathematics / Master / Master of Philosophy
65

Some results on the mean values of certain error terms in analytic number theory

林啓任, Lam, Kai-yam. January 1996 (has links)
published_or_final_version / Mathematics / Master / Master of Philosophy
66

Interactions between fingers and numbers : towards finger numeral representations

Di Luca, Samuel 15 May 2008 (has links)
The influence of finger-counting strategies (pointing, keep track, montring) on number representations is supported by several empirical facts. However, even the above mentioned strategies have been object of studies during childhood, little is known about how finger-counting could interact with the semantic representation of numbers in adulthood. To address this issue, we conducted a first experiment in which participants had to identify Arabic digits by pressing the keyboard with one between their ten fingers. Results showed that responses were faster and more accurate when the finger assigned to each digit was congruent with the finger-counting habits of the participants (Di Luca, Granà, Semenza, Seron and Pesenti, 2006). Subsequently, in a numerosity detection task, we showed that the numerosities expressed by canonical configurations are named faster than those expressed by non-canonical ones, even when no motors responses were needed (Di Luca and Pesenti, in press). Moreover, when used as unconsciously presented primes, both types of configurations speeded up comparative judgments of Arabic digits, but only the priming effect induced by canonical configurations generalized to new, never consciously seen, numerosities, which implies an automatic semantic access for these one only. Finally, we showed that these differences cannot be ascribed to simple visual features, but they stem from two distinct semantic processes. Specifically, canonical configurations are processed as a symbolic system and activate a place coding semantic representation of magnitude, whereas non-canonical configurations activate a summation coding semantic representation.
67

Studies in turbulent dispersion using Kinematic Simulation

Malik, Nadeem Ahmad January 1991 (has links)
No description available.
68

A computational and analytical study of sound emitted by free shear flows

Avital, Eldad January 1998 (has links)
No description available.
69

PRESCHOOLER UNDERSTANDING OF PRINCIPLES GOVERNING COUNTING.

ADEY, KYM LLEWELLYN. January 1987 (has links)
This dissertation sought to explore dimensions of preschooler conceptual awareness of the principles of counting. The study derived its focus from the research of Rochel Gelman and, in particular, the principles of counting she purports are implicitly understood by young children. Their frequent inability to manifest this awareness in their counting performances is explained as resulting from their susceptibility to task demands. This study explores this position by seeking to facilitate performance in order that conceptual understanding might be more apparent. The sample for this study consisted of 40 children (20 aged 3 years 3 months-3 years 9 months; 20 aged 4 years 3 months-4 years 9 months) selected randomly from a cross section of preschool and day-care centers in Adelaide, South Australia. Phase 1 of the study explored the impact of a procedure which allowed for children to receive both visual and tactile feedback on their counting behavior on array sizes ranging from 2 to 19. The results show conclusively that this self-monitoring technique significantly improved counting performances for both age groups. In doing so it lends support to the Gelman hypothesis that conceptual awareness of the 'how-to' count principles can be masked by task demands. Phase 2 of the study looked at the complex 'order-irrelevance' principle. The results suggest that preschoolers understand that items can be counted in any order before they appreciate that this has no impact on cardinal value. The extreme susceptibility of preschoolers to variations in task demands necessitates further exploration of design and analysis parameters.
70

On the algebraic theories and computations of amicable numbers

Yan, Song Yuan January 1995 (has links)
No description available.

Page generated in 0.0414 seconds