Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic efficiency”

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 1,081 records · Page 60

Parallel beamlet dose calculation via beamlet contexts in a distributed multi‐GPU framework

Purpose Dose calculation is one of the most computationally intensive, yet essential tasks in the treatment planning process. With the recent interest in automatic beam orientation and arc trajectory optimization techniques, there is a great need for more efficient model‐based dose calculation algorithms that can accommodate hundreds to thousands of beam candidates at once. Foundational work has shown the translation of dose calculation algorithms to graphical processing units ( GPU s), lending to remarkable gains in processing efficiency. But these methods provide parallelization of dose for only a single beamlet, serializing the calculation of multiple beamlets and under‐utilizing the potential of modern GPU s. In this paper, the authors propose a framework enabling parallel computation of many beamlet doses using a novel beamlet context transformation and further embed this approach in a scalable network of multi‐ GPU computational nodes. Methods The proposed context‐based transformation separates beamlet‐local density and TERMA into distinct beamlet contexts that independently provide sufficient data for beamlet dose calculation. Beamlet contexts are arranged in a composite context array with dosimetric isolation, and the context array is subjected to a GPU collapsed‐cone convolution superposition procedure, producing the set of beamlet‐specific dose distributions in a single pass. Dose from each context is converted to a sparse representation for efficient storage and retrieval during treatment plan optimization. The context radius is a new parameter permitting flexibility between the speed and fidelity of the dose calculation process. A distributed manager‐worker architecture is constructed around the context‐based GPU dose calculation approach supporting an arbitrary number of worker nodes and resident GPU s. Phantom experiments were executed to verify the accuracy of the context‐based approach compared to Monte Carlo and a reference CPU ‐ CCCS implementation for single beamlets and broad beams composed by addition of beamlets. Dose for representative 4 π beam sets was calculated in lung and prostate cases to compare its efficiency with that of an existing beamlet‐sequential GPU ‐ CCCS implementation. Code profiling was also performed to evaluate the scalability of the framework across many networked GPU s. Results The dosimetric accuracy of the context‐based method displays <1.35% and 2.35% average error from the existing serialized CPU ‐ CCCS algorithm and Monte Carlo simulation for beamlet‐specific PDD s in water and slab phantoms, respectively. The context‐based method demonstrates substantial speedup of up to two orders of magnitude over the beamlet‐sequential GPU ‐ CCCS method in the tested configurations. The context‐based framework demonstrates near linear scaling in the number of distributed compute nodes and GPU s employed, indicating that it is flexible enough to meet the performance requirements of most users by simply increasing the hardware utilization. Conclusions The context‐based approach demonstrates a new expectation of performance for beamlet‐based dose calculation methods. This approach has been successful in accelerating the dose calculation process for very large‐scale treatment planning problems ‐ such as automatic 4 π IMRT beam orientation and VMAT arc trajectory selection, with hundreds of thousands of beamlets ‐ in clinically feasible timeframes. The flexibility of this framework makes it as a strong candidate for use in a variety of other very large‐scale treatment planning tasks and clinical workflows.

Neph, Ryan↗

A scalable Euler–Lagrange approach for multiphase flow simulation on spectral elements

Multiphase flow can be difficult to simulate with high accuracy due to the wide range of scales associated with various multiphase phenomena. These scales may range from the size of individual particles to the entire domain of interest. Traditionally, large scale systems can only be simulated using averaging approaches that filter out the locations of individual particles. In this work, the Euler–Lagrange method is used to simulate large-scale dense particle systems in which each individual particle is tracked. In order to accomplish this, the highly scalable spectral element code nek5000 has been extended to handle the multiple levels of multiphase coupling in these systems. These levels include what has been called one-, two-, and four-way coupling. Here, each level has been separated to detail the computational impact of each stage. A binned ghost particle algorithm has also been developed to efficiently handle the challenges of two- and four-way coupling in a parallel processing context. The algorithms and their implementations are then shown to scale to 65,536 Message Passing Interface (MPI) ranks in both the strong and weak limits. After this, validation is performed through simulation of a small-scale fluidized bed. Lastly, a large-scale fluidized bed is simulated with 65,536 MPI ranks and is able to capture the unique physics of the onset of fluidization.

