Search NASA⌕ Search

SEARCH · Search NASA

Results for “MATHEMATICS - BOUNDARY VALUES”

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 487 records · Page 27

A National Infrastructure for Artificial Intelligence on the Grid (NI4AI) (Final Scientific/Technical Report)

Electric utilities have traditionally taken a very pragmatic yet myopic approach with grid sensors and the resulting collected data. Sensors are purchased and deployed to solve a specific, known problem that has risen to sufficient awareness as to justify the effort of deploying sensors and the needed capital investment. This sensor data flows into proprietary software packages with limited functionality intended only to address the initial problem. This approach aligns with the financial incentives of the utility to deploy capital into fixed hardware assets for which the corporations earn a rate of return. This mentality stands in stark contrast to the big data revolution that started nearly 25 years ago with the rise of Google. In this worldview, data is a fundamental business asset; successful organizations collect, store, explore, merge, and exploit as much data as possible to not only solve problems well understood today but also to tackle new problems that will inevitably rise tomorrow. The ARPA-E Open Innovation 2018 project entitled A National Infrastructure for Artificial Intelligence on the Grid or NI4AI for short was designed to demonstrate this alternative paradigm for using data. To do this, the project was composed of three key thrust areas. The first major component deployed a variety of high-frequency grid sensors and captured terabytes of both wide-scale and localized grid measurements, generating high-value datasets for grid research and algorithm development. The second aspect made available PingThings’ PredictiveGridTM, a horizontally scalable, cloud-based data management and AI platform built for time series data to explore and exploit the collected data. Finally, the project fostered a diverse and open research community composed of experts from numerous fields through focused educational content, code sharing, and data science competitions. Shifting away from “single use” sensors and closed data silos within electric utilities is a major benefit to the public at large. This legacy approach to data is incredibly (1) capital intensive (new sensors must be deployed for each new problem and problems tend to arise continuously) and (2) painfully slow (new problems must be identified first and then new sensors must be deployed to collect data to begin to address the issue). The transition to a carbon neutral grid requires a massive transformation of the existing grid infrastructure and will continue to challenge the legacy grid in unforeseen ways. The only way to make the energy transition cost effective is for utilities to abandon this dated data paradigm and adopt more contemporary approaches. NI4AI has shown that it is technically possible and economically feasible to ingest, explore, and exploit grid data collected from even very high frequency sensing, such as continuous point on wave sensors collecting measurements 10,000 times a second. In fact, the PredictiveGrid platform used is commercially available and deployed at several utilities in the United States. Project accomplishments were numerous and included (1) making available a state of the art time series platform to the community, (2) collecting over 520 streams of time series data from grid sensors totaling over 1 trillion grid measurements, and (3) developing and nurturing a community within the industry focused on the use of data to create value for utilities and, ultimately, end consumers.

97 MATHEMATICS AND COMPUTING↗

Recovery of thrust magnitude from minitrack data for the SERT-2 spacecraft

An estimation of the thrust magnitude of the Space Electric Rocket Test (SERT) engine is obtained. This estimation is based on changes in the SERT-2 spacecraft orbit as determined from tracking data by using a revised definitive orbit determination system which includes the effect of thrust upon the motion of a spacecraft in general and the SERT-2 satellite in particular. The results of these computations are found to be in good agreement with values of acceleration as determined by an on-board accelerometer. A discussion of the mathematical model used to obtain the numerical results is also presented.

Jones, E. M.↗

Diagnostics of sources of disturbances and distribution of vibrations over the width of a tape in tape-feed mechanisms

Disturbances created by certain assemblies and components of tape-feed mechanisms (TFM) and acting on a moving magnetic tape are studied. The method, based on elements of digital logic, is established by stress-strain diagrams of the longitudinal deformations and vibrations across the width of a magnetic tape. Experimental studies were carried out for determination of the functional relationships of longitudinal deformations in a section of magnetic tape to the magnitude of roller play, tension vibrations rate of movement, and elasticity of magnetic tapes. A block diagram of the measurements is shown. Appropriate digital computer algorithms and programs were proposed for statistical analysis of the data obtained. Estimates of the mathematical expectation, dispersion, intercorrelation function, energy spectral density, and distribution pattern of the random process values were calculated.

Kenstavichyus, A. B. B.↗

