Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithms and data structure”

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 559 records · Page 31

Atomic electron tomography in three and four dimensions

Atomic electron tomography (AET) has become a powerful tool for atomic-scale structural characterization in three and four dimensions. It provides the ability to correlate structures and properties of materials at the single-atom level. With recent advances in data acquisition methods, iterative three-dimensional (3D) reconstruction algorithms, and post-processing methods, AET can now determine 3D atomic coordinates and chemical species with sub-Angstrom precision, and reveal their atomic-scale time evolution during dynamical processes. In this work, we review the recent experimental and algorithmic developments of AET and highlight several groundbreaking experiments, which include pinpointing the 3D atom positions and chemical order/disorder in technologically relevant materials and capturing how atoms rearrange during early nucleation at four-dimensional atomic resolution.

30 DIRECT ENERGY CONVERSION↗

End-to-end deep learning pipeline for real-time Bragg peak segmentation: from training to large-scale deployment

X-ray crystallography reconstruction, which transforms discrete X-ray diffraction patterns into three-dimensional molecular structures, relies critically on accurate Bragg peak finding for structure determination. As X-ray free electron laser (XFEL) facilities advance toward MHz data rates (1 million images per second), traditional peak finding algorithms that require manual parameter tuning or exhaustive grid searches across multiple experiments become increasingly impractical. While deep learning approaches offer promising solutions, their deployment in high-throughput environments presents significant challenges in automated dataset labeling, model scalability, edge deployment efficiency, and distributed inference capabilities. We present an end-to-end deep learning pipeline with three key components: (1) a data engine that combines traditional algorithms with our peak matching algorithm to generate high-quality training data at scale, (2) a modular architecture that scales from a few million to hundreds of million parameters, enabling us to train large expert-level models offline while deploying smaller, distilled models at the edge, and (3) a decoupled producer-consumer architecture that separates specialized data source layer from model inference, enabling flexible deployment across diverse computing environments. Using this integrated approach, our pipeline achieves accuracy comparable to traditional methods tuned by human experts while eliminating the need for experiment-specific parameter tuning. Although current throughput requires optimization for MHz facilities, our system's scalable architecture and demonstrated model compression capabilities provide a foundation for future high-throughput XFEL deployments.

Wang, Cong↗

SHELXT – Integrated space-group and crystal-structure determination

SHELXT automates routine small-molecule structure determination starting from single-crystal reflection data, the Laue group and a reasonable guess as to which elements might be present. The new computer program SHELXT employs a novel dual-space algorithm to solve the phase problem for single-crystal reflection data expanded to the space group P1. Missing data are taken into account and the resolution extended if necessary. All space groups in the specified Laue group are tested to find which are consistent with the P1 phases. After applying the resulting origin shifts and space-group symmetry, the solutions are subject to further dual-space recycling followed by a peak search and summation of the electron density around each peak. Elements are assigned to give the best fit to the integrated peak densities and if necessary additional elements are considered. An isotropic refinement is followed for non-centrosymmetric space groups by the calculation of a Flack parameter and, if appropriate, inversion of the structure. The structure is assembled to maximize its connectivity and centred optimally in the unit cell. SHELXT has already solved many thousand structures with a high success rate, and is optimized for multiprocessor computers. It is, however, unsuitable for severely disordered and twinned structures because it is based on the assumption that the structure consists of atoms.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Labeling sequential data from noisy annotations

Crowdsourcing algorithms often work under the assumption that the data samples are independent. Recent work has shown that data dependence, such as temporal correlations in sequential data, can be leveraged to improve the label quality. Existing methods that exploit this special structure rely on third-order statistics of the annotator outputs to ensure the identifiability of key latent parameters, which are costly to acquire. This work proposes an approach for integrating crowdsourced annotations under the Dawid-Skene/Hidden Markov Model (DS-HMM) for sequential data based on second-order statistics, which naturally enjoys a lower sample complexity. An effective algorithm is proposed to tackle the challenging optimization problem associated with the proposed estimator. Numerical experiments showcase the effectiveness of the data labeling paradigm.

