Search NASA⌕ Search

SEARCH · Search NASA

Results for “deterministic processing”

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 217 records · Page 12

Realistic simulations of spin squeezing and cooperative coupling effects in large ensembles of interacting two-level systems

We describe an efficient numerical method for simulating the dynamics of interacting spin ensembles in the presence of dephasing and decay. The method builds on the discrete truncated Wigner approximation for isolated systems, which combines the mean-field dynamics of a spin ensemble with a Monte Carlo sampling of discrete initial spin values to account for quantum correlations. Here we show how this approach can be generalized for dissipative spin systems by replacing the deterministic mean-field evolution by a stochastic process, which describes the decay of coherences and populations while preserving the length of each spin. We demonstrate the application of this technique for simulating nonclassical spin-squeezing effects or the dynamics and steady states of cavity QED models with 10 5 interacting two-level systems. This opens up the possibility to perform accurate real-scale simulations of a diverse range of experiments in quantum optics or with solid-state spin ensembles under realistic laboratory conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Ultrahigh capacitive energy density in ion-bombarded relaxor ferroelectric films

Dielectric capacitors can store and release electric energy at ultrafast rates and are extensively studied for applications in electronics and electric power systems. Among various candidates, thin films based on relaxor ferroelectrics, a special kind of ferroelectric with nanometer-sized domains, have attracted special attention because of their high energy densities and efficiencies. We show that high-energy ion bombardment improves the energy storage performance of relaxor ferroelectric thin films. Intrinsic point defects created by ion bombardment reduce leakage, delay low-field polarization saturation, enhance high-field polarizability, and improve breakdown strength. We demonstrate energy storage densities as high as ~133 joules per cubic centimeter with efficiencies exceeding 75%. Deterministic control of defects by means of postsynthesis processing methods such as ion bombardment can be used to overcome the trade-off between high polarizability and breakdown strength.

Kim, Jieun↗

Improved Hybrid Modeling of Spent Fuel Storage Facilities

This work developed a new computational method for improving the ability to calculate the neutron flux in deep-penetration radiation shielding problems that contain areas with strong streaming. The “gold standard” method for radiation transport is Monte Carlo (MC) as it samples the physics exactly and requires few approximations. Historically, however, MC was not useful for shielding problems because of the computational challenge of following particles through dense shields. Instead, deterministic methods, which are superior in term of computational effort for these problems types but are not as accurate, were used. Hybrid methods, which use deterministic solutions to improve MC calculations through a process called variance reduction, can make it tractable from a computational time and resource use perspective to use MC for deep-penetration shielding. Perhaps the most widespread and accessible of these methods are the Consistent Adjoint Driven Importance Sampling (CADIS) and Forward-Weighted CADIS (FW-CADIS) methods. For problems containing strong anisotropies, such as power plants with pipes through walls, spent fuel cask arrays, active interrogation, and locations with small air gaps or plates embedded in water or concrete, hybrid methods are still insufficiently accurate. In this work, a new method for generating variance reduction parameters for strongly anisotropic, deep penetration radiation shielding studies was developed. This method generates an alternate form of the adjoint scalar flux quantity, Φ Ω , which is used by both CADIS and FW-CADIS to generate variance reduction parameters for local and global response functions, respectively. The new method, called CADIS-Ω, was implemented in the Denovo/ADVANTG software. Results indicate that the flux generated by CADIS-Ω incorporates localized angular anisotropies in the flux more effectively than standard methods. CADIS-Ω outperformed CADIS in several test problems. This initial work indicates that CADIS- may be highly useful for shielding problems with strong angular anisotropies. This is a benefit to the public by increasing accuracy for lower computational effort for many problems that have energy, security, and economic importance.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

An input adaptive, pursuit tracking model of the human opertor

Developed and evaluated is a simple model of the input adaptive behavior of the human operator (HO) in a pursuit tracking task in which the plant controlled consists of a pure gain. If it is assumed that the HO is approximately an optimal predictor using only position and velocity information, then there is a simple method of computing the values of the model parameters in terms of the autocorrelation function of the input signal. Experimental evidence indicates that the ability of the HO to use velocity information decreases with increasing signal velocity indicating that a biased estimator of the velocity weighting should be used. A suitable approximation is derived which has rapid convergence and low variance. The model thus derived is compared to actual subject transfer functions and is found to be in close agreement. In addition to tracking random processes the model can adapt to and track deterministic signals, such as sine waves, up to approximately the frequency at which human operators begin to track precognitively.

Ware, J. R.↗

Automated Impact Assessment: A New Approach to ISS Payload Operations Anomaly Response

