Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “triangular network”

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.

46 records · Page 3

SymProp: Scaling Sparse Symmetric Tucker Decomposition via Symmetry Propagation

Sparse symmetric tensors are an important class of tensors, and their decompositions serve as powerful tools for revealing low-rank structures. This paper introduces SymProp, a novel approach for scaling sparse symmetric Tucker decomposition by propagating symmetry through intermediate computations. SymProp optimizes two key computational kernels: Sparse Symmetric Tensor Times Same Matrix chain (S3 TTMc) for Higher-Order Orthogonal Iteration (HOOI) and Sparse Symmetric Tensor Times Same Matrix chain Times Core (S3 TTMcTC) for Higher-Order QR Iteration (HOQRI). Our method employs a metaprogramming-based index iteration approach to efficiently handle the upper triangular parts of intermediate dense symmetric tensors. SymProp achieves up to 50.9× speedup over SPLATT and up to 360.8× over Compressed Sparse Symmetric (CSS) format on the S3 TTMc operation. Moreover, our S3 TTMc and S3 TTMcTC implementations support tensor orders four levels higher than state-of-the-art methods. Our HOQRI demonstrates superior scalability and up to a 33.6× speedup over optimized HOOI. By enabling more scalable Tucker decompositions for higher orders, decomposition ranks, and dimension sizes, SymProp opens new possibilities for analyzing complex hypergraph structures in fields such as network science, data mining, and machine learning.

Li, Zecheng [North Carolina State University]↗

Tomo2Mesh: Fast Reconstruction and Visualization of Tomography Data in Mesh Format

Tomo2Mesh is an open-source project targeted towards real-time reconstruction, segmentation, and visualization of computed tomography (CT) data in mesh format. The CT reconstruction scheme is based on filtered back-projection of voxel subsets. The segmentation scheme uses a 3D convolutional neural network. To allow for fast, real-time reconstruction, voxel subsets are first identified by coarse reconstruction. The detail in specific regions of interest is improved through full reconstruction of voxel subsets in that region. Data structures are implemented to store and process voxel subsets. Finally, voxel data is labeled using connected components to detect disconnected regions such as voids whose morphological attributes (e.g., Feret diameter, principal axis orientation, local number density, size, etc.) can be measured also in real-time. Finally, a fast marching cubes implementation processes labeled voxel data into a triangular face mesh (vertices and faces) in .ply format for visualization in Paraview or other mesh visualization tools. The code provides a simple programming interface for detecting, classifying, and visualizing regions of interest based on morphology. For example, detected voids can be classified as round pores or extended cracks. Highly porous neighborhoods can be identified based on local number density. The mesh texture (or color) is assigned based these morphological attributes to allow smart visualization scenarios in real-time (e.g., show only long cracks). At the time of first release (July 2022), extraction of face mesh for visualization for raw CT data from a 2 megapixel camera would take between 1-5 minutes for most scenarios.

TEKAWADE, ANIKET↗

Hidden frustration in the triangular-lattice antiferromagnet NdCd 3 ⁢P 3

We report a study of the magnetic ground state and crystal electric field (CEF) scheme in the triangular-lattice antiferromagnet NdCd 3 ⁢P 3 . Combined neutron scattering, magnetization, and heat capacity measurements demonstrate that the Nd 3+ moments occupying the triangular lattice in this material harbor hidden signs of frustration not detected in typical Curie-Weiss-based parametrization of the frustration index (𝑓 = Θ 𝐶⁢𝑊 /𝑇 𝑁 ). This is evidenced by a zero-field splitting of the Kramers' ground state and first excited state doublets at temperatures far in excess of 𝑇 𝑁 as well as signatures of low-energy fluctuations for 𝑇 ≫ 𝑇 𝑁 . As a result, a suppression of the zero-field ordered moment relative to its field saturation value is observed, and the impacts of this magnetic frustration as well as the coexisting bond frustration in the CdP honeycomb network on the physical properties of NdCd 3 ⁢P3 are discussed.

Frustrated magnetism↗

Topological effects on separation of alkane isomers in metal–organic frameworks