Marrinan, Timothy P.↗

Dynamical Classification of Trans-Neptunian Objects Detected by the Dark Energy Survey

The outer solar system contains a large number of small bodies (known as trans-Neptunian objects or TNOs) that exhibit diverse types of dynamical behavior. The classification of bodies in this distant region into dynamical classes—subpopulations that experience similar orbital evolution—aids in our understanding of the structure and formation of the solar system. In this work, we propose an updated dynamical classification scheme for the outer solar system. This approach includes the construction of a new (automated) method for identifying mean motion resonances. We apply this algorithm to the current data set of TNOs observed by the Dark Energy Survey (DES) and present a working classification for all of the DES TNOs detected to date. Our classification scheme yields 1 inner centaur, 19 outer centaurs, 21 scattering disk objects, 47 detached TNOs, 48 securely resonant objects, 7 resonant candidates, and 97 classical belt objects. Among the scattering and detached objects, we detect 8 TNOs with semimajor axes greater than 150 au.

79 ASTRONOMY AND ASTROPHYSICS↗

ForceFit: a code to fit classical force fields to ab-initio potential energy surfaces

The ForceFit program package has been developed for fitting classical force field parameters based upon a force matching algorithm to quantum mechanical gradients of configurations that span the potential energy surface of the system. The program, which runs under Unix and is written in C++, is an easy to use, nonproprietary platform that enables gradient fitting of a wide variety of functional force field forms to quantum mechanical information obtained from an array of common electronic structure codes. All aspects of the fitting process are run from a graphical user interface, from the parsing of quantum mechanical data, assembling of a potential energy surface database, setting the force field and variables to be optimized, choosing a molecular mechanics code for comparison to the reference data, and finally, the initiation of a least squares minimization algorithm. Furthermore, the code is based on a modular templated code design that enables the facile addition of new functionality to the program.

74 ATOMIC AND MOLECULAR PHYSICS↗

Beyond Taylor’s hypothesis: a novel volumetric reconstruction of velocity and density fields for variable‑density and shear flows

Abstract This work presents a novel numerical procedure for reconstructing volumetric density and velocity fields from planar laser-induced fluorescence (PLIF) and stereoscopic particle image velocimetry (SPIV) data. This new method is theoretically and practically demonstrated to provide more accurate 3D vortical structures and density fields in high shear flows than reconstruction methods based on the mean convective velocity. While Taylor’s hypothesis of frozen turbulence is commonly applied by using the local mean streamwise velocity, the proposed algorithm uses the measured local instantaneous velocity for data convection. It consists of a step-by-step reconstruction based on a mixed Lagrangian–Eulerian solver that includes the 3D interpolation of scattered flow data and that relaxes the Taylor’s hypothesis by iterative enforcement of the incompressibility constraint on the velocity field. This methodology provides 3D fields with temporal resolution, spatial resolution, and accuracy comparable to that of real 3D snapshots, thus providing a practical alternative to tomographic measurements. The procedure is validated using numerical data of the constant-density channel flow available on the Johns Hopkins University Turbulence Database (JHTDB), showing the accurate reconstruction of the 3D velocity field. The algorithm is applied to an experimental dataset of PLIF and SPIV measurements of a variable-density jet flow, demonstrating its capability to provide 3D velocity and density fields that are more consistent with the Navier–Stokes equations compared to the mean flow convective method. Graphic abstract

42 ENGINEERING↗

Image reconstruction from sparse data ion synchrotron-radiation-based micro-tomography.