The International Space Station (ISS) Payload Operations and Integration Center (POIC) is undergoing rapid growth as the space station program focuses on science and commercial activities. The ISS is expanding its onboard capabilities to support additional science activities. In parallel, the POIC is expanding the capabilities of our operations tools to support the higher pace of payload activities being executed each week. An effect of these changes is that anomaly resolution has become more challenging. In the event of a real-time system fault, operators are responsible for analyzing telemetry displays, anomaly monitoring tools, documentation, and system models in order to produce failure impacts and recovery strategies. This approach to operations relies on the operator to ingest, process, and analyze information from an array of deterministic sources to provide actionable data on impacted systems and activities. Changing the existing approach of anomaly response is necessary if the ISS community is to succeed in the age of science and commercialization of space. The creation of a tool that captures deterministic technical systems knowledge and integrates existing telemetry, documentation, and planning information will allow the burden of impact assessment to be automated, thereby allowing the operator to focus on non-deterministic tasks, such as recovering failed systems and restoring critical payload operations.

Hall, R. Mason↗

Deep Packet/Flow Analysis using GPUs

Deep packet inspection (DPI) faces severe performance challenges in high-speed networks (40/100 GE) as it requires a large amount of raw computing power and high I/O throughputs. Recently, researchers have tentatively used GPUs to address the above issues and boost the performance of DPI. Typically, DPI applications involve highly complex operations in both per-packet and per-flow data level, often in real-time. The parallel architecture of GPUs fits exceptionally well for per-packet network traffic processing. However, for stateful network protocols such as TCP, their data stream need to be reconstructed in a per-flow level to deliver a consistent content analysis. Since the flow-centric operations are naturally antiparallel and often require large memory space for buffering out-of-sequence packets, they can be problematic for GPUs, whose memory is normally limited to several gigabytes. In this work, we present a highly efficient GPU-based deep packet/flow analysis framework. The proposed design includes a purely GPU-implemented flow tracking and TCP stream reassembly. Instead of buffering and waiting for TCP packets to become in sequence, our framework process the packets in batch and uses a deterministic finite automaton (DFA) with prefix-/suffix- tree method to detect patterns across out-of-sequence packets that happen to be located in different batches. In conclusion, evaluation shows that our code can reassemble and forward tens of millions of packets per second and conduct a stateful signature-based deep packet inspection at 55 Gbit/s using an NVIDIA K40 GPU.

97 MATHEMATICS AND COMPUTING↗

Deep Packet/Flow Analysis using GPUs

aDeep packet inspection (DPI) faces severe performance challenges in high-speed networks (40/100 GE) as it requires a large amount of raw computing power and high I/O throughputs. Recently, researchers have tentatively used GPUs to address the above issues and boost the performance of DPI. Typically, DPI applications involve highly complex operations in both per-packet and per-flow data level, often in real-time. The parallel architecture of GPUs fits exceptionally well for per-packet network traffic processing. However, for stateful network protocols such as TCP, their data stream need to be reconstructed in a per-flow level to deliver a consistent content analysis. Since the flow-centric operations are naturally anti-parallel and often require large memory space for buffering out-of-sequence packets, they can be problematic for GPUs, whose memory is normally limited to several gigabytes. In this work, we present a highly efficient GPU-based deep packet/flow analysi s framework. The proposed design includes a purely GPU-implemented flow tracking and TCP stream reassembly. Instead of buffering and waiting for TCP packets to become in sequence, our framework process the packets in batch and uses a deterministic finite automaton (DFA) with prefix-/suffix- tree method to detect patterns across out-of-sequence packets that happen to be located in different batches. Evaluation shows that our code can reassemble and forward tens of millions of packets per second and conduct a stateful signature-based deep packet inspection at 55 Gbit/s using an NVIDIA K40 GPU.

Gong, Qian↗

Reassessment of uncertainties for the PU-MET-INTER-002 benchmark - 14432

