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.

Jane E. Perkins

dblp:75/5233 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1997
—ORCID · none

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

Theory of computation · 2Graphics, computer vision, multimedia, augmented reality and games · 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
1 paper
Combinatorics and discrete mathematics · 67% Coding theory · 33%

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

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics › number theory
continued fractions
0.011996
Number/theoretic solutions to intercept time problems · IEEE Trans. Inf. Theory 1996
Coding theory
diophantine approximation
0.011996
Number/theoretic solutions to intercept time problems · IEEE Trans. Inf. Theory 1996
Combinatorics and discrete mathematics
number theory
0.011996
Number/theoretic solutions to intercept time problems · IEEE Trans. Inf. Theory 1996

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

farey sequence · 0.0continued fraction expansion · 0.0
YearPublicationVenuePosition
1997 Errata in 'Number theoretic solutions to intercept time problems' [May 96 959-971]
abstract
Prospective authors are requested to submit new, unpublished manuscripts for inclusion in the upcoming event described in this call for papers.
I. Vaughan L. Clarkson, Jane E. Perkins, Iven M. Y. Mareels
IEEE Trans. Inf. Theory2
1996 Number/theoretic solutions to intercept time problems
abstract
A good radar warning receiver should observe a radar very soon after it begins transmitting, so in designing our radar warning receiver we would like to ensure that the intercept time is low or the probability of intercept after a specified time is high. We consider a number of problems concerning the overlaps or coincidences of two periodic pulse trains. We show that the first intercept time of two pulse trains started in phase is a homogeneous Diophantine approximation problem which can be solved using the convergents of the simple continued fraction (s.c.f.) expansion of the ratio of their pulse repetition intervals (PRIs). We find that the intercept time for arbitrary starting phases is an inhomogeneous Diophantine approximation problem which can be solved in a similar manner. We give a recurrence equation to determine the times at which subsequent coincidences occur. We then demonstrate how the convergents of the s.c.f. expansion can be used to determine the probability of intercept of the two pulse trains after a specified time when one or both of the initial phases are random. Finally, we discuss how the probability of intercept varies as a function of the PRIs and its dependence on the Farey points.
I. Vaughan L. Clarkson, Jane E. Perkins, Iven M. Y. Mareels
IEEE Trans. Inf. Theory2
1994 Pulse train deinterleaving via the Hough transform
abstract
The nonlinear problem of pulse train deinterleaving is mapped into that of line detection in a plane. The image processing technique known as the Hough transform is then applied. The problem is now one of peak detection and the selection of a threshold is examined.>
Jane E. Perkins, Ian Coat
ICASSP (3)1