SecurityViews: A Dynamic Security for View-Oriented Programming
Bibliographic record
Abstract
In wide-enterprise information systems, the same objects play different functional roles during their lifecycle. The development and the distributtion of these functional roles can be realized using one of the aspect oriented software development techniques, in particular view oriented programming (VOP). Generally speaking, views are code fragments, which provide the implementation of different functionalities for the same object domain and theses views can be used as a units for distribution to improve performance issues. Therefore, using VOP encompasses a combination of views, which can be distributed, attached, detached dynamically throughout their object views lifecycle. In this context, an issue has to be addressed when a distributed object offers different views to different clients. A security access problem would be if a client somehow tries to perform an operation of a view, which is not attached by that client. Another issue has to be addressed is to manage views in a transparent way (implicitly) for clients. We propose a dynamic adaptation and security model based on Java security model to deal with theses issues.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.006 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.002 |
| Meta-epidemiology (broad) | 0.001 | 0.003 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.004 |
| Scholarly communication | 0.005 | 0.010 |
| Open science | 0.004 | 0.007 |
| Research integrity | 0.002 | 0.006 |
| Insufficient payload (model declined to judge) | 0.005 | 0.002 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".