Uncertainty for the PU-MET-INTER-002 benchmark of ZPR-6/10 was unusually large for a ZPR assembly and was dominated by the uncertainties in matrix tube pitch and composition uncertainties for plutonium, graphite and stainless steel plates. The original uncertainty analysis for PU-MET-INTER-002 was limited by computer resources, software and the nuclear data available in 2002, all of which have been improved since. An as-built Monte Carlo model of ZPR-6/10 was used to quantify components of the transformation from the detailed model to a simplified RZ benchmark in 2002. Compositional uncertainties were estimated based upon TWODANT calculations of the RZ benchmark model (20 group, S{sub 8} - P{sub 1}). MC{sup 2}-2 was used with END/B-V.2 data to generate homogenized cross section data for TWODANT. The MC{sup 2}-2 calculations did not account for lattice cell spatial heterogeneity which was driven by the manual process required to generate ∼80 modifications to the deterministic model and by the software limitations of MC{sup 2}-2. Improvements to DIF3D-VARIANT, development of the MC{sup 2}-3 and BuildZPRModel codes, and better computer resources make accurate 3D transport calculations of reactivity changes practical today. BuildZPRModel imports the as-built geometry and creates a 'drawer' homogenized DIF3D model where each radial DIF3D mesh is the exact size of a single ZPR matrix tube and drawer. A MC{sup 2}-3 input is constructed for each drawer to produce homogenized cross section data where the spatial cell heterogeneity is captured by solving a 1D MOC transport calculation on the ultrafine energy group level. Collapsing 3D drawers into 1D MC{sup 2}-3 drawer models follows conventional procedures and is done by BuildZPRModel. MCNP6 was used to re-compute relevant geometry components of the uncertainty using ENDF/B-VII.0 data with the as-built model. Changes in the geometry components compared with earlier results are insignificant. DIF3D calculations of the compositional uncertainties were performed using 33, 70, 116, 230, 425, and 703 group energy structures and selectively combined with P{sub 3}-P{sub 7} transport approximations and P{sub 1} and P{sub 3} scattering kernels. 3D diffusion theory calculations were also performed for comparison. Many composition uncertainty components were essentially unchanged with the updated methodology. However, the dominant experimental uncertainty for PU-MET-INTER-002 is the composition of stainless steel. The new calculations reduce the stainless steel uncertainty from ∼115 pcm to ∼70 pcm which significantly reduces the total uncertainty for PU-MET-INTER-002. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Computing the moments of the neutron population using deterministic neutron transport

It is important to treat the inherent stochasticity of the fission process in systems where the behavior of the system is stochastic. This occurs when there are few neutrons in the system, or when the neutron source is weak. In order to characterize such systems, the capability to compute the first four moments of the neutron population distribution has been added to the deterministic neutral particle transport code, PARTISN. The moments are then fitted to probability density functions from the Pearson family. PARTISN is compared against MCNP6, with which it agrees well. (authors)

97 MATHEMATICS AND COMPUTING↗

Random adaptive tool path for zonal optics fabrication

Deterministic optics fabrication using sub-aperture tools has been vital for manufacturing precision optical surfaces. The fabrication process requires the tool influence function and the tool path to calculate the dwell time that guides the tool to bring surface quality within tight design tolerances. Widely used spiral and raster paths may leave excess waviness from the tool path, and the unavoidable constant removal layer is added to obtain positive dwell time. This waviness can be removed by either using smaller tools sequentially or randomizing the tool path. However, the existing tool-path solutions can hardly adapt to different surface aperture shapes and localized surface errors. Process efficiency and accuracy are also not well considered in tool-path planning. We propose an innovative zonal Random Adaptive Path (RAP) to solve these problems in this study. Firstly, RAP can be flexibly adapted to different surface aperture shapes by introducing part boundary. Secondly, an average threshold strategy is used in the RAP planning to improve efficiency, enabling the surface errors to be selectively corrected. Finally, the threshold is performed in several passes within one processing cycle, each with its RAP, until the desired residual is achieved. The performance of the proposed RAP is studied by comparing it with the conventional tool paths. The results demonstrated that RAP takes the least processing time and achieves the best surface quality, which verifies the effectiveness of RAP in deterministic optics fabrication.

36 MATERIALS SCIENCE↗

Efficient block processing of long duration biotelemetric brain data for health care monitoring

In real time clinical environment, the brain signals which doctor need to analyze are usually very long. Such a scenario can be made simple by partitioning the input signal into several blocks and applying signal conditioning. This paper presents various block based adaptive filter structures for obtaining high resolution electroencephalogram (EEG) signals, which estimate the deterministic components of the EEG signal by removing noise. To process these long duration signals, we propose Time domain Block Least Mean Square (TDBLMS) algorithm for brain signal enhancement. In order to improve filtering capability, we introduce normalization in the weight update recursion of TDBLMS, which results TD-B-normalized-least mean square (LMS). To increase accuracy and resolution in the proposed noise cancelers, we implement the time domain cancelers in frequency domain which results frequency domain TDBLMS and FD-B-Normalized-LMS. Finally, we have applied these algorithms on real EEG signals obtained from human using Emotive Epoc EEG recorder and compared their performance with the conventional LMS algorithm. The results show that the performance of the block based algorithms is superior to the LMS counter-parts in terms of signal to noise ratio, convergence rate, excess mean square error, misadjustment, and coherence.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Markov reward processes

