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

Development of a nonlinear switching function and its application to static lift characteristics of straight wings

A mathematical modeling technique was developed for the lift characteristics of straight wings throughout a very wide angle of attack range. The technique employs a mathematical switching function that facilitates the representation of the nonlinear aerodynamic characteristics in the partially and fully stalled regions and permits matching empirical data within + or - 4 percent of maximum values. Although specifically developed for use in modeling the lift characteristics, the technique appears to have other applications in both aerodynamic and nonaerodynamic fields.

Hewes, D. E.↗

Methods of periodicity analysis - Relationship between the Rayleigh analysis and a maximum likelihood method

For periodicity analysis of occurrence rates of discrete events, one can use the maximum likelihood method or the 'Rayleigh analysis'. In a maximum likelihood analysis using a sinusoidal distribution, one tries various values of amplitude A and phase angle Theta(0) of the distribution function. We show that these two methods are essentially equivalent to one another in spite of their different mathematical origins. Using the Rayleigh analysis, therefore, we can simply calculate A and Theta(0) which maximize the likelihood. Using the cumulative nature of the logarithmic likelihood, we can identify time intervals during which the periodicity is in operation. When a periodicity operates only in certain time intervals, it is important to identify these intervals. Mathematically, the above technique is applicable only to discrete events. However, with slight modifications we can apply this technique to general cases - periodicity analysis of measurements of continuously varying quantities.

Bai, T.↗

Predicted Aerodynamic Characteristics of a NACA 0015 Airfoil Having a 25% Integral-Type Trailing Edge Flap

Using the two-dimensional ARC2D Navier-Stokes flow solver analyses were conducted to predict the sectional aerodynamic characteristics of the flapped NACA-0015 airfoil section. To facilitate the analyses and the generation of the computational grids, the airfoil with the deflected trailing edge flap was treated as a single element airfoil with no allowance for a gap between the flap's leading edge and the base of the forward portion of the airfoil. Generation of the O-type computational grids was accomplished using the HYGRID hyperbolic grid generation program. Results were obtained for a wide range of Mach numbers, angles of attack and flap deflections. The predicted sectional lift, drag and pitching moment values for the airfoil were then cast in tabular format (C81) to be used in lifting-line helicopter rotor aerodynamic performance calculations. Similar were also generated for the flap. Mathematical expressions providing the variation of the sectional lift and pitching moment coefficients for the airfoil and for the flap as a function of flap chord length and flap deflection angle were derived within the context of thin airfoil theory. The airfoil's sectional drag coefficient were derived using the ARC2D drag predictions for equivalent two dimensional flow conditions.

Hassan, Ahmed↗

Automated Testcase Generation for Numerical Support Functions in Embedded Systems

We present a tool for the automatic generation of test stimuli for small numerical support functions, e.g., code for trigonometric functions, quaternions, filters, or table lookup. Our tool is based on KLEE to produce a set of test stimuli for full path coverage. We use a method of iterative deepening over abstractions to deal with floating-point values. During actual testing the stimuli exercise the code against a reference implementation. We illustrate our approach with results of experiments with low-level trigonometric functions, interpolation routines, and mathematical support functions from an open source UAS autopilot.

Metrics↗

Sensorimotor Application of Proposed Methods to Combine the Effects of Multiple Countermeasures for PRisM

Risk associated with human systems is challenging to quantify but is critical for the mission planning and decision making required to enable future Lunar and Martian missions. To address this gap, the Crew Health and Performance-Probabilistic Risk Assessment (CHP-PRA) project is developing an integrated computational model for CHP mission risk. Much like how MEDPRAT is designed to allow medical resource trades informed by medical risk, CHP-PRA will enable analogous trades in human system risks across multiple CHP functions and capabilities. Human performance is one component of the risk intended to be captured by CHP-PRA through the Performance Risk Model (PRisM). The sensorimotor risk area provides a good frame of reference for investigating the structure of a performance model because most tasks that astronauts are expected to perform require input from the sensory system and/or movement/motor control. Additionally, sensorimotor countermeasures are an area of particular concern for NASA’s Human Research Program because of the increased sensorimotor risk associated with surface operations in Lunar and Martian missions. Thus, a tool that can quickly compare risk reductions of potential countermeasures would be beneficial in guiding research and development of effective countermeasures. In this proof of concept, we present a systematic way to combine multiple performance data sets for humans subjected to different countermeasures such that we can predict the countermeasure(s) that optimize astronaut performance on relevant tasks. PRisM assumes that both the tests that are used to measure countermeasure effectiveness (input data) and the tasks we use to represent astronaut performance, can be broken down and represented as a function/vector of the human systems required to perform that test/task. Through mathematical combination, test data are used to predict performance on astronaut tasks that use similar systems. We propose that when combining countermeasures evaluated using the same test, that only one value should be used to represent their combined effectiveness. We start our analysis with the assumption that two countermeasures together will perform better than each countermeasure individually. Our initial implementation of this framework compares various space motion sickness countermeasures and the most up to date analysis will be demonstrated at the IWS.

Caroline R Austin↗

Text analysis devices, articles of manufacture, and text analysis methods