Computer Science↗

Advanced Dynamically Adaptive Algorithms for Stochastic Simulations on Extreme Scales

The focus of the project is the development of mathematical methods and high-performance computational tools for stochastic simulations, with a particular emphasis on computations on extreme scales. The core of the project revolves around the design of highly efficient and scalable numerical algorithms that can adaptively and accurately, in high dimensional spaces, resolve stochastic problems with limited smoothness, even containing discontinuities.

97 MATHEMATICS AND COMPUTING↗

Wireless Sensor Network for Advanced Energy Management Solutions

Eaton has developed an advanced energy management solution that has been deployed to several Industries of the Future (IoF) sites. This demonstrated energy savings and reduced unscheduled downtime through an improved means for performing predictive diagnostics and energy efficiency estimation. Eaton has developed a suite of online, continuous, and inferential algorithms that utilize motor current signature analysis (MCSA) and motor power signature analysis (MPSA) techniques to detect and predict the health condition and energy usage condition of motors and their connect loads. Eaton has also developed a hardware and software platform that provided a means to develop and test these advanced algorithms in the field. Results from lab validation and field trials have demonstrated that the developed advanced algorithms are able to detect motor and load inefficiency and performance degradation. Eaton investigated the performance of Wireless Sensor Networks (WSN) within various industrial facilities to understand concerns about topology and environmental conditions that have precluded broad adoption by the industry to date. A Wireless Link Assessment System (WLAS), was used to validate wireless performance under a variety of conditions. Results demonstrated that wireless networks can provide adequate performance in most facilities when properly specified and deployed. Customers from various IoF expressed interest in applying wireless more broadly for selected applications, but continue to prefer utilizing existing, wired field bus networks for most sensor based applications that will tie into their existing Computerized Motor Maintenance Systems (CMMS). As a result, wireless technology was de-emphasized within the project, and a greater focus placed on energy efficiency/predictive diagnostics. Commercially available wireless networks were only utilized in field test sites to facilitate collection of motor wellness information, and no wireless sensor network products were developed under this project. As an outgrowth of this program, Eaton developed a patented energy-optimizing drive control technology that is complementary to a traditional variable frequency drives (VFD) to enable significant energy savings for motors with variable torque applications, such as fans, pumps, and compressors. This technology provides an estimated energy saving of 2%-10% depending on the loading condition, in addition to the savings obtained from a traditional VFD. The combination of a VFD with the enhanced energy-optimizing controls will provide significant energy savings (10% to 70% depending on the load and duty cycle) for motors that are presently connected with across the line starters. It will also provide a more favorable return on investment (ROI), thus encouraging industries to adopt VFDs for more motors within their facilities. The patented technology is based on nonintrusive algorithms that estimate the instantaneous operating efficiency and motor speed and provide active energy-optimizing control of a motor, using only existing voltage and current sensors. This technology is currently being commercialized by Eaton’s Industrial Controls Division in their next generation motor control products. Due to the common nonintrusive and inferential nature of various algorithms, this same product can also include motor and equipment condition monitoring features, providing the facility owner additional information to improve process uptime and the associated energy savings. Calculations estimated potential energy savings of 261,397GWh/Yr ($15.7B/yr), through retrofitting energy-optimizing VFDs into existing facilities, and incorporating the solution into building equipment sold by original equipment manufacturers (OEMs) and installed by mechanical and electrical contractors. Utilizing MCSA and MPSA for predictive maintenance (PM) of motors and connected equipment reduces process downtime cost and the cost of wasted energy associated with shutting down and restarting the processes. Estimated savings vary depending on the industry segment and equipment criticality per facility/process. Average downtime for an industrial facility is 4-12 hours with a cost/hr of $7500/hr, with large, critical processes reaching $50-100k/hr. Specific downtime costs are not included in this report because of customer confidentiality, but projected savings across the Industries of the Future (IoF) are still expected to be comparable to the original program estimates. Two generations of customer field deployments and evaluation have been completed during the course of this project. Results from these customer sites have been used for identifying the scope and improving the developed energy and wellness algorithms. The field deployments have confirmed that the hardware for sensing and sampling motor currents and voltages are reliable and able to provide an adequate signal-to-noise ratio from the electrical noise present on the motor signals.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A Hierarchical OPF Algorithm with Improved Gradient Evaluation in Three-Phase Networks

