SEARCH · Search NASA

Results for “algorithmic structures”

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.

SourceResearch connectionFrom yearThrough year

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

At least 1,567 records · Page 87

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Iterated projected position algorithm for constructing exponentially localized generalized Wannier functions for periodic and nonperiodic insulators in two dimensions and higher

Localized bases play an important role in understanding electronic structure. In periodic insulators, a natural choice of localized basis is given by the Wannier functions which depend on a choice of unitary transform known as a gauge transformation. Over the past few decades, there have been many works that have focused on optimizing the choice of the gauge so that the corresponding Wannier functions are maximally localized or reflect some symmetry of the underlying system. In this work, we consider fully nonperiodic materials where the usual Wannier functions are not well defined and gauge optimization is impractical. To tackle the problem of calculating exponentially localized generalized Wannier functions in both periodic and nonperiodic systems, we discuss the ‘iterated projected position (IPP)” algorithm. Here, the IPP algorithm is based on matrix diagonalization and therefore unlike optimization-based approaches, it does not require initialization and cannot get stuck at a local minimum. Furthermore, the IPP algorithm is guaranteed by a rigorous analysis to produce exponentially localized functions under certain mild assumptions. We numerically demonstrate that the IPP algorithm can be used to calculate exponentially localized bases for the Haldane model, the Kane-Mele model (in both Z 2 invariant even and Z 2 invariant odd phases), and the p x + ip y model on a quasicrystal lattice.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2014

SU-E-T-362: Automatic Catheter Reconstruction of Flap Applicators in HDR Surface Brachytherapy

Purpose: Catheter reconstruction is crucial for the accurate delivery of radiation dose in HDR brachytherapy. The process becomes complicated and time-consuming for large superficial clinical targets with a complex topology. A novel method for the automatic catheter reconstruction of flap applicators is proposed in this study. Methods: We have developed a program package capable of image manipulation, using C++class libraries of The-Visualization-Toolkit(VTK) software system. The workflow for automatic catheter reconstruction is: a)an anchor point is placed in 3D or in the axial view of the first slice at the tip of the first, last and middle points for the curved surface; b)similar points are placed on the last slice of the image set; c)the surface detection algorithm automatically registers the points to the images and applies the surface reconstruction filter; d)then a structured grid surface is generated through the center of the treatment catheters placed at a distance of 5mm from the patient's skin. As a result, a mesh-style plane is generated with the reconstructed catheters placed 10mm apart. To demonstrate automatic catheter reconstruction, we used CT images of patients diagnosed with cutaneous T-cell-lymphoma and imaged with Freiburg-Flap-Applicators (Nucletron™-Elekta, Netherlands). The coordinates for each catheter were generated and compared to the control points selected during the manual reconstruction for 16catheters and 368control point Results: The variation of the catheter tip positions between the automatically and manually reconstructed catheters was 0.17mm(SD=0.23mm). The position difference between the manually selected catheter control points and the corresponding points obtained automatically was 0.17mm in the x-direction (SD=0.23mm), 0.13mm in the y-direction (SD=0.22mm), and 0.14mm in the z-direction (SD=0.24mm). Conclusion: This study shows the feasibility of the automatic catheter reconstruction of flap applicators with a high level of positioning accuracy. Implementation of this technique has potential to decrease the planning time and may improve overall quality in superficial brachytherapy.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2018

An Algorithm for Enhancing the Image Contrast of Electron Tomography

Abstract Three-dimensional (3D) reconstruction of a single protein molecule is essential for understanding the relationship between the structural dynamics and functions of the protein. Electron tomography (ET) provides a tool for imaging an individual particle of protein from a series of tilted angles. Individual-particle electron tomography (IPET) provides an approach for reconstructing a 3D density map from a single targeted protein particle (without averaging from different particles of this type of protein), in which the target particle was imaged from a series of tilting angles. However, owing to radiation damage limitations, low-dose images (high noise, and low image contrast) are often challenging to be aligned for 3D reconstruction at intermediate resolution (1–3 nm). Here, we propose a computational method to enhance the image contrast, without increasing any experimental dose, for IPET 3D reconstruction. Using an edge-preserving smoothing-based multi-scale image decomposition algorithm, this method can detect the object against a high-noise background and enhance the object image contrast without increasing the noise level or significantly decreasing the image resolution. The method was validated by using both negative staining (NS) ET and cryo-ET images. The successful 3D reconstruction of a small molecule (<100 kDa) indicated that this method can be used as a supporting tool to current ET 3D reconstruction methods for studying protein dynamics via structure determination from each individual particle of the same type of protein.

