SEARCH · Engineering Papers

Results for “Symbolic computing”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 613 records · Page 34

All sources NASA NTRS DOE OSTI

DOE OSTI2018

GrammarViz 3.0: Interactive Discovery of Variable-Length Time Series Patterns

The problems of recurrent and anomalous pattern discovery in time series, e.g., motifs and discords, respectively, have received a lot of attention from researchers in the past decade. However, since the pattern search space is usually intractable, most existing detection algorithms require that the patterns have discriminative characteristics and have its length known in advance and provided as input, which is an unreasonable requirement for many real-world problems. In addition, patterns of similar structure, but of different lengths may co-exist in a time series. In order to address these issues, we have developed algorithms for variable-length time series pattern discovery that are based on symbolic discretization and grammar inference—two techniques whose combination enables the structured reduction of the search space and discovery of the candidate patterns in linear time. In this work, we present GrammarViz 3.0—a software package that provides implementations of proposed algorithms and graphical user interface for interactive variable-length time series pattern discovery. The current version of the software provides an alternative grammar inference algorithm that improves the time series motif discovery workflow, and introduces an experimental procedure for automated discretization parameter selection that builds upon the minimum cardinality maximum cover principle and aids the time series recurrent and anomalous pattern discovery.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2009

NASA Tech Briefs, March 2009

Topics covered include: Improved Instrument for Detecting Water and Ice in Soil; Real-Time Detection of Dust Devils from Pressure Readings; Determining Surface Roughness in Urban Areas Using Lidar Data; DSN Data Visualization Suite; Hamming and Accumulator Codes Concatenated with MPSK or QAM; Wide-Angle-Scanning Reflectarray Antennas Actuated by MEMS; Biasable Subharmonic Membrane Mixer for 520 to 600 GHz; Hardware Implementation of Serially Concatenated PPM Decoder; Symbolic Processing Combined with Model-Based Reasoning; Presentation Extensions of the SOAP; Spreadsheets for Analyzing and Optimizing Space Missions; Processing Ocean Images to Detect Large Drift Nets; Alternative Packaging for Back-Illuminated Imagers; Diamond Machining of an Off-Axis Biconic Aspherical Mirror; Laser Ablation Increases PEM/Catalyst Interfacial Area; Damage Detection and Self-Repair in Inflatable/Deployable Structures; Polyimide/Glass Composite High-Temperature Insulation; Nanocomposite Strain Gauges Having Small TCRs; Quick-Connect Windowed Non-Stick Penetrator Tips for Rapid Sampling; Modeling Unsteady Cavitation and Dynamic Loads in Turbopumps; Continuous-Flow System Produces Medical-Grade Water; Discrimination of Spore-Forming Bacilli Using spoIVA; nBn Infrared Detector Containing Graded Absorption Layer; Atomic References for Measuring Small Accelerations; Ultra-Broad-Band Optical Parametric Amplifier or Oscillator; Particle-Image Velocimeter Having Large Depth of Field; Enhancing SERS by Means of Supramolecular Charge Transfer; Improving 3D Wavelet-Based Compression of Hyperspectral Images; Improved Signal Chains for Readout of CMOS Imagers; SOI CMOS Imager with Suppression of Cross-Talk; Error-Rate Bounds for Coded PPM on a Poisson Channel; Biomorphic Multi-Agent Architecture for Persistent Computing; and Using Covariance Analysis to Assess Pointing Performance.

Source record↗

DOE OSTI2021

FTK: A Simplicial Spacetime Meshing Framework for Robust and Scalable Feature Tracking

