• Refine Query
• Source
• Publication year
• to
• Language
• 8
• 3
• 1
• Tagged with
• 12
• 12
• 8
• 8
• 6
• 6
• 5
• 5
• 5
• 5
• 5
• 5
• 5
• 5
• 4
• 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.
1

#### Combinatorial problems related to sequences with repeated entries

Archibald, Margaret Lyn 15 November 2006 (has links)
Student Number : 9708525G - PhD thesis - School of Mathematics - Faculty of Science / Sequences of numbers have important applications in the field of Computer Science. As a result they have become increasingly regarded in Mathematics, since analysis can be instrumental in investigating algorithms. Three concepts are discussed in this thesis, all of which are concerned with ‘words’ or ‘sequences’ of natural numbers where repeated letters are allowed: • The number of distinct values in a sequence with geometric distri- bution In Part I, a sample which is geometrically distributed is considered, with the objective of counting how many different letters occur at least once in the sample. It is concluded that the number of distinct letters grows like log n as n → ∞. This is then generalised to the question of how many letters occur at least b times in a word. • The position of the maximum (and/or minimum) in a sequence with geometric distribution Part II involves many variations on the central theme which addresses the question: “What is the probability that the maximum in a geometrically distributed sample occurs in the first d letters of a word of length n?” (assuming d ≤ n). Initially, d is considered fixed, but in later chapters d is allowed to grow with n. It is found that for 1 ≤ d = o(n), the results are the same as when d is fixed. • The average depth of a key in a binary search tree formed from a sequence with repeated entries Lastly, in Part III, random sequences are examined where repeated letters are allowed. First, the average left-going depth of the first one is found, and later the right-going path to the first r if the alphabet is {1, . . . , r} is examined. The final chapter uses a merge (or ‘shuffle’) operator to obtain the average depth of an arbitrary node, which can be expressed in terms of the left-going and right-going depths.
2

#### Characterizations Based on Conditional Expectations of Order Statistics

Kuo, Tzu-Fang 04 July 2000 (has links)
It is known that record values and order statistics are closely related. When record values and order statistics are viewed as point processes, the two processes both share the order statistics property. The results of Beg and Balasubramanian(1990), Wu and Ouyang(1996), and Huang and Su(1999) about record values and order statistics motivated us to investigate more general results of characterization for order statistics point processes by using conditional expectations based on order statistics. On the other hand, in the class of point processes, there are a lot of characterizations of homogeneous Poisson processes based on the memoryless property of exponential distribution. The result of Asadi(1999) about characterization of the Gumble bivariate exponential or the bivariate geometric distribution inspired us be interested in investigating some similar results about non-independent bivarite homogeneous Poisson processes.
3

#### An Investigation of Some Problems Related to Renewal Process

Yeh, Tzu-Tsen 19 June 2001 (has links)
In this thesis we present some related problems about the renewal processes. More precisely, let \$gamma_{t}\$ be the residual life at time \$t\$ of the renewal process \$A={A(t),t geq 0}\$, \$F\$ be the common distribution function of the inter-arrival times. Under suitable conditions, we prove that if \$Var(gamma_{t})=E^2(gamma_{t})-E(gamma_{t}),forall t=0,1 ho,2 ho,3 ho,... \$, then \$F\$ will be geometrically distributed under the assumption \$F\$ is discrete. We also discuss the tails of random sums for the renewal process. We prove that the \$k\$ power of random sum is always new worse than used (\$NWU\$).
4

#### O modelo Burr XII geométrico: propriedades e aplicações / The model Burr XII Geometric: properties and applications

Lanjoni, Beatriz Rezende 25 November 2013 (has links)
5

#### A distribuição log-logística exponenciada geométrica: dupla ativação / The exponentiated log-logistic geometric distribution: dual activation

Mendoza, Natalie Verónika Rondinel 18 September 2012 (has links)
6

#### A distribuição beta semi-normal generalizada geométrica / The beta generalized half-normal geométric distribution

Ramires, Thiago Gentil 21 June 2013 (has links)
7

#### Modelo geométrico de ordem k correlacionado / Correlated Geometric Model of Order k

Souza, Roberta de 29 August 2019 (has links)
8

#### A distribuição beta semi-normal generalizada geométrica / The beta generalized half-normal geométric distribution

Thiago Gentil Ramires 21 June 2013 (has links)
9

#### O modelo Burr XII geométrico: propriedades e aplicações / The model Burr XII Geometric: properties and applications

Beatriz Rezende Lanjoni 25 November 2013 (has links)