Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized algorithm”

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 775 records · Page 43

Modeling of dodecagonal quasicrystal lattices

We consider a method for constructing dodecagonal quasi-lattices, which involves the recurrent multiplication of the initial group of sites that are vertices of a regular dodecagon. The algorithm of modeling of reciprocal lattices of dodecagonal quasicrystals has been analyzed. The proposed modeling method is compared with the traditional projection method. We have performed indexing of the diffraction pattern from dodecagonal quasicrystals, which is analogous to indexing proposed by Cahn for icosahedral quasicrystals. The ambiguity of the choice of the basis vectors of the quasicrystal reciprocal lattice has been considered.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A time-implicit numerical method and benchmarks for the relativistic Vlasov–Ampere equations

We present a time-implicit numerical method to solve the relativistic Vlasov–Ampere system of equations on a two dimensional phase space grid. The time-splitting algorithm we use allows the generalization of the work presented here to higher dimensions keeping the linear aspect of the resulting discrete set of equations. The implicit method is benchmarked against linear theory results for the relativistic Landau damping for which analytical expressions using the Maxwell-Jüttner distribution function are derived. We note that, independently from the shape of the distribution function, the relativistic treatment features collective behaviours that do not exist in the nonrelativistic case. The numerical study of the relativistic two-stream instability completes the set of benchmarking tests.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Multiview Incomplete Knowledge Graph Integration with application to cross-institutional EHR data harmonization

Objective: The growing availability of electronic health records (EHR) data opens opportunities for integrative analysis of multi-institutional EHR to produce generalizable knowledge. A key barrier to such integrative analyses is the lack of semantic interoperability across different institutions due to coding differences. We propose a Multiview Incomplete Knowledge Graph Integration (MIKGI) algorithm to integrate information from multiple sources with partially overlapping EHR concept codes to enable translations between healthcare systems. Methods: The MIKGI algorithm combines knowledge graph information from (i) embeddings trained from the co-occurrence patterns of medical codes within each EHR system and (ii) semantic embeddings of the textual strings of all medical codes obtained from the Self-Aligning Pretrained BERT (SAPBERT) algorithm. Due to the heterogeneity in the coding across healthcare systems, each EHR source provides partial coverage of the available codes. MIKGI synthesizes the incomplete knowledge graphs derived from these multi-source embeddings by minimizing a spherical loss function that combines the pairwise directional similarities of embeddings computed from all available sources. MIKGI outputs harmonized semantic embedding vectors for all EHR codes, which improves the quality of the embeddings and enables direct assessment of both similarity and relatedness between any pair of codes from multiple healthcare systems. Results: With EHR co-occurrence data from Veteran Affairs (VA) healthcare and Mass General Brigham (MGB), MIKGI algorithm produces high quality embeddings for a variety of downstream tasks including detecting known similar or related entity pairs and mapping VA local codes to the relevant EHR codes used at MGB. Based on the cosine similarity of the MIKGI trained embeddings, the AUC was 0.918 for detecting similar entity pairs and 0.809 for detecting related pairs. For cross-institutional medical code mapping, the top 1 and top 5 accuracy were 91.0% and 97.5% when mapping medication codes at VA to RxNorm medication codes at MGB; 59.1% and 75.8% when mapping VA local laboratory codes to LOINC hierarchy. When trained with 500 labels, the lab code mapping attained top 1 and 5 accuracy at 77.7% and 87.9%. MIKGI also attained best performance in selecting VA local lab codes for desired laboratory tests and COVID-19 related features for COVID EHR studies. Compared to existing methods, MIKGI attained the most robust performance with accuracy the highest or near the highest across all tasks. Conclusions: The proposed MIKGI algorithm can effectively integrate incomplete summary data from biomedical text and EHR data to generate harmonized embeddings for EHR codes for knowledge graph modeling and cross-institutional translation of EHR codes.

Zhou, Doudou↗

A Branch and Bound Approach for Truss Topology Design Problems with Valid Inequalities

One of the classical problems in the structural optimization field is the Truss Topology Design Problem (TTDP) which deals with the selection of optimal configuration for structural systems for applications in mechanical, civil, aerospace engineering, among others. In this paper we consider a TTDP where the goal is to find the stiffest truss, under a given load and with a bound on the total volume. The design variables are the cross-section areas of the truss bars that must be chosen from a given finite set. This results in a large-scale non-convex problem with discrete variables. This problem can be formulated as a Semidefinite Programming Problem (SDP problem) with binary variables. We propose a branch and bound algorithm to solve this problem. In this paper it is considered a binary formulation of the problem, to take advantage of its structure, which admits a Knapsack problem as subproblem. Thus, trying to improve the performance of the Branch and Bound, at each step, some valid inequalities for the Knapsack problem are included.

42 ENGINEERING↗

Comparison between beamforming and super resolution imaging algorithms for non-destructive evaluation

