Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Guaranteed performance”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Quantum computational phase transition in combinatorial problems

Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical computers, without a proof that bounded-error quantum polynomial time (BQP) ≠ nondeterministic polynomial time (NP), it is necessary to investigate the empirical advantages of QAOA. We identify a computational phase transition of QAOA when solving hard problems such as SAT—random instances are most difficult to train at a critical problem density. We connect the transition to the controllability and the complexity of QAOA circuits. Moreover, we find that the critical problem density in general deviates from the SAT-UNSAT phase transition, where the hardest instances for classical algorithms lies. Then, we show that the high problem density region, which limits QAOA’s performance in hard optimization problems (reachability deficits), is actually a good place to utilize QAOA: its approximation ratio has a much slower decay with the problem density, compared to classical approximate algorithms. Indeed, it is exactly in this region that quantum advantages of QAOA over classical approximate algorithms can be identified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Trainability of Dissipative Perceptron-Based Quantum Neural Networks

Several architectures have been proposed for quantum neural networks (QNNs), with the goal of efficiently performing machine learning tasks on quantum data. Rigorous scaling results are urgently needed for specific QNN constructions to understand which, if any, will be trainable at a large scale. Here, we analyze the gradient scaling (and hence the trainability) for a recently proposed architecture that we call dissipative QNNs (DQNNs), where the input qubits of each layer are discarded at the layer’s output. We find that DQNNs can exhibit barren plateaus, i.e., gradients that vanish exponentially in the number of qubits. Moreover, we provide quantitative bounds on the scaling of the gradient for DQNNs under different conditions, such as different cost functions and circuit depths, and show that trainability is not always guaranteed. Here our work represents the first rigorous analysis of the scalability of a perceptron-based QNN.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Towards Resilient Near Real-Time Analysis Workflows in Fusion Energy Science

Nuclear fusion holds the promise of an endless source of energy. Several research experiments across the world and joint modeling and simulation efforts between the nuclear physics and high performance computing communities are actively preparing the operation of the International Thermonuclear Experimental Reactor (ITER). Both experimental reactors and their simulated counterparts generate data that must be analyzed quickly and in a resilient way to support decision making for the configuration of subsequent runs or prevent a catastrophic failure. However, the cost if the traditional techniques used to improve the resilience of analysis workflows, i.e., replicating datasets and computational tasks, becomes prohibitive with explosion of the volume of data produced by modern instruments and simulations. Therefore, we advocate in this paper for an alternate approach based on data reduction and data streaming. The rationale is that by allowing for a reasonable, controlled, and guaranteed loss of accuracy it becomes possible to transfer smaller amounts of data, shorten the execution time of analysis workflows, and lower the cost of replication to increase resilience. We develop our research and development roadmap towards resilient near real-time analysis workflows in fusion energy science and present early results showing that data streaming and data reduction is a promising way to speed up the execution and improve the resilience of analysis workflows.

Suter, Fred↗
DOE OSTI2026

Throughput Estimation of Data Transport Networks From Digital Twin Measurements

Digital twins of networked infrastructures, known as Virtual Infrastructure Twins (VITs), are increasingly used for software development, pre-deployment testing, and design space exploration. While VITs avoid the costs and potential disruptions associated with experiments on operational networks, their throughput measurements are typically not sufficiently accurate for performance profiling of wide-area networks that they emulate. Here, machine learning (ML) methods are developed to transform these inaccurate VIT network throughput measurements to closely match in peak and overall profile of those from a physical testbed or production network. First, a micro kernel network reflecting a physical network is utilized to collect one-time measurements on a host to support this ML transformation. Then, a generic multi-modal ML method is developed to learn a map that transforms measurements from subsequent VITs on the same host to match past, current and follow-on testbed and cloud networks. ML generalization equations are derived to establish its correctness and probabilistically guarantee its generalization accuracy. Experimental results are presented for a variety of VIT hosts with target testbed and cloud networks; they include a case study of a four-site science ecosystem wherein inaccurate convex VIT measurement profiles are transformed into accurate concave profiles of target networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Virtual Self-Excited Induction Generator-Based Grid-Forming Inverter Control for Robust Voltage Regulation Under Nonideal Loading