47 OTHER INSTRUMENTATION↗

DOE OSTI2014

Oscillator strengths and transition probabilities from the Breit–Pauli R-matrix method: Ne IV

The atomic parameters–oscillator strengths, line strengths, radiative decay rates (A), and lifetimes–for fine structure transitions of electric dipole (E1) type for the astrophysically abundant ion Ne IV are presented. The results include 868 fine structure levels with n≤ 10, l≤ 9, and 1/2≤J≤ 19/2 of even and odd parities, and the corresponding 83,767 E1 transitions. The calculations were carried out using the relativistic Breit–Pauli R-matrix method in the close coupling approximation. The transitions have been identified spectroscopically using an algorithm based on quantum defect analysis and other criteria. The calculated energies agree with the 103 observed and identified energies to within 3% or better for most of the levels. Some larger differences are also noted. The A-values show good to fair agreement with the very limited number of available transitions in the table compiled by NIST, but show very good agreement with the latest published multi-configuration Hartree–Fock calculations. The present transitions should be useful for diagnostics as well as for precise and complete spectral modeling in the soft X-ray to infra-red regions of astrophysical and laboratory plasmas. -- Highlights: •The first application of BPRM method for accurate E1 transitions in Ne IV is reported. •Amount of atomic data (n going up to 10) is complete for most practical applications. •The calculated energies are in very good agreement with most observed levels. •Very good agreement of A-values and lifetimes with other relativistic calculations. •The results should provide precise nebular abundances, chemical evolution etc.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2020

Computing Bottleneck Structures at Scale for High-Precision Network Performance Analysis

The Theory of Bottleneck Structures is a recently-developed framework for studying the performance of data networks. It describes how local perturbations in one part of the network propagate and interact with others. This framework is a powerful analytical tool that allows network operators to make accurate predictions about network behavior and thereby optimize performance. Previous work implemented a software package for bottleneck structure analysis, but applied it only to toy examples. In this work, we introduce the first software package capable of scaling bottleneck structure analysis to production-size networks. Here, we benchmark our system using logs from ESnet, the Department of Energy's high-performance data network that connects research institutions in the U.S. Using the previously published tool as a baseline, we demonstrate that our system achieves vastly improved performance, constructing the bottleneck structure graphs in 0.21 s and calculating link derivatives in 0.09 s on average. We also study the asymptotic complexity of our core algorithms, demonstrating good scaling properties and strong agreement with theoretical bounds. These results indicate that our new software package can maintain its fast performance when applied to even larger networks. They also show that our software is efficient enough to analyze rapidly changing networks in real time. Overall, we demonstrate the feasibility of applying bottleneck structure analysis to solve practical problems in large, real-world data networks.

benchmark↗

DOE OSTI2021

Algorithm advances and applications of time‐dependent first‐principles simulations for ultrafast dynamics

Abstract Far from equilibrium phenomenon is a central theme of contemporary material research. Such phenomenon can exhibit itself in atomic structure and dynamics, but very often it also happens as non‐equilibrium phenomenon in the electronic structure. In ab initio material simulation, density functional theory (DFT) has played an essential role in studying electronic ground state problems. For excited states, besides many‐body perturbation theory, another powerful tool is the time dependent DFT (TDDFT) method. In particular, the real‐time TDDFT (rt‐TDDFT) method can be used to simulate many non‐equilibrium phenomena directly. Here we introduce our works on some algorithm advances based on our recently rt‐TDDFT method. This method uses the plane‐wave basis set, and significantly accelerates its efficiency by increasing the time step from 0.1–1 as in traditional methods to 0.2–0.5 fs. The noncollinear magnetic moments and spin–orbit coupling have also been included in our rt‐TDDFT method. Furthermore, a Boltzmann‐TDDFT algorithm has been developed to solve the hot carrier overheating problem in Ehrenfest dynamics, and a natural orbital branching algorithm has been developed to overcome the mean‐field approximation in Ehrenfest dynamics nuclear trajectory, thus allows stochastic multiple paths in chemical reactions. Utilizing these methods, we have studied the photoinduced ultrafast demagnetization, ultrafast phase transition, energy transfer between plasmon and hot carriers, as well as the high‐energy ion implantation and low‐energy atomic diffusion in semiconductors. We believe the tools as the ones introduced here can enable us to study a wide range of phenomena which are of great interest in modern day material research. This article is categorized under: Structure and Mechanism > Computational Materials Science Electronic Structure Theory > Ab Initio Electronic Structure Methods Electronic Structure Theory > Density Functional Theory

