MétaCan
Menu
Back to cohort

Algorithms for matrix extension and orthogonal wavelet filter banks over algebraic number fields

2012· article· en· W1996637148 on OpenAlexafffund
Bin Han, Xiaosheng Zhuang

Bibliographic record

VenueMathematics of Computation · 2012
Typearticle
Languageen
FieldMathematics
TopicMathematical Analysis and Transform Methods
Canadian institutionsUniversity of Alberta
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMathematicsAlgebraic extensionAlgebraic numberWaveletOrthogonal matrixField (mathematics)Algebraic number fieldMatrix (chemical analysis)Algebra over a fieldFilter (signal processing)Rational numberDiscrete mathematicsAlgorithmPure mathematicsMathematical analysisComputer scienceOrthogonal basis

Abstract

fetched live from OpenAlex

As a finite dimensional linear space over the rational number field Q \mathbb {Q} , an algebraic number field is of particular importance and interest in mathematics and engineering. Algorithms using algebraic number fields can be efficiently implemented involving only integer arithmetics. We observe that all known finitely supported orthogonal wavelet low-pass filters in the literature have coefficients coming from an algebraic number field. Therefore, it is of theoretical and practical interest for us to consider orthogonal wavelet filter banks over algebraic number fields. In this paper, we formulate the matrix extension problem over any general subfield of C \mathbb {C} (including an algebraic number field as a special case), and we provide step-by-step algorithms to implement our main results. As an application, we obtain a satisfactory algorithm for constructing orthogonal wavelet filter banks over algebraic number fields. Several examples are provided to illustrate the algorithms proposed in this paper.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.006
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.007
Threshold uncertainty score0.023

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.006
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0030.004
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0070.003

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.076
GPT teacher head0.398
Teacher spread0.323 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations26
Published2012
Admission routes2
Has abstractyes

Explore more

Same venueMathematics of ComputationSame topicMathematical Analysis and Transform MethodsFrench-language works237,207