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

Emmett P. O'Grady

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

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

Systems, architecture and hardware · 1 · 1 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › simulation › analog and hybrid computer simulation
analog computer simulation
0.011967
Correlation Method for Computing Sensitivity Functions on a High-Speed Iterative Analog Computer · IEEE Trans. Electron. Comput. 1967
Performance modeling and evaluation › statistical analysis
sensitivity analysis
0.011967
Correlation Method for Computing Sensitivity Functions on a High-Speed Iterative Analog Computer · IEEE Trans. Electron. Comput. 1967
Performance modeling and evaluation
simulation
0.011967
Correlation Method for Computing Sensitivity Functions on a High-Speed Iterative Analog Computer · IEEE Trans. Electron. Comput. 1967

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

perturbation analysis · 0.0correlation with orthogonal binary sequences · 0.0
YearPublicationVenuePosition
1967 Correlation Method for Computing Sensitivity Functions on a High-Speed Iterative Analog Computer
abstract
During successive high-speed iterative-analog-computer runs, the parameters a1, a2, . . ., amof a simulated dynamical system are perturbed by mutually orthogonal binary sequences of perturbations Δai= ±Δa. Each parameter perturbation remains constant during a full 1-ms analog-computer run. Simple correlation of the perturbed solution-sample sequences x(tk)+Δx(tk) with each parameter-perturbation sequence simultaneously produces approximations Δx(tk)/Δaito all the system sensitivity coefficients ∂x(t)/∂aias the sampling time tkis automatically stepped. Note that correlation with binary variables requires no multipliers. The new technique is compared to the conventional method requiring separate sensitivity-equation setups for each sensitivity coefficient, and a simple example is presented.
Emmett P. O'Grady
IEEE Trans. Electron. Comput.1