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

Nicholas DeClaris

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

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

Computer networks · 1Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

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
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › signal processing › time-frequency analysis
ambiguity function
0.011966
Linear transformations of the ambiguity function · IEEE Trans. Inf. Theory 1966
Information theory › signal processing › radar signal processing
radar waveform design
0.011966
Linear transformations of the ambiguity function · IEEE Trans. Inf. Theory 1966
Information theory
signal processing
0.011966
Linear transformations of the ambiguity function · IEEE Trans. Inf. Theory 1966

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

linear transformation · 0.0
YearPublicationVenuePosition
2005 Utilizing Domain Knowledge in Developing Robust Neural Network Models for Peptide-Allele Binding Prediction
Vasileios Megalooikonomou, Despina Kontos, Nicholas DeClaris, Pedro Cano
CIBCB3
1973 Synthesis of modulation insensitive N-path filters
abstract
Abstract Through the intermediary of state‐variable equations, realization of an N‐path filter from a prescribed transfer function is obtained. An equivalence is found which shows how passive RC circuits incorporating time‐variable gyrators can be used to realize N‐path filters. It is also proved possible to realize any stable transfer function as an N‐path filter structure and that the system is insensitive to the frequency of the multiplying signals or the frequency of the gyration conductance. „Listen again to this. I have seen moonlight Sometimes the statues leaning over like reeds In the middle of living fruit, – the statues”︁[1,p. 95].
S. Chang, Nicholas DeClaris, Robert W. Newcomb
Networks2
1966 Linear transformations of the ambiguity function
abstract
The radar ambiguity function is useful as a criterion of goodness for modulation signals used to discriminate the range and range-rate of point targets. It is often desirable to change existing ambiguity functions to meet new specifications of resolvability. One way of accomplishing this task is by using linear transformations of the ambiguity function. A review of the properties of ambiguity functions pertinent to the paper is included. Sufficient conditions for linear transformations to result in new ambiguity functions are presented in several forms. Then, necessary and sufficient conditions for kernels of the linear transformations to correspond to linear signal transformations are derived.
Edward L. Titlebaum, Nicholas DeClaris
IEEE Trans. Inf. Theory2