Traffic noise as a filtered Markov renewal process

1973 ◽  
Vol 10 (2) ◽  
pp. 377-386 ◽  
Author(s):  
Allan H. Marcus
Keyword(s):  
Renewal Process ◽  
Noise Level ◽  
Traffic Noise ◽  
Engineering Practice ◽  
Markov Renewal Process ◽  
Noise Emission ◽  
Mean And Variance ◽  
Explicit Formulae ◽  
The Mean ◽  
Modest Degree

Traffic noise depends significantly on statistical properties of highway flow. The noise heard by an off-highway observer is the sum of the contributions of all the vehicles on the highway. We assume that vehicle spacings on a single-lane infinite straight road form a Markov renewal process (MRP) with N states or vehicle types. The noise impact is then a two-sided filtered MRP. We give explicit formulae for the mean and variance in the case N = 2 and exponential headways. Jewell's (1965) study (cars vs. trucks in the southbound curb lane of U.S. 40) gives parameters of the MPR for a numerical example. Even with only a modest degree of truck clustering and variability in vehicle spacings and noise emission, the variation in noise level is much greater than usually predicted. The coefficient of variation of arithmetic noise intensity is greater than unity at distances from the roadway less than 700 feet. The logarithmic noise level parameters L50 and L10 usually computed in engineering practice may be in error by 2 to 3 decibels if these sources of variability are ignored.

Traffic noise as a filtered Markov renewal process

1973 ◽  
Vol 10 (02) ◽  
pp. 377-386 ◽  
Author(s):  
Allan H. Marcus
Keyword(s):  
Renewal Process ◽  
Noise Level ◽  
Traffic Noise ◽  
Engineering Practice ◽  
Markov Renewal Process ◽  
Noise Emission ◽  
Mean And Variance ◽  
Explicit Formulae ◽  
The Mean ◽  
Modest Degree

Traffic noise depends significantly on statistical properties of highway flow. The noise heard by an off-highway observer is the sum of the contributions of all the vehicles on the highway. We assume that vehicle spacings on a single-lane infinite straight road form a Markov renewal process (MRP) with N states or vehicle types. The noise impact is then a two-sided filtered MRP. We give explicit formulae for the mean and variance in the case N = 2 and exponential headways. Jewell's (1965) study (cars vs. trucks in the southbound curb lane of U.S. 40) gives parameters of the MPR for a numerical example. Even with only a modest degree of truck clustering and variability in vehicle spacings and noise emission, the variation in noise level is much greater than usually predicted. The coefficient of variation of arithmetic noise intensity is greater than unity at distances from the roadway less than 700 feet. The logarithmic noise level parameters L 50 and L 10 usually computed in engineering practice may be in error by 2 to 3 decibels if these sources of variability are ignored.

STATISTICAL INFERENCE FOR K INDEPENDENT, HOMOGENEOUS ARITHMETIC PROCESSES

2000 ◽  
Vol 07 (03) ◽  
pp. 223-236 ◽  
Author(s):  
FRANCIS KIT-NAM LEUNG
Keyword(s):  
Stochastic Process ◽  
Linear Regression ◽  
Renewal Process ◽  
Random Variable ◽  
Simple Linear Regression ◽  
Variable Formula ◽  
Mean And Variance ◽  
The Mean ◽  
Time Continuum ◽  
Area Of Application

For k=1,…, K, a stochastic process {An,k, n =1, 2,…} is an arithmetic process (AP) if there exists some real number, d, so that {An,k +(n-1)d, n =1, 2,…} is a renewal process (RP). AP is a stochastically monotonic process and can be used to model a point process, i.e., point events occurring in a haphazard way in time (or space), especially with a trend. For example, the events may be failures arising from a deteriorating machine; and such a series of failures is distributed haphazardly along a time continuum. In this paper, we discuss estimation procedures for K independent, homogeneous APs. Two statistics are suggested for testing whether K given processes come from a common AP. If this is so, we can estimate the parameters d, [Formula: see text] and [Formula: see text] of the AP based on the techniques of simple linear regression, where [Formula: see text] and [Formula: see text] are the mean and variance of the first average random variable [Formula: see text], respectively. In this paper, the procedures are, for the most part, discussed in reliability terminology. Of course, the methods are valid in any area of application, in which case they should be interpreted accordingly.

An infinite variance solidarity theorem for Markov renewal functions

1996 ◽  
Vol 33 (2) ◽  
pp. 434-438 ◽  
Author(s):  
M. S. Sgibnev
Keyword(s):  
Renewal Process ◽  
Expected Value ◽  
Infinite Variance ◽  
Markov Renewal Process ◽  
Initial Moment ◽  
Recurrence Times ◽  
The Mean