Text analysis devices, articles of manufacture, and text analysis methods are described according to some aspects. In one aspect, a text analysis device includes a display configured to depict visible images, and processing circuitry coupled with the display and wherein the processing circuitry is configured to access a first vector of a text item and which comprises a plurality of components, to access a second vector of the text item and which comprises a plurality of components, to weight the components of the first vector providing a plurality of weighted values, to weight the components of the second vector providing a plurality of weighted values, and to combine the weighted values of the first vector with the weighted values of the second vector to provide a third vector.

97 MATHEMATICS AND COMPUTING↗

Store operation with conditional push of a tag value to a queue

According to one embodiment, a method for a store operation with a conditional push of a tag value to a queue is provided. The method includes configuring a queue that is accessible by an application, setting a value at an address in a memory device including a memory and a controller, receiving a request for an operation using the value at the address and performing the operation. The method also includes the controller writing a result of the operation to the address, thus changing the value at the address, the controller determining if the result of the operation meets a condition and the controller pushing a tag value to the queue based on the condition being met, where the tag value in the queue indicates to the application that the condition is met.

97 MATHEMATICS AND COMPUTING↗

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

97 MATHEMATICS AND COMPUTING↗

Distributed metadata in a high performance computing environment

A computer-executable method, system, and computer program product for managing meta-data in a distributed storage system, wherein the distributed storage system includes one or more burst buffers enabled to operate with a distributed key-value store, the co computer-executable method, system, and computer program product comprising receiving a request for meta-data associated with a block of data stored in a first burst buffer of the one or more burst buffers in the distributed storage system, wherein the meta data is associated with a key-value, determining which of the one or more burst buffers stores the requested metadata, and upon determination that a first burst buffer of the one or more burst buffers stores the requested metadata, locating the key-value in a portion of the distributed key-value store accessible from the first burst buffer.

97 MATHEMATICS AND COMPUTING↗

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

97 MATHEMATICS AND COMPUTING↗

Systems and methods of generating a plurality of data visualizations in a data visualization region

An exemplary method of generating a plurality of data visualizations comprises displaying a graphical user interface that includes a schema information region and a data visualization region. The method further includes receiving user actions to associate first, second, and third fields included in the schema information region with a plurality of shelves of the data visualization region. The method further includes generating a plurality of data visualizations in the data visualization region in accordance with the received user actions, each data visualization includes a plurality of data marks corresponding to a respective retrieved tuple of data having the first, second, and third fields. Moreover, each of the data marks has an x-position and y-position defined according to data for the first and second fields, respectively. In addition, each of the data visualizations corresponds to a respective unique value of the third field, and is displayed in a respective pane.

97 MATHEMATICS AND COMPUTING↗

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

97 MATHEMATICS AND COMPUTING↗

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

97 MATHEMATICS AND COMPUTING↗

Generative attribute optimization

A generative attribute optimization (“GAO”) system facilitates understanding of effects of changes of attribute values of an object on a characteristic of the object and automatically identifying attribute values to achieve a desired result for the characteristic. The GAO system trains a generator (encoder and decoder) using an attribute generative adversarial network. The GAO model includes the trained generator and a separately trained predictor model. The GAO model inputs an input image and modified attribute values and employs the encoder and the decoder to generate a modified image that is the input image modified based on the modified attribute values. The GAO model then employs the predictor model to that inputs the modified image and generate a prediction of a characteristic of the modified image. The GAO system may employ an optimizer to modify the attribute values until an objective based on the desired result is achieved.

97 MATHEMATICS AND COMPUTING↗

Further Investigation of Employing Binomial Small-Sample Estimator in M-LROM

Reduced Order Modeling (ROM) is essential to enable the identification of the so-called active parameter subspace for high-fidelity models that are employed in computationally intensive analyses such as uncertainty characterization and data assimilation. Given the complexity of models for real-world application, brute force methods to identify the active subspace may not be computationally efficient to realize the value of reduction, since in realistic problems, the full scale model must be executed few hundred times, which may be computationally taxing. Earlier work has introduced a new approach, which represents a further development of our previous work on ROM, referred to as multi-level ROM (M-LROM). In M-LROM, approximate models are employed to identify the active subspace instead of the full scale model. In this summary, we present our recent results on M-LROM, specifically in regard to the construction of reliable error metrics that can bound the errors resulting from the reduction. The idea is to employ a lower fidelity model, i.e., an approximation of the full scale or high fidelity model, to build the active subspace, and via the proposed error bound, the quality of the active subspace can be determined by calculating an upper bound on the errors resulting from the reduction. For this approach to be practical, the error bound must be realistic, implying that it should be close to the actual errors expected, and not much higher. Therefore, an important goal of this summary is to compare different error bounds in terms of the relation between their estimated bounds to the actual errors. In particular, we compare the proposed error bound which numerically construct an estimator using binomial distribution to the widely used small-sample norm estimators. Unlike most probabilistic error estimation methods, the proposed bound employs a binomial distribution to construct the estimator whereas in other conventional methods, the distribution employed is typically the standard Gaussian, normalized over a unit hypersphere as initially proposed by the seminal paper of J. Dixon on random matrix theory. Previous publications provided evidence that the binomial distribution calculates more realistic bounds as compared to the Gaussian distribution, which tends to be conservative, implying that the bound is much bigger than the actual errors, which diminishes the value of the reduction, as now must increase the size of the active subspace to reach the desired upper bound on the reduction errors. This work has provided a rigorous approach by which error bounds on the reduction errors can be established without having to execute the high fidelity model during the construction of the active subspace. The high fidelity model is only need to test the error bound using small number of executions. This methodology paves the way for a more efficient application of ROM to complex engineering models, where standard ROM techniques may be too taxing to optimally realize their value in practical situations. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Distillation Column Flooding Predictor

