Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solving”

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 937 records · Page 52

WinPSSP : a revamp of the computer program PSSP and its performance solving the crystal structures of small organic compounds and solids of biological and pharmaceutical interest

The direct-space methods software Powder Structure Solution Program ( PSSP ) [Pagola & Stephens (2010). J. Appl. Cryst. 43 , 370–376] has been migrated to the Windows OS and the code has been optimized for fast runs. WinPSSP is a user-friendly graphical user interface that allows the input of preliminary crystal structure information, integrated intensities of the reflections and FWHM, the definition of structural parameters and a simulated annealing schedule, and the visualization of the calculated and experimental diffraction data overlaid for each individual solution. The solutions are reported as filename.cif files, which can be used to analyze packing motifs and chemical bonding, and to input the atomic coordinates into the Rietveld analysis software GSAS. WinPSSP performance in straightforward crystal structure determinations has been evaluated using 18 molecular solids with 6–20 degrees of freedom. The free-distribution program as well as multimedia tutorials can be accessed at http://users.uoi.gr/nkourkou/winpssp/.

60 APPLIED LIFE SCIENCES↗

The structure of nano-twinned rhombohedral YCuO 2.66 solved by electron crystallography

In the search for frustrated spin interactions, a YCuO 2.66 phase has been synthesized by a treatment under oxygen pressure of YCuO 2.5 . X-ray powder diffraction and electron diffraction studies have been conducted. Electron diffraction shows that the sample is twinned on a 10 nm scale. Precession electron diffraction data obtained from a twinned crystal was treated in order to obtain intensities corresponding to only one of the orientations of the twins. From this data a structure solution was obtained where, as in YCuO 2.5 , the Cu atoms form triangular planes. The Cu atoms are linked in two dimensions by oxygen atoms in the present structure whereas in YCuO 2.5 they are only linked in one-dimensional chains.

36 MATERIALS SCIENCE↗

Using sound pulses to solve the crystal-harvesting bottleneck

Crystal harvesting has proven to be difficult to automate and remains the rate-limiting step for many structure-determination and high-throughput screening projects. This has resulted in crystals being prepared more rapidly than they can be harvested for X-ray data collection. Fourth-generation synchrotrons will support extraordinarily rapid rates of data acquisition, putting further pressure on the crystal-harvesting bottleneck. Here, a simple solution is reported in which crystals can be acoustically harvested from slightly modified MiTeGen In Situ -1 crystallization plates. This technique uses an acoustic pulse to eject each crystal out of its crystallization well, through a short air column and onto a micro-mesh (improving on previous work, which required separately grown crystals to be transferred before harvesting). Crystals can be individually harvested or can be serially combined with a chemical library such as a fragment library.

36 MATERIALS SCIENCE↗

Graph-Based Attention Mechanisms for Solving the AC Optimal Power Flow Problem in Electrical Power Networks

With the increasing complexity and data availability in modern power systems, learning-based approaches to AC Optimal Power Flow (AC OPF) have garnered significant attention. In particular, the structure of smart grids lends itself naturally to graph-based representations, where Graph Neural Networks (GNNs) can capture spatial and relational dependencies. This paper investigates attention-based GNN architectures tailored to heterogeneous graph representations of electric grids. We evaluate two major paradigms: relational attention, which distinguishes between edge types during message passing, and meta-path attention, which captures high-level semantics through multi-hop, typed paths. Using a large corpus of public AC OPF scenarios, we benchmark representative models of each type of attention. Our results demonstrate the benefits of heterogeneous attention-based models in accurately capturing grid dynamics; heterogeneous attention models achieve superior performance in both standard and perturbed settings. The findings highlight the importance of semantic-aware architectures for improving prediction robustness and interpretability in power system applications.

Trigui, Ali [Qubit Engineering Inc.]↗

A Game-Theoretic Quantum Algorithm for Solving Magic Squares

Variational quantum algorithms (VQAs) offer a promising near-term approach to finding optimal quantum strategies for playing non-local games. These games test quantum correlations beyond classical limits and enable entanglement verification. In this work, we present a variational framework for the Magic Square Game (MSG), a two-player non-local game with perfect quantum advantage. We construct a value Hamiltonian that encodes the game’s parity and consistency constraints, then optimize parameterize quantum circuits to minimize this cost. Our approach build on the stabilizer formalism, leverages commutation structure for circuit design, and is hardware-efficient. Compared to existing work, our contribution emphasizes algebraic structure an interpretability. We validate our method through numerical experiments and outline generalizations to larger games.