This paper presents a generator-inspired control methodology for grid-forming (GFM) inverters that deliberately emulates a self-excited induction generator so that the inverter can hold its voltage and frequency under difficult loading and severe terminal disturbances across wide voltage and frequency ranges. The design integrates a Lyapunov energy function-based inner loop to provide high bandwidth and strong disturbance rejection, and it complements this with a passivity-based argument that furnishes a coherent large-signal stability guarantee beyond small-signal limits. Analytical insights are developed via the Krylov-Bogoliubov-Mitropolsky averaging method, which reveals an intrinsic resistive droop characteristic; these closed-form relations both explain the observed dynamics and yield simple, decentralized tuning rules. The methodology is validated on a controller-hardware-in-the-loop platform and exercised in real time across balanced, unbalanced, and nonlinear loads, as well as during parallel operation. Across these scenarios, the inverter maintains balanced three-phase voltages, limits harmonic content, settles quickly with well-damped transients, and remains resilient when multiple units operate in parallel. The contributions are a self-excited-machine-inspired GFM controller with enhanced dynamic performance and robustness, a single stability rationale grounded in passivity, closed-form expressions that guide tuning, and comprehensive hardware-in-the-loop validations demonstrating effectiveness and superiority under challenging operating conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Attack-Resilient Weighted $\ell_{1}$ Observer with Prior Pruning

Security related questions for Cyber Physical Systems (CPS) have attracted much research attention in searching for novel methods for attack-resilient control and/or estimation. Specifically, false data injection attacks (FDIAs) have been shown to be capable of bypassing bad data detection (BDD), while arbitrarily compromising the integrity of state estimators and robust controller even with very sparse measurements corruption. Moreover, based on the inherent sparsity of pragmatic attack signals, ℓ1 -minimization scheme has been used extensively to improve the design of attack-resilient estimators. For this, the theoretical maximum for the percentage of compromised nodes that can be accommodated has been shown to be 50%. In order to guarantee correct state recoveries for larger percentage of attacked nodes, researchers have begun to incorporate prior information into the underlying resilient observer design framework. For the most pragmatic cases, this prior information is often obtained through some data-driven machine learning process. Existing results have shown strong positive correlation between the tolerated attack percentages and the precision of the prior information. In this paper, we present a pruning method to improve the precision of the prior information, given corresponding stochastic uncertainty characteristics of the underlying machine learning model. Then a weighted ℓ1 -minimization is proposed based on the pruned prior. The theoretical and simulation results show that the pruning method significantly improves the observer performance for much larger attack percentages, even when moderately accurate machine learning model used.

Resilient observer, Cyber-physical systems, prunin↗
DOE OSTI2022

Analysis of sparse recovery for Legendre expansions using envelope bound

We provide novel sufficient conditions for the uniform recovery of sparse Legendre expansions using ℓ 1 minimization, where the sampling points are drawn according to orthogonalization (uniform) measure. So far, conditions of the form m ≳ Θ 2 s x log factors have been relied on to determine the minimum number of samples m that guarantees successful reconstruction of s-sparse vectors when the measurement matrix is associated to an orthonormal system. However, in case of sparse Legendre expansions, the uniform bound Θ of Legendre systems is so high that these conditions are unable to provide meaningful guarantees. Here, in this paper, we present an analysis which employs the envelop bound of all Legendre polynomials instead, and prove a new recovery guarantee for s-sparse Legendre expansions, m ≳ Θs 2 x log factors, which is independent of Θ. Arguably, this is the first recovery condition established for orthonormal systems without assuming the uniform boundedness of the sampling matrix. The key ingredient of our analysis is an extension of chaining arguments, recently developed in Bourgain and Chkifa et al., to handle the envelope bound. Furthermore, our recovery condition is proved via restricted eigenvalue property, a less demanding replacement of restricted isometry property which is perfectly suited to the considered scenario. Along the way, we derive simple criteria to detect good sample sets. Our numerical tests show that sets of uniformly sampled points that meet these criteria will perform better recovery on average.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Porous Flow Modeling of Axial Gas Redistribution in Fragmented LWR Fuel Rods using MOOSE

