MétaCan
Menu
Back to cohort
Record W1611244738 · doi:10.1002/cae.21675

LAS: A programming language and development environment for learning matrix structural analysis

2015· article· en· W1611244738 on OpenAlexafffund
Patrick Paultre, Éric Lapointe, Charles Carbonneau, Jean Proulx

Bibliographic record

VenueComputer Applications in Engineering Education · 2015
Typearticle
Languageen
FieldEngineering
TopicExperimental Learning in Engineering
Canadian institutionsUniversité LavalDassault Systèmes (Canada)Université de Sherbrooke
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsDirect stiffness methodGraphicsComputer scienceModal analysisStiffness matrixFinite element methodMatrix (chemical analysis)Programming languageStatic analysisComputer graphics (images)Structural engineeringEngineering

Abstract

fetched live from OpenAlex

ABSTRACT This article presents language for the analysis of structures (LAS). It is a development environment and a high‐level language for learning matrix structural analysis, dynamics of structures, and the finite element method. LAS is a flexible learning environment in which users list pre‐programmed commands in the right order to solve finite element static and dynamic problems. In addition to structural analysis commands, the language also includes powerful operators, conditional expressions, loop expressions, and several functions (matrix manipulations, linear algebra, direct stiffness assembly, modal analysis, time domain dynamic analysis, frequency domain dynamic analysis). The LAS environment includes an editor used to list the commands, a matrix manager, a graphics post‐processor, and a Fourier‐analysis tool. © 2015 Wiley Periodicals, Inc. Comput. Appl. Eng. Educ. 24:89–100, 2016; View this article online at wileyonlinelibrary.com/journal/cae ; DOI 10.1002/cae.21675

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: Not applicable · Consensus signal: none
GenreCandidate signal: Software · Consensus signal: none
Teacher disagreement score0.049
Threshold uncertainty score0.163

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.006
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0020.003
Open science0.0030.003
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0490.025

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.006
GPT teacher head0.248
Teacher spread0.242 · 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 designNot applicable
Domainnot available
GenreSoftware

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

Citations4
Published2015
Admission routes2
Has abstractyes

Explore more

Same venueComputer Applications in Engineering EducationSame topicExperimental Learning in EngineeringFrench-language works237,207