Linear approximation commonly used in solving alternating-current optimal power flow (AC-OPF) simplifies the system models but incurs accumulated voltage errors in large power networks. Such errors will make the primal-dual type gradient algorithms converge to solutions with voltage violation. In this paper, we improve a recent hierarchical OPF algorithm that rested on primal-dual gradients evaluated with a linearized distribution power flow model. Specifically, we propose a more accurate gradient evaluation method based on an unbalanced three-phase nonlinear distribution power flow model to mitigate the errors arising from linearization. The resultant gradients feature a blocked structure that enables our development of an improved hierarchical primal-dual algorithm to solve the OPF problem. Numerical results on the IEEE 123-bus test feeder and a 4,518-node test feeder show that the proposed method can enhance voltage safety at comparable computational efficiency with the linearized algorithm.

approximation algorithms↗

An Evolutionary Algorithm to Personalize Stool-Based Colorectal Cancer Screening

Fecal immunochemical testing (FIT) is an established method for colorectal cancer (CRC) screening. Measured FIT-concentrations are associated with both present and future risk of CRC, and may be used for personalized screening. However, evaluation of personalized screening is computationally challenging. In this study, a broadly applicable algorithm is presented to efficiently optimize personalized screening policies that prescribe screening intervals and FIT-cutoffs, based on age and FIT-history. We present a mathematical framework for personalized screening policies and a bi-objective evolutionary algorithm that identifies policies with minimal costs and maximal health benefits. The algorithm is combined with an established microsimulation model (MISCAN-Colon), to accurately estimate the costs and benefits of generated policies, without restrictive Markov assumptions. The performance of the algorithm is demonstrated in three experiments. In Experiment 1, a relatively small benchmark problem, the optimal policies were known. The algorithm approached the maximum feasible benefits with a relative difference of 0.007%. Experiment 2 optimized both intervals and cutoffs, Experiment 3 optimized cutoffs only. Optimal policies in both experiments are unknown. Compared to policies recently evaluated for the USPSTF, personalized screening increased health benefits up to 14 and 4.3%, for Experiments 2 and 3, respectively, without adding costs. Generated policies have several features concordant with current screening recommendations. The method presented in this paper is flexible and capable of optimizing personalized screening policies evaluated with computationally-intensive but established simulation models. It can be used to inform screening policies for CRC or other diseases. For CRC, more debate is needed on what features a policy needs to exhibit to make it suitable for implementation in practice.

60 APPLIED LIFE SCIENCES↗

Removal of Congo Red from Aqueous Solution by Hydroxyapatite Nanoparticles Loaded on Zein as an Efficient and Green Adsorbent: Response Surface Methodology and Artificial Neural Network-Genetic Algorithm

This study is based on the application of hydroxyapatite nanoparticles loaded on Zein (Zein/nHAp) as an efficient adsorbent for the removal of Congo red from aqueous solutions. The properties of the adsorbent were characterized using various techniques including FT-IR, XRD, FE-SEM, and BET. The influence of five parameters such as pH, temperature, contact time, initial dye concentration, and adsorbent dosage on the removal percentage of the dye was investigated. The optimum conditions of 5.83, 34.32 °C, 5.20 min, 392.10 ppm, and 0.007 g were achieved for pH, temperature, contact time, initial dye concentration, and adsorbent dosage, respectively. The maximum removal percentage of 99.48% was obtained under the optimum condition that exhibited high adsorption potential of the used adsorbent. Central composite design (CCD) under response surface methodology and artificial neural network-genetic algorithm (ANN-GA) were utilized for optimization of parameters. Comparison of the results of the two models in terms of coefficient of determination (R{sup 2}) and mean absolute percentage error confirmed the prediction potential of CCD and ANN-GA. Higher ability and accuracy of ANN-GA in prediction was found based on given results. The experimental equilibrium data were studied by Langmuir, Freundlich, Temkin and Dubinin-Radushkevic isotherm models and explored that the data well presented by Langmuir model with maximum adsorption capacity of 416.66 mg/g. The adsorption kinetic was well-fitted by the pseudo-second-order model. The thermodynamics of the adsorption displayed spontaneous and endothermic nature of the process. Regeneration investigation showed that Zein/nHAp can impressively be reused, indicating that the adsorbent was a promising one for the removal of Congo red from aqueous solution. Graphical Abstract: .