Liu, Wen‐Hao↗

DOE OSTI2021

Electronic structure of mononuclear Cu-based molecule from density-functional theory with self-interaction correction

In this paper, we investigate the electronic structure of a planar mononuclear Cu-based molecule [Cu(C 6 H 4 S 2 ) 2 ] z in two oxidation states ( z = –2, –1) using density-functional theory (DFT) with Fermi–Löwdin orbital (FLO) self-interaction correction (SIC). The dianionic Cu-based molecule was proposed to be a promising qubit candidate. Self-interaction error within approximate DFT functionals renders severe delocalization of electron and spin densities arising from 3 d orbitals. The FLO-SIC method relies on optimization of Fermi–Löwdin orbital descriptors (FODs) with which localized occupied orbitals are constructed to create SIC potentials. Starting with many initial sets of FODs, we employ a frozen-density loop algorithm within the FLO-SIC method to study the Cu-based molecule. We find that the electronic structure of the molecule remains unchanged despite somewhat different final FOD configurations. In the dianionic state (spin S = 1/2), FLO-SIC spin density originates from the Cu d and S p orbitals with an approximate ratio of 2:1, in quantitative agreement with multireference calculations, while in the case of SIC-free DFT, the orbital ratio is reversed. Overall, FLO-SIC lowers the energies of the occupied orbitals and, in particular, the 3 d orbitals unhybridized with the ligands significantly, which substantially increases the energy gap between the highest occupied molecular orbital (HOMO) and the lowest unoccupied molecular orbital (LUMO) compared to SIC-free DFT results. The FLO-SIC HOMO–LUMO gap of the dianionic state is larger than that of the monoanionic state, which is consistent with experiment. Our results suggest a positive outlook of the FLO-SIC method in the description of magnetic exchange coupling within 3 d -element-based systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2026

Dynamic Transmission Line Switching Amid Wildfire-Prone Weather Under Decision-Dependent Uncertainty

During dry and windy seasons, environmental conditions significantly increase the risk of wildfires, exposing power grids to disruptions caused by transmission line failures. Wildfire propagation exacerbates grid vulnerability, potentially leading to prolonged power outages. To address this challenge, we propose a multistage optimization model that dynamically adjusts transmission grid topology in response to wildfire propagation, aiming to develop an optimal response policy. By accounting for decision-dependent uncertainty, where line survival probabilities depend on usage, we employ distributionally robust optimization to model uncertainty in line survival distributions. We adapt the stochastic nested decomposition algorithm and derive a deterministic upper bound for its finite convergence. To enhance computational efficiency, we exploit the Lagrangian dual problem structure for a faster generation of Lagrangian cuts. Using realistic data from the California transmission grid, we demonstrate the superior performance of dynamic response policies against two-stage alternatives through a comprehensive case study. In addition, after solving the multistage formulation, we construct easy-to-implement policies that significantly reduce computational burden while maintaining good performance in real-time deployment. History: Accepted by Russell Bent, Area Editor for Network Optimization: Algorithms and Applications. Funding: This work was supported by the U.S. Department of Energy, Office of Electricity [Grant DE-AC02-05CH11231]. The work of R. Jiang was supported in part by the U.S. National Science Foundation, Division of Electrical, Communications and Cyber Systems [Grant ECCS-1845980] and the U.S. Air Force Office of Scientific Research [Grant FA9550-23-1-0323]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2025.1210 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2025.1210 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Estrada-Garcia, Juan-Alberto↗

