• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 410
  • 58
  • 47
  • 19
  • 13
  • 11
  • 11
  • 11
  • 11
  • 11
  • 11
  • 7
  • 7
  • 4
  • 3
  • Tagged with
  • 690
  • 132
  • 95
  • 94
  • 76
  • 70
  • 62
  • 59
  • 56
  • 54
  • 46
  • 42
  • 38
  • 37
  • 36
  • 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.
181

The asymptotic behaviour of a critical branching process /

Sze, Michael Ming Chih January 1975 (has links)
No description available.
182

On a class of estimators of the location parameter based on a weighted sum of the observations

Rivest, Louis Paul. January 1978 (has links)
Note:
183

The analysis of outliers /

Norris, Douglas Arnold. January 1969 (has links)
No description available.
184

Tchebycheff type inequalities

Yalovsky, Morty January 1968 (has links)
No description available.
185

On the existence of random fields compatible with given systems of conditional probabilities

Hamilton, Malcolm D. January 1974 (has links)
No description available.
186

Bounds for the probability of a union

Grenon, Gilles January 1975 (has links)
No description available.
187

Students' reasoning about probability simulations during instruction

Zimmermann, Gwendolyn. Jones, Graham A. January 2002 (has links)
Thesis (Ph. D.)--Illinois State University, 2002. / Title from title page screen, viewed January 24, 2006. Dissertation Committee: Graham A. Jones (chair), Cynthia Langrall, Kenneth Berk, Edward S. Mooney. Includes bibliographical references (leaves 180-186) and abstract. Also available in print.
188

Lower and upper probabilities in the distributive lattice of subsystems

Vourdas, Apostolos 07 July 2014 (has links)
yes / The set of subsystems ∑ (m) of a finite quantum system ∑(n) (with variables in Ζ(n)) together with logical connectives, is a distributive lattice. With regard to this lattice, the ℓ(m | ρn) = Tr (𝔓(m) ρn ) (where 𝔓(m) is the projector to ∑(m)) obeys a supermodularity inequality, and it is interpreted as a lower probability in the sense of the Dempster–Shafer theory, and not as a Kolmogorov probability. It is shown that the basic concepts of the Dempster–Shafer theory (lower and upper probabilities and the Dempster multivaluedness) are pertinent to the quantum formalism of finite systems.
189

Quantum walks and quantum search on graphene lattices

Foulger, Iain January 2014 (has links)
This thesis details research I have carried out in the field of quantum walks, which are the quantum analogue of classical random walks. Quantum walks have been shown to offer a significant speed-up compared to classical random walks for certain tasks and for this reason there has been considerable interest in their use in algorithmic settings, as well as in experimental demonstrations of such phenomena. One of the most interesting developments in quantum walk research is their application to spatial searches, where one searches for a particular site of some network or lattice structure. There has been much work done on the creation of discrete- and continuous-time quantum walk search algorithms on various lattice types. However, it has remained an issue that continuous-time searches on two-dimensional lattices have required the inclusion of additional memory in order to be effective, memory which takes the form of extra internal degrees of freedom for the walker. In this work, we describe how the need for extra degrees of freedom can be negated by utilising a graphene lattice, demonstrating that a continuous-time quantum search in the experimentally relevant regime of two-dimensions is possible. This is achieved through alternative methods of marking a particular site to previous searches, creating a quantum search protocol at the Dirac point in graphene. We demonstrate that this search mechanism can also be adapted to allow state transfer across the lattice. These two processes offer new methods for channelling information across lattices between specific sites and supports the possibility of graphene devices which operate at a single-atom level. Recent experiments on microwave analogues of graphene that adapt these ideas, which we will detail, demonstrate the feasibility of realising the quantum search and transfer mechanisms on graphene.
190

Ruin theory under a threshold insurance risk model

Kwan, Kwok-man., 關國文. January 2007 (has links)
published_or_final_version / abstract / Statistics and Actuarial Science / Master / Master of Philosophy

Page generated in 0.0577 seconds