Understanding how gas axially redistributes within fragmented fuel pellets is crucial for predicting the behavior of Light Water Reactor (LWR) fuel rods, particularly during transient and accidental scenarios. The time scale of this phenomenon plays a fundamental role in determining the progression and hazard of a Loss Of Coolant Accident (LOCA), especially when high burn-up fuel in a severe state of fragmentation is involved. Here, this study presents a Computational Fluid Dynamics (CFD) model developed within the Multiphysics Object-Oriented Simulation Environment (MOOSE) to predict the time-scale of plenum depressurization in Light-Water Reactor (LWR) fuel rods driven by axial gas transport through fragmented pellets. The model examines the effects of incorporating non-linearities in the friction term by comparing the results with experimental data. The experiment employed surrogate fuel rods containing pellets subjected to mechanical and/or thermal loadings to simulate various severity of cracking, and aimed at studying the influence of fuel conditions on axial gas redistribution. The results of this analysis indicate that under certain flow regime conditions - determined by the value of an equivalent Reynolds number - accounting for the non-linear friction term in Navier-Stokes equations guarantees better predictions for the time-scale of plenum depressurization. Also, the model enabled the simulation of the pressure decay by assigning distinct permeability values to each pellet instead of a single uniform value. Multiple simulations were run across all possible pellet position combinations, having each pellet assigned with values of permeability extracted from the experimental data. This allows to quantify the impact of the considering various non-uniform distributions of permeability on the dynamics of axial gas redistribution. The present work findings enhance the understanding of axial gas transport, and provide valuable insights for the integration of a model for predicting the axial gas redistribution during a LOCA scenario into the BISON fuel performance code.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2024

Electric Vehicles Charging Time Constrained Deliverable Provision of Secondary Frequency Regulation

Aggregation of electric vehicles (EVs) is a promising technique for providing secondary frequency regulation (SFR) in highly renewable energy-penetrated power systems. Equipped with energy storage devices, EV aggregation can provide reliable SFR. However, the main challenge is to guarantee reliable intra-interval SFR capacities and inter-interval delivery following the automatic generation control (AGC) signal. Furthermore, aggregated EV SFR provision will be further complicated by the EV charging time anxiety because SFR provision might extend EV's charging time. This paper proposes a deliverable EV SFR provision with a charging-time-constrained control strategy. First, a charging-time-constrained EV aggregation is proposed to address the uncertainty of EV capacity based on the state-space model considering the charging-time restriction of EV owners. Second, a real-time economic dispatch and time domain simulation (RTED-TDS) cosimulation framework is proposed to verify financial results and the dynamic performance of the EV SFR provision. Last, the proposed charging time-constrained EV aggregation is validated on the IEEE 39-bus system. In conclusion, the results demonstrate that with charging time-constrained EV aggregation, the dynamic performance of the system can be improved with a marginal increase in total cost. More importantly, the charging time constraint can be respected in the proposed SFR provision of the EV aggregation.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Analysis of the ratio of ℓ 1 and ℓ 2 norms in compressed sensing

We study the ratio of ℓ 1 and ℓ 2 norms ( ℓ 1 / ℓ 2 ) as a sparsity-promoting objective in compressed sensing. We first propose a novel criterion that guarantees that an s-sparse signal is the local minimizer of the ℓ 1 / ℓ 2 objective; our criterion is interpretable and useful in practice. We also give the first uniform recovery condition using a geometric characterization of the null space of the measurement matrix, and show that this condition is satisfied for a class of random matrices. We also present analysis on the robustness of the procedure when noise pollutes data. Numerical experiments are provided that compare ℓ 1 / ℓ 2 with some other popular non-convex methods in compressed sensing. Finally, we propose a novel initialization approach to accelerate the numerical optimization procedure. We call this initialization approach support selection, and we demonstrate that it empirically improves the performance of existing ℓ 1 / ℓ 2 algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Iridium-Doped Nanosized Zn–Al Layered Double Hydroxides as Efficient Water Oxidation Catalysts