DOE OSTI2022

Materials structure–property factorization for identification of synergistic phase interactions in complex solar fuels photoanodes

Abstract Properties can be tailored by tuning composition in high-order composition spaces. For spaces with complex phase behavior, modeling the properties as a function of composition and phase distribution remains a formidable challenge. We present materials structure–property factorization (MSPF) as an approach to automate modeling of such data and identify synergistic phase interactions. MSPF is an interpretable machine learning algorithm that couples phase mapping via Deep Reasoning Networks (DRNets) to matrix factorization-based modeling of the representative properties of each phase in a dataset. MSPF is demonstrated for Bi–Cu–V oxide photoanodes for solar fuel generation, which contains 25 different phase combinations and correspondingly exhibits complex composition-structure-photoactivity relationships. Comparing the measured photoactivity to a learned model for non-interacting phases, synergistic phase interactions are identified to guide further photoactivity optimization and understanding. MSPF identifies synergistic interactions of a BiVO 4 -like phase with both Cu 2 V 2 O 7 -like and CuV 2 O 6 -like phases, creating avenues for understanding complex photoelectrocatalysts.

36 MATERIALS SCIENCE↗

DOE OSTI2019

Quantum simulations of excited states with active-space downfolded Hamiltonians

Many-body techniques based on the double unitary coupled cluster ansatz (DUCC) can be used to downfold electronic Hamiltonians into low-dimensional active spaces. It can be shown that the resulting dimensionality reduced Hamiltonians are amenable for quantum computing. Recent studies performed for several benchmark systems using quantum phase estimation (QPE) algorithms demonstrated that these formulations can recover a significant portion of ground-state dynamical correlation effects that stem from the electron excitations outside of the active space. These results have also been confirmed in studies of ground-state potential energy surfaces using quantum simulators. In this letter, we study the effectiveness of the DUCC formalism in describing excited states. We also emphasize the role of the QPE formalism and its stochastic nature in discovering/identifying excited states or excited-state processes in situations when the knowledge about the true configurational structure of a sought after excited state is limited or postulated (due to the specific physics driving excited-state processes of interest). In this context, we can view the QPE algorithm as an engine for verifying various hypotheses for excited-state processes and providing statistically meaningful results that correspond to the electronic state(s) with the largest overlap with a postulated configurational structure. We illustrate these ideas on examples of strongly cor- related molecular systems, characterized by small energy gaps and high density of quasi-degenerate states around the Fermi level.

quantum chemistry, quantum computing, computationa↗

DOE OSTI2021

Algorithm-Driven Advances for Scientific CT Instruments: From model-based to deep learning-based approaches

Multiscale 3D characterization is widely used by materials scientists to further their understanding of the relationships between microscopic structure and macroscopic function. Scientific computed tomography (SCT) instruments are one of the most popular choices for 3D nondestructive characterization of materials at length scales ranging from the angstrom scale to the micron scale. These instruments typically have a source of radiation (such as electrons, X-rays, or neutrons) that interacts with the sample to be studied and a detector assembly to capture the result of this interaction (see Figure 1 ). A collection of such high-resolution measurements is made by reorienting the sample, which is mounted on a specially designed stage/holder after which reconstruction algorithms are used to produce the final 3D volume of interest. The specific choice of which instrument to use depends on the desired resolution and properties of the materials being imaged. Additionally, the end goal of SCT scans includes determining the morphology, chemical composition, or dynamic behavior of materials when subjected to external stimuli. In summary, SCT instruments are powerful tools that enable 3D characterization across multiple length scales and play a critical role in furthering the understanding of the structure–function relationships of different materials.

42 ENGINEERING↗

DOE OSTI2015

Pairwise Sequence Alignment Library