Mathematical model for steady state, simple ampholyte isoelectric focusing: Development, computer simulation and implementation

The elimination of Ampholine from the system by establishing the pH gradient with simple ampholytes is proposed. A mathematical model was exercised at the level of the two-component system by using values for mobilities, diffusion coefficients, and dissociation constants representative of glutamic acid and histidine. The constants assumed in the calculations are reported. The predictions of the model and computer simulation of isoelectric focusing experiments are in direct importance to obtain Ampholine-free, stable pH gradients.

Palusinski, O. A.↗

Advances in core loss calculations for magnetic materials

A new analytical technique which predicts the basic magnetic properties under various operating conditions encountered in state-of-the-art dc-ac/dc converters is discussed. Using a new flux-controlled core excitation circuit, magnetic core characteristics were developed for constant values of ramp flux (square wave voltage excitation) and frequency. From this empirical data, a mathematical loss characteristics equation is developed to analytically predict the specific core loss of several magnetic materials under various waveform excitation conditions. In addition, these characteristics show the circuit designer for the first time the direct functional relatonships between induction level and specific core loss as a function of the two key dc-dc converter operating parameters of input voltage and duty cycle.

Triner, J. E.↗

Transverse conductivity of a relativistic plasma in oblique electric and magnetic fields

Resistive tearing in a primary candidate for flares occurring in stressed magnetic fields. Its possible application to the strongly magnetized environments (Hz about 10 to the 12th G) near the surface of neutron stars, particularly as a mechanism for generating the plasma heating and particle acceleration leading to gamma-ray bursts, has motivated a quantum treatment of this process, which requires knowledge of the electrical conductivity sigma of a relativistic gas in a new domain (i.e., that of a low-density n/e/) plasma in oblique electric and magnetic fields. This paper discusses the mathematical formalism for calculating sigma and present numerical results for a wide range of parameter values. The results indicate that sigma depends very strongly on both the applied electric and magnetic fields.

Melia, Fulvio↗

Mapping virtual addresses to different physical addresses for value disambiguation for thread memory access requests

A multiprocessor system includes nodes. Each node includes a data path that includes a core, a TLB, and a first level cache implementing disambiguation. The system also includes at least one second level cache and a main memory. For thread memory access requests, the core uses an address associated with an instruction format of the core. The first level cache uses an address format related to the size of the main memory plus an offset corresponding to hardware thread meta data. The second level cache uses a physical main memory address plus software thread meta data to store the memory access request. The second level cache accesses the main memory using the physical address with neither the offset nor the thread meta data after resolving speculation. In short, this system includes mapping of a virtual address to a different physical addresses for value disambiguation for different threads.

97 MATHEMATICS AND COMPUTING↗

Method for discovering relationships in data by dynamic quantum clustering

Data clustering is provided according to a dynamical framework based on quantum mechanical time evolution of states corresponding to data points. To expedite computations, we can approximate the time-dependent Hamiltonian formalism by a truncated calculation within a set of Gaussian wave-functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data-points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition and/or feature filtering.

97 MATHEMATICS AND COMPUTING↗

Electric power grid control using a market-based resource allocation system

Disclosed herein are representative embodiments of methods, apparatus, and systems for distributing a resource (such as electricity) using a resource allocation system. In one exemplary embodiment, a plurality of requests for electricity are received from a plurality of end-use consumers. The requests indicate a requested quantity of electricity and a consumer-requested index value indicative of a maximum price a respective end-use consumer will pay for the requested quantity of electricity. A plurality of offers for supplying electricity are received from a plurality of resource suppliers. The offers indicate an offered quantity of electricity and a supplier-requested index value indicative of a minimum price for which a respective supplier will produce the offered quantity of electricity. A dispatched index value is computed at which electricity is to be supplied based at least in part on the consumer-requested index values and the supplier-requested index values.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Method for discovering relationships in data by dynamic quantum clustering

Data clustering is provided according to a dynamical framework based on quantum mechanical time evolution of states corresponding to data points. To expedite computations, we can approximate the time-dependent Hamiltonian formalism by a truncated calculation within a set of Gaussian wave-functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data-points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition and/or feature filtering.

97 MATHEMATICS AND COMPUTING↗

Dynamic Quantum Clustering: A Tool for Unsupervised Exploration of Structures in Data

