scholarly journals Asymptotic Maximum Order Statistic for SIR in ${\kappa} -{\mu}$ Shadowed Fading

2019 ◽  
Vol 67 (9) ◽  
pp. 6512-6526 ◽  
Author(s):  
Athira Subhash ◽  
Muralikrishnan Srinivasan ◽  
Sheetal Kalyani
Keyword(s):  
Order Statistic ◽  
Maximum Order ◽  
Shadowed Fading

Reliability Analysis of Shiplift Gear Based on System-Level Load-Strength Interference Model

2010 ◽  
Vol 118-120 ◽  
pp. 354-358
Author(s):  
Ying Wu ◽  
Li Yang Xie ◽  
De Cheng Wang ◽  
Ji Zhang Gao
Keyword(s):  
Reliability Analysis ◽  
Order Statistic ◽  
System Reliability ◽  
Bending Strength ◽  
High Reliability ◽  
Interference Model ◽  
System Level ◽  
Maximum Order ◽  
Minimum Order ◽  
Analysis System

A reliability analysis method for the shiplift gear according to the system-level load-strength interference model is presented. The gear is regarded as a series system with dependent failure and multiple failure models. Its reliability is obtained by calculating the probability that the minimum order statistic of the strengths exceeds the maximum order statistic of repeated random loads. The load probability distribution of gear is then obtained using Monte Carlo on the basis of load information. The contact strength and bending strength are calculated. On the basis of system-level load-strength interference analysis, system reliability of a gear is straightforward built up. Finally, system reliability of a gear is worked out, which shows a high reliability.

ORDER STATISTIC FILTER (OSF): A NOVEL APPROACH TO DOCUMENT ANALYSIS

2002 ◽  
Vol 16 (05) ◽  
pp. 551-571 ◽  
Author(s):  
HONG MA ◽  
JIE ZHOU ◽  
LI MA ◽  
YUAN Y. TANG
Keyword(s):  
Order Statistic ◽  
Computing Time ◽  
Basic Research ◽  
Document Analysis ◽  
Research Subjects ◽  
Page Segmentation ◽  
Maximum Order ◽  
Hierarchical Method ◽  
Novel Approach ◽  
Segmentation Approach

Page segmentation is one of the important and basic research subjects of document analysis. There are two major kinds of page segmentation methods, i.e. hierarchical and no-hierarchical ones. Most traditional techniques such as top–down and bottom–up approaches belong to the hierarchical method. Though these two approaches have been used till now, they are not effective for processing documents with high geometric complexity and the process of splitting document needs iterative operations which is time consuming. A non-hierarchical method called the modified fractal signature (MFS) was presented in recent years. It can overcome the above weaknesses, however the MFS needs to calculate modified fractal signature which makes the theory very complex. In this thesis, we present a new page segmentation approach: Median Order Statistic Filter (MedOSF) — Maximum Order Statistic Filter (MaxOSF) approach which is more direct and much simpler. We use the MedOSF to remove the salt–pepper noise of the document and use the MaxOSF to do the page segmentation. In practice, they not only can adaptively process the documents with high geometrical complexity, but also save a lot of computing time.

scholarly journals Order Statistics of Additive Uniform Exponential Distribution

2021 ◽  
Vol 9 (10) ◽  
pp. 1084-1087
Author(s):  
Dr. Uppu Venkata Subbarao
Keyword(s):  
Order Statistics ◽  
Exponential Distribution ◽  
Order Statistic ◽  
Probability Density Functions ◽  
Joint Density ◽  
Density Functions ◽  
Length Of Service ◽  
Maximum Order ◽  
Minimum Order ◽  
Distribution Moments

Abstract: In this paper we investigated the order statistics by using Additive Uniform Exponential Distribution (AUED) proposed by Venkata Subbarao Uppu (2010).The probability density functions of rth order Statistics, lth moment of the rth order Statistic, minimum, maximum order statistics, mean of the maximum and minimum order statistics, the joint density function of two order statistics were calculated and discussed in detailed . Applications and several aspects were discussed Keywords: Additive Uniform Exponential Distribution, Moments, Minimum order statistic, Maximum order statistic, Joint density of the order Statistics, complete length of service.

A Note on the Accuracy of Normal Approximation of Random Quantities

2021 ◽  
Vol 73 (1) ◽  
pp. 62-67
Author(s):  
Ibrahim A. Ahmad ◽  
A. R. Mugdadi
Keyword(s):  
Sample Size ◽  
Order Statistic ◽  
Normal Approximation ◽  
Order Approximation ◽  
Random Variables ◽  
Random Variable ◽  
Limiting Distribution ◽  
Exact Order ◽  
Fixed Sample ◽  
Independent Identically Distributed

For a sequence of independent, identically distributed random variable (iid rv's) [Formula: see text] and a sequence of integer-valued random variables [Formula: see text], define the random quantiles as [Formula: see text], where [Formula: see text] denote the largest integer less than or equal to [Formula: see text], and [Formula: see text] the [Formula: see text]th order statistic in a sample [Formula: see text] and [Formula: see text]. In this note, the limiting distribution and its exact order approximation are obtained for [Formula: see text]. The limiting distribution result we obtain extends the work of several including Wretman[Formula: see text]. The exact order of normal approximation generalizes the fixed sample size results of Reiss[Formula: see text]. AMS 2000 subject classification: 60F12; 60F05; 62G30.

scholarly journals Residual dimension of nilpotent groups

2020 ◽  
Vol 23 (5) ◽  
pp. 801-829
Author(s):  
Mark Pengitore
Keyword(s):  
New York ◽  
Nilpotent Group ◽  
Nilpotent Groups ◽  
Finitely Generated ◽  
Nontrivial Element ◽  
Maximum Order ◽  
Asymptotic Bounds ◽  
Group Morphism ◽  
A Finite Group

AbstractThe function {\mathrm{F}_{G}(n)} gives the maximum order of a finite group needed to distinguish a nontrivial element of G from the identity with a surjective group morphism as one varies over nontrivial elements of word length at most n. In previous work [M. Pengitore, Effective separability of finitely generated nilpotent groups, New York J. Math. 24 2018, 83–145], the author claimed a characterization for {\mathrm{F}_{N}(n)} when N is a finitely generated nilpotent group. However, a counterexample to the above claim was communicated to the author, and consequently, the statement of the asymptotic characterization of {\mathrm{F}_{N}(n)} is incorrect. In this article, we introduce new tools to provide lower asymptotic bounds for {\mathrm{F}_{N}(n)} when N is a finitely generated nilpotent group. Moreover, we introduce a class of finitely generated nilpotent groups for which the upper bound of the above article can be improved. Finally, we construct a class of finitely generated nilpotent groups N for which the asymptotic behavior of {\mathrm{F}_{N}(n)} can be fully characterized.

Sign in / Sign up

Export Citation Format

Share Document