77 NANOSCIENCE AND NANOTECHNOLOGY↗

A Generalized Backward Euler algorithm for the numerical integration of a viscous breakage model

This paper discusses the formulation and the numerical performance of a fully implicit algorithm used to integrate a rate-dependent model defined within a breakage mechanics framework. For this purpose, a Generalized Backward Euler (GBE) algorithm has been implemented according to two different linearization strategies: The former is derived by a direct linearization of the constitutive equations, while the latter introduces rate effects through a consistency parameter. Additionally, the accuracy and efficiency of the GBE algorithm have been investigated by (1) performing material point analyses and (2) solving initial boundary value problems. In both cases, the overall performance of the underlying algorithm is inspected for a range of loading rates, thus simulating comminution from slow to fast dynamic problems. As the viscous response of the breakage model can be recast through a viscous nucleus function, the presented algorithm can be considered as a general framework to integrate constitutive equations relying on the overstress approach typical of Perzyna-like viscoplastic models.

36 MATERIALS SCIENCE↗

Accelerated fast iterative shrinkage thresholding algorithms for sparsity-regularized cone-beam CT image reconstruction

Purpose: The development of iterative image reconstruction algorithms for cone-beam computed tomography (CBCT) remains an active and important research area. Even with hardware acceleration, the overwhelming majority of the available 3D iterative algorithms that implement nonsmooth regularizers remain computationally burdensome and have not been translated for routine use in time-sensitive applications such as image-guided radiation therapy (IGRT). In this work, two variants of the fast iterative shrinkage thresholding algorithm (FISTA) are proposed and investigated for accelerated iterative image reconstruction in CBCT. Methods: Algorithm acceleration was achieved by replacing the original gradient-descent step in the FISTAs by a subproblem that is solved by use of the ordered subset simultaneous algebraic reconstruction technique (OS-SART). Due to the preconditioning matrix adopted in the OS-SART method, two new weighted proximal problems were introduced and corresponding fast gradient projection-type algorithms were developed for solving them. We also provided efficient numerical implementations of the proposed algorithms that exploit the massive data parallelism of multiple graphics processing units. Results: The improved rates of convergence of the proposed algorithms were quantified in computer-simulation studies and by use of clinical projection data corresponding to an IGRT study. The accelerated FISTAs were shown to possess dramatically improved convergence properties as compared to the standard FISTAs. For example, the number of iterations to achieve a specified reconstruction error could be reduced by an order of magnitude. Volumetric images reconstructed from clinical data were produced in under 4 min. Conclusions: The FISTA achieves a quadratic convergence rate and can therefore potentially reduce the number of iterations required to produce an image of a specified image quality as compared to first-order methods. We have proposed and investigated accelerated FISTAs for use with two nonsmooth penalty functions that will lead to further reductions in image reconstruction times while preserving image quality. Moreover, with the help of a mixed sparsity-regularization, better preservation of soft-tissue structures can be potentially obtained. The algorithms were systematically evaluated by use of computer-simulated and clinical data sets.

60 APPLIED LIFE SCIENCES↗

Wind direction estimation using SCADA data with consensus-based optimization