Let , be a recurrent Markov renewal process and Mik(t) be the expected value of Nk(t) provided that at the initial moment the system is in state i. It is shown that when the mean recurrence times μ ii are finite, the differences μ ij Mki (t) – t behave asymptotically the same for all states i and k.

An infinite variance solidarity theorem for Markov renewal functions

1996 ◽  
Vol 33 (02) ◽  
pp. 434-438 ◽  
Author(s):  
M. S. Sgibnev
Keyword(s):  
Renewal Process ◽  
Expected Value ◽  
Infinite Variance ◽  
Markov Renewal Process ◽  
Initial Moment ◽  
Recurrence Times ◽  
The Mean

Let , be a recurrent Markov renewal process and Mik (t) be the expected value of Nk (t) provided that at the initial moment the system is in state i. It is shown that when the mean recurrence times μ ii are finite, the differences μ ij Mki (t) – t behave asymptotically the same for all states i and k.

MR/GI/1 queues by positively correlated arrival stream

1994 ◽  
Vol 31 (02) ◽  
pp. 497-514
Author(s):  
R. Szekli ◽  
R. L. Disney ◽  
S. Hur
Keyword(s):  
Renewal Process ◽  
Point Processes ◽  
Waiting Times ◽  
Jump Process ◽  
Arrival Process ◽  
Markov Renewal Process ◽  
Stochastic Comparison ◽  
Single Server ◽  
Comparison Results ◽  
The Mean

The effects of dependencies (such as association) in the arrival process to a single server queue on mean queue lengths and mean waiting times are studied. Markov renewal arrival processes with a particular transition matrix for the underlying Markov chain are used which allow us to change dependency properties without at the same time changing distributional conditions. It turns out that correlations do not seem to be pure effects, and three main factors are studied: (a) differences in the mean interarrival times in the underlying Markov renewal process, (b) intensity in the Markov renewal jump process, (c) variability in the point processes underlying the Markov renewal process. It is shown that the mean queue length can be made arbitrarily large in the class of queues with the same interarrival distributions and the same service time distributions (with fixed smaller than one traffic intensity), by making (a) large enough and (b) small enough. The existence of the moments of interest is confirmed and some stochastic comparison results for actual waiting times are shown.

MR/GI/1 queues by positively correlated arrival stream

1994 ◽  
Vol 31 (2) ◽  
pp. 497-514 ◽  
Author(s):  
R. Szekli ◽  
R. L. Disney ◽  
S. Hur
Keyword(s):  
Renewal Process ◽  
Point Processes ◽  
Waiting Times ◽  
Jump Process ◽  
Arrival Process ◽  
Markov Renewal Process ◽  
Stochastic Comparison ◽  
Single Server ◽  
Comparison Results ◽  
The Mean

The effects of dependencies (such as association) in the arrival process to a single server queue on mean queue lengths and mean waiting times are studied. Markov renewal arrival processes with a particular transition matrix for the underlying Markov chain are used which allow us to change dependency properties without at the same time changing distributional conditions. It turns out that correlations do not seem to be pure effects, and three main factors are studied: (a) differences in the mean interarrival times in the underlying Markov renewal process, (b) intensity in the Markov renewal jump process, (c) variability in the point processes underlying the Markov renewal process. It is shown that the mean queue length can be made arbitrarily large in the class of queues with the same interarrival distributions and the same service time distributions (with fixed smaller than one traffic intensity), by making (a) large enough and (b) small enough. The existence of the moments of interest is confirmed and some stochastic comparison results for actual waiting times are shown.

scholarly journals Weighted statistical binary patterns for facial feature representation

2021 ◽  
Author(s):  
Hung Phuoc Truong ◽  
Thanh Phuong Nguyen ◽  
Yong-Guk Kim
Keyword(s):  
Comprehensive Evaluation ◽  
Facial Feature ◽  
Input Image ◽  
Feature Representation ◽  
Illumination Variation ◽  
Straight Line ◽  
Mean And Variance ◽  
The Mean ◽  
Face Datasets ◽  
Degraded Images