Layered double hydroxides (LDHs) are an ideal platform to host catalytic metal centers for water oxidation (WO) owing to the high accessibility of water to the interlayer region, which makes all centers potentially reachable and activated. In this paper, we report the syntheses of three iridium-doped zinc–aluminum LDHs (Ir-LDHs) nanomaterials (1–3, with about 80 nm of planar size and a thickness of 8 nm as derived by field emission scanning electron microscopy and powder X-ray diffraction studies, respectively), carried out in the confined aqueous environment of reverse micelles, through a very simple and versatile procedure. These materials exhibit excellent catalytic performances in WO driven by NaIO 4 at neutral pH and 25 °C, with an iridium content as low as 0.5 mol % (~0.8 wt %), leading to quantitative oxygen yields (based on utilized NaIO 4 , turnover number up to ~10,000). Nanomaterials 1–3 display the highest ever reported turnover frequency values (up to 402 min –1 ) for any heterogeneous and heterogenized catalyst, comparable only to those of the most efficient molecular iridium catalysts, tested under similar reaction conditions. The boost in activity can be traced to the increased surface area and pore volume (>5 times and 1 order of magnitude, respectively, higher than those of micrometric materials of size 0.3–1 μm) estimated for the nanosized particles, which guarantee higher noble metal accessibility. X-ray absorption spectroscopy (XAS) studies suggest that 1–3 nanomaterials, as-prepared and after catalysis, contain a mixture of isolated, single octahedral Ir(III) sites, with no evidence of Ir–Ir scattering from second-nearest neighbors, excluding the presence of IrO 2 nanoparticles. The combination of the results obtained from XAS, elemental analysis, and ionic chromatography strongly suggests that iridium is embedded in the brucite-like structure of LDHs, having four hydroxyls and two chlorides as first neighbors. These results demonstrate that nanometric LDHs can be successfully exploited to engineer efficient WOCs, minimizing the amount of iridium used, consistent with the principle of the noble-metal atom economy.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Defect-free-induced Na + disordering in electrode materials

For reaching high-performance of electrode materials, it is generally believed that understanding the structure evolution and heterogeneous alignment effect is the key. Presently, a very simple and universally applicable self-healing method is investigated to prepare defect-free Prussian blue analogs (PBAs) that reach their theoretical capacity as cathode materials for sodium-ion batteries (SIBs). For direct imaging of the local structure and the dynamic process at the atomic scale, we deliver a fast ion-conductive nickel-based PBA that enables rapid Na + extraction/insertion within 3 minutes and a capacity retention of nearly 100% over 4000 cycles. This guest-ion disordered and quasi-zero-strain nonequilibrium solid–solution reaction mechanism provides an effective guarantee for realizing long-cycle life and high-rate capability electrode materials that operate via reversible two-phase transition reaction. Unconventional materials and mechanisms that enable reversible insertion/extraction of ions in low-cost metal–organic frameworks (MOFs) within minutes have implications for fast-charging devices, grid-scale energy storage applications, material discovery, and tailored modification.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Analysis of Energy Justice and Equity Impacts from Replacing Peaker Plants with Energy Storage

Transitions to low-carbon energy systems are essential to mitigating and adapting to climate change. Energy storage systems are a key component in achieving a viable decarbonized electric grid. However, decarbonization alone does not guarantee a fairer, more inclusive, or socially just energy system. Energy equity and justice should be integrated in energy system transitions to ensure benefits and burdens are shared equitably. In this paper, we discuss the relationship between energy storage and social equity by assessing the use of energy storage to replace natural gas-fired (NG) peaker plants. Peaker plants are disproportionately located near disadvantaged communities and tend to be older and high emitters of health-affecting fine particulate matter and other pollutants. This paper investigates the equity implications of NG peaker plant replacements with battery energy storage in the context of Washington State’s peaker plants to highlight the human-centered values of retiring the plants. The study performed production cost simulations using the latest Western Electric Coordinating Council Anchor Dataset 2030 case and found that total generation cost, locational marginal price, and total annual emissions were reduced with the replacements. These reductions will have equity benefits on local communities including access to clean air, enhanced health outcomes, and energy burden reductions.