Vector extensions, such as SSE, have been part of the x86 CPU since the 1990s, with applications in graphics, signal processing, and scientific applications. Although many algorithms and applications can naturally benefit from automatic vectorization techniques, there are still many that are difficult to vectorize due to their dependence on irregular data structures, dense branch operations, or data dependencies. Sequence alignment, one of the most widely used operations in bioinformatics workflows, has a computational footprint that features complex data dependencies. The trend of widening vector registers adversely affects the state-of-the-art sequence alignment algorithm based on striped data layouts. Therefore, a novel SIMD implementation of a parallel scan-based sequence alignment algorithm that can better exploit wider SIMD units was implemented as part of the Parallel Sequence Alignment Library (parasail). Parasail features: Reference implementations of all known vectorized sequence alignment approaches. Implementations of Smith Waterman (SW), semi-global (SG), and Needleman Wunsch (NW) sequence alignment algorithms. Implementations across all modern CPU instruction sets including AVX2 and KNC. Language interfaces for C/C++ and Python.

Jeff Daily, PNNL↗

DOE OSTI2015

Pairwise Sequence Alignment Library

Jeff Daily, PNNL↗

DOE OSTI2023

Entropic control of the free-energy landscape of an archetypal biomolecular machine

Biomolecular machines are complex macromolecular assemblies that utilize thermal and chemical energy to perform essential, multistep, cellular processes. Despite possessing different architectures and functions, an essential feature of the mechanisms of action of all such machines is that they require dynamic rearrangements of structural components. Surprisingly, biomolecular machines generally possess only a limited set of such motions, suggesting that these dynamics must be repurposed to drive different mechanistic steps. Although ligands that interact with these machines are known to drive such repurposing, the physical and structural mechanisms through which ligands achieve this remain unknown. Using temperature-dependent, single-molecule measurements analyzed with a time-resolution-enhancing algorithm, here, we dissect the free-energy landscape of an archetypal biomolecular machine, the bacterial ribosome, to reveal how its dynamics are repurposed to drive distinct steps during ribosome-catalyzed protein synthesis. Specifically, we show that the free-energy landscape of the ribosome encompasses a network of allosterically coupled structural elements that coordinates the motions of these elements. Moreover, we reveal that ribosomal ligands which participate in disparate steps of the protein synthesis pathway repurpose this network by differentially modulating the structural flexibility of the ribosomal complex (i.e., the entropic component of the free-energy landscape). Here, we propose that such ligand-dependent entropic control of free-energy landscapes has evolved as a general strategy through which ligands may regulate the functions of all biomolecular machines. Such entropic control is therefore an important driver in the evolution of naturally occurring biomolecular machines and a critical consideration for the design of synthetic molecular machines.

Science & Technology - Other Topics↗

DOE OSTI2014

Ligand placement based on prior structures: the guided ligand-replacement method

A new module, Guided Ligand Replacement (GLR), has been developed in Phenix to increase the ease and success rate of ligand placement when prior protein-ligand complexes are available. The process of iterative structure-based drug design involves the X-ray crystal structure determination of upwards of 100 ligands with the same general scaffold (i.e. chemotype) complexed with very similar, if not identical, protein targets. In conjunction with insights from computational models and assays, this collection of crystal structures is analyzed to improve potency, to achieve better selectivity and to reduce liabilities such as absorption, distribution, metabolism, excretion and toxicology. Current methods for modeling ligands into electron-density maps typically do not utilize information on how similar ligands bound in related structures. Even if the electron density is of sufficient quality and resolution to allow de novo placement, the process can take considerable time as the size, complexity and torsional degrees of freedom of the ligands increase. A new module, Guided Ligand Replacement (GLR), was developed in Phenix to increase the ease and success rate of ligand placement when prior protein–ligand complexes are available. At the heart of GLR is an algorithm based on graph theory that associates atoms in the target ligand with analogous atoms in the reference ligand. Based on this correspondence, a set of coordinates is generated for the target ligand. GLR is especially useful in two situations: (i) modeling a series of large, flexible, complicated or macrocyclic ligands in successive structures and (ii) modeling ligands as part of a refinement pipeline that can automatically select a reference structure. Even in those cases for which no reference structure is available, if there are multiple copies of the bound ligand per asymmetric unit GLR offers an efficient way to complete the model after the first ligand has been placed. In all of these applications, GLR leverages prior knowledge from earlier structures to facilitate ligand placement in the current structure.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2014