Polymorphism in metal–organic frameworks (MOFs) means that the same chemical building blocks (nodes and linkers) can be used to construct isomeric MOFs with different topological networks. The choice of topology can substantially impact the pore network of the MOF, changing the sizes and shapes of the pores, which has implications for adsorption and separation applications. Here, we look at the influence of topology in 38 polymorphic MOFs on the separation of linear and branched C4–C6 alkane isomers, a separation of great importance to the petrochemical industry. We find that the MOF Cu 2 (1,4-benzenedicarboxylate) in nbo topology (nbo-Cu 2 BDC) has particularly high affinity for linear alkanes due to its small pore size, which excludes the branched isomers. Upon studying this MOF in further detail, we find that it can take either of two conformations: a cubic conformation, which is typical of nbo MOFs, and a unique star conformation that contains 1D triangular and hexagonal channels. The determination of which conformation the MOF will adopt depends on steric effects between the nodes and linkers.

42 ENGINEERING↗

Programmable interactions and emergent geometry in an array of atom clouds

Interactions govern the flow of information and the formation of correlations between constituents of many-body quantum systems, dictating phases of matter found in nature and forms of entanglement generated in the laboratory. Typical interactions decay with distance and thus produce a network of connectivity governed by geometry—such as the crystalline structure of a material or the trapping sites of atoms in a quantum simulator. However, many envisioned applications in quantum simulation and computation require more complex coupling graphs including non-local interactions, which feature in models of information scrambling in black hole, and mappings of hard optimization problems onto frustrated classical magnets. Here we describe the realization of programmable non-local interactions in an array of atomic ensembles within an optical cavity, in which photons carry information between atomic spins. By programming the distance dependence of the interactions, we access effective geometries for which the dimensionality, topology and metric are entirely distinct from the physical geometry of the array. As examples, we engineer an antiferromagnetic triangular ladder, a Möbius strip with sign-changing interactions and a treelike geometry inspired by concepts of quantum gravity. The tree graph constitutes a toy model of holographic duality, in which the quantum system lies on the boundary of a higher-dimensional geometry that emerges from measured correlations. Overall, our work provides broader prospects for simulating frustrated magnets and topological phases, investigating quantum optimization paradigms and engineering entangled resource states for sensing and computation.

74 ATOMIC AND MOLECULAR PHYSICS↗

FPGA Acceleration of GCN in Light of the Symmetry of Graph Adjacency Matrix

Graph Convolutional Neural Networks (GCNs) are widely used to process large-scale graph data. Different from deep neural networks (DNNs), GCNs are sparse, irregular, and unstructured, posing unique challenges to hardware acceleration with regular processing elements (PEs). In particular, the adjacency matrix of a GCN is extremely sparse, leading to frequent but irregular memory access, low spatial/temporal data locality and poor data reuse. Furthermore, a realistic graph usually consists of unstructured data (e.g., unbalanced distributions), creating significantly different processing times and imbalanced workload for each node in GCN acceleration. To overcome these challenges, we propose an end-to-end hardware-software co-design to accelerate GCNs on resource-constrained FPGAs with the features including: (1) A custom dataflow that leverages symmetry along the diagonal of the adjacency matrix to accelerate feature aggregation for undirected graphs. We utilize either the upper or the lower triangular matrix of the adjacency matrix to perform aggregation in GCN to improve data reuse. (2) Unified compute cores for both aggregation and transform phases, with full support to the symmetry-based dataflow. These cores can be dynamically reconfigured to the systolic mode for transformation or as individual accumulators for aggregation in GCN processing. (3) Preprocessing of the graph in software to rearrange the edges and features to match the custom dataflow. This step improves the regularity in memory access and data reuse in the aggregation phase. Moreover, we quantize the GCN precision from FP32 to INT8 to reduce the memory footprint without losing the inference accuracy. We implement our accelerator design in Intel Stratix10 MX FPGA board with HBM2, and demonstrate 1.3x-110.5x improvement in end-to-end GCN latency as compared to the state-of the-art FPGA implementations, on the graph datasets of Cora, Pubmed, Citeseer and Reddit.

Nair, Gopikrishnan R.↗

A data-driven approach to real-time vertical position estimation for NSTX-U vertical stability control

In this paper, a database of 77 996 plasma equilibrium reconstructions from 727 discharges during the initial operation of the NSTX-U spherical tokamak is analyzed to develop a statistically robust model of the plasma vertical position for real-time control. A variety of regression models are developed and tested, ranging in complexity from linear models to deep neural networks, and including input signals ranging from the four pairs of flux loops used historically on NSTX-U up to the full set of 389 real-time signals available to the plasma control system. A linear model based on 140 real-time magnetics signals is found to offer excellent accuracy, with a coefficient of determination R 2 = 0.906. The robustness of this model to limited training data, new operating scenarios, and signal errors is tested, and a procedure is demonstrated to tune the model parameters to optimize its robustness. A time-dependent plasma equilibrium solver, TokaMaker, is used to simulate vertical stability control in NSTX-U, demonstrating that it should be possible to iteratively tune the parameters of a linear vertical position model to stabilize both positive and negative triangularity plasmas in future experiments.

