Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

John T. Barnett

dblp:13/592 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Information theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › probability theory
stochastic processes
0.021998
Zero-Crossing Rates of Mixtures and Products of Gaussian Processes · IEEE Trans. Inf. Theory 1998
Zero-crossing rates of functions of Gaussian processes · IEEE Trans. Inf. Theory 1991
Information theory › signal processing › signal analysis
zero-crossing rate
0.021998
Zero-Crossing Rates of Mixtures and Products of Gaussian Processes · IEEE Trans. Inf. Theory 1998
Zero-crossing rates of functions of Gaussian processes · IEEE Trans. Inf. Theory 1991
Information theory › probability theory › stochastic processes
gaussian processes
0.021998
Zero-Crossing Rates of Mixtures and Products of Gaussian Processes · IEEE Trans. Inf. Theory 1998
Zero-crossing rates of functions of Gaussian processes · IEEE Trans. Inf. Theory 1991

Methods — techniques the papers use, named apart from their topics

rice's formula · 0.0discrete-time limiting argument · 0.0price's theorem · 0.0chain rule · 0.0
YearPublicationVenuePosition
1998 Zero-Crossing Rates of Mixtures and Products of Gaussian Processes
abstract
Formulas for the expected zero-crossing rate of non-Gaussian mixtures and products of Gaussian processes are obtained. The approach we take is to first derive the expected zero-crossing rate in discrete time and then obtain the rate in continuous time by an appropriate limiting argument. The processes considered, which are non-Gaussian but derived from Gaussian processes, serve to illustrate the variability of the zero-crossing rate in terms of the normalized autocorrelation function p(t) of the process. For Gaussian processes, Rice's formula gives the expected zero-crossing rate in continuous time as 1//spl pi//spl radic/(-/spl rho/"(0)). We show processes exist with expected zero-crossing rates given by /spl kappa///spl pi//spl radic/(-/spl rho/"(0)) with either /spl kappa//spl Gt/1 or /spl kappa//spl Lt/1. Consequently, such processes can have an arbitrarily large or small zero-crossing rate as compared to a Gaussian process with the same autocorrelation function.
John T. Barnett, Benjamin Kedem
IEEE Trans. Inf. Theory1
1992 Authors' Reply to Comments on 'Zero-crossing rates of functions of Gaussian processes'
John T. Barnett, Benjamin Kedem
IEEE Trans. Inf. Theory1
1991 Zero-crossing rates of functions of Gaussian processes
abstract
Formulas for the expected zero-crossing rates of random processes that are monotone transformations of Gaussian processes can be obtained by using two different techniques. The first technique involves derivation of the expected zero-crossing rate for discrete-time processes and extends the result of the continuous-time case by using an appropriate limiting argument. The second is a direct method that makes successive use of R. Price's (1958) theorem, the chain rule for derivatives, and S.O. Rice's (1954) formula for the expected zero-crossing rate of a Gaussian process. A constant, which depends on the variance of the transformed process and a second-moment of its derivative, is derived. Multiplying Rice's original expression by this constant yields the zero-crossing formula for the transformed process. The two methods can be used for the general level-crossing problem of random processes that are monotone functions of a Gaussian process.>
John T. Barnett, Benjamin Kedem
IEEE Trans. Inf. Theory1