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

Hassan N. El-Ghoroury

dblp:134/5792 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1972
—ORCID · none

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

Systems, architecture and hardware · 2 · 2 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
2 papers
Emerging computing paradigms · 100%
Theoretical computer science
2 papers
Automata and formal languages · 100%

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

TopicWeightPapersLastEvidence papers
Emerging computing paradigms › approximate and stochastic computing
stochastic computing
0.021972
Additive Bernoulli Noise Linear Sequential Circuits · IEEE Trans. Computers 1972
Realization of Stochastic Automata · IEEE Trans. Computers 1971
Automata and formal languages › finite automata › sequential machines
linear sequential circuits
0.011972
Additive Bernoulli Noise Linear Sequential Circuits · IEEE Trans. Computers 1972
Automata and formal languages
probabilistic automata
0.011971
Realization of Stochastic Automata · IEEE Trans. Computers 1971

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

state transition matrix analysis · 0.0bernoulli noise · 0.0random binary variables · 0.0convex combination · 0.0
YearPublicationVenuePosition
1972 Additive Bernoulli Noise Linear Sequential Circuits
abstract
In the search for new methods to realize stochastic automata, additive Bernoulli noise linear sequential circuits (ABNLSC) are constructed from linear sequential circuits fed with Bernoulli noise. The characteristics of the subclass of stochastic automata realizable by ABNLSC's are found. These characteristics include: commutativity with respect to input sequences; state minimality; doubly stochastic state transition matrices; and the conditions for the existence of asymptotic distribution of the state.
Hassan N. El-Ghoroury, Someshwar C. Gupta
IEEE Trans. Computers1
1971 Realization of Stochastic Automata
abstract
Using the convex combination of random binary variables, stochastic vectors and stochastic matrices are systematically realized. The techniques are extended to the realization of stochastic automata as randomly fed deterministic automata.
Hassan N. El-Ghoroury, Someshwar C. Gupta
IEEE Trans. Computers1