SEARCH · Search NASA
Results for “GCP”
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.
Reaction Mechanism for the Hydrogen Evolution Reaction on the Basal Plane Sulfur Vacancy Site of MoS 2 Using Grand Canonical Potential Kinetics
We develop the grand canonical potential kinetics (GCP-K) formulation based on thermodynamics from quantum mechanics calculations to provide a fundamental basis for understanding heterogeneous electrochemical reactions. Our GCP-K formulation arises naturally from minimizing the free energy using a Legendre transform relating the net charge of the system and the applied voltage. Performing this macroscopic transformation explicitly allows us to make the connection of GCP-K to the traditional Butler-Volmer kinetics. Using this GCP-K based free energy, we show how to predict both the potential and pH dependent chemistry for a specific example, the hydrogen evolution reaction (HER) at a sulfur vacancy on the basal plane of MoS2.We find that the rate-determining steps in both acidic and basic conditions are the Volmer reaction in which the second hydrogen atom is adsorbed from the solution. Using the GCP-K formulation, we show that the stretched bond distances change continuously as a function of the applied potential. This shows that the main reason for the higher activity in basic conditions is that the transition state is closer to the product, which leads to a more favorable Tafel slope of 60 mV/dec. In contrast if the transition state were closer to the reactant, where the transfer coefficient is less than 0.5 we would obtain a Tafel slope of almost 150 mV/dec. Based on this detailed understanding of the reaction mechanism, we conclude that the second hydrogen at the chalcogenide vacant site is the most active toward the hydrogen evolution reaction. Using this as a descriptor, we compare it to the other 2H group VI metal dichalcogenides and predict that vacancies on MoTe 2 will have the best performance toward HER.
Streaming Generalized Canonical Polyadic Tensor Decompositions
In this paper, we develop a method which we call OnlineGCP for computing the Generalized Canonical Polyadic (GCP) tensor decomposition of streaming data. GCP differs from traditional canonical polyadic (CP) tensor decompositions as it allows for arbitrary objective functions which the CP model attempts to minimize. This approach can provide better fits and more interpretable models when the observed tensor data is strongly non-Gaussian. In the streaming case, tensor data is gradually observed over time and the algorithm must incrementally update a GCP factorization with limited access to prior data. In this work, we extend the GCP formalism to the streaming context by deriving a GCP optimization problem to be solved as new tensor data is observed, formulate a tunable history term to balance reconstruction of recently observed data with data observed in the past, develop a scalable solution strategy based on segregated solves using stochastic gradient descent methods, describe a software implementation that provides performance and portability to contemporary CPU and GPU architectures and integrates with Matlab for enhanced usability, and demonstrate the utility and performance of the approach and software on several synthetic and real tensor data sets.
Tensor decompositions for count data that leverage stochastic and deterministic optimization
There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the maximum likelihood estimator (MLE) of the Poisson CPD model. Here, this work presents two new algorithms that extend state-of-the-art local methods for Poisson CPD. Hybrid GCP-CPAPR combines Generalized Canonical Decomposition (GCP) with stochastic optimization and CP Alternating Poisson Regression (CPAPR), a deterministic algorithm, to increase the probability of converging to the MLE over either method used alone. Restarted CPAPR with SVDrop uses a heuristic based on the singular values of the CPD model unfoldings to identify convergence toward optimizers that are not the MLE and restarts within the feasible domain of the optimization problem, thus reducing overall computational cost when using a multi-start strategy. We provide empirical evidence that indicates our approaches outperform existing methods with respect to converging to the Poisson CPD MLE.
Generalized Canonical Polyadic Tensor Decomposition
Tensor decomposition is a fundamental unsupervised machine learning method in data science, with applications including network analysis and sensor data processing. This work develops a generalized canonical polyadic (GCP) low-rank tensor decomposition that allows other loss functions besides squared error. For instance, we can use logistic loss or Kullback--Leibler divergence, enabling tensor decomposition for binary or count data. We present a variety of statistically motivated loss functions for various scenarios. We provide a generalized framework for computing gradients and handling missing data that enables the use of standard optimization methods for fitting the model. Furthermore, we demonstrate the flexibility of the GCP decomposition on several real-world examples including interactions in a social network, neural activity in a mouse, and monthly rainfall measurements in India.
Stochastic Gradients for Large-Scale Tensor Decomposition
Tensor decomposition is a well-known tool for multiway data analysis. This work proposes using stochastic gradients for efficient generalized canonical polyadic (GCP) tensor decomposition of large-scale tensors. GCP tensor decomposition is a recently proposed version of tensor decomposition that allows for a variety of loss functions such as Bernoulli loss for binary data or Huber loss for robust estimation. Here, the stochastic gradient is formed from randomly sampled elements of the tensor and is efficient because it can be computed using the sparse matricized-tensor times Khatri--Rao product tensor kernel. For dense tensors, we simply use uniform sampling. For sparse tensors, we propose two types of stratified sampling that give precedence to sampling nonzeros. Numerical results demonstrate the advantages of the proposed approach and its scalability to large-scale problems.
Stereoinversion in the diastereoselective acylation of benzoxazine derivatives with 2-aryloxypropionyl chlorides
A comparative study of the kinetic resolution of racemic derivatives of 3,4-dihydro-3-methyl-2H-[1,4]benzoxazine using racemic 2-aryloxypropionyl chlorides was performed. It was found that the acylation of racemic amines with racemic 2-(1-naphthyloxy)propionyl chloride leads to amides enriched with (3R*,2′R*)-diastereomers, while the acylation with 2-phenoxypropionyl chloride gives predominantly (3R*,2′S*)-amides. Quantum chemical modeling of the process of kinetic resolution at the COSMO-CH{sub 2}Cl{sub 2}-B3LYP-D3-gCP/def2-TZVP//B3LYP-D3-gCP/def2-SVP level of theory was performed. The computational results are in a good agreement with the experimental data.
Reaction mechanism and kinetics for CO 2 reduction on nickel single atom catalysts from quantum mechanics
Experiments have shown that graphene-supported Ni-single atom catalysts (Ni-SACs) provide a promising strategy for the electrochemical reduction of CO 2 to CO, but the nature of the Ni sites (Ni-N 2 C 2 , Ni-N 3 C 1 , Ni-N 4 ) in Ni-SACs has not been determined experimentally. Here, we apply the recently developed grand canonical potential kinetics (GCP-K) formulation of quantum mechanics to predict the kinetics as a function of applied potential (U) to determine faradic efficiency, turn over frequency, and Tafel slope for CO and H 2 production for all three sites. We predict an onset potential (at 10 mA cm –2 ) U onset = –0.84 V (vs. RHE) for Ni-N 2 C 2 site and U onset = –0.92 V for Ni-N 3 C 1 site in agreement with experiments, and U onset = –1.03 V for Ni-N 4 . We predict that the highest current is for Ni-N 4 , leading to 700 mA cm –2 at U = –1.12 V. To help determine the actual sites in the experiments, we predict the XPS binding energy shift and CO vibrational frequency for each site.
Reaction mechanism and kinetics for N 2 reduction to ammonia on the Fe–Ru based dual-atom catalyst
Environmental and energy considerations demand that the Haber-Bosch process for reducing N 2 to NH 3 be replaced with electrochemical ammonia synthesis where the H atoms come from water instead of from H 2 . But a practical realization of electrochemical N 2 reduction reaction (NRR) requires the development of new generation electrocatalysts with low overpotential and high Faraday efficiency (FE). A major problem here is that the hydrogen evolution reaction (HER) competes with NRR. Herein, we consider new generation dual-site catalysts involving two different metals incorporated into a novel two-dimensional C 3 N–C 2 N heterostructure that provides a high concentration of well-defined but isolated active sites that bind two distinct metal atoms in a framework that facilitates electron transfer. We report here the mechanism and predicted kinetics as a function of applied potential for both NRR and HER for the (Fe–Ru)/C 3 N–C 2 N dual atom catalyst. These calculations employ the grand canonical potential kinetics (GCP-K) methodology to predict reaction free energies and reaction barriers as a function of applied potential. The rates are then used in a microkinetic model to predict the turn-over-frequencies (TOF) as a function of applied potential. At U = 0 V, the FE for NRR is 93%, but the current is only 2.0 mA cm –2 . The onset potential (at 10 mA cm –2 ) for ammonia on Fe–Ru/C 3 N–C 2 N is –0.22 V RHE . This leads to a calculated TOF of 434 h –1 per Fe–Ru site. In conclusion, we expect that the mechanisms for NRR and HER developed here will help lead to new generations of NRR with high TOF and FE.
The ATLAS experiment software on ARM
With an increased dataset obtained during the Run 3 of the LHC at CERN and the even larger expected increase of the dataset by more than one order of magnitude for the HL-LHC, the ATLAS experiment is reaching the limits of the current data processing model in terms of traditional CPU resources based on x86_64 architectures and an extensive program for software upgrades towards the HL-LHC has been set up. The ARM architecture is becoming a competitive and energy efficient alternative. Some surveys indicate its increased presence in HPCs and commercial clouds, and some WLCG sites have expressed their interest. Chip makers are also developing their next generation solutions on ARM architectures, sometimes combining ARM and GPU processors in the same chip. Consequently it is important that the ATLAS software embraces the change and is able to successfully exploit this architecture. We report on the successful porting to ARM of the Athena software framework, which is used by ATLAS for both online and offline computing operations. Furthermore we report on the successful validation of simulation workflows running on ARM resources. For this we have set up an ATLAS Grid site using ARM compatible middleware and containers on Amazon Web Services (AWS) ARM resources. The ARM version of Athena is fully integrated in the regular software build system and distributed in the same way as other software releases. In addition, the workflows have been integrated into the HEPscore benchmark suite which is the planned WLCG wide replacement of the HepSpec06 benchmark used for Grid site pledges. In the overall porting process we have used resources on AWS, Google Cloud Platform (GCP) and CERN. A performance comparison of different architectures and resources will be discussed.
Using the ATLAS experiment software on heterogeneous resources
With the large dataset expected from 2030 onwards by the HL-LHC at CERN, the ATLAS experiment is reaching the limits of the current data processing model in terms of traditional CPU resources based on x86_64 architectures and an extensive program for software upgrades towards the HL-LHC has been set up. The ARM CPU architecture is becoming a competitive and energy efficient alternative. Accelerators like GPUs are available in any recent HPC. In the past years ATLAS has successfully ported its full data processing and simulation software framework Athena to ARM and has invested significant effort in porting parts of the reconstruction and simulation algorithms to GPUs. We report on the successful usage of the ATLAS experiment offline and online software framework Athena on ARM and GPUs through the PanDA workflow management system at various WLCG sites. Furthermore we report on performance optimizations of the builds for ARM CPUs and the GPU integration efforts. We will discuss performance comparisons of different ARM and x86_64 architectures on WLCG resources and Cloud compute providers like GCP and AWS using ATLAS productions workflows as used in the Hep-Score23 benchmark suite.
Regional trends and drivers of the global methane budget
Abstract The ongoing development of the Global Carbon Project (GCP) global methane (CH 4 ) budget shows a continuation of increasing CH 4 emissions and CH 4 accumulation in the atmosphere during 2000–2017. Here, we decompose the global budget into 19 regions (18 land and 1 oceanic) and five key source sectors to spatially attribute the observed global trends. A comparison of top‐down (TD) (atmospheric and transport model‐based) and bottom‐up (BU) (inventory‐ and process model‐based) CH 4 emission estimates demonstrates robust temporal trends with CH 4 emissions increasing in 16 of the 19 regions. Five regions—China, Southeast Asia, USA, South Asia, and Brazil—account for >40% of the global total emissions (their anthropogenic and natural sources together totaling >270 Tg CH 4 yr −1 in 2008–2017). Two of these regions, China and South Asia, emit predominantly anthropogenic emissions (>75%) and together emit more than 25% of global anthropogenic emissions. China and the Middle East show the largest increases in total emission rates over the 2000 to 2017 period with regional emissions increasing by >20%. In contrast, Europe and Korea and Japan show a steady decline in CH 4 emission rates, with total emissions decreasing by ~10% between 2000 and 2017. Coal mining, waste (predominantly solid waste disposal) and livestock (especially enteric fermentation) are dominant drivers of observed emissions increases while declines appear driven by a combination of waste and fossil emission reductions. As such, together these sectors present the greatest risks of further increasing the atmospheric CH 4 burden and the greatest opportunities for greenhouse gas abatement.
Energy Exascale Earth System Model v2.0.1
First patch release of v2.0.0 Changes since v2.0.0 [Important change] Fix ocean threading bug seen in debug cases on Chrysalis with Intel 20.0.4. Was introduced around time of v2.0.0 tag. Does not change v2.0.0 answers on Chrysalis because those didn't use threading or debugging. [EAM] Add semi-lagrangian tracer transport for theta-l (F90 and C++), add new algorithm for finding tropopause, add DSCREAM to allow v2 and SCREAM settings in same code such as adjust_ps [EAM-MMF] 60L default, allow C++ back end of RRTMGP (EAM too). [EAMxx] add nu-top functionality, fix forcing functor, add ttype9 and dcmip2012 tests 2.1, 2.2, and 3 HOMME: remove obsolete remap algs, option to specify dynamics alg indep of tracer, new sponge layer, add imex tests [ELM] Add topography-based subgrid (topounits), add FATES-ELM Nitro., Phos. and CH4 coupling, add land-use ts for NARRM, add lulc for SSP3 RCP7, Fix nutrient fertilization exp test and carbon isotope flux, Fix xactive lnd dry deposition, add lake water storage option, fix plant hydraulics 2d params, fix carbon budget calc, fix soil nutrient conc. bug, fix mosart dam bug, add test for new ELM, MOSART features, fix bug in O3 dry dep stomatal resistances, fix plant hydraulics restart BFB error, update mkmapdata. [MOSART] fix bug for reading the latitude from an unstructured input file, fix oversat in bubble test. [MPAS-ocean] Add CFC11, CFC12 tracers, add 2D spherical transport tests, fix del4 tracer mixing, add MARBL ocean tracer mixing, modify harmonic analysis options, add GPU port of vmix routines, fix calc of ML-averaged BV freq. [MPAS-seaice] Change extents of initial polar disks for oRRS18to6v3 grid, fix ice BGC with MARBL, update spherical test cases, fix DON coupling, Remove Cf from sea ice constants. [MPAS-landice] add CRYO1850-4xCO2 compset [CIME] add GCP, ANL GCE, Spock, Perlmutter, deprecate config_compilers.xml, fix and clean-up cmake macros, fix slurm bindings, refactor CIME internal testing, cleanup SCORPIO perf data, allow position independent compset naming, [also] update v2 benchmarking suite, extend e3sm_prod with throughput and memory checks
GentenMPI: Distributed Memory Sparse Tensor Decomposition
GentenMPl is a toolkit of sparse canonical polyadic (CP) tensor decomposition algorithms that is designed to run effectively on distributed-memory high-performance computers. Its use of distributed-memory parallelism enables it to efficiently decompose tensors that are too large for a single compute node's memory. GentenMPl leverages Sandia's decades-long investment in the Trilinos solver framework for much of its parallel-computation capability. Trilinos contains numerical algorithms and linear algebra classes that have been optimized for parallel simulation of complex physical phenomena. This work applies these tools to the data science problem of sparse tensor decomposition. In this report, we describe the use of Trilinos in GentenMPl, extensions needed for sparse tensor decomposition, and implementations of the CP-ALS (CP via alternating least squares) and GCP-SGD (generalized CP via stochastic gradient descent) sparse tensor decomposition algorithms. We show that GentenMPl can decompose sparse tensors of extreme size, e.g., a 12.6-terabyte tensor on 8192 computer cores. We demonstrate that the Trilinos backbone provides good strong and weak scaling of the tensor decomposition algorithms.
LiDAR-Aided Interior Orientation Parameters Refinement Strategy for Consumer-Grade Cameras Onboard UAV Remote Sensing Systems
Unmanned aerial vehicles (UAVs) are quickly emerging as a popular platform for 3D reconstruction/modeling in various applications such as precision agriculture, coastal monitoring, and emergency management. For such applications, LiDAR and frame cameras are the two most commonly used sensors for 3D mapping of the object space. For example, point clouds for the area of interest can be directly derived from LiDAR sensors onboard UAVs equipped with integrated global navigation satellite systems and inertial navigation systems (GNSS/INS). Imagery-based mapping, on the other hand, is considered to be a cost-effective and practical option and is often conducted by generating point clouds and orthophotos using structure from motion (SfM) techniques. Mapping with photogrammetric approaches requires accurate camera interior orientation parameters (IOPs), especially when direct georeferencing is utilized. Most state-of-the-art approaches for determining/refining camera IOPs depend on ground control points (GCPs). However, establishing GCPs is expensive and labor-intensive, and more importantly, the distribution and number of GCPs are usually less than optimal to provide adequate control for determining and/or refining camera IOPs. Moreover, consumer-grade cameras with unstable IOPs have been widely used for mapping applications. Therefore, in such scenarios, where frequent camera calibration or IOP refinement is required, GCP-based approaches are impractical. To eliminate the need for GCPs, this study uses LiDAR data as a reference surface to perform in situ refinement of camera IOPs. The proposed refinement strategy is conducted in three main steps. An image-based sparse point cloud is first generated via a GNSS/INS-assisted SfM strategy. Then, LiDAR points corresponding to the resultant image-based sparse point cloud are identified through an iterative plane fitting approach and are referred to as LiDAR control points (LCPs). Finally, IOPs of the utilized camera are refined through a GNSS/INS-assisted bundle adjustment procedure using LCPs. Seven datasets over two study sites with a variety of geomorphic features are used to evaluate the performance of the developed strategy. The results illustrate the ability of the proposed approach to achieve an object space absolute accuracy of 3–5 cm (i.e., 5–10 times the ground sampling distance) at a 41 m flying height.
Remote sensing images, DEM, and point clouds associated with “Accuracy evaluation of cost-effective 3D reconstruction approaches for hydrobiogeochemical processes in non-perennial stream riverbeds”
This data package is associated with the publication “Accuracy evaluation of cost-effective 3D reconstruction approaches for hydrobiogeochemical processes in non-perennial stream riverbeds” published in Frontiers in Environmental Science, Environmental Informatics and Remote Sensing (Bao et al., 2026; doi: 10.3389/fenvs.2026.1725258). This data package includes the drone photos for a section of Umtanum Creek in Washington, Unted States. The photos were used to reconstruct the 3-dimensional (3D) digital elevation model (DEM) of the riverbed for the investigated stream section. The reconstruction results from four approaches are provided: (1) unoccupied aerial vehicle (UAV, colloquially known as drone) imagery-based Structure-from-Motion (SfM), (2) a machine learning-based 3D reconstruction model, Visual Geometry Grounded Deep Structure from Motion (VGGSfM), (3) Visual Geometry Grounded Transformer for long sequence of images (VGGT-Long), and (4) handheld smartphone LiDAR scanning. The ground truth measurements by tripod-mounted optical level kit and ground control points GPS locations for evaluating the accuracy of the four reconstruction approaches are also provided in this data package. A preliminary version of this data package was published in October 2025 at the time of manuscript submission. It was updated in March 2026, at the time of manuscript acceptance, to include additional metadata (this readme, data dictionary, and file level metadata). The data did not change. For details on how to navigate data packages generated by this project, see https://data.ess-dive.lbl.gov/portals/PNNLRiverCorridorSFA/About. In addition to a readme, this data package also includes a file-level metadata (FLMD) file that describes each file and a data dictionary (DD) that describes all column/row headers and variable definitions. This dataset is comprised of (1) 8 folders; (2) the detailed flight configuration html files; (3) field metadata; (4) a readme; (5) a data dictionary; and (6) file-level metadata. The folders “2024_10_18_d01” and “2024_10_18_d02” contain the original drone photos for the two drone flights (d01 and d02) on October 18, 2024. The reconstruction results from each of the approaches are in the folders called “ODM_SfM”, “VGGSfM”, “VGGTLong”, and “LiDAR”. The ground truth measurements are in the folder called “optical_level_kit”. Lastly, results comparing the different approaches are in the folder called “comparisons”. All files are .csv, .html, .jpg, .obj, .txt, and .npy. For information on using the .obj and .npy files, see the readme files within the same folder as the files.
A Hybrid Method for Tensor Decompositions that Leverages Stochastic and Deterministic Optimization
In this paper, we propose a hybrid method that uses stochastic and deterministic search to compute the maximum likelihood estimator of a low-rank count tensor with Poisson loss via state-of-theart local methods. Our approach is inspired by Simulated Annealing for global optimization and allows for fine-grain parameter tuning as well as adaptive updates to algorithm parameters. We present numerical results that indicate our hybrid approach can compute better approximations to the maximum likelihood estimator with less computation than the state-of-the-art methods by themselves.