Michael L. Ulrey

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

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

Theory of computation · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 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.

Theoretical computer science
2 papers
Coding theory · 70% Information theory · 30%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory
channel coding
0.011976
Sequential Coding for Channels with Feedback · Inf. Control. 1976
Coding theory › channel coding › feedback communication
feedback coding
0.011976
Sequential Coding for Channels with Feedback · Inf. Control. 1976
Coding theory › source coding
sequential coding
0.011976
Sequential Coding for Channels with Feedback · Inf. Control. 1976
Coding theory
source coding
0.011976
Sequential Coding for Channels with Feedback · Inf. Control. 1976
Physical-layer communications
channel coding
0.011975
The Capacity Region of a Channel with s Senders and r Receivers · Inf. Control. 1975
Information theory › channel capacity
capacity region
0.011975
The Capacity Region of a Channel with s Senders and r Receivers · Inf. Control. 1975
Information theory
network information theory
0.011975
The Capacity Region of a Channel with s Senders and r Receivers · Inf. Control. 1975

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

information-theoretic capacity analysis · 0.0sequential coding · 0.0feedback · 0.0
YearPublicationVenuePosition
2003 Formulas for the distribution of sums of independent exponential random variables
abstract
This paper derives a new type of formula for the probability that, among a collection of items with s-independent exponential times to failure, a certain subset of them fails in a given order before a certain time, and all the remaining items survive beyond that time. This formula is in the form of a power series that satisfies a certain constant coefficient linear differential equation with specified initial conditions. This provides an alternative to existing closed-form formulas of the "exponomial" variety, viz., a nonlinear combination of exponential terms, where the coefficients of the exponential terms are polynomials in the mission time. Some results are given which quantify the computation effort required to achieve a specified accuracy using partial sums of the infinite series; a simple example illustrates these results. This approach can be very efficient for system reliability analysis where the product of the mission time and the sum of the failure rates down any path leading to system failure is small. Further work is needed to expand the practical applicability of this approach to cases where some rates are large and/or the mission time is long.
Michael L. Ulrey
IEEE Trans. Reliab.1
1976 Sequential Coding for Channels with Feedback
Michael L. Ulrey
Inf. Control.1
1975 The Capacity Region of a Channel with s Senders and r Receivers
Michael L. Ulrey
Inf. Control.1