Numerous applications in the area of computer system analysis can be effectively studied with Markov reward models. These models describe the behavior of the system with a continuous-time Markov chain, where a reward rate is associated with each state. In a reliability/availability model, upstates may have reward rate 1 and down states may have reward rate zero associated with them. In a queueing model, the number of jobs of certain type in a given state may be the reward rate attached to that state. In a combined model of performance and reliability, the reward rate of a state may be the computational capacity, or a related performance measure. Expected steady-state reward rate and expected instantaneous reward rate are clearly useful measures of the Markov reward model. More generally, the distribution of accumulated reward or time-averaged reward over a finite time interval may be determined from the solution of the Markov reward model. This information is of great practical significance in situations where the workload can be well characterized (deterministically, or by continuous functions e.g., distributions). The design process in the development of a computer system is an expensive and long term endeavor. For aerospace applications the reliability of the computer system is essential, as is the ability to complete critical workloads in a well defined real time interval. Consequently, effective modeling of such systems must take into account both performance and reliability. This fact motivates our use of Markov reward models to aid in the development and evaluation of fault tolerant computer systems.

Smith, R. M.↗

Request for All - A Generalized Request Framework for PhEDEx

PhEDEx has been serving CMS community since 2004 as the data broker. Every PhEDEx operation is initiated by a request, e.g. request to move or to delete data, and so on. A request has it own life cycle, including creation, approval, notification, and book keeping and the details depend on its type. Currently, only two kinds of requests, transfer and deletion, are fully integrated in PhEDEx. They are tailored specifically to the operations' workflows. To be able to serve a new type of request it generally means a fair amount of development work. After several many years of operation, we have gathered enough experience to rethink the request handling in PhEDEx. Generalized Request Project is set to abstract such experience and design a request system which is not tied into current workflow yet it is general enough to accommodate current and future requests. The challenges are dealing with different stages in a request's life cycle, complexity of approval process and complexity of the ability and authority associated with each role in the context of the request. We start with a high level abstraction driven by a deterministic finite automata, followed by a formal description and handling of approval process, followed by a set of tools that make such system friendly to the users. Since we have a formal way to describe the life of a request and a mechanism to systematically handle it, to serve a new kind of request is merely a configuration issue, adding the description of the new request rather than development effort. In this paper, we share the design and implementation of a generalized request framework and the experience of taking an existing serving system through a re-design and re-deployment.

Huang, C.-H.↗

ENSEMBLE KALMAN FILTERS FOR RELIABILITY ESTIMATION IN PERFUSION INFERENCE

We consider the solution of inverse problems in dynamic contrast–enhanced imaging by means of ensemble Kalman filters. Our quantity of interest is blood perfusion, i.e., blood flow rates in tissue. While existing approaches to compute blood perfusion parameters for given time series of radiological measurements mainly rely on deterministic, deconvolution–based methods, we aim at recovering probabilistic solution information for given noisy measurements. To this end, we model radiological image capturing as a sequential data assimilation process and solve it by an ensemble Kalman filter. Thereby, we recover deterministic results as an ensemble–based mean and are able to compute reliability information such as probabilities for the perfusion to be in a given range. Our target application is the inference of blood perfusion parameters in the human brain. A numerical study shows promising results for artificial measurements generated by a digital perfusion phantom.

Engineering↗

Development of a First-of-a-Kind Deterministic Decision-Making Tool for Supervisory Control System

Decision-making is the process of identifying and choosing alternatives where each alternative offers a different approach or path to move from a given state or condition to a desired state or condition. The generation of consistent decisions requires that a structured, coherent process be defined, immediately leading to a decision-making framework. The overall objective of the generalized framework is for it to be adopted into an autonomous decision-making framework and tailored to specific requirements for various applications. In this context, automation is the use of computing resources to make decisions and implement a structured decision-making process with limited or no human intervention. The overriding goal of automation is to replace or supplement human decision makers with reconfigurable decision- making modules that can perform a given set of tasks reliably. Risk-informed decision making requires a probabilistic assessment of the likelihood of success given the status of the plant/systems and component health, and a deterministic assessment between plant operating parameters and reactor protection parameters to prevent unnecessary trips and challenges to plant safety systems. The implementation of the probabilistic portion of the decision-making engine of the proposed supervisory control system was detailed in previous milestone reports. Once the control options are identified and ranked based on the likelihood of success, the supervisory control system transmits the options to the deterministic portion of the platform. The deterministic multi-attribute decision-making framework uses variable sensor data (e.g., outlet temperature) and calculates where it is within the challenge state, its trajectory, and margin within the controllable domain using utility functions to evaluate current and projected plant state space for different control decisions. Metrics to be evaluated include stability, cost, time to complete (action), power level, etc. The integration of deterministic calculations using multi-physics analyses (i.e., neutronics, thermal, and thermal-hydraulics) and probabilistic safety calculations allows for the examination and quantification of margin recovery strategies. This also provides validation of the control options identified from the probabilistic assessment. Thus, the thermal-hydraulics analyses are used to validate the control options identified from the probabilistic assessment. Future work includes evaluating other possible metrics and computational efficiencies.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Dynamic Event Tree Analysis Through RAVEN

