Proactive Frequency Stability Scheme Based on Bayesian Filters and Spectral Clustering
Not Available
SEARCH · Engineering Papers
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.
Not Available
Fermilab has been running a Ceph cluster in production for several years to support high-throughput scientific computing. Our primary use case is CephFS, which serves interactive data analysis workloads, with growing interest in using RGW for scalable object storage of scientific datasets. In this talk, we'll share lessons learned from successfully deploying and maintaining our Ceph cluster with cephadm, including challenges faced, performance tuning, and operational practices. We'll also present custom tools we've developed to streamline monitoring and management and discuss how Ceph fits into our broader storage architecture for large-scale scientific research.
We have constructed the first all-sky map of the thermal Sunyaev-Zeldovich (tSZ) effect by applying specifically tailored component separation algorithms to the 100 to 857 GHz frequency channel maps from the Planck survey. This map shows an obvious galaxy cluster tSZ signal that is well matched with blindly detected clusters in the Planck SZ catalogue. To characterize the signal in the tSZ map we have computed its angular power spectrum. At large angular scales (ℓ < 60), the major foreground contaminant is the diffuse thermal dust emission. At small angular scales (ℓ > 500) the clustered cosmic infrared background and residual point sources are the major contaminants. These foregrounds are carefully modelled and subtracted. We thus measure the tSZ power spectrum over angular scales 0.17° ≲ θ ≲ 3.0° that were previously unexplored. The measured tSZ power spectrum is consistent with that expected from the Planck catalogue of SZ sources, with clear evidence of additional signal from unresolved clusters and, potentially, diffuse warm baryons. Marginalized band-powers of the Planck tSZ power spectrum and the best-fit model are given. The non-Gaussianity of the Compton parameter map is further characterized by computing its 1D probability distribution function and its bispectrum. The measured tSZ power spectrum and high order statistics are used to place constraints on σ 8 .
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.
This is the Final Report for Ohio State University for the NUCLEI SciDAC3 project. In addition to the local OSU summary given here, we have attached a global NUCLEI summary and a list of papers and talks by the full collaboration, with OSU contributions marked in red. The NUCLEI project, as defined by the scope of work, developed, implemented and ran codes for largescale computations of many topics in lowenergy nuclear physics. Physics studied included the properties of nuclei and nuclear decays, nuclear structure and reactions, and the properties of nuclear matter. The computational techniques used included Quantum Monte Carlo, Configuration Interaction, Coupled Cluster, InMedium SRG, and Density Functional methods. The research program emphasized areas of high interest to current and possible future DOE nuclear physics facilities, including ATLAS and FRIB (nuclear structure and reactions, and nuclear astrophysics), TJNAF (neutron distributions in nuclei, few body systems, and electroweak processes), NIF (thermonuclear reactions), MAJORANA and FNPB (neutrinoless doublebeta decay and physics beyond the Standard Model), and LANSCE (fission studies). Research at Ohio State University played an integral role in NUCLEI by providing input microscopic interactions and operators needed for ab initio structure and reaction calculations including uncertainty quantification, independent ab initio calculations using the inmedium similarity renormalization group (IMSRG), and developing microscopic constraints for the nextgeneration energy density functionals (EDF). Much of the theoretical work at OSU was closely coordinated with the theory team at Michigan State University. Although the OSU group did not usually directly develop codes for the highest performance computing components of NUCLEI, we provided needed inputs for much of the effort. In particular, our work contributes to the “Validated Nuclear Interactions” task as well as to both of the “Structure and Reactions” tasks.
Here, in this study, we introduce a novel approach to coupled-cluster Green's function (CCGF) embedding by seamlessly integrating conventional CCGF theory with the state-of-the-art sub-system embedding sub-algebras coupled cluster (SES-CC) formalism. This integration focuses primarily on delineating the characteristics of the sub-system and the corresponding segments of the Green's function, defined explicitly by active orbitals. Crucially, our work involves the adaptation of the SES-CC paradigm, addressing the left eigenvalue problem through a distinct form of Hamiltonian similarity transformation. This advancement not only facilitates a comprehensive representation of the interaction between the embedded sub-system and its surrounding environment but also paves the way for the quantum mechanical description of multiple embedded domains, particularly by employing the emergent quantum flow algorithms. Our theoretical underpinnings further set the stage for a generalization to multiple embedded sub-systems. This expansion holds significant promise for the exploration and application of non-equilibrium quantum systems, enhancing the understanding of system–environment interactions. In doing so, the research underscores the potential of SES-CC embedding within the realm of quantum computations and multi-scale simulations, promising a good balance between accuracy and computational efficiency.
Traffic analysis is a core element in network operations and management for various purposes including change detection, traffic prediction, and anomaly detection. In this paper, we introduce a new approach to online traffic analysis based on a pattern-based representation for high-level summarization of the traffic measurement data. Unlike the past online analysis techniques limited to a single variable to summarize (e.g., sketch), the focus of this study is on capturing the network state from the multivariate attributes under consideration. To this end, we employ clustering with its benefit of the aggregation of multidimensional variables. The clustered result represents the state of the network with regard to the monitored variables, which can also be compared with the observed patterns from previous time windows enabling intuitive analysis. Finally, we demonstrate the proposed method with two popular use cases, one for estimating state changes and the other for identifying anomalous states, to confirm its feasibility. Our extensive experimental results with public traces and collected monitoring measurements from ESnet traffic traces show that our pattern-based approach is effective for multivariate analysis of online network traffic with visual and quantitative tools.
Our purpose is to identify a computational level sufficiently dependable and affordable to assess trends in the interaction of a variety of radical or closed shell unsaturated hydro-carbons A adsorbed on soot platelet models B. These systems, of environmental interest, would unavoidably have rather large sizes, thus prompting to explore in this paper the performances of relatively low-level computational methods and compare them with higher-level reference results. To this end, the interaction of three complexes between non-polar species, vinyl radical, ethyne, or ethene (A) with benzene (B) is studied, since these species, involved themselves in growth processes of polycyclic aromatic hydrocarbons (PAHs) and soot particles, are small enough to allow high-level reference calculations of the interaction energy ΔE{sub AB}. Counterpoise-corrected interaction energies ΔE{sub AB} are used at all stages. (1) Density Functional Theory (DFT) unconstrained optimizations of the A−B complexes are carried out, using the B3LYP-D, ωB97X-D, and M06-2X functionals, with six basis sets: 6-31G(d), 6-311 (2d,p), and 6-311++G(3df,3pd); aug-cc-pVDZ and aug-cc-pVTZ; N07T. (2) Then, unconstrained optimizations by Møller-Plesset second order Perturbation Theory (MP2), with each basis set, allow subsequent single point Coupled Cluster Singles Doubles and perturbative estimate of the Triples energy computations with the same basis sets [CCSD(T)//MP2]. (3) Based on an additivity assumption of (i) the estimated MP2 energy at the complete basis set limit [E{sub MP2/CBS}] and (ii) the higher-order correlation energy effects in passing from MP2 to CCSD(T) at the aug-cc-pVTZ basis set, ΔE{sub CC-MP}, a CCSD(T)/CBS estimate is obtained and taken as a computational energy reference. At DFT, variations in ΔE{sub AB} with basis set are not large for the title molecules, and the three functionals perform rather satisfactorily even with rather small basis sets [6-31G(d) and N07T], exhibiting deviation from the computational reference of less than 1 kcal mol{sup −1}. The zero-point vibrational energy corrected estimates Δ(E{sub AB}+ZPE), obtained with the three functionals and the 6-31G(d) and N07T basis sets, are compared with experimental D{sub 0} measures, when available. In particular, this comparison is finally extended to the naphthalene and coronene dimers and to three π−π associations of different PAHs (R, made by 10, 16, or 24 C atoms) and P (80 C atoms)
The principle of least action is the cornerstone of classical mechanics, theory of relativity, quantum mechanics, and thermodynamics. Here, we describe how a neural network (NN) learns to find the trajectory for a Lennard-Jones (LJ) system that maintains balance in minimizing the Onsager–Machlup (OM) action and maintaining the energy conservation. The phase-space trajectory thus calculated is in excellent agreement with the corresponding results from the “ground-truth” molecular dynamics (MD) simulation. Furthermore, we show that the NN can easily find structural transformation pathways for LJ clusters, for example, the basin-hopping transformation of an LJ 38 from an incomplete Mackay icosahedron to a truncated face-centered cubic octahedron. Unlike MD, the NN computes atomic trajectories over the entire temporal domain in one fell swoop, and the NN time step is a factor of 20 larger than the MD time step. The NN approach to OM action is quite general and can be adapted to model morphometrics in a variety of applications.
The topic of this communication pertains to defect formation in irradiated solids such as plasma-facing tungsten submitted to helium implantation in fusion reactor com- ponents, and nuclear fuel (metal and oxides) submitted to volatile ssion product generation in nuclear reactors. The purpose of this progress report is to describe ef- forts towards addressing the prediction of long-time evolution of defects via continuum cluster dynamics simulation. The di culties are twofold. First, realistic, long-time dynamics in reactor conditions leads to a non-dilute di usion regime which is not accommodated by the prevailing dilute, stressless cluster dynamics theory. Second, long-time dynamics calls for a large set of species (ideally an in nite set) to capture all possible emerging defects, and this represents a computational bottleneck. Extensions beyond the dilute limit is a signi cant undertaking since no model has been advanced to extend cluster dynamics to non-dilute, deformable conditions. Here our proposed approach to model the non-dilute limit is to monitor the appearance of a spatially localized void volume fraction in the solid matrix with a bell shape pro le and insert an explicit geometrical bubble onto the support of the bell function. The newly cre- ated internal moving boundary provides the means to account for the interfacial ux of mobile species into the bubble, and the growth of bubbles allows for coalescence phenomena which captures highly non-dilute interactions. We present a preliminary interfacial kinematic model with associated interfacial di usion transport to follow the evolution of the bubble in any number of spatial dimensions and any number of bubbles, which can be further extended to include a deformation theory. Finally we comment on a computational front-tracking method to be used in conjunction with conventional cluster dynamics simulations in the non-dilute model proposed.
The benchmarking effort within the Computational Research & Development Programs at the Oak Ridge National Laboratory (ORNL) seeks to design and enable High Performance Computing (HPC) benchmarks and test suites. The work described in this report is a part of the effort focusing on the comparison and analysis of OpenSHMEM implementations using the Interleave Or Random (IOR) software for benchmarking parallel file system using POSIX, MPIIO, or HDF5 interfaces. We describe the effort to emulate the MPIIO parallel collective capabilities in the IOR benchmark using OpenSHMEM communication. One development effort was in emulating the MPI derived datatype used in the read/write operations and in setting the file view. Another effort was in implementing an internal cache in OpenSHMEM distributed shared memory to facilitate global collective I/O operations. Experiments comparing collective I/O in MPIIO implementations with the OpenSHMEM implementations were performed on the SGI Turing Cluster and the Cray XK7 Titan supercomputer at the Oak Ridge Leadership Computing Facility (OLCF). The preliminary results suggest that on the Cray XK7 Titan, the MPIIO implementations obtained higher write performance and the OpenSHMEM version obtained slightly higher read performance. On the SGI Turing Cluster, the MPIIO implementations obtained slightly higher performance over the OpenSHMEM implementations on large files.
The MB-pol many-body potential accurately predicts many properties of water, including cluster, liquid phase, and vapor–liquid equilibrium properties, but its high computational cost can make applying it in large-scale simulations quite challenging. Here, in order to address this limitation, we developed a “deep potential” neural network (DPMD) model based on the MB-pol potential for water. We find that a DPMD model trained on mostly liquid configurations yields a good description of the bulk liquid phase but severely underpredicts vapor–liquid coexistence densities. By contrast, adding cluster configurations to the neural network training set leads to a good agreement for the vapor coexistence densities. Liquid phase densities under supercooled conditions are also represented well, even though they were not included in the training set. These results confirm that neural network models can combine accuracy and transferability if sufficient attention is given to the construction of a representative training set for the target system.
Laboratory studies of acoustic emission events with seismic signatures have used the point source assumption. Given the millimeter-scale size and clustering of the asperities and the centimeter-scale distances to the sensors, the records can convey information about the source complexity that is not fully revealed in a point source inversion. We develop a finite source inversion technique following Hartzell and Heaton, 1983 to compute the spatiotemporal distribution of slip during rupture of asperities and asperity clusters. First inversions of purely synthetic signals reveal some of the applicability and limitations of the algorithm. A preliminary inversion of one recorded event is included for demonstration. With much further sensitivity analysis and modeling improvements, the resulting slip profiles will provide a new tool for understanding the frictional strength and rupture behaviors of self-similar rough-rough interfaces at any scale.
State-specific orbital optimized approaches are more accurate at predicting core-level spectra than traditional linear-response protocols, but their utility had been restricted due to the risk of "variational collapse" down to the ground state. We employ the recently developed square gradient minimization algorithm to reliably avoid variational collapse and study the effectiveness of orbital optimized density functional theory (DFT) at predicting second period element 1s core-level spectra of open-shell systems. Several density functionals (including SCAN, B3LYP, and ωB97X-D3) are found to predict excitation energies from the core to singly occupied levels with high accuracy (≤0.3 eV RMS error) against available experimental data. Higher excited states are, however, more challenging by virtue of being intrinsically multiconfigurational. We thus present a configuration interaction inspired route to self-consistently recouple single determinant mixed configurations obtained from DFT, in order to obtain approximate doublet states. This recoupling scheme is used to predict the C K-edge spectra of the allyl radical, the O K-edge spectra of CO + , and the N K-edge of NO 2 with high accuracy relative to experiment, indicating substantial promise in using this approach for the computation of core-level spectra for doublet species [vs more traditional time dependent DFT, equation of motion coupled cluster singles and doubles (EOM-CCSD), or using unrecoupled mixed configurations]. Finally, we also present general guidelines for computing core-excited states from orbital optimized DFT.
ABSTRACT Cluster weak lensing is a sensitive probe of cosmology, particularly the amplitude of matter clustering σ8 and matter density parameter Ωm. The main nuisance parameter in a cluster weak lensing cosmological analysis is the scatter between the true halo mass and the relevant cluster observable, denoted $\sigma _{\ln M_\mathrm{ c}}$. We show that combining the cluster weak lensing observable ΔΣ with the projected cluster–galaxy cross-correlation function wp,cg and galaxy autocorrelation function wp,gg can break the degeneracy between σ8 and $\sigma _{\ln M_\mathrm{ c}}$ to achieve tight, per cent-level constraints on σ8. Using a grid of cosmological N-body simulations, we compute derivatives of ΔΣ, wp,cg, and wp,gg with respect to σ8, Ωm, $\sigma _{\ln M_\mathrm{ c}}$, and halo occupation distribution (HOD) parameters describing the galaxy population. We also compute covariance matrices motivated by the properties of the Dark Energy Survey cluster and weak lensing survey and the BOSS CMASS galaxy redshift survey. For our fiducial scenario combining ΔΣ, wp,cg, and wp,gg measured over 0.3−30.0 h−1 Mpc, for clusters at z = 0.35−0.55 above a mass threshold Mc ≈ 2 × 1014 h−1 M⊙, we forecast a $1.4{{\ \rm per\ cent}}$ constraint on σ8 while marginalizing over $\sigma _{\ln M_\mathrm{ c}}$ and all HOD parameters. Reducing the mass threshold to 1 × 1014 h−1 M⊙ and adding a z = 0.15−0.35 redshift bin sharpens this constraint to $0.8{{\ \rm per\ cent}}$. The small-scale (rp < 3.0 h−1 Mpc) ‘mass function’ and large-scale (rp > 3.0 h−1 Mpc) ‘halo-mass cross-correlation’ regimes of ΔΣ have comparable constraining power, allowing internal consistency tests from such an analysis.
In this paper, we analyze the properties of the recently proposed real-time equation-of-motion coupled-cluster (RT-EOM-CC) cumulant Green’s function approach [Rehr et al., J. Chem. Phys. 152, 174113 (2020)]. We specifically focus on identifying the limitations of the original time-dependent coupled cluster (TDCC) ansatz and propose an enhanced double TDCC ansatz, ensuring the exactness in the expansion limit. In addition, we introduce a practical cluster-analysis-based approach for characterizing the peaks in the computed spectral function from the RT-EOM-CC cumulant Green’s function approach, which is particularly useful for the assignments of satellite peaks when many-body effects dominate the spectra. Our preliminary numerical tests focus on reproducing, approximating, and characterizing the exact impurity Green’s function of the three-site and four-site single impurity Anderson models using the RT-EOM-CC cumulant Green’s function approach. The numerical tests allow us to have a direct comparison between the RT-EOM-CC cumulant Green’s function approach and other Green’s function approaches in the numerical exact limit.
This paper introduces a new parallel clustering algorithm, named Feel-the-Way clustering algorithm, that provides better or equivalent convergence rate than the traditional clustering methods by optimizing the synchronization and communication costs. Our algorithm design centers on how to optimize three factors simultaneously: reduced synchronizations, improved convergence rate, and retained same or comparable optimization cost. To compare the optimization cost, we use the Sum of Square Error (SSE) cost as the metric, which is the sum of the square distance between each data point and its assigned clusters. Compared with the traditional MPI k-means algorithm, the new Feel-the-Way algorithm requires less communications among participating processes. As for the convergence rate, the new algorithm requires fewer number of iterations to converge. As for the optimization cost, it obtains the SSE costs that are close to the k-means algorithm. In the paper, we first design the full-step Feel-the-Way k-means clustering algorithm that can significantly reduce the number of iterations that are required by the original k-means clustering method. Next, we improve the performance of the full-step algorithm by adopting an optimized sampling-based approach, named reassignment-history-aware sampling. Our experimental results show that the optimized sampling-based Feel-the-Way method is significantly faster than the widely used k-means clustering method, and can provide comparable optimization costs. More extensive experiments with several synthetic datasets and real-world datasets (e.g., MNIST, CIFAR-10, ENRON, and PLACES-2) show that the new parallel algorithm can outperform the open source MPI k-means library by up to 110% on a high-performance computing system using 4,096 CPU cores. In addition, the new algorithm can take up to 51% fewer iterations to converge than the k-means clustering algorithm.
Simulations of the n = 2 absorption spectra of HeN(N = 70, 150, 231, 300) clusters are reported, with nuclear configurations sampled by path integral molecular dynamics. The electronic structure is treated by a new approach, ALMO-CIS+CT, which is a formulation of configuration interaction singles (CIS) based on absolutely localized molecular orbitals (ALMOs). The method generalizes the previously reported ALMO-CIS model [K. D. Closser et al. J. Chem. Theory Comput. 11, 5791 (2015)] to include spatially localized charge transfer (CT) effects. It is designed to recover large numbers of excited states in atomic and molecular clusters, such as the entire n = 2 Rydberg band in helium clusters. ALMO-CIS+CT is shown to recover most of the error caused by neglecting charge transfer in ALMO-CIS and has comparable accuracy to standard CIS for helium clusters. For the n = 2 band, CT stabilizes states towards the blue edge by up to 0.5 eV. ALMO-CIS+CT retains the formal cubic scaling of ALMO-CIS with respect to system size. With improvements to the implementation over that originally reported for ALMO-CIS, ALMO-CIS+CT is able to treat helium clusters with hundreds of atoms using modest computing resources. Here, a detailed simulation of the absorption spectra associated with the 2s and 2p bands of helium clusters up to 300 atoms is reported, using path integral molecular dynamics with a spherical boundary condition to generate atomic configurations at 3 K. The main features of experimentally reported fluorescence excitation spectra for helium clusters are reproduced.