Synchrotron-radiation-based microcomputed-tomography (SR-{micro}CT) is a powerful tool for yielding 3D structural information of high spatial and contrast resolution about a specimen preserved in its natural state. A large number of projection views are required currently for yielding SR-{micro}CT images by use of existing algorithms without significant artifacts. When a wet biological specimen is imaged, synchrotron x-ray radiation from a large number of projection views can result in significant structural deformation within the specimen. A possible approach to reducing imaging time and specimen deformation is to decrease the number of projection views. In the work, using reconstruction algorithms developed recently for medical computed tomography (CT), we investigate and demonstrate image reconstruction from sparse-view data acquired in SR-{micro}CT. Numerical results of our study suggest that images of practical value can be obtained from data acquired at a number of projection views significantly lower than those used currently in a typical SR-{micro}CT imaging experiment.

99 GENERAL AND MISCELLANEOUS↗

Classifying and assembling two-dimensional X-ray laser diffraction patterns of a single particle to reconstruct the three-dimensional diffraction intensity function: resolution limit due to the quantum noise

A new algorithm is developed for reconstructing the high-resolution three-dimensional diffraction intensity function of a globular biological macromolecule from many quantum-noise-limited two-dimensional X-ray laser diffraction patterns, each for an unknown orientation. The structural resolution is expressed as a function of the incident X-ray intensity and quantities characterizing the target molecule. A new two-step algorithm is developed for reconstructing the three-dimensional diffraction intensity of a globular biological macromolecule from many experimentally measured quantum-noise-limited two-dimensional X-ray laser diffraction patterns, each for an unknown orientation. The first step is classification of the two-dimensional patterns into groups according to the similarity of direction of the incident X-rays with respect to the molecule and an averaging within each group to reduce the noise. The second step is detection of common intersecting circles between the signal-enhanced two-dimensional patterns to identify their mutual location in the three-dimensional wavenumber space. The newly developed algorithm enables one to detect a signal for classification in noisy experimental photon-count data with as low as ∼0.1 photons per effective pixel. The wavenumber of such a limiting pixel determines the attainable structural resolution. From this fact, the resolution limit due to the quantum noise attainable by this new method of analysis as well as two important experimental parameters, the number of two-dimensional patterns to be measured (the load for the detector) and the number of pairs of two-dimensional patterns to be analysed (the load for the computer), are derived as a function of the incident X-ray intensity and quantities characterizing the target molecule.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Protein crystal structure from non-oriented, single-axis sparse X-ray data