Tarekegne, Bethel W.↗
DOE OSTI2023

Robust Parameter Design on Dual Stochastic Response Models With Constrained Bayesian Optimization

In engineering system design, minimizing the variations of the quality measurements while guaranteeing their overall quality up to certain levels, namely the robust parameter design (RPD), is crucial. Recent works have dealt with the design of a system whose response-control variables relationship is a deterministic function with a complex shape and function evaluation is expensive. In this work, we propose a Bayesian optimization method for the RPD of stochastic functions. Dual stochastic response models are carefully designed for stochastic functions. The heterogeneous variance of the sample mean is addressed by the predictive mean of the log variance surrogate model in a two-step approach. We establish an acquisition function that favors exploration across the feasible and optimality-improvable regions to effectively and efficiently solve the stochastic constrained optimization problem. Further, the performance of our proposed method is demonstrated by the extensive numerical and case studies. Note to Practitioners-Many manufacturing processes involve undesirable variations, which create variations in the final products. For example, many emerging manufacturing processes, such as nanomanufacturing, involve complex physical and chemical dynamics and transformation, creating variations in the manufacturing output. In such processes, it is crucial to design the manufacturing processes or products so that they have minimum variations in their quality. Meanwhile, it is also important to maintain the overall quality of the designed processes or products. Furthermore, acquiring data from many advanced manufacturing processes is often very costly, especially in the designing stage. In this work, we propose a data-driven method that automatically finds the best setting of manufacturing processes or products with the minimum variations of quality and a given constraint on the average quality satisfied. Our proposed method is used before conducting every experiment; It analyzes the historical data from previous experiments and provides a setting to be used in the next experiment. Our proposed method efficiently utilizes the historical data, and thus finds the best robust setting by conducting only a small number of experiments.

42 ENGINEERING↗
DOE OSTI2021

Optimizing Error-Bounded Lossy Compression for Scientific Data by Dynamic Spline Interpolation

Today's scientific simulations are producing vast volumes of data that cannot be stored and transferred efficiently because of limited storage capacity, parallel I/O bandwidth, and network bandwidth. The situation is getting worse over time because of the ever-increasing gap between relatively slow data transfer speed and fast-growing computation power in modern supercomputers. Error-bounded lossy compression is becoming one of the most critical techniques for resolving the big scientific data issue, in that it can significantly reduce the scientific data volume while guaranteeing that the reconstructed data is valid for users because of its compression-error-bounding feature. In this paper, we present a novel error-bounded lossy compressor based on a state-of-the-art prediction-based compression framework. Our solution exhibits substantially better compression quality than all of the existing error-bounded lossy compressors, with comparable compression speed. Specifically, our contribution is threefold. (1) We provide an in-depth analysis of why the best-existing prediction-based lossy compressor can only minimally improve the compression quality. (2) We propose a dynamic spline interpolation approach with a series of optimization strategies that can significantly improve the data prediction accuracy, substantially improving the compression quality in turn. (3) We perform a thorough evaluation using six real-world scientific simulation datasets across different science domains to evaluate our solution vs. all other related works. Experiments show that the compression ratio of our solution is higher than that of the second-best lossy compressor by 20%similar to 460% with the same error bound in most of the cases.

Zhao, Kai↗
DOE OSTI2023

Incremental Interval Assignment by Integer Linear Algebra with Improvements