Conventional Event-Tree (ET) based methodologies are extensively used as tools to perform reliability and safety assessment of complex and critical engineering systems. One of the disadvantages of these methods is that timing/sequencing of events and system dynamics is not explicitly accounted for in the analysis. In order to overcome these limitations several techniques, also know as Dynamic Probabilistic Risk Assessment (D-PRA), have been developed. Monte-Carlo (MC) and Dynamic Event Tree (DET) are two of the most widely used D-PRA methodologies to perform safety assessment of Nuclear Power Plants (NPP). In the past two years, the Idaho National Laboratory (INL) has developed its own tool to perform Dynamic PRA: RAVEN (Reactor Analysis and Virtual control ENvironment). RAVEN has been designed in a high modular and pluggable way in order to enable easy integration of different programming languages (i.e., C++, Python) and coupling with other application including the ones based on the MOOSE framework, developed by INL as well. RAVEN performs two main tasks: 1) control logic driver for the new Thermo-Hydraulic code RELAP-7 and 2) post-processing tool. In the first task, RAVEN acts as a deterministic controller in which the set of control logic laws (user defined) monitors the RELAP-7 simulation and controls the activation of specific systems. Moreover, RAVEN also models stochastic events, such as components failures, and performs uncertainty quantification. Such stochastic modeling is employed by using both MC and DET algorithms. In the second task, RAVEN processes the large amount of data generated by RELAP-7 using data-mining based algorithms. This paper focuses on the first task and shows how it is possible to perform the analysis of dynamic stochastic systems using the newly developed RAVEN DET capability. As an example, the Dynamic PRA analysis, using Dynamic Event Tree, of a simplified pressurized water reactor for a Station Black-Out scenario is presented.

42 ENGINEERING↗

Probabilistic design applications for the Space Transportation Main Engines

All of the current rocket engine designs are based on deterministic design analysis methods. The most recently designed engine, Space Shuttle Main Engines (SSME), was designed and developed using these techniques in the 1970's and 80's. The Space Transportation Main Engine (STME) design objective is to use a robust design methodology and to pro-actively assess and improve the design during the design process. The design approach is a combination of the traditional deterministic methodologies and recently developed probabilistic methodologies. The designer must use a more rigorous structural criteria, conduct pro-active reliability assessments (reliability allocations, failure modes and effects analysis, reliability growth studies, and design reliability assessment), use a damage tolerant design philosophy and perform probabilistic analyses. Rigorous application of this structured methodology will develop a better engine product.

Ohara, Kevin↗

Multiscale eddy simulation for moist atmospheric convection: Preliminary investigation

A multiscale computational framework is designed for simulating atmospheric convection and clouds. In this multiscale framework, large eddy simulation (LES) is used to model the coarse scales of 100 m and larger, and a stochastic, one-dimensional turbulence (ODT) model is used to represent the fine scales of 100 m and smaller. Coupled and evolving together, these two components provide a multiscale eddy simulation (MES). Through its fine-scale turbulence and moist thermodynamics, MES allows coarse grid cells to be partially cloudy and to encompass cloudy–clear air mixing on scales down to 1 m; in contrast, in typical LES such fine-scale processes are not represented or are parameterized using bulk deterministic closures. To illustrate MES and investigate its multiscale dynamics, a shallow cumulus cloud field is simulated. The fine-scale variability is seen to take a plausible form, with partially cloudy grid cells prominent near cloud edges and cloud top. From earlier theoretical work, this mixing of cloudy and clear air is believed to have an important impact on buoyancy. However, contrary to expectations based on earlier theoretical studies, the mean statistics of the bulk cloud field are essentially the same in MES and LES; possible reasons for this are discussed, including possible limitations in the present formulation of MES. One difference between LES and MES is seen in the coarse-scale turbulent kinetic energy, which appears to grow slowly in time due to incoherent stochastic fluctuations in the buoyancy. This and other considerations suggest the need for some type of spatial and/or temporal filtering to attenuate undersampling of the stochastic fine-scale processes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