MétaCan
Menu
Back to cohort

Dynamic Multilevel Redundancy Allocation Optimization Under Uncertainty

2023· article· en· W4362647392 on OpenAlex
Aliakbar Eslami Baladeh, Sharareh Taghipour

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicReliability and Maintenance Optimization
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsRedundancy (engineering)Computer scienceReliability engineeringProcess (computing)Variety (cybernetics)Key (lock)Risk analysis (engineering)Systems engineeringIndustrial engineeringOperations researchEngineeringArtificial intelligence

Abstract

fetched live from OpenAlex

System engineers are facing new challenges in designing products due to a variety of reasons: I) as the time between introducing new technologies is getting shorter, the capability of upgrading with new technologies is a key requirement in designing sustainable products. II) To satisfy customers' requirements, products should be adapted to their needs and applications, which may vary from each other, or differ from time to time, such as the changes in working conditions. III) New data about different aspects of products' performance comes to the system on an ongoing basis. Responding to this information and considering the possibility of changing the prior knowledge about the working conditions and the system's performance should be considered in the design phases.Multilevel designs aim to improve the maintenance and replacement process and facilitate redundancy allocation. Components at the same level are replaced and maintained together. For each level, it is possible to consider different choices, and customers can select their combinations based on their needs. This design addresses the aforementioned challenges for high-reliability products. The design can be upgraded with new technologies by replacing old components with new ones at different levels. Moreover, after realizing new information regarding the system's performance and working conditions, the multilevel design enables the possibility of immediate adjustment according to the new information. In addition, multilevel design makes the diagnostic process more efficient and maintenance and replacement actions more economical.Although some methodologies are proposed to allocate redundancy in multilevel systems, they assume all decisions are made at the initial design. They ignore the possibility of responding to future uncertainties by changing the redundancy configuration. Moreover, the redundancy allocation in multilevel series-parallel systems has not been addressed under uncertain conditions.In this study, a multilevel redundancy allocation problem is considered. It is assumed some uncertainties are realized at the time of operation, such as working conditions and workload. Moreover, the system’s configuration at some levels can be updated according to the customers’ needs during the usage. The paper develops a two-stage stochastic model. In stage I, the redundancy allocation is optimally designed at the components’ levels considering the uncertainties. In stage II, after realizing the uncertain parameters, as a response, the customer updates the system redundancy at the defined levels.To deal with the complexity of the proposed model, a genetic algorithm (GA) is developed to find the optimal solution. The results of the static and dynamic stochastic models are compared to show the model’s capability to improve the system's reliability.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.956
Threshold uncertainty score0.407

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.010
GPT teacher head0.228
Teacher spread0.218 · 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

Quick stats

Citations4
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicReliability and Maintenance OptimizationFrench-language works237,207