In this work, we present the Feature Tracking Kit (FTK), a framework that simplifies, scales, and delivers various feature-tracking algorithms for scientific data. The key of FTK is our simplicial spacetime meshing scheme that generalizes both regular and unstructured spatial meshes to spacetime while tessellating spacetime mesh elements into simplices. The benefits of using simplicial spacetime meshes include (1) reducing ambiguity cases for feature extraction and tracking, (2) simplifying the handling of degeneracies using symbolic perturbations, and (3) enabling scalable and parallel processing. The use of simplicial spacetime meshing simplifies and improves the implementation of several feature-tracking algorithms for critical points, quantum vortices, and isosurfaces. As a software framework, FTK provides end users with VTK/ParaView filters, Python bindings, a command line interface, and programming interfaces for feature-tracking applications. We demonstrate use cases as well as scalability studies through both synthetic data and scientific applications including tokamak, fluid dynamics, and superconductivity simulations. We also conduct end-to-end performance studies on the Summit supercomputer. FTK is open sourced under the MIT license: https://github.com/hguo/ftk.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1994

A Knowledge-Based Representation Scheme for Environmental Science Models

One of the primary methods available for studying environmental phenomena is the construction and analysis of computational models. We have been studying how artificial intelligence techniques can be applied to assist in the development and use of environmental science models within the context of NASA-sponsored activities. We have identified several high-utility areas as potential targets for research and development: model development; data visualization, analysis, and interpretation; model publishing and reuse, training and education; and framing, posing, and answering questions. Central to progress on any of the above areas is a representation for environmental models that contains a great deal more information than is present in a traditional software implementation. In particular, a traditional software implementation is devoid of any semantic information that connects the code with the environmental context that forms the background for the modeling activity. Before we can build AI systems to assist in model development and usage, we must develop a representation for environmental models that adequately describes a model's semantics and explicitly represents the relationship between the code and the modeling task at hand. We have developed one such representation in conjunction with our work on the SIGMA (Scientists' Intelligent Graphical Modeling Assistant) environment. The key feature of the representation is that it provides a semantic grounding for the symbols in a set of modeling equations by linking those symbols to an explicit representation of the underlying environmental scenario.

Keller, Richard M.↗

NASA NTRS2004

The Role of Ontologies in Schema-based Program Synthesis

Program synthesis is the process of automatically deriving executable code from (non-executable) high-level specifications. It is more flexible and powerful than conventional code generation techniques that simply translate algorithmic specifications into lower-level code or only create code skeletons from structural specifications (such as UML class diagrams). Key to building a successful synthesis system is specializing to an appropriate application domain. The AUTOBAYES and AUTOFILTER systems, under development at NASA Ames, operate in the two domains of data analysis and state estimation, respectively. The central concept of both systems is the schema, a representation of reusable computational knowledge. This can take various forms, including high-level algorithm templates, code optimizations, datatype refinements, or architectural information. A schema also contains applicability conditions that are used to determine when it can be applied safely. These conditions can refer to the initial specification, to intermediate results, or to elements of the partially-instantiated code. Schema-based synthesis uses AI technology to recursively apply schemas to gradually refine a specification into executable code. This process proceeds in two main phases. A front-end gradually transforms the problem specification into a program represented in an abstract intermediate code. A backend then compiles this further down into a concrete target programming language of choice. A core engine applies schemas on the initial problem specification, then uses the output of those schemas as the input for other schemas, until the full implementation is generated. Since there might be different schemas that implement different solutions to the same problem this process can generate an entire solution tree. AUTOBAYES and AUTOFILTER have reached the level of maturity where they enable users to solve interesting application problems, e.g., the analysis of Hubble Space Telescope images. They are large (in total around 100kLoC Prolog), knowledge intensive systems that employ complex symbolic reasoning to generate a wide range of non-trivial programs for complex application do- mains. Their schemas can have complex interactions, which make it hard to change them in isolation or even understand what an existing schema actually does. Adding more capabilities by increasing the number of schemas will only worsen this situation, ultimately leading to the entropy death of the synthesis system. The root came of this problem is that the domain knowledge is scattered throughout the entire system and only represented implicitly in the schema implementations. In our current work, we are addressing this problem by making explicit the knowledge from Merent parts of the synthesis system. Here; we discuss how Gruber's definition of an ontology as an explicit specification of a conceptualization matches our efforts in identifying and explicating the domain-specific concepts. We outline the dual role ontologies play in schema-based synthesis and argue that they address different audiences and serve different purposes. Their first role is descriptive: they serve as explicit documentation, and help to understand the internal structure of the system. Their second role is prescriptive: they provide the formal basis against which the other parts of the system (e.g., schemas) can be checked. Their final role is referential: ontologies also provide semantically meaningful "hooks" which allow schemas and tools to access the internal state of the program derivation process (e.g., fragments of the generated code) in domain-specific rather than language-specific terms, and thus to modify it in a controlled fashion. For discussion purposes we use AUTOLINEAR, a small synthesis system we are currently experimenting with, which can generate code for solving a system of linear equations, Az = b.