The Flooding Predictor™ is a patented advanced control technology proven in research at the Separations Research Program, University of Texas at Austin, to increase distillation column throughput by over 6%, while also increasing energy efficiency by 10%. The research was conducted under a U. S. Department of Energy Cooperative Agreement awarded to George Dzyacky of 2ndpoint, LLC. The Flooding Predictor™ works by detecting the incipient flood point and controlling the column closer to its actual hydraulic limit than historical practices have allowed. Further, the technology uses existing column instrumentation, meaning no additional refining infrastructure is required. Refiners often push distillation columns to maximize throughput, improve separation, or simply to achieve day-to-day optimization. Attempting to achieve such operating objectives is a tricky undertaking that can result in flooding. Operators and advanced control strategies alike rely on the conventional use of delta-pressure instrumentation to approximate the column’s approach to flood. But column delta-pressure is more an inference of the column’s approach to flood than it is an actual measurement of it. As a consequence, delta pressure limits are established conservatively in order to operate in a regime where the column is never expected to flood. As a result, there is much “left on the table” when operating in such a regime, i.e. the capacity difference between controlling the column to an upper delta-pressure limit and controlling it to the actual hydraulic limit. The Flooding Predictor™, an innovative pattern recognition technology, controls columns at their actual hydraulic limit, which research shows leads to a throughput increase of over 6%. Controlling closer to the hydraulic limit also permits operation in a sweet spot of increased energy-efficiency. In this region of increased column loading, the Flooding Predictor is able to exploit the benefits of higher liquid/vapor traffic that produce increased contact area and lead to substantial increases in separation efficiency – which translates to a 10% increase in energy efficiency on a BTU/bbl basis. The Flooding Predictor™ operates on the principle that between five to sixty minutes in advance of a flooding event, certain column variables experience an oscillation, a pre-flood pattern. The pattern recognition system of the Flooding Predictor™ utilizes the mathematical first derivative of certain column variables to identify the column’s pre-flood pattern(s). This pattern is a very brief, highly repeatable, simultaneous movement among the derivative values of certain column variables. While all column variables experience negligible random noise generated from the natural frequency of the process, subtle pre-flood patterns are revealed among sub-sets of the derivative values of column variables as the column approaches its hydraulic limit. The sub-set of column variables that comprise the pre-flood pattern is identified empirically through in a two-step process. First, 2ndpoint’s proprietary off-line analysis tool is used to mine historical data for pre-flood patterns. Second, the column is flood-tested to fine-tune the pattern recognition for commissioning. Then the Flooding Predictor™ is implemented as closed-loop advanced control strategy on the plant’s distributed control system (DCS), thus automating control of the column at its hydraulic limit.

02 PETROLEUM↗

WE-AB-207A-04: Random Undersampled Cone Beam CT: Theoretical Analysis and a Novel Reconstruction Method

Purpose: Reducing x-ray exposure and speeding up data acquisition motived studies on projection data undersampling. It is an important question that for a given undersampling ratio, what the optimal undersampling approach is. In this study, we propose a new undersampling scheme: random-ray undersampling. We will mathematically analyze its projection matrix properties and demonstrate its advantages. We will also propose a new reconstruction method that simultaneously performs CT image reconstruction and projection domain data restoration. Methods: By representing projection operator under the basis of singular vectors of full projection operator, matrix representations for an undersampling case can be generated and numerical singular value decomposition can be performed. We compared properties of matrices among three undersampling approaches: regular-view undersampling, regular-ray undersampling, and the proposed random-ray undersampling. To accomplish CT reconstruction for random undersampling, we developed a novel method that iteratively performs CT reconstruction and missing projection data restoration via regularization approaches. Results: For a given undersampling ratio, random-ray undersampling preserved mathematical properties of full projection operator better than the other two approaches. This translates to advantages of reconstructing CT images at lower errors. Different types of image artifacts were observed depending on undersampling strategies, which were ascribed to the unique singular vectors of the sampling operators in the image domain. We tested the proposed reconstruction algorithm on a Forbid phantom with only 30% of the projection data randomly acquired. Reconstructed image error was reduced from 9.4% in a TV method to 7.6% in the proposed method. Conclusion: The proposed random-ray undersampling is mathematically advantageous over other typical undersampling approaches. It may permit better image reconstruction at the same undersampling ratio. The novel algorithm suitable for this random-ray undersampling was able to reconstruct high-quality images.

60 APPLIED LIFE SCIENCES↗