A Barrier Based Methodology to Assess Site Security Risk
Bibliographic record
Abstract
Abstract The recent attacks on petroleum plants in various countries such as Algeria, Nigeria, and Iraq have greatly changed the risk mindset of the chemical industry (Johnson and Gilbert, 2013; Nordland and Al-Sahy, 2014). Risk assessments and management traditionally are conducted on unintended (safety related) incidents and not on intentional acts. These intentional acts could either be from an internal or external source. This paper extends the probabilistic risk assessment methodology (generally focus on safety unintended) to the security facet (focusing on intended incidents) of a processing facility. The methodology is based on the barrier approach. Five security barriers are proposed throughout the facility to help deter an attack. These security barriers are external, internal, interior, critical, and the fail-safe barrier, which are implemented at various stages of a plant with varying objectives. For example, the fail-safe barrier aims to bring the plant to safe shutdown mode, once it observes breach of the barrier. Breach of each barrier is modeled using fault tree approach. A number of monitoring parameters are proposed to track the effectiveness of the barrier, which are modeled as basic events in the fault tree. The occurrence of each basic event is modeled using two failure modes: i) natural, and ii) forced failure. Conditional probability with soft computing theory is used to model occurrence probability. The proposed methodology also takes into account effectiveness of the management, and political parameters in an impeding attack. In addition, the fault trees modeled are mapped into respective Bayesian Networks. Bayesian networks allow for manipulation of the conditional probability table. There are three relaxation assumptions that manipulate the conditional probability table that is explored in this paper. In order to eliminate uncertainty developed in the data, an updating mechanism is used along with a predictive component to make the model dynamic. This is significant as the model can be become dynamic to reflect any changes that may have occurred. Finally, a case study of a typical processing facility is presented to demonstrate the effectiveness of the model and to indicate areas of further improvement. This paper aspires to bring awareness to security risk assessments and the need to create a database for security related failures.
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.004 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.005 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
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".