Bures, Tomas↗

DOE OSTI2024

Symbolic diagnostics to interpret and analyze neural network models

Embedded machine-learned models (EMLMs) have the promise to improve the predictive accuracy of engineering simulators in environments of national interest. EMLMs often comprise complex input-output maps (e.g., neural networks), which make them unamenable to rigorous analysis and generally difficult to interpret. In the face of decades of theory, this lack of interpretability is a significant barrier to building confidence in these models. This work outlines an approach to interpret EMLMs using sparse polynomial regression for comparison with theoretical understanding. To do so, we build on the concept of Locally Interpretable Model-agnostic Explanations (LIME) using physics-informed clustering, prototype selection, and library construction. While general, we demonstrate our method on tensor-basis neural networks used in Reynolds-Averaged Navier-Stokes simulations of hypersonic fluid flows. Results are presented for a simulated toy model and for direct numerical simulations (DNS) of turbulent flows over a flat plate.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Machine learning of superconducting critical temperature from Eliashberg theory

Abstract The Eliashberg theory of superconductivity accounts for the fundamental physics of conventional superconductors, including the retardation of the interaction and the Coulomb pseudopotential, to predict the critical temperature T c . McMillan, Allen, and Dynes derived approximate closed-form expressions for the critical temperature within this theory, which depends on the electron–phonon spectral function α 2 F ( ω ). Here we show that modern machine-learning techniques can substantially improve these formulae, accounting for more general shapes of the α 2 F function. Using symbolic regression and the SISSO framework, together with a database of artificially generated α 2 F functions and numerical solutions of the Eliashberg equations, we derive a formula for T c that performs as well as Allen–Dynes for low- T c superconductors and substantially better for higher- T c ones. This corrects the systematic underestimation of T c while reproducing the physical constraints originally outlined by Allen and Dynes. This equation should replace the Allen–Dynes formula for the prediction of higher-temperature superconductors.

36 MATERIALS SCIENCE↗

DOE OSTI2015

Helium: lifting high-performance stencil kernels from stripped x86 binaries to halide DSL code

Highly optimized programs are prone to bit rot, where performance quickly becomes suboptimal in the face of new hardware and compiler techniques. In this paper we show how to automatically lift performance-critical stencil kernels from a stripped x86 binary and generate the corresponding code in the high-level domain-specific language Halide. Using Halide's state-of-the-art optimizations targeting current hardware, we show that new optimized versions of these kernels can replace the originals to rejuvenate the application for newer hardware. The original optimized code for kernels in stripped binaries is nearly impossible to analyze statically. Instead, we rely on dynamic traces to regenerate the kernels. We perform buffer structure reconstruction to identify input, intermediate and output buffer shapes. Here, we abstract from a forest of concrete dependency trees which contain absolute memory addresses to symbolic trees suitable for high-level code generation. This is done by canonicalizing trees, clustering them based on structure, inferring higher-dimensional buffer accesses and finally by solving a set of linear equations based on buffer accesses to lift them up to simple, high-level expressions. Helium can handle highly optimized, complex stencil kernels with input-dependent conditionals. We lift seven kernels from Adobe Photoshop giving a 75 % performance improvement, four kernels from Irfan View, leading to 4.97 x performance, and one stencil from the mini GMG multigrid benchmark netting a 4.25 x improvement in performance. We manually rejuvenated Photoshop by replacing eleven of Photoshop's filters with our lifted implementations, giving 1.12 x speedup without affecting the user experience.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

Methods and apparatuses using filter banks for multi-carrier spread spectrum signals