Abstract. Wind turbines in a wind farm typically operate individually to maximize their own performance and do not take into account information from nearby turbines. To enable cooperation to achieve farm-level objectives, turbines will need to use information from nearby turbines to optimize performance, ensure resiliency when other sensors fail, and adapt to changing local conditions. A key element of achieving a more efficient wind farm is to develop algorithms that ensure reliable, robust, real-time, and efficient operation of wind turbines in a wind farm using local sensor information that is already being collected, such as supervisory control and data acquisition (SCADA) data, local meteorological stations, and nearby radars/sodars/lidars. This article presents a framework for developing a cooperative wind farm that incorporates information from nearby turbines in real time to better align turbines in a wind farm. SCADA data from multiple turbines can be used to make better estimates of the local inflow conditions at each individual turbine. By incorporating measurements from multiple nearby turbines, a more reliable estimate of the wind direction can be obtained at an individual turbine. The consensus-based approach presented in this paper uses information from nearby turbines to estimate wind direction in an iterative way rather than aggregating all the data in a wind farm at once. Results indicate that this estimate of the wind direction can be used to improve the turbine's knowledge of the wind direction. This estimated wind direction signal has implications for potentially decreasing dynamic yaw misalignment, decreasing the amount of time a turbine spends yawing due to a more reliable input to the yaw controller, increasing resiliency to faulty wind-vane measurements, and increasing the potential for wind farm control strategies such as wake steering.

17 WIND ENERGY↗

Search for New Heavy Particles Decaying to Z0 Z0 to llll, lljj in p pbar Collisions at Sqrt(s) = 1.96 TeV

We report on a search for anomalous production of Z pairs through a massive resonance decay in data corresponding to 2.5-2.9 fb{sup -1} of integrated luminosity in p{bar p} collisions at {radical}s = 1.96 TeV using the CDF II detector at the Fermilab Tevatron. This analysis, with more data and channels where the Z bosons decay to muons or jets, supersedes the 1.1 fb{sup -1} four-electron channel result previously published by CDF. In order to maintain high efficiency for muons, we use a new forward tracking algorithm and muon identification requirements optimized for these high signal-to-background channels. Predicting the dominant backgrounds in each channel entirely from sideband data samples, we observe four-body invariant mass spectra above 300 GeV/c{sup 2} that are consistent with background. We set limits using the acceptance for a massive graviton resonance that are 7-20 times stronger than the previously published direct limits on resonant ZZ production.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Proactive Intrusion Detection and Mitigation System

SAND2023-05661O The proactive intrusion detection and mitigation system (PIDMS) provides grid-edge situational awareness for cybersecurity defense by capturing real-time distributed energy resource (DER) network traffic and performance data with a novel approach that improves the detection and prevention of cyber-physical attacks. The PIDMS addresses the grid-edge security gap with real-time analysis of both network traffic and photovoltaic performance data to deliver a novel, cyber-physical intrusion detection system (IDS) approach that increases the accuracy and effectiveness of detection and mitigation. This hybrid IDS analysis enables dual monitoring that increases the workload of the adversary; both cyber and physical data would have to be simultaneously spoofed to evade detection. Furthermore, monitoring and analyzing cyber data are insufficient in some cases. For example, in an insider threat aimed at disrupting inverter grid-support functions where proper credentials and authentication are achieved, only the altered PV performance would indicate abnormal behavior. All in all, the PIDMS provides novel capabilities for: • Distributed, real-time cyber-physical detection and mitigation analysis • Cybersecurity defense for grid-edge systems • Analysis framework that can provide situational awareness across the transmission, distribution, and DER systems The PIDMS sensor is designed to collect cyber-physical data, process the data using machine-learning algorithms, detect abnormal events, and deploy mitigations. With these goals, the main functional PIDMS objectives are: • Capability to collect cyber-physical data • Onboard storage of cyber-physical data • Peer-to-peer communication • Computationally efficient machine-learning algorithms • Online cyber-physical data analysis • Alerting/visualization capabilities • Mitigation deployment capability with bump-in-the-wire (BITW) implementation Each of these functional objectives enable PIDMS to perform effective cyber-physical intrusion detection and mitigation. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Jones, Christian↗

An improved iteration loop for the three dimensional quasi-static particle-in-cell algorithm: QuickPIC