AbstractWe present a novel framework for efficient and robust facial feature representation based upon Local Binary Pattern (LBP), called Weighted Statistical Binary Pattern, wherein the descriptors utilize the straight-line topology along with different directions. The input image is initially divided into mean and variance moments. A new variance moment, which contains distinctive facial features, is prepared by extracting root k-th. Then, when Sign and Magnitude components along four different directions using the mean moment are constructed, a weighting approach according to the new variance is applied to each component. Finally, the weighted histograms of Sign and Magnitude components are concatenated to build a novel histogram of Complementary LBP along with different directions. A comprehensive evaluation using six public face datasets suggests that the present framework outperforms the state-of-the-art methods and achieves 98.51% for ORL, 98.72% for YALE, 98.83% for Caltech, 99.52% for AR, 94.78% for FERET, and 99.07% for KDEF in terms of accuracy, respectively. The influence of color spaces and the issue of degraded images are also analyzed with our descriptors. Such a result with theoretical underpinning confirms that our descriptors are robust against noise, illumination variation, diverse facial expressions, and head poses.

scholarly journals Groups and Individuals: Optical Flow Patterns of Broiler Chicken Flocks Are Correlated with the Behavior of Individual Birds

Animals ◽  
2021 ◽  
Vol 11 (2) ◽  
pp. 568
Author(s):  
Sabine G. Gebhardt-Henrich ◽  
Ariane Stratmann ◽  
Marian Stamp Dawkins
Keyword(s):  
Optical Flow ◽  
Broiler Chicken ◽  
Average Length ◽  
Flow Patterns ◽  
Group Level ◽  
Positive Correlation ◽  
Water Test ◽  
Mean And Variance ◽  
The Mean

Group level measures of welfare flocks have been criticized on the grounds that they give only average measures and overlook the welfare of individual animals. However, we here show that the group-level optical flow patterns made by broiler flocks can be used to deliver information not just about the flock averages but also about the proportion of individuals in different movement categories. Mean optical flow provides information about the average movement of the whole flock while the variance, skew and kurtosis quantify the variation between individuals. We correlated flock optical flow patterns with the behavior and welfare of a sample of 16 birds per flock in two runway tests and a water (latency-to-lie) test. In the runway tests, there was a positive correlation between the average time taken to complete the runway and the skew and kurtosis of optical flow on day 28 of flock life (on average slow individuals came from flocks with a high skew and kurtosis). In the water test, there was a positive correlation between the average length of time the birds remained standing and the mean and variance of flock optical flow (on average, the most mobile individuals came from flocks with the highest mean). Patterns at the flock level thus contain valuable information about the activity of different proportions of the individuals within a flock.

scholarly journals Noise in Otolaryngology – Head and Neck Surgery operating rooms: a systematic review

2021 ◽  
Vol 50 (1) ◽  
Author(s):  
Gianluca Sampieri ◽  
Amirpouyan Namavarian ◽  
Marc Levin ◽  
Justine Philteos ◽  
Jong Wook Lee ◽  
...  
Keyword(s):  
Systematic Review ◽  
Head And Neck ◽  
Patient Outcomes ◽  
Noise Level ◽  
Neck Surgery ◽  
Operating Rooms ◽  
Head And Neck Surgery ◽  
Noise Levels ◽  
Surgical Performance ◽  
The Mean

Abstract Objective Noise in operating rooms (OR) can have negative effects on both patients and surgical care workers. Noise can also impact surgical performance, team communication, and patient outcomes. Such implications of noise have been studied in orthopedics, neurosurgery, and urology. High noise levels have also been demonstrated in Otolaryngology-Head and Neck Surgery (OHNS) procedures. Despite this, no previous study has amalgamated the data on noise across all OHNS ORs to determine how much noise is present during OHNS surgeries. This study aims to review all the literature on noise associated with OHNS ORs and procedures. Methods Ovid Medline, EMBASE Classic, Pubmed, SCOPUS and Cochrane databases were searched following PRISMA guidelines. Data was collected on noise measurement location and surgery type. Descriptive results and statistical analysis were completed using Stata. Results This search identified 2914 articles. Final inclusion consisted of 22 studies. The majority of articles analyzed noise level exposures during mastoid surgery (18/22, 82%). The maximum noise level across all OHNS ORs and OHNS cadaver studies were 95.5 a-weighted decibels (dBA) and 106.6 c-weighted decibels (dBC), respectively (P = 0.2068). The mean noise level across all studies was significantly higher in OHNS cadaver labs (96.9 dBA) compared to OHNS ORs (70.1 dBA) (P = 0.0038). When analyzed together, the mean noise levels were 84.9 dBA. Conclusions This systematic review demonstrates that noise exposure in OHNS surgery exceeds safety thresholds. Further research is needed to understand how noise may affect team communication, surgical performance and patient outcomes in OHNS ORs. Graphical abstract

Sign in / Sign up

Export Citation Format

Share Document