X-ray free-electron lasers (XFELs) have inspired the development of serial femtosecond crystallography (SFX) as a method to solve the structure of proteins. SFX datasets are collected from a sequence of protein microcrystals injected across ultrashort X-ray pulses. The idea behind SFX is that diffraction from the intense, ultrashort X-ray pulses leaves the crystal before the crystal is obliterated by the effects of the X-ray pulse. The success of SFX at XFELs has catalyzed interest in analogous experiments at synchrotron-radiation (SR) sources, where data are collected from many small crystals and the ultrashort pulses are replaced by exposure times that are kept short enough to avoid significant crystal damage. The diffraction signal from each short exposure is so `sparse' in recorded photons that the process of recording the crystal intensity is itself a reconstruction problem. Using the EMC algorithm, a successful reconstruction is demonstrated here in a sparsity regime where there are no Bragg peaks that conventionally would serve to determine the orientation of the crystal in each exposure. In this proof-of-principle experiment, a hen egg-white lysozyme (HEWL) crystal rotating about a single axis was illuminated by an X-ray beam from an X-ray generator to simulate the diffraction patterns of microcrystals from synchrotron radiation. Millions of these sparse frames, typically containing only ~200 photons per frame, were recorded using a fast-framing detector. It is shown that reconstruction of three-dimensional diffraction intensity is possible using the EMC algorithm, even with these extremely sparse frames and without knowledge of the rotation angle. Further, the reconstructed intensity can be phased and refined to solve the protein structure using traditional crystallographic software. In conclusion, this suggests that synchrotron-based serial crystallography of micrometre-sized crystals can be practical with the aid of the EMC algorithm even in cases where the data are sparse.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Oak Ridge National Laboratory Pilot Demonstration of an Attestation and Anomaly Detection Framework using Distributed Ledger Technology for Power Grid Infrastructure

This report summarizes the design and pilot demonstration of a framework called Grid Guard that was created to provide increased data and device trustworthiness to electric grid devices by leveraging distributed ledger technology (DLT), specifically blockchain. Grid Guard contains a combination of core cryptographic methods such as the secure hash algorithm (SHA), and asymmetric cryptography, private permissioned blockchain, baselining configuration data, consensus algorithm (Raft) and the Hyperledger Fabric (HLF) framework. The system implements a low energy, fast, and robust enhancement to system trustworthiness within and across electric grid systems such as substations, control centers and metering infrastructures. Blockchain is a distributed database structured that provides a practically unalterable (immutable) timeline of stored transactions. By relying on hashing and the Raft consensus algorithm, if an entity tries to illegitimately alter a record at one instance of the database the other ledger nodes are not altered. They work to cross-reference each other and easily locate any incorrectly added data and remove it. The bulk raw data is stored in an off-chain storage (outside of the blockchain ledger) and a hash of this baseline data is stored in the Blockchain ledger via hashing windows of time-series and configuration data, after aggregation and filtering. The bulk off-chain data repository is then considered to be trust-anchored using the hashes stored in the blockchain. To secure the electric grid testbed devices and data, device configuration baselines were compared to those baselines that had been previously stored in the ledger. Statistical baselines for device configurations, network communication patterns, and high-speed sensor data are calculated and then stored off-chain and hashes stored in the ledger. Measurements such as three-phase voltage and current, frequency, breaker status, protection scheme settings, network configuration settings (and other device configuration artifacts) and network traffic features (packet interarrival times) are compared every minute or other selected time windows. During phase 1 of the Grid Guard DLT project different DLT technologies were studies, and an assessment was performed on DLT technology vulnerabilities, uses, and key characteristics. DLT consensus protocols were studies (e.g., RAFT, named after Reliable, Replicated, Redundant, And Fault-Tolerant). Also, cryptography, public, private and permissioned or permissionless systems were assessed. Grid Guard implements a permissioned private DLT. Consensus algorithm selection and choice of DLT implementation depended heavily on the use-case. For this use-case, parameters were selected to measure performance and existing tools for assessment. Benchmarking was performed theoretically and practically. During phase 2 hashed transactions/blocks were inserted into the ledger every second. During phase 2 of the Grid Guard DLT project, a prototype framework was developed and demonstrated for attestation of critical substation devices and data using precision timing systems that use PTP and IRIG-B protocols) on a testbed of operational devices that emulated a distribution substation, control center, and power metering infrastructure using real Operational Technology (OT). The testbed includes OT devices such as protective relays, human machine interfaces (HMI), and power meters. To determine when to collect and compare system and network baselines, an initial examination of an anomaly detection capability to identify malicious manipulation of data streams was conducted. The resulting anomaly detection was demonstrated in a set of experiments and leveraged to trigger device artifact attestation checks. Attestation checks occur against device configuration baselines when compared with the immutable blockchain-stored baselines, which provided a cryptographically supported means by which to store baselines. The electrical substation-grid testbed was created to test the Grid Guard framework. The testbed emulates the operations of a portion of a power grid and SCADA systems as closely as possible. The testbed integrates real protocols, mainly IEC 61850 standard protocols, such as the Sampled Value (SV) and the GOOSE protocols. The testbed also supports DNP3 and other layer 2 and layer 3 protocols such as Telnet, SSH, SFTP/FTP and other proprietary protocols needed to connect to industrial control system equipment. The testbed emulates real power conditions using the OpalRT hardware-in-the-loop (HIL) device which can create fault situations that cannot be easily tested on real systems. The electrical substation-grid testbed was created using real measurement, communication, and protection devices that electrical utilities commonly use.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Shape-constrained Input Estimation for Efficient Multi-shaker Vibration Testing

Multi-shaker vibration testing is gaining interest from structural dynamics test engineers as it can provide a much more accurate match to complicated field vibration responses than traditional single-axis shaker tests. However, the force capabilities of the small modal shakers typically used in multi-shaker vibration tests has limited the achievable response levels. To date, most multi-shaker vibration tests have been performed using a variety of standard, commercially-available control systems. While these control systems are adequate for a wide range of multiple-input/multiple-output tests, their control algorithms have not been tailored for the specific problem of multi-shaker vibration tests: efficiently coordinating the various shakers to work together to achieve a desired response. Here, a new input estimation algorithm is developed and demonstrated using simulations and actual test data. This algorithm, dubbed shape-constrained input estimation, is shown to effectively coordinate multiple shakers using a set of constraint vectors based on the deflection shapes of the test structure. This is accomplished by using the singular vector shapes of the system frequency response matrix, which allows the constraint vectors to automatically change as a function of frequency. Simulation and test results indicate a significant reduction in the input forces required to achieve a desired response. Finally, the results indicate that shape-constrained input estimation is an effective method to achieve higher response levels from limited shaker forces which will enable higher level multi-shaker vibration tests to be performed.

42 ENGINEERING↗

SU-E-I-87: Automated Liver Segmentation Method for CBCT Dataset by Combining Sparse Shape Composition and Probabilistic Atlas Construction

Purpose: The aiming of this study was to extract liver structures for daily Cone beam CT (CBCT) images automatically. Methods: Datasets were collected from 50 intravenous contrast planning CT images, which were regarded as training dataset for probabilistic atlas and shape prior model construction. Firstly, probabilistic atlas and shape prior model based on sparse shape composition (SSC) were constructed by iterative deformable registration. Secondly, the artifacts and noise were removed from the daily CBCT image by an edge-preserving filtering using total variation with L1 norm (TV-L1). Furthermore, the initial liver region was obtained by registering the incoming CBCT image with the atlas utilizing edge-preserving deformable registration with multi-scale strategy, and then the initial liver region was converted to surface meshing which was registered with the shape model where the major variation of specific patient was modeled by sparse vectors. At the last stage, the shape and intensity information were incorporated into joint probabilistic model, and finally the liver structure was extracted by maximum a posteriori segmentation.Regarding the construction process, firstly the manually segmented contours were converted into meshes, and then arbitrary patient data was chosen as reference image to register with the rest of training datasets by deformable registration algorithm for constructing probabilistic atlas and prior shape model. To improve the efficiency of proposed method, the initial probabilistic atlas was used as reference image to register with other patient data for iterative construction for removing bias caused by arbitrary selection. Results: The experiment validated the accuracy of the segmentation results quantitatively by comparing with the manually ones. The volumetric overlap percentage between the automatically generated liver contours and the ground truth were on an average 88%–95% for CBCT images. Conclusion: The experiment demonstrated that liver structures of CBCT with artifacts can be extracted accurately for following adaptive radiation therapy. This work is supported by National Natural Science Foundation of China (No. 61201441), Research Fund for Excellent Young and Middle-aged Scientists of Shandong Province (No. BS2012DX038), Project of Shandong Province Higher Educational Science and Technology Program (No. J12LN23), Jinan youth science and technology star (No.20120109)

60 APPLIED LIFE SCIENCES↗

Structure Learning and Statistical Estimation in Distribution Networks - Part I

Traditionally power distribution networks are either not observable or only partially observable. This complicates development and implementation of new smart grid technologies, such as those related to demand response, outage detection and management, and improved load-monitoring. In this two part paper, inspired by proliferation of the metering technology, we discuss estimation problems in structurally loopy but operationally radial distribution grids from measurements, e.g. voltage data, which are either already available or can be made available with a relatively minor investment. In Part I, the objective is to learn the operational layout of the grid. Part II of this paper presents algorithms that estimate load statistics or line parameters in addition to learning the grid structure. Further, Part II discusses the problem of structure estimation for systems with incomplete measurement sets. Our newly suggested algorithms apply to a wide range of realistic scenarios. The algorithms are also computationally efficient – polynomial in time– which is proven theoretically and illustrated computationally on a number of test cases. The technique developed can be applied to detect line failures in real time as well as to understand the scope of possible adversarial attacks on the grid.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Benchmarking Multipacting Simulations in VORPAL

We will present the results of benchmarking simulations run to test the ability of VORPAL to model multipacting processes in Superconducting Radio Frequency structures. VORPAL is an electromagnetic (FDTD) particle-in-cell simulation code originally developed for applications in plasma and beam physics. The addition of conformal boundaries and algorithms for secondary electron emission allow VORPAL to be applied to multipacting processes. We start with simulations of multipacting between parallel plates where there are well understood theoretical predictions for the frequency bands where multipacting is expected to occur. We reproduce the predicted multipacting bands and demonstrate departures from the theoretical predictions when a more sophisticated model of secondary emission is used. Simulations of existing cavity structures developed at Jefferson National Laboratories will also be presented where we compare results from VORPAL to experimental data.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Characterization of IgG1 Conformation and Conformational Dynamics by Hydrogen/Deuterium Exchange Mass Spectrometry

Protein function is dictated by protein conformation. For the protein biopharmaceutical industry, therefore, it is important to have analytical tools that can detect changes in protein conformation rapidly, accurately, and with high sensitivity. In this paper we show that hydrogen/deuterium exchange mass spectrometry (H/DX-MS) can play an important role in fulfilling this need within the industry. H/DX-MS was used to assess both global and local conformational behavior of a recombinant monoclonal IgG1 antibody, a major class of biopharmaceuticals. Analysis of exchange into the intact, glycosylated IgG1 (and the Fab and Fc regions thereof) showed that the molecule was folded, highly stable, and highly amenable to analysis by this method using less than a nanomole of material. With improved chromatographic methods, peptide identification algorithms and data-processing steps, the analysis of deuterium levels in peptic peptides produced after labeling was accomplished in 1--2 days. On the basis of peptic peptide data, exchange was localized to specific regions of the antibody. Changes to IgG1 conformation as a result of deglycosylation were determined by comparing exchange into the glycosylated and deglycosylated forms of the antibody. Two regions of the IgG1 (residues 236-253 and 292-308) were found to have altered exchange properties upon deglycosylation. These results are consistent with previous findings concerning the role of glycosylation in the interaction of IgG1 with Fc receptors. Moreover, the data clearly illustrate how H/DX-MS can provide important characterization information on the higher order structure of antibodies and conformational changes that these molecules may experience upon modification.

59 BASIC BIOLOGICAL SCIENCES↗

Robust reconstruction of single-cell RNA-seq data with iterative gene weight updates

Single-cell RNA-sequencing technologies have greatly enhanced our understanding of heterogeneous cell populations and underlying regulatory processes. However, structural (spatial or temporal) relations between cells are lost during cell dissociation. These relations are crucial for identifying associated biological processes. Many existing tissue-reconstruction algorithms use prior information about subsets of genes that are informative with respect to the structure or process to be reconstructed. When such information is not available, and in the general case when the input genes code for multiple processes, including being susceptible to noise, biological reconstruction is often computationally challenging. We propose an algorithm that iteratively identifies manifold-informative genes using existing reconstruction algorithms for single-cell RNA-seq data as subroutine. We show that our algorithm improves the quality of tissue reconstruction for diverse synthetic and real scRNA-seq data, including data from the mammalian intestinal epithelium and liver lobules.

59 BASIC BIOLOGICAL SCIENCES↗

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