A transmitter includes a synthesis filter bank to spread a data symbol to a plurality of frequencies by encoding the data symbol on each frequency, apply a common pulse-shaping filter, and apply gains to the frequencies such that a power level of each frequency is less than a noise level of other communication signals within the spectrum. Each frequency is modulated onto a different evenly spaced subcarrier. A demodulator in a receiver converts a radio frequency input to a spread-spectrum signal in a baseband. A matched filter filters the spread-spectrum signal with a common filter having characteristics matched to the synthesis filter bank in the transmitter by filtering each frequency to generate a sequence of narrow pulses. A carrier recovery unit generates control signals responsive to the sequence of narrow pulses suitable for generating a phase-locked loop between the demodulator, the matched filter, and the carrier recovery unit.

42 ENGINEERING↗

DOE OSTI2019

Final Report for Transmission of Information by Acoustic Communication along Metal Pathways in Nuclear Facilities

Transmission of information using elastic waves on existing metallic pipes provides an alternative communication option for a nuclear facility. The advantages of this approach consist of transmitting information through barriers, such as the containment building wall. A viable candidate for acoustic communication channel is a chemical volume control system (CVCS) stainless steel pipe, which penetrates through the containment building wall. A laboratory bench-scale system consisting of a nuclear grade CVCS-like pipe and ultrasonic transducers was assembled for a preliminary communication system analysis. Because of low bandwidth and spectral dispersion of ultrasonic transducers, on off keying (OOK) protocol was chosen for data communication. Operation of the acoustic communication during normal and post-accident conditions involves data transmission on the CVCS pipe, which according to literature guidelines, will be at 50°C and 150°C, respectively. Preliminary communication system development was performed using paintbrush PZT transducers capable of continuous operation at temperatures up to 80°C. Next, high-temperature LiNbO 3 acoustic transducers, originally developed for flow metering applications of EBRII reactor at Argonne, were utilized to develop a high-temperature acoustic communication system. A Gaussian pulse shape filter was introduced to suppress ringing and thus reduce inter-symbol interference. This resulted in enhancement of data transmission bitrate. Heating tapes, temperature controllers, and thermal insulation were installed on the laboratory pipe to study acoustic communication at elevated temperature. This included development of custom insertion heating elements for controlling temperature at pipe ends. Demonstrations of communication at high temperature included transmission of images and text files. Main achievements thus far include demonstration of transmission of 90KB image at the bitrate of 10Kbps with bit error rate smaller than 10 -3 across the pipe heated to 50°C and 150°C. Final phase of project development involved investigating strategies for deployment of the ultrasonic communication system in a representative environment. Mechanisms Engineering Test Loop (METL) facility at ANL was chosen as a viable candidate for communication system demonstration. Analysis of piping manifolds at METL has shown that in a typical scenario, ultrasonic signals have to be transmitted over straight and bent piping sections. This report describes preliminary studies on transmission of information with ultrasonic shear waves across bent piping sections. A test article consisting of a stainless steel pipe bent at 90° was developed for laboratory analysis of ultrasonic signal transmission. The bent piping test article developed by welding two straight pipes to an elbow. For consistency, the diameter and wall thickness of the bent pipe is the same as that of the straight pipe utilized in prior studies. COMSOL computer simulations were performed to study ultrasonic refracted shear wave coupling and transmission across bent piping. Preliminary evaluations of ultrasonic shear wave transmission were conducted with piezoelectric (PZT) and LiNbO 3 transducers, with the signals recorded with previously developed LabView interface. Preliminary results have shown significant dispersion of transmitted signals, most likely due to reflections and scattering by piping welds. Signal distortion compensation algorithm based on time reversal modulation (TRM) was initially investigated for transmission through solids, and demonstrated for signals transmitted over the bent pipe. Using TRM, it was shown that communication bitrates of 100Kbps were achievable, in principle.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2023

A Method of Estimating Sparse and Doubly-Dispersive Channels

