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

J. E. Storer

dblp:133/7992 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1956
—ORCID · none

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

Theory of computation · 1

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
1 paper
Algorithms and data structures · 56% Information theory · 44%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › randomized algorithms › sampling › random variate generation
gaussian sampling
0.011956
Generating a Gaussian sample · IRE Trans. Inf. Theory 1956
Information theory › probability theory › stochastic processes › numerical methods for stochastic processes
stochastic process simulation
0.011956
Generating a Gaussian sample · IRE Trans. Inf. Theory 1956
Algorithms and data structures › randomized algorithms
monte carlo methods
0.011956
Generating a Gaussian sample · IRE Trans. Inf. Theory 1956

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

monte carlo simulation · 0.0eigenvalue decomposition · 0.0autocorrelation function · 0.0
YearPublicationVenuePosition
1956 Generating a Gaussian sample
abstract
The general theoretical difficulties in analyzing the effect of a random input signal on a known system are pointed out. Basically, if certain output statistics are computed directly, each statistic represents a complete, separate problem. An alternative analytical computational procedure is suggested, using a Monte Carlo type technique in which the output is obtained by numerical integration from sequences of values which represent members of the statistical ensemble of the input process. For such applications, or for other possible uses such as in testing, it is necessary to generate statistical sequences, analogous to tables of random numbers. Techniques are discussed for analytically generating such sequences, to correspond to gaussian probability distributions which are further characterized by arbitrarily specified power spectra or autocorrelation functions. The procedure makes use of the standard tables of random numbers, these numbers being distributed uniformly and without correlation. The exact statistical generation ofNvalues of a sequence is shown to require, in general, the diagonalization (or solution for the eigenvalues and eigenvectors) of anNth order matrix; two simpler approximate procedures are also described.
Seymour Stein, J. E. Storer
IRE Trans. Inf. Theory2