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

Edgar DuCasse

dblp:59/5878 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1980
—ORCID · none

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

Systems, architecture and hardware · 3 · 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
1 paper
Hardware reliability and fault tolerance · 100%
Theoretical computer science
2 papers
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Logic in computer science › many-valued logic
multivalued switching algebra
0.021976
Rebuttal to the Authors' Reply to our Comments on "The Relationship Between Multivalued Switching Algebra and Boolean Algebra Under Different Definitions of Complement." · IEEE Trans. Computers 1976
Comments on "The Relationship Between Multivalued Switching Algebra and Boolean Algebra under Different Definitions of Complement" · IEEE Trans. Computers 1975
Hardware reliability and fault tolerance
fault-tolerant design
0.011980
A Hardware Redundancy Reconfiguration Scheme for Tolerating Multiple Module Failures · IEEE Trans. Computers 1980
Hardware reliability and fault tolerance › redundancy
modular redundancy
0.011980
A Hardware Redundancy Reconfiguration Scheme for Tolerating Multiple Module Failures · IEEE Trans. Computers 1980
Logic in computer science
many-valued logic
0.011975
Comments on "The Relationship Between Multivalued Switching Algebra and Boolean Algebra under Different Definitions of Complement" · IEEE Trans. Computers 1975
Hardware reliability and fault tolerance
majority voting
0.011980
A Hardware Redundancy Reconfiguration Scheme for Tolerating Multiple Module Failures · IEEE Trans. Computers 1980
Logic in computer science › algebraic logic
boolean algebra
0.021976
Rebuttal to the Authors' Reply to our Comments on "The Relationship Between Multivalued Switching Algebra and Boolean Algebra Under Different Definitions of Complement." · IEEE Trans. Computers 1976
Comments on "The Relationship Between Multivalued Switching Algebra and Boolean Algebra under Different Definitions of Complement" · IEEE Trans. Computers 1975

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

TMR · 0.05MR reconfiguration · 0.0rebuttal · 0.0max and min functions · 0.0
YearPublicationVenuePosition
1980 A Hardware Redundancy Reconfiguration Scheme for Tolerating Multiple Module Failures
abstract
This paper deals with a method for designing a digital system which will remain operational in spite of the failure of some of its components. A scheme and its realization are presented for automatically reconfiguring a 5MR (five modular redundancy system or 5-input majority voting system) into a triple modular redundancy (TMR) system under a single or double module failures. The scheme can tolerate a double fault followed by a single fault which can neither be tolerated by a 5MR nor by a hybrid redundancy system with a TMR core. It uses no spare units and the circuit realization is relatively simple. The modular structure of the logic design for the proposed scheme should make the testing of the system easier. The scheme can be used in both binary and multivalued systems.
Stephen Y. H. Su, Edgar DuCasse
IEEE Trans. Computers2
1976 Rebuttal to the Authors' Reply to our Comments on "The Relationship Between Multivalued Switching Algebra and Boolean Algebra Under Different Definitions of Complement."
Edgar DuCasse, Gernot Metze
IEEE Trans. Computers1
1975 Comments on "The Relationship Between Multivalued Switching Algebra and Boolean Algebra under Different Definitions of Complement"
abstract
These comments point out first that the difficulties encountered in a recent paper1in applying the theorems of Boolean algebra to a multivalued system using max and min functions are not due to the type of complement that is chosen, but due to the attempt to deqne a multivalued Boolean algebra using the max and min functions which are not Boolean functions except in the 2-valued case; and second, that the three types of complement defined are well known in the context of multivalued non-Boolean algebras.
Edgar DuCasse, Gernot Metze
IEEE Trans. Computers1