The large delay and Doppler spreads of skywave high-frequency (HF) channels complicates channel acquisition, especially in low-SNR conditions. Using pilot-symbol assisted modulation, we develop a robust method to acquire channel information by first estimating the power-delay profile (PDP) of the channel, then applying that estimate to obtain the channel coefficients only where the PDP is nonzero. We find the presented approach to be robust at low-SNRs, making it suitable for spread-spectrum and underlay waveforms. We show that this two-stage channel acquisition procedure has three advantages: i),the channel is estimated with fewer terms, reducing complexity; ii), the MSE of the channel estimate is lower than assuming a fixed channel length; and iii), each propagation mode is reliably recovered in high-Doppler conditions. We conclude this paper by presenting results of the developed techniques as applied to a filter-bank multicarrier spread-spectrum (FBMC-SS) waveform.

42 ENGINEERING↗

NASA NTRS2010

Performance Bounds on Two Concatenated, Interleaved Codes

A method has been developed of computing bounds on the performance of a code comprised of two linear binary codes generated by two encoders serially concatenated through an interleaver. Originally intended for use in evaluating the performances of some codes proposed for deep-space communication links, the method can also be used in evaluating the performances of short-block-length codes in other applications. The method applies, more specifically, to a communication system in which following processes take place: At the transmitter, the original binary information that one seeks to transmit is first processed by an encoder into an outer code (Co) characterized by, among other things, a pair of numbers (n,k), where n (n > k)is the total number of code bits associated with k information bits and n k bits are used for correcting or at least detecting errors. Next, the outer code is processed through either a block or a convolutional interleaver. In the block interleaver, the words of the outer code are processed in blocks of I words. In the convolutional interleaver, the interleaving operation is performed bit-wise in N rows with delays that are multiples of B bits. The output of the interleaver is processed through a second encoder to obtain an inner code (Ci) characterized by (ni,ki). The output of the inner code is transmitted over an additive-white-Gaussian- noise channel characterized by a symbol signal-to-noise ratio (SNR) Es/No and a bit SNR Eb/No. At the receiver, an inner decoder generates estimates of bits. Depending on whether a block or a convolutional interleaver is used at the transmitter, the sequence of estimated bits is processed through a block or a convolutional de-interleaver, respectively, to obtain estimates of code words. Then the estimates of the code words are processed through an outer decoder, which generates estimates of the original information along with flags indicating which estimates are presumed to be correct and which are found to be erroneous. From the perspective of the present method, the topic of major interest is the performance of the communication system as quantified in the word-error rate and the undetected-error rate as functions of the SNRs and the total latency of the interleaver and inner code. The method is embodied in equations that describe bounds on these functions. Throughout the derivation of the equations that embody the method, it is assumed that the decoder for the outer code corrects any error pattern of t or fewer errors, detects any error pattern of s or fewer errors, may detect some error patterns of more than s errors, and does not correct any patterns of more than t errors. Because a mathematically complete description of the equations that embody the method and of the derivation of the equations would greatly exceed the space available for this article, it must suffice to summarize by reporting that the derivation includes consideration of several complex issues, including relationships between latency and memory requirements for block and convolutional codes, burst error statistics, enumeration of error-event intersections, and effects of different interleaving depths. In a demonstration, the method was used to calculate bounds on the performances of several communication systems, each based on serial concatenation of a (63,56) expurgated Hamming code with a convolutional inner code through a convolutional interleaver. The bounds calculated by use of the method were compared with results of numerical simulations of performances of the systems to show the regions where the bounds are tight (see figure).

Moision, Bruce↗

DOE OSTI2025

Filterbank Multicarrier Communications for High Mobility Underwater Acoustic Links

This paper presents a new method of designing prototype filters that are robust against time and frequency dispersive (i.e., doubly dispersive) underwater acoustic (UWA) channels. The proposed design uses a modified form of Slepian sequences as a basis set to arrive at a design that is maximally compact along both time and frequency/Doppler dimensions. This keeps the inter-symbol interference confined to a small number of adjacent data symbols, both across time and frequency dimensions. It also minimizes the ramp-up (at the beginning) and ramp-down (at the end) of each synthesized data packet. Here, we test our design by making use of the BELLHOP/VirTex channel simulator and compare its performance with that of the widely used orthogonal frequency division multiplexing (OFDM) method. Our emphasis is on scenarios where the channel impulse response extends to a few hundreds of milli-seconds and the relative speed of communicating vehicles can be as large as 10 m/s. We find that while OFDM fails in majority of these scenarios, the proposed design continues to work well in all the scenarios that we simulate.