A given set of data-points in some feature space may be associated with a Schroedinger equation whose potential is determined by the data. This is known to lead to good clustering solutions. Here we extend this approach into a full-fledged dynamical scheme using a time-dependent Schroedinger equation with a small diffusion component. Moreover, we approximate this Hamiltonian formalism by a truncated calculation within a set of Gaussian wave functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data-points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition or feature filtering.

97 MATHEMATICS AND COMPUTING↗

Mathematical modelling of the beam under axial compression force applied at any point – the buckling problem

The study is devoted to stability of simply supported beam under axial compression. The beam is subjected to an axial load located at any point along the axis of the beam. The buckling problem has been desribed and solved mathematically. Critical loads have been calculated. In the particular case, the Euler’s buckling load is obtained. Explicit solutions are given. The values of critical loads are collected in tables and shown in figure. The relation between the point of the load application and the critical load is presented.

97 MATHEMATICS AND COMPUTING↗

Implicit–explicit multirate infinitesimal stage-restart methods

Implicit–Explicit (IMEX) methods are flexible numerical time integration methods which solve an initial-value problem (IVP) that is split into stiff and nonstiff processes with the goal of lower computational costs than a purely implicit or explicit approach. A complementary form of flexible IVP solvers are multirate infinitesimal methods for problems split into fast- and slow-changing dynamics, that solve a multirate IVP by evolving a sequence of “fast” IVPs using any suitably accurate algorithm. This article introduces a new class of high-order implicit–explicit multirate methods that are designed for multirate IVPs in which the slow-changing dynamics are further split in an IMEX fashion. This new class, which we call implicit–explicit multirate infinitesimal stage-restart (IMEX-MRI-SR), both improves upon the previous implicit–explicit multirate infinitesimal generalized-structure additive Runge Kutta (IMEX-MRI-GARK) methods by allowing for far easier creation of new embedded methods, and extends multirate exponential Runge Kutta (MERK) methods by allowing the fast-changing dynamics to be nonlinear and the methods to be implicit. We leverage GARK theory to derive conditions for orders of accuracy up to four, and we provide second- and third-order accurate example methods, which are the first known embedded MRI methods with IMEX structure. We then perform numerical simulations demonstrating convergence rates and computational performance in both fixed-step and adaptive-step settings.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Neutron dosimetry in organs of an adult human phantom using linacs with multileaf collimator in radiotherapy treatments

Purpose: To calculate absorbed doses due to neutrons in 87 organs/tissues for anthropomorphic phantoms, irradiated in position supine (head first into the gantry) with orientations anteroposterior (AP) and right-left (RLAT) with a 18 MV accelerator. Conversion factors from monitor units to {mu}Gy per neutron in organs, equivalent doses in organs/tissues, and effective doses, which permit to quantify stochastic risks, are estimated. Methods: MAX06 and FAX06 phantoms were modeled with MCNPX and irradiated with a 18 MV Varian Clinac 2100C/D accelerator whose geometry included a multileaf collimator. Two actual fields of a pelvic treatment were simulated using electron-photon-neutron coupled transport. Absorbed doses due to neutrons were estimated from kerma. Equivalent doses were estimated using the radiation weighting factor corresponding to an average incident neutron energy 0.47 MeV. Statistical uncertainties associated to absorbed doses, as calculated by MCNPX, were also obtained. Results: Largest doses were absorbed in shallowest (with respect to the neutron pathway) organs. In {mu}GyMU{sup -1}, values of 2.66 (for penis) and 2.33 (for testes) were found in MAX06, and 1.68 (for breasts), 1.05 (for lenses of eyes), and 0.94 (for sublingual salivary glands) in FAX06, in AP orientation. In RLAT, the largest doses were found for bone tissues (leg) just at the entrance of the beam in the body (right side in our case). Values, in {mu}GyMU{sup -1}, of 1.09 in upper leg bone right spongiosa, for MAX06, and 0.63 in mandible spongiosa, for FAX06, were found. Except for gonads, liver, and stomach wall, equivalent doses found for FAX06 were, in both orientations, higher than for MAX06. Equivalent doses in AP are higher than in RLAT for all organs/tissues other than brain and liver. Effective doses of 12.6 and 4.1 {mu}SvMU{sup -1} were found for AP and RLAT, respectively. The organs/tissues with larger relative contributions to the effective dose were testes and breasts, in AP, and breasts and red marrow, in RLAT. Equivalent and effective doses obtained for MAX06/FAX06 were smaller (between 2 and 20 times) than those quoted for the mathematical phantoms ADAM/EVA in ICRP-74. Conclusions: The new calculations of conversion coefficients for neutron irradiation in AP and RLAT irradiation geometries show a reduction in the values of effective dose by factors 7 (AP) and 6 (RLAT) with respect to the old data obtained with mathematical phantoms. The existence of tissues or anatomical regions with maximum absorbed doses, such as penis, lens of eyes, fascia (part of connective tissue), etc., organs/tissues that classic mathematical phantoms did not include because they were not considered for the study of stochastic effects, has been revealed. Absorbed doses due to photons, obtained following the same simulation methodology, are larger than those due to neutrons, reaching values 100 times larger as the primary beam is approached. However, for organs far from the treated volume, absorbed photon doses can be up to three times smaller than neutron ones. Calculations using voxel phantoms permitted to know the organ dose conversion coefficients per MU due to secondary neutrons in the complete anatomy of a patient.