Chehade, Sarah [ORNL]↗

Decentralized Schemes with Overlap for Solving Graph-Structured Optimization Problems

We present a new algorithmic paradigm for the decentralized solution of graph-structured optimization problems that arise in the estimation and control of network systems. A key and novel design concept of the proposed approach is that it uses overlapping subdomains to promote and accelerate convergence. We show that the algorithm converges if the size of the overlap is sufficiently large and that the convergence rate improves exponentially with the size of the overlap. The proposed approach provides a bridge between fully decentralized and centralized architectures and is flexible in that it enables the implementation of asynchronous schemes, handling of constraints, and balancing of computing, communication, and data privacy needs. The proposed scheme is tested in an estimation problem for a 9241-node power network and we show that it outperforms the alternating direction method of multipliers.

asynchronous↗

Particle-Filter-Based Multisensor Fusion For Solving Low-Frequency Electromagnetic NDE Inverse Problems

Flaw profile characterization from NDE measurements is a typical inverse problem. A novel transformation of this inverse problem into a tracking problem, and subsequent application of a sequential Monte Carlo method called particle filtering, has been proposed by the authors in an earlier publication [1]. In this study, the problem of flaw characterization from multi-sensor data is considered. The NDE inverse problem is posed as a statistical inverse problem and particle filtering is modified to handle data from multiple measurement modes. The measurement modes are assumed to be independent of each other with principal component analysis (PCA) used to legitimize the assumption of independence. The proposed particle filter based data fusion algorithm is applied to experimental NDE data to investigate its feasibility.

Data Fusion↗

Implementation and Tuning of Batched Cholesky Factorization and Solve for NVIDIA GPUs

Many problems in engineering and scientific computing require the solution of a large number of small systems of linear equations. Due to their high processing power, Graphics Processing Units became an attractive target for this class of problems, and routines based on the LU and the QR factorization have been provided by NVIDIA in the cuBLAS library. This work addresses the situation where the systems of equations are symmetric positive definite. The paper describes the implementation and tuning of the kernels for the Cholesky factorization and the forward and backward substitution. Targeted workloads involve the solution of thousands of linear systems of the same size, where the focus is on matrix dimensions from 5 by 5 to 100 by 100. Due to the lack of a cuBLAS Cholesky factorization, execution rates of cuBLAS LU and cuBLAS QR are used for comparison against the proposed Cholesky factorization in this work. Execution rates of forward and backward substitution routines are compared to equivalent cuBLAS routines. Comparisons against optimized multicore implementations are also presented. Superior performance is reached in all cases.

Computer Science↗

Solving the sample size problem for resource selection functions

Abstract Sample size sufficiency is a critical consideration for estimating resource selection functions (RSFs) from GPS‐based animal telemetry. Cited thresholds for sufficiency include a number of captured animals and as many relocations per animal N as possible. These thresholds render many RSF‐based studies misleading if large sample sizes were truly insufficient, or unpublishable if small sample sizes were sufficient but failed to meet reviewer expectations. We provide the first comprehensive solution for RSF sample size by deriving closed‐form mathematical expressions for the number of animals M and the number of relocations per animal N required for model outputs to a given degree of precision. The sample sizes needed depend on just 3 biologically meaningful quantities: habitat selection strength, variation in individual selection and a novel measure of landscape complexity, which we define rigorously. The mathematical expressions are calculable for any environmental dataset at any spatial scale and are applicable to any study involving resource selection (including sessile organisms). We validate our analytical solutions using globally relevant empirical data including 5,678,623 GPS locations from 511 animals from 10 species (omnivores, carnivores and herbivores living in boreal, temperate and tropical forests, montane woodlands, swamps and Arctic tundra). Our analytic expressions show that the required M and N must decline with increasing selection strength and increasing landscape complexity, and this decline is insensitive to the definition of availability used in the analysis. Our results demonstrate that the most biologically relevant effects on the utilization distribution (i.e. those landscape conditions with the greatest absolute magnitude of resource selection) can often be estimated with much fewer than animals. We identify several critical steps in implementing these equations, including (a) a priori selection of expected model coefficients and (b) regular sampling of background (pseudoabsence) data within a given definition of availability. We discuss possible methods to identify a priori expectations for habitat selection coefficients, effects of scale on RSF estimation and caveats for rare species applications. We argue that these equations should be a mandatory component for all future RSF studies.

Street, Garrett M.↗