In this paper the performance of total focusing method is compared with the widely used time-reversal MUSIC super resolution technique. The algorithms are tested with simulated and experimental ultrasonic array data, each containing different noise levels. The simulated time domain signals allow the effects of array geometry, frequency, scatterer location, scatterer size, scatterer separation and random noise to be carefully controlled. The performance of the imaging algorithms is evaluated in terms of resolution and sensitivity to random noise. It is shown that for the low noise situation, time-reversal MUSIC provides enhanced lateral resolution when compared to the total focusing method. However, for higher noise levels, the total focusing method shows robustness, whilst the performance of time-reversal MUSIC is significantly degraded.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Calibrations and verifications performed in view of the ILA reinstatement at JET

The calibrations and verifications that are performed in preparation of the ITER-Like antenna (ILA) reinstatement at JET are reviewed. A brief reminder of the ILA system layout is given. The different calibration methods and results are then discussed. They encompass the calibrations of the directional couplers present in the system, the determination of the relation between the capacitor position readings and the capacitance value, the voltage probes calibration inside the antenna housing, the RF cables characterization and the acquisition electronics circuit calibration. Earlier experience with the ILA has shown that accurate calibrations are essential for the control of the full ILA close-packed antenna array, its protection through the S-Matrix Arc Detection and the new second stage matching algorithm to be implemented. Finally the voltage stand-off of the capacitors is checked and the phase range achievable with the system is verified. The system layout is modified as to allow dipole operation over the whole operating frequency range when operating with the 3dB combiner-splitters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Few group collapsing of covariance matrix data based on a conservation principle

A new algorithm for a rigorous collapsing of covariance data is proposed, derived, implemented, and tested. The method is based on a conservation principle that allows preserving at a broad energy group structure the uncertainty calculated in a fine group energy structure for a specific integral parameter, using as weights the associated sensitivity coefficients.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The effect of the electron–phonon interaction on reverse currents of GaAs-based p–n junctions

An algorithm for calculating the parameters of the electron–phonon interaction of the EL2 trap has been developed and implemented based on the example of GaAs. Using the obtained parameters, the field dependences of the probabilities of nonradiative transitions from the trap and reverse currents of the GaAs p–n junctions are calculated, which are in good agreement with the experimental data.

36 MATERIALS SCIENCE↗

A Cartesian cut cell method for rarefied flow simulations around moving obstacles

For accurate simulations of rarefied gas flows around moving obstacles, we propose a cut cell method on Cartesian grids: it allows exact conservation and accurate treatment of boundary conditions. Our approach is designed to treat Cartesian cells and various kinds of cut cells by the same algorithm, with no need to identify the specific shape of each cut cell. This makes the implementation quite simple, and allows a direct extension to 3D problems. Such simulations are also made possible by using an adaptive mesh refinement technique and a hybrid parallel implementation. This is illustrated by several test cases, including a 3D unsteady simulation of the Crookes radiometer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Circular polarization analyzer with polarization tunable focusing of surface plasmon polaritons

A practical circular polarization analyzer (CPA) that can selectively focus surface plasmon polaritons (SPPs) at two separate locations, according to the helicity of the circularly polarized light, is designed and experimentally verified in the terahertz frequency range. The CPA consists of fishbone-slit units and is designed using the simulated annealing algorithm. By differentially detecting the intensities of the two SPPs focuses, the helicity of the incident circularly polarized light can be obtained and the CPA is less vulnerable to the noise of incident light. The proposed device may also have wide potential applications in chiral SPPs photonics and the analysis of chiral molecules in biology.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A parallel Eulerian interface tracking/Lagrangian point particle multi-scale coupling procedure

This paper presents a parallel Eulerian/Lagrangian multi-scale coupling procedure for two-phase flows. At the fully resolved scale, the dynamically evolving phase interface is tracked using a Eulerian approach. In regions of the flow, where the phase interface geometry can no longer be resolved adequately, separated, small scale liquid structures are described by a Lagrangian point particle approach. The coupling procedure of these two descriptions consists of an efficient parallel algorithm that identifies tracked liquid candidate structures, removes them from the resolved Eulerian description, and inserts them into the Lagrangian description preserving their position, mass, momentum, and lower order shape. While in principle applicable to level set, Volume of Fluid, and marker particle interface tracking methods for the fully resolved scale, this paper focuses on examples from atomization simulations using the refined level set grid method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stable schemes for dissipative particle dynamics with conserved energy

This article presents a new numerical scheme for the discretization of dissipative particle dynamics with conserved energy. The key idea is to reduce elementary pairwise stochastic dynamics (either fluctuation/dissipation or thermal conduction) to effective single-variable dynamics, and to approximate the solution of these dynamics with one step of a Metropolis–Hastings algorithm. This ensures by construction that no negative internal energies are encountered during the simulation, and hence allows to increase the admissible timesteps to integrate the dynamics, even for systems with small heat capacities. Stability is only limited by the Hamiltonian part of the dynamics, which suggests resorting to multiple timestep strategies where the stochastic part is integrated less frequently than the Hamiltonian one.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reactive burn models and ignition & growth concept

