MétaCan
Menu
Back to cohort
Record W4206411094 · doi:10.22215/etd/2021-14768

Computationally Efficient and Secure Kronecker-based Compressive Sensing

2021· dissertation· en· W4206411094 on OpenAlexafffund
Parichehreh Firoozi Shahmirzadi

Bibliographic record

Venuenot available
Typedissertation
Languageen
FieldEngineering
TopicSparse and Compressive Sensing Techniques
Canadian institutionsCarleton University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsCompressed sensingComputer scienceMatrix (chemical analysis)AlgorithmSparse matrixKronecker deltaBlock matrixBlock (permutation group theory)PlaintextParallel computingTheoretical computer scienceEncryptionMathematicsPhysics

Abstract

fetched live from OpenAlex

We propose an efficient permuted Kronecker-based sparse measurement matrix for compressive sensing applications. We use sub-matrices to create a block-diagonal matrix and multiply it with a deterministic permutation matrix to measure the sparse or compressible signals. Using ECG signals from the MIT-BIH Arrhythmia database, we show that the reconstructed signal quality is comparable to the ones achieved using standard compressive sensing methods. Our methodology results in an overall reduction in storage and computations and can be generalized to other classes of eligible measurement matrices in compressive sensing. We show that with the use of a securely generated one-time sensing matrix, our proposed method is computationally secure against plaintext and ciphertext-only attacks. The proposed one-time sensing matrix is superior to other measurement matrices in the literature in terms of the number of linear feedback shift register bits required for their generation.

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 distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.093
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.007
GPT teacher head0.221
Teacher spread0.214 · 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 teacher head, not a consensus.

Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations0
Published2021
Admission routes2
Has abstractyes

Explore more

Same topicSparse and Compressive Sensing TechniquesFrench-language works237,207