scispace - formally typeset
Search or ask a question
Topic

K-distribution

About: K-distribution is a research topic. Over the lifetime, 1281 publications have been published within this topic receiving 51774 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: In this article, the authors derived the formulae for moments and recurrence relations for two classes of discrete probability distributions, namely, Deformed Modified Factorial Series Distributions (DMFSD) and deformed Modified Power series distributions (DMPSD), and derived the results obtained generalize or extend some Theorems given by Janardan.
Abstract: We consider properties of two classes of discrete probability distributions, namely the so-called Deformed Modified Factorial Series Distributions (DMFSD) and Deformed Modified Power Series Distributions (DMPSD). The formulae for moments and recurrence relations for the moments of these deformed distributions are derived. The results obtained generalize or extend some Theorems given by Janardan (Janardan, K. G. (1984). Moments of certain series distributions and their applications. SIAM J. Appl. Math. 44:854–868) and Gupta (Gupta, R. C. (1974). Modified power series distributions and some of its applications. Sankhya, Ser. B 35:288–298).

8 citations

Journal ArticleDOI
P. M. Lewis1
TL;DR: It is shown that networks consisting of diodes in the form of “and” gates and resistors in the forms of summation elements can realize any probability approximation satisfying the maximum entropy criterion.
Abstract: Frequently engineering considerations place limitations on the size of decision making systems and on the resources of the system designer. The pertinent high order probability distributions may be unknown and it may not be possible to measure and/or store these distributions in their entirety; some type of approximation is then necessary. One type of approximation that has been studied previously involves measuring and storing several of the lower order component distributions and using these to approximate the high order distribution, using the criterion of maximum entropy. This note considers the related realization problem for binary distributions. By a realization of such an approximation is meant a physical network with the following properties: (1) Its inputs are the variables on which the decision is to be based. (2) Stored within it are the lower order component distributions on which the approximation is to be based. (3) Its outputs (one for each possible decision) are approximations to the high order distributions sufficient to make the decisions. The realization problem for maximum entropy approximations is particularly simple because of their functional form. Maximum entropy distributions are always products of functions of the variables in the given component distributions. Therefore, the logarithms of these distributions are sums of functions of these same variables and hence can be easily realized. It is shown that networks consisting of diodes in the form of “and” gates and resistors in the form of summation elements can realize any probability approximation satisfying the maximum entropy criterion.

8 citations

Journal ArticleDOI
Yong Kong1
TL;DR: In this paper, the GF method was used to derive run-related distributions in a systematic way for both conditional and unconditional models, and the limiting distributions were Gaussian, with mean, variance, and covariance linear functions in the size of the system.
Abstract: Distributions of runs have important applications in many fields, including biological sequence analysis. The generating function (GF) method provides a unified approach to tackle different run-related problems in multistate trials. By utilizing this method, various run-related distributions are derived in a systematic way for both conditional and unconditional models. The GF approach also naturally yields the asymptotic distributions. For all the distributions considered, the limiting distributions are Gaussian, with mean, variance, and covariance linear functions in the size of the system.

8 citations

Journal ArticleDOI
TL;DR: This paper extends previous works on unimodal distributions by proposing a possibility representation of bimodal probability distributions, and applies the proposed method to the case of three independent or positively correlated C-grade resistors in series.
Abstract: At the application level, it is important to be able to define the measurement result as an interval that will contain an important part of the distribution of the measured values, that is, a coverage interval. This practice acknowledged by the International Organization for Standardization (ISO) Guide is a major shift from the probabilistic representation. It can be viewed as a probability/possibility transformation by viewing possibility distributions as encoding coverage intervals. In this paper, we extend previous works on unimodal distributions by proposing a possibility representation of bimodal probability distributions. Indeed, U-shaped distributions or Gaussian mixture distribution are not very rare in the context of physical measurements. Some elements to further propagate such bimodal possibility distributions are also exposed. The proposed method is applied to the case of three independent or positively correlated C-grade resistors in series and compared with the Guide to the Expression of Uncertainty in Measurement (GUM) and Monte Carlo methods.

8 citations


Network Information
Related Topics (5)
Markov chain
51.9K papers, 1.3M citations
80% related
Estimator
97.3K papers, 2.6M citations
78% related
Iterative method
48.8K papers, 1.2M citations
76% related
Wavelet
78K papers, 1.3M citations
76% related
Robustness (computer science)
94.7K papers, 1.6M citations
73% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20232
20228
20213
20207
201914
201816