61 RADIATION PROTECTION AND DOSIMETRY↗

Characterization and Valuation of the Uncertainty of Calibrated Parameters in Microsimulation Decision Models

We evaluated the implications of different approaches to characterize the uncertainty of calibrated parameters of microsimulation decision models (DMs) and quantified the value of such uncertainty in decision making. We calibrated the natural history model of CRC to simulated epidemiological data with different degrees of uncertainty and obtained the joint posterior distribution of the parameters using a Bayesian approach. We conducted a probabilistic sensitivity analysis (PSA) on all the model parameters with different characterizations of the uncertainty of the calibrated parameters. We estimated the value of uncertainty of the various characterizations with a value of information analysis. We conducted all analyses using high-performance computing resources running the Extreme-scale Model Exploration with Swift (EMEWS) framework. The posterior distribution had a high correlation among some parameters. The parameters of the Weibull hazard function for the age of onset of adenomas had the highest posterior correlation of -0.958. When comparing full posterior distributions and the maximum-a-posteriori estimate of the calibrated parameters, there is little difference in the spread of the distribution of the CEA outcomes with a similar expected value of perfect information (EVPI) of $\$$653 and $\$$685, respectively, at a willingness-to-pay (WTP) threshold of $\$$66,000 per quality-adjusted life year (QALY). Ignoring correlation on the calibrated parameters’ posterior distribution produced the broadest distribution of CEA outcomes and the highest EVPI of $\$$809 at the same WTP threshold. Different characterizations of the uncertainty of calibrated parameters affect the expected value of eliminating parametric uncertainty on the CEA. Ignoring inherent correlation among calibrated parameters on a PSA overestimates the value of uncertainty.

97 MATHEMATICS AND COMPUTING↗

A Testbed of Parallel Kernels for Computer Science Research

