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

Michael B. Marcus

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

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

Theory of computation · 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.

Theoretical computer science
2 papers
Information theory · 100%
Computer networks
1 paper
Wireless sensing and localization · 67% Physical-layer communications · 33%

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

TopicWeightPapersLastEvidence papers
Information theory › hypothesis testing
sequential hypothesis testing
0.011967
Truncated sequential hypothesis tests · IEEE Trans. Inf. Theory 1967
Information theory › statistical inference
statistical decision theory
0.011967
Truncated sequential hypothesis tests · IEEE Trans. Inf. Theory 1967
Wireless sensing and localization
radar signal processing
0.011962
Sequential detection in radar with multiple resolution elements · IRE Trans. Inf. Theory 1962
Physical-layer communications › signal detection › hypothesis testing
sequential detection
0.011962
Sequential detection in radar with multiple resolution elements · IRE Trans. Inf. Theory 1962
Wireless sensing and localization › radar signal processing
target detection
0.011962
Sequential detection in radar with multiple resolution elements · IRE Trans. Inf. Theory 1962
Information theory › probability theory › stochastic processes › markov processes
bernoulli sequence
0.011959
Recurrent events in a Bernoulli sequence · IRE Trans. Inf. Theory 1959
Information theory › probability theory
stochastic processes
0.011959
Recurrent events in a Bernoulli sequence · IRE Trans. Inf. Theory 1959

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

simulation · 0.0sequential analysis · 0.0point of regeneration method · 0.0generating functions · 0.0boundary analysis · 0.0approximation method · 0.0
YearPublicationVenuePosition
1967 Truncated sequential hypothesis tests
abstract
Through a careful examination of the equations by which Wald determines the values of the boundaries for tests of sequential hypotheses, we are able to obtain interesting relationships for the conditional probability distributions of the stage at which the test terminates. These enable us to study sequential tests in which the boundaries are functions of the sample number. We are particularly concerned with tests with convergent boundaries, and investigate a set of boundaries which approach those of a truncated Wald test. Approximate expressions for the expected sample number and probabilities of error are obtained for the tests considered. The obtained approximations apply best for gently tapering slopes. Extensions of our method can be applied to evaluate various ad hoc schemes for truncating tests and to the theory of tests with a varying parameter.
Julian J. Bussgang, Michael B. Marcus
IEEE Trans. Inf. Theory2
1962 Sequential detection in radar with multiple resolution elements
abstract
In this paper the techniques of sequential analysis are applied to a multiple-resolution-element search radar for different types of detection. By using sequential methods such a radar shows considerable saving compared to fixed-scan-rate detection radars. Many of the problems occurring in sequential radar detection are examined; the difficulties of obtaining analytical results for multiple-resolution-element sequential radars are discussed. Most of the results of this paper were obtained by simulation. Included are interesting results which suggest that truncation is not necessary for the tests which were considered. Curves are given describing the improvement obtained by sequential detection procedures. The curves are discussed in detail to make this paper useful to those whose primary interest is in the results which are obtained.
Michael B. Marcus, Peter Swerling
IRE Trans. Inf. Theory1
1959 Recurrent events in a Bernoulli sequence
abstract
The "point of regeneration" method is used to obtain simple sequential equations for determining the complete probability density function for multiple occurrences of events in a Bernoulli sequence. Both the independent and overlapping classes of recurrent events are included in the general framework of these equations. The equations also lead to the generating function for the probability distribution. This is used to obtain the expected recurrence times for the different classes of recurrent events. A distinction is made between the probability distributions for the occurrence of thekth event at thenth trial and the occurrence ofkevents inntrials. The latter case is of primary concern. The methods employed and the results obtained have extensive applications in problems in automatic control, communications, and information processing.
Michael B. Marcus
IRE Trans. Inf. Theory1