Plastic-bonded explosives are heterogeneous materials. Experimentally, shock initiation is sensitive to small amounts of porosity, due to the formation of hot spots (small localized regions of high temperature). This leads to the Ignition and Growth concept, introduced by Lee and Tarver in 1980, as the basis for reactive burn models. A homogeneized burn rate needs to account for three mesoscale physical effects (i) the density of burnt hot spots, which depends on the lead shock strength; (ii) the growth of the burn fronts triggered by hot spots, which depends on the local deflagration speed; (iii) a geometric factor that accounts for the overlap of deflagration wavelets from adjacent hot spots. These effects can be combined and the burn model defined by specifying the reaction progress variable {lambda}(t) as a function of a dimensionless reaction length {tau}{sub hs}(t)/{ell}{sub hs}, rather than by xpecifying an explicit burn rate. The length scale {ell}{sub hs} is the average distance between hot spots, which is proportional to [N{sub hs}(P{sub s})]{sup -1/3}, where N{sub hs} is the number density of hot spots activated by the lead shock. The reaction length {tau}{sub hs}(t) = {line_integral}{sub 0}{sup t} D(P(t'))dt' is the distance the burn front propagates from a single hot spot, where D is the deflagration speed and t is the time since the shock arrival. A key implementation issue is how to determine the lead shock strength in conjunction with a shock capturing scheme. They have developed a robust algorithm for this purpose based on the Hugoniot jump condition for the energy. The algorithm utilizes the time dependence of density, pressure and energy within each cell. The method is independent of the numerical dissipation used for shock capturing. It is local and can be used in one or more space dimensions. The burn model has a small number of parameters which can be calibrated to fit velocity gauge data from shock initiation experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Variance-based sensitivity indices for stochastic models with correlated inputs

The goal of this article is the formulation of the principles of one of the possible strategies in implementing correlation between input random variables so as to be usable for algorithm development and the evaluation of Sobol’s sensitivity analysis. With regard to the types of stochastic computational models, which are commonly found in structural mechanics, an algorithm was designed for effective use in conjunction with Monte Carlo methods. Sensitivity indices are evaluated for all possible permutations of the decorrelation procedures for input parameters. The evaluation of Sobol’s sensitivity coefficients is illustrated on an example in which a computational model was used for the analysis of the resistance of a steel bar in tension with statistically dependent input geometric characteristics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Squeezed coherent states of motion for ions confined in quadrupole and octupole ion traps

Quasiclassical dynamics of trapped ions is characterized by applying the time dependent variational principle (TDVP) on coherent state orbits, in case of quadrupole and octupole combined (Paul and Penning) or radiofrequency (RF) traps. A dequantization algorithm is proposed, by which the classical Hamilton (energy) function associated to the system results as the expectation value of the quantum Hamiltonian on squeezed coherent states. We develop such method and particularize the quantum Hamiltonian for both combined and RF nonlinear traps, that exhibit axial symmetry. We also build the classical Hamiltonian functions for the particular traps we considered, and find the classical equations of motion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Integrated tokamak modelling taskforce: Validation of the equilibrium reconstruction from experimental data

The Integrated tokamak modelling taskforce was set up to provide the European scientific community with simulation tools for preparing and analysing discharges of fusion experiments. We will report on recent progress made on the taskforce project on equilibrium and linear stability. A generic data structure has been devised to describe the geometry of a machine and physical processes in the discharge. This data structure is used to interface all individual analysis program within the taskforce. One of the analysis tools, the equilibrium code EFIT-ITM, based on the EFIT code written by L. L. Lao, has been completely rewritten in order to make it suitable for the ITM. It has algorithm enhancements to increase execution speed, and the ability to treat anisotropic pressure and deviation from axisymmetry. The reconstruction code is now completely independent of the machine description. First results on veriflcation and validation of the new tool are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An atomic orbital-based formulation of the complete active space self-consistent field method on graphical processing units

Despite its importance, state-of-the-art algorithms for performing complete active space self-consistent field (CASSCF) computations have lagged far behind those for single reference methods. We develop an algorithm for the CASSCF orbital optimization that uses sparsity in the atomic orbital (AO) basis set to increase the applicability of CASSCF. Our implementation of this algorithm uses graphical processing units (GPUs) and has allowed us to perform CASSCF computations on molecular systems containing more than one thousand atoms. Additionally, we have implemented analytic gradients of the CASSCF energy; the gradients also benefit from GPU acceleration as well as sparsity in the AO basis.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computer correction of turbulent distortions of image of extended objects on near-Earth paths

An algorithm of computer-based correction of images of extended objects distorted by turbulent atmosphere is developed. The method of computer correction is used to correct a distorted image of an extended object on a horizontal 2300-m-long observation path. The angular size of the corrected-image region was 15'. (image processing)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