We present improvements to the three-dimensional (3D) quasi-static particle-in-cell (PIC) algorithm, which is used to efficiently model short-pulse laser and particle beam–plasma interactions. In this algorithm the fields including the index of refraction created by a static particle/laser beam are calculated. These fields are then used to advance the particle/laser beam forward in time (distance). For a 3D quasi-static code, calculating the wake fields is done using a two-dimensional (2D) PIC code where the time variable is ξ=ct-z and z is the propagation direction of the particle/laser beam. When calculating the wake, the fields, particle positions and momenta are not naturally time centered so an iterative predictor corrector loop is required. In the previous iterative loop in QuickPIC (currently the only 3D quasi-static PIC code), the field equations are derived using the Lorentz gauge. Here we describe a new algorithm which uses gauge independent field equations. It is found that with this new algorithm, the results converge to the results from fully explicitly PIC codes with far fewer iterations (typically 1 iteration as compared to 2–8) for a wide range of problems. In addition, we describe a new deposition scheme for directly depositing the time derivative of the current that is needed in one of the field equations. The new deposition scheme does not require message passing for the particles inside the iteration loop, which greatly improves the speed for parallelized calculations. Comparisons of results from the new and old algorithms and to fully explicit PIC codes are also presented.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Neural Networks-Based Inverter Control: Modeling and Adaptive Optimization for Smart Distribution Networks

The optimal voltage control of inverter-based resources, especially under the high penetration of solar photovoltaics, is critical to the stability of the distribution power system. However, the computational complexity as well as the coordinated operation performance of the voltage control optimization in the distribution power system limits the real-time applications. To mitigate this issue, a model-free based adaptive optimal control scheme for the smart inverter is proposed to maximize the active power generation, minimize the power loss, and maintain the bus voltages in smart distribution networks. An inverter-based optimization model for coordinated operation is first established, considering the uncertainties of renewable power generation. Subsequently, by collecting the data and control strategies, the neural networks (NNs) based algorithm is proposed to efficiently predict the best possible control strategy. The main objective of this scheme is to accurately predict candidate optimal solutions with near-negligible feasibility and optimization gaps, with the advantage of avoiding complicated iteration-based numerical algorithms. Thereafter, the co-simulation among OpenDSS, MATLAB, and Python is set up to fully take advantage of the three individual software. Experiments are conducted based on different control parameter characteristics and structures of NNs. Finally, the results reveal that an average mean squared error of 0.013 and 1 ms response time are achieved, which is lower than some state-of-the-art methods.

42 ENGINEERING↗

A DVH-guided IMRT optimization algorithm for automatic treatment planning and adaptive radiotherapy replanning

Purpose: To develop a novel algorithm that incorporates prior treatment knowledge into intensity modulated radiation therapy optimization to facilitate automatic treatment planning and adaptive radiotherapy (ART) replanning. Methods: The algorithm automatically creates a treatment plan guided by the DVH curves of a reference plan that contains information on the clinician-approved dose-volume trade-offs among different targets/organs and among different portions of a DVH curve for an organ. In ART, the reference plan is the initial plan for the same patient, while for automatic treatment planning the reference plan is selected from a library of clinically approved and delivered plans of previously treated patients with similar medical conditions and geometry. The proposed algorithm employs a voxel-based optimization model and navigates the large voxel-based Pareto surface. The voxel weights are iteratively adjusted to approach a plan that is similar to the reference plan in terms of the DVHs. If the reference plan is feasible but not Pareto optimal, the algorithm generates a Pareto optimal plan with the DVHs better than the reference ones. If the reference plan is too restricting for the new geometry, the algorithm generates a Pareto plan with DVHs close to the reference ones. In both cases, the new plans have similar DVH trade-offs as the reference plans. Results: The algorithm was tested using three patient cases and found to be able to automatically adjust the voxel-weighting factors in order to generate a Pareto plan with similar DVH trade-offs as the reference plan. The algorithm has also been implemented on a GPU for high efficiency. Conclusions: A novel prior-knowledge-based optimization algorithm has been developed that automatically adjust the voxel weights and generate a clinical optimal plan at high efficiency. It is found that the new algorithm can significantly improve the plan quality and planning efficiency in ART replanning and automatic treatment planning.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Nonlinear burn control in ITER using adaptive allocation of actuators with uncertain dynamics