97 - MATHEMATICS AND COMPUTING↗

NASA NTRS2005

Improved Compression of Wavelet-Transformed Images

A recently developed data-compression method is an adaptive technique for coding quantized wavelet-transformed data, nominally as part of a complete image-data compressor. Unlike some other approaches, this method admits a simple implementation and does not rely on the use of large code tables. A common data compression approach, particularly for images, is to perform a wavelet transform on the input data, and then losslessly compress a quantized version of the wavelet-transformed data. Under this compression approach, it is common for the quantized data to include long sequences, or runs, of zeros. The new coding method uses prefixfree codes for the nonnegative integers as part of an adaptive algorithm for compressing the quantized wavelet-transformed data by run-length coding. In the form of run-length coding used here, the data sequence to be encoded is parsed into strings consisting of some number (possibly 0) of zeros, followed by a nonzero value. The nonzero value and the length of the run of zeros are encoded. For a data stream that contains a sufficiently high frequency of zeros, this method is known to be more effective than using a single variable length code to encode each symbol. The specific prefix-free codes used are from two classes of variable-length codes: a class known as Golomb codes, and a class known as exponential-Golomb codes. The codes within each class are indexed by a single integer parameter. The present method uses exponential-Golomb codes for the lengths of the runs of zeros, and Golomb codes for the nonzero values. The code parameters within each code class are determined adaptively on the fly as compression proceeds, on the basis of statistics from previously encoded values. In particular, a simple adaptive method has been devised to select the parameter identifying the particular exponential-Golomb code to use. The method tracks the average number of bits used to encode recent runlengths, and takes the difference between this average length and the code parameter. When this difference falls outside a fixed range, the code parameter is updated (increased or decreased). The Golomb code parameter is selected based on the average magnitude of recently encoded nonzero samples. The coding method requires no floating- point operations, and more readily adapts to local statistics than other methods. The method can also accommodate arbitrarily large input values and arbitrarily long runs of zeros. In practice, this means that changes in the dynamic range or size of the input data set would not require a change to the compressor. The algorithm has been tested in computational experiments on test images. A comparison with a previously developed algorithm that uses large code tables (generated via Huffman coding on training data) suggests that the data-compression effectiveness of the present algorithm is comparable to the best performance achievable by the previously developed algorithm.

Kiely, Aaron↗

DOE OSTI2026

Geometrical optics without singularities: using the ray time as the coordinate space

Geometrical optics (GO) is widely used for reduced modelling of waves in plasmas, but it fails near reflection points, where it predicts a spurious singularity of the wave amplitude. We show how to avoid this singularity by adopting a different representation of the wave equation. Instead of the physical coordinate 𝑥 and the wavevector 𝑘, we use the ray time 𝜏 as the new canonical coordinate and the ray energy ℎ as the associated canonical momentum. To derive the envelope equation in the 𝜏-representation, we construct the Weyl symbol calculus on the (𝜏,ℎ) space and show that the corresponding Weyl symbols are related to their (𝑥,𝑘) counterparts by the Airy transform. This allows us to express the coefficients in the envelope equation through the known properties of the original dispersion operator. When necessary, solutions of this equation can be mapped to the 𝑥-space using a generalised metaplectic transform. However, the field per se might not even be needed in practice. Instead, knowing the corresponding Wigner function usually suffices for linear and quasilinear calculations. As a Weyl symbol itself, the Wigner function can be mapped analytically, using the aforementioned Airy transform. We show that the standard Airy patterns that form in regions where conventional GO fails are successfully reproduced within metaplectic GO (MGO) simply by remapping the field from the 𝜏-space to the 𝑥-space. An extension to mode-converting waves is also presented. This formulation, which we call generalised MGO, can be particularly useful, for example, for reduced modelling of the O–X conversion in inhomogeneous plasma near the critical density, an effect that is important for fusion applications and also occurs in the ionosphere. Overall, MGO can replace GO for any practical purposes, because it better handles cutoffs and is similar otherwise.