Interval Assignment (IA) is the problem of selecting the number of mesh edges (intervals) for each curve for conforming quad and hex meshing. The intervals x is fundamentally integer-valued. Many other approaches perform numerical optimization then convert a floating-point solution into an integer solution, which is slow and error prone. We avoid such steps: we start integer, and stay integer. Incremental Interval Assignment (IIA) uses integer linear algebra (Hermite normal form) to find an initial solution to the meshing constraints, satisfying the integer matrix equation Solving for reduced row echelon form provides integer vectors spanning the nullspace of A. Here we add vectors from the nullspace to improve the initial solution, maintaining Ax = b Heuristics find good integer linear combinations of nullspace vectors that provide strict improvement towards variable bounds or goals. IIA always produces an integer solution if one exists. In practice we usually achieve solutions close to the user goals, but there is no guarantee that the solution is optimal, nor even satisfies variable bounds, e.g. has positive intervals. We describe several algorithmic changes since first publication that tend to improve the final solution. The software is freely available.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Multi-material ALE remap with interface sharpening using high-order matrix-free finite element methods

The arbitrary Lagrangian-Eulerian (ALE) technique involves remapping field quantities from a Lagrangian mesh to an optimized mesh in a conservative, accurate and bounds-preserving manner. For methods based on arbitrary order finite elements, as described in a reference, material volume fractions are advected in pseudo-time using flux-corrected transport (FCT) without any form of interface reconstruction. In practice, this can lead to excessive propagation of small volume fractions throughout the domain. In addition, this method requires assembly of a global advection matrix to compute the bounds-preserving low-order FCT solution. In this work, we introduce a new approach for ALE remap using a high-order matrix-free technique which incorporates a flux modification to sharpen material interfaces in a conservative manner. Our approach begins with computing a bounds-preserving low-order solution to the ALE remap equations at the element level. We then compute a sharp interface solution (not guaranteed to be bounds-preserving) which comes from solving an augmented version of the ALE remap equations with a conservative flux modification which acts to sharpen material volume fractions based on their gradients and transport directions. Using the sharp interface solution, we make global corrections to the bounds-preserving solution while maintaining preservation of bounds. By blending with the sharpened solution at the global level we are able to globally conserve mass without hindering the remap pseudo-time step. This new interface-aware ALE remap method is based entirely on partial assembly techniques where globally assembled matrix operators are no longer needed, resulting in a globally matrix-free FCT method for multi-material, multi-field ALE remap with high performance on GPU architectures. We present results of our new remap method on 1D, 2D and 3D benchmarks and describe the algorithmic tailoring for GPU architectures that was developed.

Vargas, Arturo [Lawrence Livermore National Labora↗
DOE OSTI2024

Evaluation of data collection bias of third molar stages of mineralisation for age estimation in the living

Abstract Age assessment of the living is a fundamental procedure in the process of human identification, in order to guarantee fair treatment of individuals, which has ethical, civil, legal, and medical repercussions. The careful selection of the appropriate methods requires evaluation of several parameters: accuracy, precision of the method, as well as its reproducibility. The approach proposed by Mincer et al. adapted from Demirjian et al. exploring third molar mineralisation, is one of the most frequently considered for age estimation of the living. Thus, this work aims to assess potential bias in the data collection when applying the classification stages for dental mineralisation adapted by Mincer et al. A total of 102 orthopantomographs, of clinical origin, belonging to individuals aged between 12 and 25 years ($ \bar{\textit x} $ = 20.12 years, SD = 3.49 years; 65 females, 37 males, all of Portuguese nationality) were included and a retrospective analysis performed by five observers with different levels of experience (high, average, and basic). The performance and agreement between five observers were evaluated using Weighted Cohen’s Kappa and the Intraclass Correlation Coefficient. To access the influence of impaction on third molar classification, variables were tested using ordinal logistic regression Generalised Linear Model. It was observed that there were variations in the number of teeth identified among the observers, but the agreement levels ranged from moderate to substantial (0.4–0.8). Upon closer examination of the results, it was observed that although there were discernible differences between highly experienced observers and those with less experience, the gap was not as significant as initially hypothesised, and a greater disparity between the classifications of the upper (0.24–0.49) and lower third molars (>0.55) was observed. When bone superimposition is present, the classification process is not significantly influenced; however, variation in teeth angulation affects the assessment. The results suggest that with an efficient preparation, the level of experience as a factor can be overcome. Mincer and colleague's classification system can be replicated with ease and consistency, even though the classification of upper and lower third molars presents distinct challenges.

de Oliveira Santos, Inês (ORCID:0000000267324347)↗