magnetic diagnostics↗

Magnetic properties of the double trillium lattice antiferromagnet KBaCr 2 ⁢(PO 4 ) 3

Trillium lattices formed by corner-shared triangular units are the platform for magnetic frustration in three dimensions. Herein, we report structural and magnetic properties of the Cr-based (S = 3/2) double trillium lattice material KBaCr 2 ⁢(PO 4 ) 3 studied by x-ray diffraction, dc and ac magnetization, heat capacity, thermal conductivity, and 31 P nuclear magnetic resonance (NMR) measurements complemented by density-functional band-structure calculations. Magnetization, heat capacity, and 31 P NMR measurements reveal the magnetic transition at T N⁢1 ≃ 12.5 K in zero field followed by another transition (T N⁢2 ) at low temperatures in weak applied fields. The 31 P spin-lattice relaxation rate in the ordered state follows the T 3 behavior indicative of the two-magnon Raman process. Finally, the spin lattice of KBaCr 2 ⁢(PO 4 ) 3 comprises two crystallographically nonequivalent ferromagnetic sublattices that are coupled antiferromagnetically, thus eliminating frustration in this trillium network and leading to weak ferromagnetism in the vicinity of T N⁢1 .

36 MATERIALS SCIENCE↗

Solutions Are the Problem: Ordered Two-Dimensional Covalent Organic Framework Films by Chemical Vapor Deposition

Covalent organic frameworks (COFs) are a promising class of crystalline polymer networks that are useful due to their high porosity, versatile functionality, and tunable architecture. Conventional solution-based methods of producing COFs are marred by slow reactions that produce powders that are difficult to process into adaptable form factors for functional applications, and there is a need for facile and fast synthesis techniques for making crystalline and ordered covalent organic framework (COF) thin films. In this work, we report a chemical vapor deposition (CVD) approach utilizing co-evaporation of two monomers onto a heated substrate to produce highly crystalline, defect-free COF films and coatings with hydrazone, imine, and ketoenamine COF linkages. Further, this all-in-one synthesis technique produces highly crystalline, 40 nm–1 μm-thick COF films on Si/SiO2 substrates in less than 30 min. Crystallinity and alignment were proven by using a combination of grazing-incidence wide-angle X-ray scattering (GIWAXS) and transmission electron microscopy (TEM), and successful conversion of the monomers to produce the target COF was supported by Raman spectroscopy, X-ray photoelectron spectroscopy (XPS), and UV–vis measurements. Additionally, we used atomic force microscopy (AFM) to investigate the growth mechanisms of these films, showing the coalescence of triangular crystallites into a smooth film. To show the wide applicability and scope of the CVD process, we also prepared crystalline ordered COF films with imine and ketoenamine linkages. These films show potential as high-quality size exclusion membranes, catalytic platforms, and organic transistors.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Machine-learning modeling of magnetization dynamics in quasi-equilibrium and driven metallic spin systems

Here, we present a perspective on recent progress in machine-learning (ML) force-field approaches for large-scale Landau–Lifshitz–Gilbert (LLG) simulations of metallic spin systems. Building on a generalization of the Behler–Parrinello (BP) architecture originally developed for quantum molecular dynamics, we develop scalable and transferable ML models that faithfully capture the complex, environment-dependent electron-mediated exchange fields characteristic of itinerant magnets. A central ingredient of this framework is the implementation of symmetry-aware magnetic descriptors based on group-theoretical bispectrum formalisms. Leveraging these ML force fields, LLG simulations faithfully reproduce hallmark non-collinear magnetic orders—such as the 120° and tetrahedral states—on the triangular lattice, and successfully capture the complex spin textures emerging in the mixed-phase states of a square-lattice double-exchange model under thermal quench. We further discuss a generalized potential theory that extends the BP formalism to incorporate both conservative and nonconservative electronic torques, thereby enabling ML models to learn nonequilibrium exchange fields from computationally demanding microscopic approaches such as nonequilibrium Green’s-function techniques. This extension yields quantitatively accurate predictions of voltage-driven domain-wall motion and establishes a foundation for quantum-accurate, multiscale modeling of nonequilibrium spin dynamics and spintronic functionalities.

Descriptors↗