Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 18 of 18 for “"Probability Mass Function"”.
-
On Semi-supervised Estimation of Distributions
We study the problem of estimating the joint probability mass function (pmf) over two random variables. In particular, the estimation is based on the observation of 𝑚 samples containing both variables and 𝑛 samples missing one fixed variable. We adopt the minimax framework with [notation] loss …
-
A stochastic process model for transient trace data
… random variables X<sub>t</sub> follow different probability distributions. To estimate the parameters for the model a Rate Evolution Graph (REG) is built from the trace data. The REG is a two-dimensional Cartesian graph which plots the number of occurrences of each unique state in the trace on …
-
The Zero-Truncated Poisson-Weighted Exponential Distribution with Applications
… In the first part (the theoretical part), the probability mass function is derived from two methods. Then theoretical properties of the zero-truncated Poisson weighted exponential distribution are discussed: such as probability generating function, moment generating function, characteristic …
-
Probabilistic Modeling and Verification of Large Scale Systems
… synchronization. We abstract a system state as a probability mass function (pmf); a pmf is succinct in representation and is informative enough to describe many useful aggregate behaviors of the system. We model the dynamics of the state transitions as a Discrete Time Markov Chain (DTMC) and …
-
A New Asymptotic Expansion for Sums of Random Variables
… to improve upon local Edgeworth expansions for probability distributions of sums of independent identically distributed random variables. Let X be a random variable with finite variance, and X1, X2, …, a sequence of i.i.d. random variables each with the same distribution as X. In addition, …
-
Optimal Codes and Entropy Extractors
… between the uniform distribution and the probability mass function of a random number generator with the weight distribution of the linear code associated to the linear extractor. Finally, we present a collection of results derived while pursuing a way to classify optimal codes, such as a …
-
Efficient sequential probability assessment heuristic in decision analysis
… outcomes are specified but the corresponding probability mass function is only partially known. In such cases, the expected utility of an alternative is not explicitly computable and decisions are made without full information. To address this problem, previous research has tried to establish …
-
The Advancements on the Interface of Statistical Computing, Survival Analysis, and Degradation Analysis
… re-represents the denominator as a part of the probability mass function (pmf) of a Poisson multinomial distribution (PMD). However, efficient methods for computing the pmf of the PMD have yet to be developed. To bridge this gap, this dissertation introduces three distinct methods to calculate …
-
Data and Distribution Privacy Under Function Recoverability
Many data-driven applications entail function computation based on user data, with accompanying requirements of data privacy. In such an application, a user holding data must publicly furnish accurate attributes of the data (function recoverability or utility) while simultaneously protecting the …
-
Reliability Analysis of Social Networks
… multi-valued and stochastic in nature but also a function of the interactions with its neighbors. A Monte Carlo simulation model is presented to evaluate the reliability of the network, and network reliability is evaluated under various influence communication rules. In Chapter 5, a hierarchical …
-
Learning with structured decision constraints
… based on minimizing estimated conditional risk functions. With this approach, we first estimate the conditional expected loss (i.e., conditional risk) function by regression, and then minimize it to predict an output. We analyze statistical and computational properties of this approach, and …
-
Learning and testing junta distributions over hypercubes
… D over {0, 1}n is a k-junta distribution if the probability mass function p of D is a k-junta-- i. e., if there is a set J [subset][n] of at most k coordinates such that for every x [set membership] {0, 1}7, the value of p(x) is completely determined by the value of x on the coordinates in J. We …
-
Proactive Decision Support Tools for National Park and Non-Traditional Agencies in Solving Traffic-Related Problems
… where queueing performance and arrival and probability mass functions of the vehicle arrival rates are determined. Chapter 3 focuses on the evaluation of a parking system within the Moose-Wilson Corridor in a popular attraction known as the Laurance S. Rockefeller Preserve, in which the …
-
Statistically and economically based attribute acceptance sampling models with inspection errors
… AOQ, average total inspection, ATI, and the probability of accepting a lot, P<sub>a</sub> are established for both situations of interest. For the error prone situation, a new probability mass function is defined which describes the conditional distribution governing the occurrence of …
-
Stochastic Dynamics of Cascading Failures in Electric-Cyber Infrastructures
… the prediction of the evolution of the blackout probability in time. Furthermore, the asymptotic analysis of the blackout probability as time tends to infinity enables the calculation of the probability mass function of the blackout size, which has been shown to have a heavy tail, e.g., power-law …
-
Information Measures For Statistical Orbit Determination
… of its region of uncertainty given by the probability density function (PDF). As even collision events with very low probability are important, accurate prediction of collisions require the representation of the full PDF of the random orbit state. Through representing the full PDF of the …
-
A Study on Unintentional and Intentional Sources of Variability in Nanometer Scale Digital Circuits
… the error injected into a computation as a function of the extent of approximation to systematically obtain the tradeoff between accuracy and power savings achieved in approximate circuits to aid their design. For applications where aging-related errors are a critical problem, the first half …
-
Entropic Continuity Bounds & Eventually Entanglement-Breaking Channels
… and uniform continuity bounds for Schur concave functions; that is, for real-valued functions which are decreasing in the majorization pre-order. Continuity bounds provide a quantitative measure of robustness, addressing the following question: If there is some uncertainty or error in the input, …