A hybrid reconstruction algorithm for fast and accurate 4D cone-beam CT imaging

Purpose: 4D cone beam CT (4D-CBCT) has been utilized in radiation therapy to provide 4D image guidance in lung and upper abdomen area. However, clinical application of 4D-CBCT is currently limited due to the long scan time and low image quality. The purpose of this paper is to develop a new 4D-CBCT reconstruction method that restores volumetric images based on the 1-min scan data acquired with a standard 3D-CBCT protocol. Methods: The model optimizes a deformation vector field that deforms a patient-specific planning CT (p-CT), so that the calculated 4D-CBCT projections match measurements. A forward-backward splitting (FBS) method is invented to solve the optimization problem. It splits the original problem into two well-studied subproblems, i.e., image reconstruction and deformable image registration. By iteratively solving the two subproblems, FBS gradually yields correct deformation information, while maintaining high image quality. The whole workflow is implemented on a graphic-processing-unit to improve efficiency. Comprehensive evaluations have been conducted on a moving phantom and three real patient cases regarding the accuracy and quality of the reconstructed images, as well as the algorithm robustness and efficiency. Results: The proposed algorithm reconstructs 4D-CBCT images from highly under-sampled projection data acquired with 1-min scans. Regarding the anatomical structure location accuracy, 0.204 mm average differences and 0.484 mm maximum difference are found for the phantom case, and the maximum differences of 0.3–0.5 mm for patients 1–3 are observed. As for the image quality, intensity errors below 5 and 20 HU compared to the planning CT are achieved for the phantom and the patient cases, respectively. Signal-noise-ratio values are improved by 12.74 and 5.12 times compared to results from FDK algorithm using the 1-min data and 4-min data, respectively. The computation time of the algorithm on a NVIDIA GTX590 card is 1–1.5 min per phase. Conclusions: High-quality 4D-CBCT imaging based on the clinically standard 1-min 3D CBCT scanning protocol is feasible via the proposed hybrid reconstruction algorithm.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2015

Analysis of dynamic radiation level changes using surface networks [Book Chapter]

The Fukushima nuclear accident reminds us of severe risk of radioactive substances. Citizen scientists voluntarily collect and share radiation data using geo-tagged sensors for radiation preparedness. However, radiation levels are affected by a number of factors including for example weather conditions, naturally occurring radioactive materials (NORM), and large marble structures. It is therefore difficult to determine whether a higher radiation level comes from a normal variation in background or not. This research analyzes the radiation changes using surface networks that can be used to characterize complex surfaces. A new algorithm has been developed to identify salient peaks and their hills by merging insignificant peaks recur-sively. Salient peaks and their hills are converted into graphs. The structural similarities of graphs were compared over time. The radiation measurements in the city of Koriyama, Japan were analyzed as a case study. The results demonstrated that structural analysis of dynamic radiation levels revealed stable changes, while numeric analysis of radiation levels presented statistically significant differences. This method is able to detect radiation level changes irrespective of background variations.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

An Intelligent Distributed Ledger Construction Algorithm for IoT

Blockchain is the next generation of secure data management that creates near-immutable decentralized storage. Secure cryptography created a niche for blockchain to provide alternatives to well-known security compromises. However, design bottlenecks with traditional blockchain data structures scale poorly with increased network usage and are extremely computation-intensive. This made the technology difficult to combine with limited devices, like those in Internet of Things networks. In protocols like IOTA, replacement of blockchain's linked-list queue processing with a lightweight dynamic ledger showed remarkable throughput performance increase. However, current stochastic algorithms for ledger construction suffer distinct trade-offs between efficiency and security. This work proposed a machine-learning approach with a multi-arm bandit that resolved these issues and was designed for auditing on limited devices. This algorithm was tested in a reinforcement-learning environment simulating the IOTA ledger's construction with a decision tree. This study showed through regret analysis and experimentation that this approach was secure against impulse manipulation attacks while remaining energy-efficient. Although the IOTA protocol was a pioneer for lightweight distributed ledgers, it is expected that future blockchain protocols will adopt techniques similar to those presented in this work.

multi-arm bandit↗