plasma waves↗

NASA NTRS2007

Smooth Phase Interpolated Keying

Smooth phase interpolated keying (SPIK) is an improved method of computing smooth phase-modulation waveforms for radio communication systems that convey digital information. SPIK is applicable to a variety of phase-shift-keying (PSK) modulation schemes, including quaternary PSK (QPSK), octonary PSK (8PSK), and 16PSK. In comparison with a related prior method, SPIK offers advantages of better performance and less complexity of implementation. In a PSK scheme, the underlying information waveform that one seeks to convey consists of discrete rectangular steps, but the spectral width of such a waveform is excessive for practical radio communication. Therefore, the problem is to smooth the step phase waveform in such a manner as to maintain power and bandwidth efficiency without incurring an unacceptably large error rate and without introducing undesired variations in the amplitude of the affected radio signal. Although the ideal constellation of PSK phasor points does not cause amplitude variations, filtering of the modulation waveform (in which, typically, a rectangular pulse is converted to a square-root raised cosine pulse) causes amplitude fluctuations. If a power-efficient nonlinear amplifier is used in the radio communication system, the fluctuating-amplitude signal can undergo significant spectral regrowth, thus compromising the bandwidth efficiency of the system. In the related prior method, one seeks to solve the problem in a procedure that comprises two major steps: phase-value generation and phase interpolation. SPIK follows the two-step approach of the related prior method, but the details of the steps are different. In the phase-value-generation step, the phase values of symbols in the PSK constellation are determined by a phase function that is said to be maximally smooth and that is chosen to minimize the spectral spread of the modulated signal. In this step, the constellation is divided into two groups by assigning, to information symbols, phase values that result in equal numbers of clockwise and counter-clockwise phase rotations for equally likely symbols. The purpose served by assigning phase values in this way is to prevent unnecessary generation of spectral lines and prevent net shifts of the carrier signal. In the phase-interpolation step, the smooth phase values are interpolated over a number, n, of consecutive symbols (including the present symbol) by means of an unconventional spline curve fit.

Borah, Deva K.↗

DOE OSTI2020

Simple descriptor derived from symbolic regression accelerating the discovery of new perovskite catalysts

Symbolic regression (SR) is an approach of interpretable machine learning for building mathematical formulas that best fit certain datasets. In this work, SR is used to guide the design of new oxide perovskite catalysts with improved oxygen evolution reaction (OER) activities. A simple descriptor, μ/t, where μ and t are the octahedral and tolerance factors, respectively, is identified, which accelerates the discovery of a series of new oxide perovskite catalysts with improved OER activity. We successfully synthesise five new oxide perovskites and characterise their OER activities. Remarkably, four of them, Cs 0.4 La 0.6 Mn 0.25 Co 0.75 O 3 , Cs 0.3 La 0.7 NiO 3 , SrNi 0.75 Co 0.25 O 3 , and Sr 0.25 Ba 0.75 NiO 3 , are among the oxide perovskite catalysts with the highest intrinsic activities. Our results demonstrate the potential of SR for accelerating the data-driven design and discovery of new materials with improved properties.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2019

Building an open source software ecosystem for cross-disciplinary plasma research and education

Software is crucial to all areas of modern plasma science research. Laboratory plasma physicists use software to interpret plasma diagnostics, analyze experimental results, and glean insights using advanced techniques from data science. Space scientists use software to reduce and understand in situ observations. Numericists use software to simulate the behavior of laboratory, heliospheric, and astrophysical plasmas, and then analyze or visualize the results. Theorists use symbolic manipulation software to perform or check derivations. Cross-disciplinary research and cross-comparisons between experiments, observations, simulations, and theories all require software. Despite our heavy reliance on software, funding agencies have traditionally had few avenues available to support development of general purpose research software infrastructure.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