Smart-AC: A New Framework Concept for Modeling Access Control Policy
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
As new technologies grow such as Internet of Things (IoT) and cloud computing, the way how people interact with devices change. The current world of interconnectivity, the heterogeneity of networks, platforms, applications, and the diversity of users make the modernization of security methods inevitable fact. Access Control (AC) is one of these essential security requirements in this domain. The continuous technology propagation forces the need to enhance AC methods, which are presented in the literature by combining features from two or more models based on a given case or scenario. The aim is to enforce AC policy and create secure communication environments. In this paper, we summarize some of the proposed methods with combined features from various AC models in the light of new technologies. Also, we present a deeper look for our idea of finding a methodology for a new dynamic Smart-AC model and a use case, in addition to the challenges to implement it. Our aim is to find a general AC framework to overcome the limitations of the presented AC methods, since they are not generic enough and do not encompass a general concept to tackle the various IT cases. The concept of our Smart-AC method is that it can be oriented to include (or exclude) all (or some) AC features for a given scenario or project, and work as a generic basis to encompass the heterogeneity of all AC models. Our proposed model aims to follow up AC requirements along with technology propagations and developments.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 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