Abstract ITER will be the first tokamak to sustain a fusion-producing, or burning, plasma. If the plasma temperature were to inadvertently rise in this burning regime, the positive correlation between temperature and the fusion reaction rate would establish a destabilizing positive feedback loop. Careful regulation of the plasma’s temperature and density, or burn control, is required to prevent these potentially reactor-damaging thermal excursions, neutralize disturbances and improve performance. In this work, a Lyapunov-based burn controller is designed using a full zero-dimensional nonlinear model. An adaptive estimator manages destabilizing uncertainties in the plasma confinement properties and the particle recycling conditions (caused by plasma–wall interactions). The controller regulates the plasma density with requests for deuterium and tritium particle injections. In ITER-like plasmas, the fusion-born alpha particles will primarily heat the plasma electrons, resulting in different electron and ion temperatures in the core. By considering separate response models for the electron and ion energies, the proposed controller can independently regulate the electron and ion temperatures by requesting that different amounts of auxiliary power be delivered to the electrons and ions. These two commands for a specific control effort (electron and ion heating) are sent to an actuator allocation module that optimally maps them to the heating actuators available to ITER: an electron cyclotron heating system (20 MW), an ion cyclotron heating system (20 MW), and two neutral beam injectors (16.5 MW each). Two different actuator allocators are presented in this work. The first actuator allocator finds the optimal mapping by solving a convex quadratic program that includes actuator saturation and rate limits. It is nonadaptive and assumes that the mapping between the commanded control efforts and the allocated actuators (i.e. the effector model) contains no uncertainties. The second actuator allocation module has an adaptive estimator to handle uncertainties in the effector model. This uncertainty includes actuator efficiencies, the fractions of neutral beam heating that are deposited into the plasma electrons and ions, and the tritium concentration of the fueling pellets. Furthermore, the adaptive allocator considers actuator dynamics (actuation lag) that contain uncertainty. This adaptive allocation algorithm is more computationally efficient than the aforementioned nonadaptive allocator because it is computed using dynamic update laws so that finding the solution to a static optimization problem is not required at every time step. A simulation study assesses the performance of the proposed adaptive burn controller augmented with each of the actuator allocation modules.

Physics↗

Reconstruction and identification of pairs of collimated τ-leptons decaying hadronically using s=13 TeV pp collision data with the ATLAS detector

This paper describes an algorithm for reconstructing and identifying a highly collimated hadronically decaying τ$$\tau $$-lepton pair with low transverse momentum. When two τ$$\tau $$-leptons are highly collimated, their visible decay products might overlap, degrading the reconstruction performance for each of the τ$$\tau $$-leptons. A dedicated treatment attempting to tag the τ$$\tau $$-lepton pair as a single object is required. The reconstruction algorithm is based on a large radius jet and its associated two leading subjets, and the identification uses a boosted decision tree to discriminate between signatures from τ+τ-$$\tau ^+\tau ^-$$ systems and those arising from QCD jets. The efficiency of the identification algorithm is measured in Zγ$$Z\gamma $$ events using proton–proton collision data at s=13$$\sqrt{s}=13$$ TeV collected by the ATLAS experiment at the Large Hadron Collider between 2015 and 2018, corresponding to an integrated luminosity of 139fb-1$$139\,\text{ fb}^{-1}$$. The resulting data-to-simulation scale factors are close to unity with uncertainties ranging from 26 to 37%.

Aad, G↗

Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems

We present a quantum eigenstate filtering algorithm based on quantum signal processing (QSP) and minimax polynomials. The algorithm allows us to efficiently prepare a target eigenstate of a given Hamiltonian, if we have access to an initial state with non-trivial overlap with the target eigenstate and have a reasonable lower bound for the spectral gap. We apply this algorithm to the quantum linear system problem (QLSP), and present two algorithms based on quantum adiabatic computing (AQC) and quantum Zeno effect respectively. Both algorithms prepare the final solution as a pure state, and achieves the near optimal $\mathcal{\tilde{O}}$(dκlog(1/ϵ)) query complexity for a d -sparse matrix, where κ is the condition number, and ϵ is the desired precision. Neither algorithm uses phase estimation or amplitude amplification.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