Matrix-based decomposition algorithms for engineering applications: the survey and generic framework
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This paper focuses on the issue of matrix-based decomposition, which has already been recognised as an effective means to address a system's complexity. For instance, a Design Structure Matrix (DSM) has been applied to tackle the complexity involved in product architecture and project management. As matrix-based decomposition has been studied and applied in different engineering contexts, the corresponding algorithms are rather scattered and often address only specific, context-dependent problems. Therefore, this paper is intended to contribute to matrix-based decomposition in two aspects. First, the research efforts in different domains are surveyed to identify the fundamental algorithmic techniques that are relevant to matrix-based decomposition. Second, a generic framework that allows the customisation of algorithms is proposed as an integrated tool to address different problems in matrix-based decomposition. Four matrix examples have been used to illustrate the framework's feasibility and applicability. The example results support that the proposed framework is capable of addressing four common matrix types in engineering applications, namely, symmetric DSM, non-symmetric DSM, directed DSM and rectangular matrix.
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.
Full frame distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it