For several decades, computer scientists have sought guidance on how to evolve architectures, languages, and programming models for optimal performance, efficiency, and productivity. Unfortunately, this guidance is most often taken from the existing software/hardware ecosystem. Architects attempt to provide micro-architectural solutions to improve performance on fixed binaries. Researchers tweak compilers to improve code generation for existing architectures and implementations, and they may invent new programming models for fixed processor and memory architectures and computational algorithms. In today's rapidly evolving world of on-chip parallelism, these isolated and iterative improvements to performance may miss superior solutions in the same way gradient descent optimization techniques may get stuck in local minima. In an initial study, we have developed an alternate approach that, rather than starting with an existing hardware/software solution laced with hidden assumptions, defines the computational problems of interest and invites architects, researchers and programmers to implement novel hardware/ software co-designed solutions. Our work builds on the previous ideas of computational dwarfs, motifs, and parallel patterns by selecting a representative set of essential problems for which we provide: An algorithmic description; scalable problem definition; illustrative reference implementations; verification schemes. For simplicity, we focus initially on the computational problems of interest to the scientific computing community but proclaim the methodology (and perhaps a subset of the problems) as applicable to other communities. We intend to broaden the coverage of this problem space through stronger community involvement. Previous work has established a broad categorization of numerical methods of interest to the scientific computing, in the spirit of the NAS Benchmarks, which pioneered the basic idea of a 'pencil and paper benchmark' in the 1990s. The initial result of the more modern study was the seven dwarfs, which was subsequently extended to 13 motifs. These motifs have already been useful in defining classes of applications for architecture-software studies. However, these broad-brush problem statements often miss the nuance seen in individual kernels. For example, the computational requirements of particle methods vary greatly between the naive (but more accurate) direct calculations and the particle-mesh and particle-tree codes. Thus we commenced our study with an enumeration of problems, but then proceeded by providing not only reference implementations for each problem, but more importantly a mathematical definition that allows one to escape iterative approaches to software/hardware optimization. To ensure long term value, we have augmented each of our reference implementations with both a scalable problem generator and a verification scheme. In a paper we have prepared that documents our efforts, we describe in detail this process of problem definition, scalable input creation, verification, and implementation of reference codes for the scientific computing domain. Table 1 enumerates and describes the level of support we've developed for each kernel. We group these important kernels using the Berkeley dwarfs/motifs taxonomy using a red box in the appropriate column. As kernels become progressively complex, they build upon other, simpler computational methods. We note this dependency via orange boxes. After enumeration of the important numerical problems, we created a domain-appropriate high-level definition of each problem. To ensure future endeavors are not tainted by existing implementations, we specified the problem definition to be independent of both computer architecture and existing programming languages, models, and data types. Then, to provide context as to how such kernels productively map to existing architectures, languages and programming models, we produced reference implementations for most of the kernel (see table). These sample codes should be viewed as 'hints,' designed to show how other designers have mapped a problem's operands and operators to existing hardware and software. Since we wanted such implementations to be illustrative, we tried to ensure they were the most straightforward implementation in the easiest to understand languages using familiar architectures. To that end, most of the linear algebra-oriented computations are written in MATLAB using array indexing to process matrices, rather than one-line library calls to compute the same kernel. This ensures that the kernel's computation is explicit and readable in the implementation and not hidden behind a library. For other problems, such as the Barnes-Hut n-Body solver, the implementations were written in pure C, without any supporting library computations. Along this line, we have also created a scalable problem generator to accompany each computation.

97 MATHEMATICS AND COMPUTING↗

Generalized variational principle for excited states using nodes of trial functions

The familiar variational principle provides an upper bound to the ground-state energy of a given Hamiltonian. This allows one to optimize a trial wave function by minimizing the expectation value of the energy. This approach is also trivially generalized to excited states, so that given a trial wave function of a certain symmetry, one can compute an upper bound to the lowest-energy level of that symmetry. In order to generalize further and build an upper bound of an arbitrary excited state of the desired symmetry, a linear combination of basis functions is generally used to generate an orthogonal set of trial functions, all bounding their respective states. However, sometimes a compact wave-function form is sought, and a basis-set expansion is not desirable or possible. Here we present an alternative generalization of the variational principle to excited states that does not require explicit orthogonalization to lower-energy states. It is valid for one-dimensional systems and, with additional information, to at least some n-dimensional systems. This generalized variational principle exploits information about the nodal structure of the trial wave function, giving an upper bound to the exact energy without the need to build a linear combination of basis functions. To illustrate the theorem we apply it to a nontrivial example: the 1s2s {sup 1} S excited state of the helium atom.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Strength in Shear of the Thin Curved Sheets of Alclad

This note is on an investigation made to obtain information on the strength of thin curved sheets of Alclad in shear. Designers may utilize this material as a strength member as well as for a covering for the wings and fuselages. A reduction may then be made in the size of the internal strength members. These experiments were undertaken with the object of securing the maximum value from the metal in this respect. The point at which buckling occurs is of primary importance. The buckling shear of a curved thin plate was determined mathematically and also experimentally. The following formula was obtained mathematically: s=K E t/r in which s is the unit shear, K is a constant, E is the modulus of elasticity, t is the thickness of the material, and r is the radius of curvature. The value of K as determined by the experiments was found to be .075. This formula applies only when s is within the elastic limit of the material. The breaking point of the material was obtained in most of the tests as a matter of information and the results are included in this report. The effect of the supporting ribs was determined by varying the number used.

Smith, George Michael↗