Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithm Development”

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 1,639 records · Page 91

Development of activity pencil beam algorithm using measured distribution data of positron emitter nuclei generated by proton irradiation of targets containing {sup 12}C, {sup 16}O, and {sup 40}Ca nuclei in preparation of clinical application

Purpose: The purpose of this study is to develop a new calculation algorithm that is satisfactory in terms of the requirements for both accuracy and calculation time for a simulation of imaging of the proton-irradiated volume in a patient body in clinical proton therapy. Methods: The activity pencil beam algorithm (APB algorithm), which is a new technique to apply the pencil beam algorithm generally used for proton dose calculations in proton therapy to the calculation of activity distributions, was developed as a calculation algorithm of the activity distributions formed by positron emitter nuclei generated from target nuclear fragment reactions. In the APB algorithm, activity distributions are calculated using an activity pencil beam kernel. In addition, the activity pencil beam kernel is constructed using measured activity distributions in the depth direction and calculations in the lateral direction. {sup 12}C, {sup 16}O, and {sup 40}Ca nuclei were determined as the major target nuclei that constitute a human body that are of relevance for calculation of activity distributions. In this study, ''virtual positron emitter nuclei'' was defined as the integral yield of various positron emitter nuclei generated from each target nucleus by target nuclear fragment reactions with irradiated proton beam. Compounds, namely, polyethylene, water (including some gelatin) and calcium oxide, which contain plenty of the target nuclei, were irradiated using a proton beam. In addition, depth activity distributions of virtual positron emitter nuclei generated in each compound from target nuclear fragment reactions were measured using a beam ON-LINE PET system mounted a rotating gantry port (BOLPs-RGp). The measured activity distributions depend on depth or, in other words, energy. The irradiated proton beam energies were 138, 179, and 223 MeV, and measurement time was about 5 h until the measured activity reached the background level. Furthermore, the activity pencil beam data were made using the activity pencil beam kernel, which was composed of the measured depth data and the lateral data including multiple Coulomb scattering approximated by the Gaussian function, and were used for calculating activity distributions. Results: The data of measured depth activity distributions for every target nucleus by proton beam energy were obtained using BOLPs-RGp. The form of the depth activity distribution was verified, and the data were made in consideration of the time-dependent change of the form. Time dependence of an activity distribution form could be represented by two half-lives. Gaussian form of the lateral distribution of the activity pencil beam kernel was decided by the effect of multiple Coulomb scattering. Thus, the data of activity pencil beam involving time dependence could be obtained in this study. Conclusions: The simulation of imaging of the proton-irradiated volume in a patient body using target nuclear fragment reactions was feasible with the developed APB algorithm taking time dependence into account. With the use of the APB algorithm, it was suggested that a system of simulation of activity distributions that has levels of both accuracy and calculation time appropriate for clinical use can be constructed.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Flat and Level Analysis Tool (FLAT) for real-time automated segmentation and analysis of concrete slab point clouds

In the United States, the flatness and levelness of concrete floors during construction is traditionally specified by a maximum allowable gap under a 3 meter straightedge. However, the straightedge method is inexact and rarely representative of the entire floor since the technician is free to choose any location on the floor to perform the measurement. In cases requiring a higher degree of precision and repeatability, concrete floor flatness and levelness can be measured using the standard test method ASTM E1155. With the recent introduction of advanced surveying instruments such as robotic theodolites and terrestrial laser scanners (TLS), the means now exist to modernize and expedite the measurement of floor flatness and levelness. This paper details the development and demonstration of a digital tool, named the Flat and Level Analysis Tool (FLAT), to automate and expedite the segmentation and analysis of flatness and levelness from dense point cloud data of concrete floor slabs. Segmentation algorithms were developed using unsupervised machine learning to extract the set of points belonging to the concrete floor slab from a full 360 scan of a construction site. After segmentation, automated analysis algorithms report the results according to the standard method. The developed algorithms were demonstrated on a dense point cloud captured from a concrete slab-on-grade at a construction site. Results show that the digital tool can quickly provide estimates for floor flatness and levelness with minimal human involvement with comparable accuracy to manual methods.

Hayes, Nolan↗

Development of a validation model for the defense meteorological satellite program's special sensor microwave imager

The Defence Meteorological Space Program's (DMSP) Special Sensor Microwave/Imager (SSM/I), an operational wind speed algorithm was developed. The algorithm is based on the D-matrix approach which seeks a linear relationship between measured SSM/I brightness temperatures and environmental parameters. D-matrix performance was validated by comparing algorithm derived wind speeds with near-simultaneous and co-located measurements made by off-shore ocean buoys. Other topics include error budget modeling, alternate wind speed algorithms, and D-matrix performance with one or more inoperative SSM/I channels.

Swift, C. T.↗

Machine vision guided sensor positioning system for leaf temperature assessment

A sensor positioning system was developed for monitoring plants' well-being using a non-contact sensor. Image processing algorithms were developed to identify a target region on a plant leaf. A novel algorithm to recover view depth was developed by using a camera equipped with a computer-controlled zoom lens. The methodology has improved depth recovery resolution over a conventional monocular imaging technique. An algorithm was also developed to find a maximum enclosed circle on a leaf surface so the conical field-of-view of an infrared temperature sensor could be filled by the target without peripheral noise. The center of the enclosed circle and the estimated depth were used to define the sensor 3-D location for accurate plant temperature measurement.

NASA Discipline Life Support Systems↗

Initial CEED API (CEED-MS10)

Key components of CEED software development involve fast finite element operator storage and evaluation, architecture optimizations, performant algorithms for all orders, global kernels for finite element operators, efficient use of the memory sub-system, optimal data locality and motion, enhanced scalability and parallelism, and fast tensor contractions. As ultimate goals of the project, CEED is exploring and identifying the best algorithms for the full range of discretizations and applying algorithmic and software development to support ECP applications’ needs. In this milestone, we initiated the development and implementation of a common CEED API consisting of two main components: low-level and high-level APIs. We accomplished the goal of having the low-level component ready for the release of CEED v1.0 in the next quarter, see CEED-MS13. In this report we also provide a highlight from CEED’s integration with the MARBL app and the corresponding Laghos miniapp. A main theme in this work has been the systematic transition of advanced algorithms, developed and tested in Laghos, to the large-scale multi-physics settings of the MARBL code. The low-level CEED API provides a set of FE kernels and components for writing new low-level kernels. Examples include: vector and sparse linear algebra, element matrix assembly over a batch of elements, partial assembly and action for efficient high-order operators like mass, diffusion, advection, etc. The main goal of the low-level API is to establish the basis for the high-level API. Also, identifying such low-level kernels and providing a reference implementation for them serves as the basis for collaboration with vendors and STs. Another goal for the low-level API is to make it easy for applications with their own discretization infrastructure, who do not want to switch directly to using the high-level CEED API, to still evaluate and use the core operations provided by the low-level API. One of the challenges with high-order methods is that a global sparse matrix is no longer a good representation of a high-order linear operator, both with respect to the FLOPs needed for its evaluation, as well as the memory transfer needed for a matvec. Thus, another important question we tried to address while developing the low-level API is: is it possible to abstract out in a natural and efficient way the different implementations and data structures that arise when dealing with various computational device types: CPUs, GPUs, etc. Fully answering this question is beyond the scope of this particular milestone, since that requires longer time as we develop and expand the devices we support. The future high-level API will be the frontend provided by CEED consisting of high-level abstractions such as meshes, finite element spaces and solutions, bilinear forms, solvers, etc. At this high-level, an important aspect of the API will be to provide a uniform abstraction layer for writing code in a portable manner. To achieve that, we plan to utilize the MPI programming model combined with a device abstraction layer (DAL) for finite element computations that we will develop. The DAL will serve as the bridge between the low- and the high-level APIs, allowing a variety of programming models to be used for the low-level kernel implementations. The software artifacts delivered as part of this milestone include an initial CEED API software implementation (libCEED) provided through the CEED website, http://ceed.exascaleproject.org and the CEED GitHub organization, http://github.com/ceed. In addition to details and results from the above R&D efforts, in this document we are also reporting on other project-wide activities performed in Q1 of FY18, including: the Nek5000 v17.0 MFEM v3.3.2 and PETSc v3.8 releases, collaborations with ECP/ST and SciDAC projects, the inaugural Nek5000 hackathon and various outreach activities.

97 MATHEMATICS AND COMPUTING↗

Model Predictive Control of HVAC Systems: Implementation and Testing at the University of California, Merced

A Model Predictive Control algorithm was developed for the UC Merced campus chilled water plant. Model predictive control (MPC) is an advanced control technology that has proven successful in the chemical process industry and other industries. The main goal of the research was to demonstrate the practical and commercial viability of MPC for optimization of building energy systems. The control algorithms were developed and implemented in MATLAB, allowing for rapid development, performance, and robustness assessment. The UC Merced chilled water plant includes three water-cooled chillers and a two million gallon chilled water storage tank. The tank is charged during the night to minimize on-peak electricity consumption and take advantage of the lower ambient wet bulb temperature. The control algorithms determined the optimal chilled water plant operation including chilled water supply (CHWS) temperature set-point, condenser water supply (CWS) temperature set-point and the charging start and stop times to minimize a cost function that includes energy consumption and peak electrical demand over a 3-day prediction horizon. A detailed model of the chilled water plant and simplified models of the buildings served by the plant were developed using the equation-based modeling language Modelica. Steady state models of the chillers, cooling towers and pumps were developed, based on manufacturers performance data, and calibrated using measured data collected and archived by the control system. A detailed dynamic model of the chilled water storage tank was also developed and calibrated. Simple, semi-empirical models were developed to predict the temperature and flow rate of the chilled water returning to the plant from the buildings. These models were then combined and simplified for use in a model predictive control algorithm that determines the optimal chiller start and stop times and set-points for the condenser water temperature and the chilled water supply temperature. The report describes the development and testing of the algorithm and evaluates the resulting performance, concluding with a discussion of next steps in further research. The experimental results show a small improvement in COP over the baseline policy but it is difficult to draw any strong conclusions about the energy savings potential for MPC with this system only four days of suitable experimental data were obtained once correct operation of the MPC system had been achieved. These data show an improvement in COP of 3.1% {+-} 2.2% relative to a baseline established immediately prior to the period when the MPC was run in its final form. This baseline includes control policy improvements that the plant operators learned by observing the earlier implementations of MPC, including increasing the temperature of the water supplied to the chiller condensers from the cooling towers. The process of data collection and model development, necessary for any MPC project, resulted in the team uncovering various problems with the chilled water system. Although it is difficult to quantify the energy savings resulting from these problems being remedied, they were likely on the same order as the energy savings from the MPC itself. Although the types of problems uncovered and the level of energy savings may differ significantly from other projects, some of the benefits of detecting and diagnosing problems are expected from the use of MPC for any chilled water plant. The degree of chiller loading was found to be a key factor for efficiency. It is more efficient to operate the chillers at or near full load. In order to maximize the chiller load, one would maximize the temperature difference across chillers and the chilled water flow rate through the chillers. Thus, the CHWS set-point and the chilled water flow-rate can be used to limit the chiller loading to prevent chiller surging. Since the flow rate has an upper bound and the CHWS set point has a lower bound, the chiller loading is constrained and often determined by the chilled water return temperature (CHWR). The CHWR temperature is primarily comprised of warm water from the top of the TES tank. The CHWR temperature falls substantially as the thermocline approaches the top of the tank, which reduces the chiller loading. As a result, it has been determined that overcharging the TES tank can be detrimental to the chilled water plant efficiency. The resulting MPC policy differs from the current practice of fully charging the TES tank. A heuristic rule could possible avoid this problem without using predictive control. Similarly, the COP improvements from the change in CWS set-point were largely captured by a static set-point change by the operators. Further research is required to determine how much of the MPC savings could be garnered through simplified rules (based on the MPC study), with and without prediction.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Development of signal processing algorithms for ultrasonic detection of coal seam interfaces

A pattern recognition system is presented for determining the thickness of coal remaining on the roof and floor of a coal seam. The system was developed to recognize reflected pulse echo signals that are generated by an acoustical transducer and reflected from the coal seam interface. The flexibility of the system, however, should enable it to identify pulse-echo signals generated by radar or other techniques. The main difference being the specific features extracted from the recorded data as a basis for pattern recognition.

Purcell, D. D.↗

An Algorithm for Interactive Modeling of Space-Transportation Engine Simulations: A Constraint Satisfaction Approach

In this research we have developed an algorithm for the purpose of constraint processing by utilizing relational algebraic operators. Van Beek and others have investigated in the past this type of constraint processing from within a relational algebraic framework, producing some unique results. Apart from providing new theoretical angles, this approach also gives the opportunity to use the existing efficient implementations of relational database management systems as the underlying data structures for any relevant algorithm. Our algorithm here enhances that framework. The algorithm is quite general in its current form. Weak heuristics (like forward checking) developed within the Constraint-satisfaction problem (CSP) area could be also plugged easily within this algorithm for further enhancements of efficiency. The algorithm as developed here is targeted toward a component-oriented modeling problem that we are currently working on, namely, the problem of interactive modeling for batch-simulation of engineering systems (IMBSES). However, it could be adopted for many other CSP problems as well. The research addresses the algorithm and many aspects of the problem IMBSES that we are currently handling.

Mitra, Debasis↗

DSP Algorithms for Fission Fragment and Prompt Fission Neutron Spectroscopy

Digital signal processing (DSP) algorithms are in high demand for modern nuclear fission investigation due to importance of increase the accuracy of fissile nuclear data for new generation of nuclear power stations. DSP algorithms for fission fragment (FF) and prompt fission neutron (PFN) spectroscopy are described in the present work. The twin Frisch-grid ionization chamber (GTIC) is used to measure the kinetic energy-, mass- and angular distributions of the FF in the {sup 252}Cf(SF) reaction. Along with the neutron time-of-flight (TOF) measurement the correlation between neutron emission and FF mass and energy is investigated. The TOF is measured between common cathode of the GTIC and the neutron detector (ND) pulses. Waveform digitizers (WFD) having 12 bit amplitude resolution and 100 MHz sampling frequency are used for the detector pulse sampling. DSP algorithms are developed as recursive procedures to perform the signal processing, similar to those available in various nuclear electronics modules, such as constant fraction discriminator (CFD), pulse shape discriminator (PSD), peak-sensitive analogue-to-digital converter (pADC) and pulse shaping amplifier (PSA). To measure the angle between FF and the cathode plane normal to the GTIC a new algorithm is developed having advantage over the traditional analogue pulse processing schemes. Algorithms are tested by comparing the numerical simulation of the data analysis of the {sup 252}Cf(SF) reaction with data available from literature.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Specular reflection treatment for the 3D radiative transfer equation solved with the discrete ordinates method

The contribution of this paper relies in the development of numerical algorithms for the mathematical treatment of specular reflection on borders when dealing with the numerical solution of radiative transfer problems. The radiative transfer equation being integro-differential, the discrete ordinates method allows to write down a set of semi-discrete equations in which weights are to be calculated. The calculation of these weights is well known to be based on either a quadrature or on angular discretization, making the use of such method straightforward for the state equation. Also, the diffuse contribution of reflection on borders is usually well taken into account. However, the calculation of accurate partition ratio coefficients is much more tricky for the specular condition applied on arbitrary geometrical borders. This paper presents algorithms that calculate analytically partition ratio coefficients needed in numerical treatments. The developed algorithms, combined with a decentered finite element scheme, are validated with the help of comparisons with analytical solutions before being applied on complex geometries.

97 MATHEMATICS AND COMPUTING↗

Control and Size Energy Storage for Managing Energy balance of Variable Generation Resources

This paper presents control algorithms and sizing strategies for using energy storage to manage energy balance for variable generation resources. The control objective is to minimize the hourly generation imbalance between the actual and the scheduled generation of the wind farm. Three control algorithms are compared: tracking power imbalance, post-compensation, and pre-compensation. Measurement data from a wind farm located in South-central Washington State are used in the study. The results show that tracking power imbalance yields the best performance by keeping the hourly energy imbalances zero. However, the energy storage system (ESS) will be significantly oversized. Post-compensation reduces power rating of the ESS but the hourly imbalance may not be kept as zero when large and long-lasting energy imbalances occur. A linear regression forecasting algorithm is developed for the pre-compensation algorithm to pre-charge or pre-discharge the ESS based on predicted energy imbalances. The performance comparison shows that the pre-compensation method significantly reduces the size of the ESS while maintaining satisfactory performance.

ENERGY MANAGEMENT↗

Aerosol backscatter studies supporting LAWS

Optimized Royal Signals and Radar Establishment (RSRE), Laser True Airspeed System (LATAS) algorithm for low backscatter conditions was developed. The algorithm converts backscatter intensity measurements from focused continuous-wave (CW) airborne Doppler lidar into backscatter coefficients. The performance of optimized algorithm under marginal backscatter signal conditions was evaluated. The 10.6 micron CO2 aerosol backscatter climatologies were statistically analyzed. Climatologies reveal clean background aerosol mode near 10(exp -10)/kg/sq m/sr (mixing ratio units) through middle and upper troposhere, convective mode associated with planetary boundary layer convective activity, and stratospheric mode associated with volcanically-generated aerosols. Properties of clean background mode are critical to design and simulation studies of Laser Atmospheric Wind Sounder (LAWS), a MSFC facility Instrument on the Earth Observing System (Eos). Previous intercomparisons suggested correlation between aerosol backscatter at CO2 wavelength and water vapor. Field measurements of backscatter profiles with MSFC ground-based Doppler lidar system (GBDLS) were initiated in late FY-88 to coincide with independent program of local rawinsonde releases and overflights by Multi-spectral Atmospheric Mapping Sensor (MAMS), a multi-channel infrared radiometer capable of measuring horizontal and vertical moisture distributions. Design and performance simulation studies for LAWS would benefit from the existence of a relationship between backscatter and water vapor.

Rothermel, Jeffry↗

Digital optical computers at the optoelectronic computing systems center

The Digital Optical Computing Program within the National Science Foundation Engineering Research Center for Opto-electronic Computing Systems has as its specific goal research on optical computing architectures suitable for use at the highest possible speeds. The program can be targeted toward exploiting the time domain because other programs in the Center are pursuing research on parallel optical systems, exploiting optical interconnection and optical devices and materials. Using a general purpose computing architecture as the focus, we are developing design techniques, tools and architecture for operation at the speed of light limit. Experimental work is being done with the somewhat low speed components currently available but with architectures which will scale up in speed as faster devices are developed. The design algorithms and tools developed for a general purpose, stored program computer are being applied to other systems such as optimally controlled optical communication networks.

Jordan, Harry F.↗

A variable multi-step method for transient heat conduction

A variable explicit time integration algorithm is developed for unsteady diffusion problems. The algorithm uses nodal partitioning and allows the nodal groups to be updated with different time steps. The stability of the algorithm is analyzed using energy methods and critical time steps are found in terms of element eigenvalues with no restrictions on element types. Several numerical examples are given to illustrate the accuracy of the method.

Smolinski, Patrick↗

Data integration in multi-sensor based robotic workstations

A relaxation labeling algorithm is developed. The major advantage of this algorithm over the existing ones is that the mathematic operation is simplified. The simplification eases the analysis of the convergence properties. Both the theoretical and application aspects of the proposed algorithm are investigated. The local convergence properties of a labeling process with n labels and m labels are established. The investigation of the interaction among the nodes in a multinode labeling process reveals some insight into the mathematical issues involved in the relaxation operations.

Chen, Qin↗

Dust Aerosol Retrieval Over the Oceans With the MODIS/VIIRS Dark‐Target Algorithm: 1. Dust Detection

To prepare for implementation of a new aerosol retrieval specifically designed for dust aerosol over ocean in the operational Dark-Target (DT) algorithms for the Moderate-resolution Imaging Spectrometer (MODIS) and Visible Infrared Imaging Radiometer Suite (VIIRS) satellite sensors, we focus on the challenge of detecting dust. We first survey the literature on existing dust detection algorithms and then develop an innovative algorithm that combines near-UV (deep blue), visible, and thermal infrared (TIR) wavelength spectral tests. The new detection algorithm is applied to Terra and Aqua MODIS granules and compared with other dust detection possibilities from existing MODIS products. Quantitative evaluation of the new dust detection algorithm is conducted using both a collocated AERONET-MODIS data set and collocated Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observation (CALIPSO)-MODIS data set. From comparison with both AERONET and CALIOP measurements, we estimate the new dust detection algorithm detects about 30% of weakly dusty pixels and more than 80% of heavily dusty pixels, with false detections in the range of 1–2%. The very low false detection rate is particularly noteworthy in comparison with existing literature. Compared with the dust flag currently available as part of the MODIS cloud mask product (MOD35/MYD35), and dust classification based on commonly used thresholds with aerosol optical depth (AOD) and Angstrom exponent (AE), the new dust detection algorithm finds more dusty pixels and fewer false detections.

spectral dust detection↗

Comparing Coordinated Garbage Collection Algorithms for Arrays of Solid-state Drives

Solid-State Drives (SSDs) offer significant performance improvements over hard disk drives (HDD) on a number of workloads. The frequency of garbage collection (GC) activity is directly correlated with the pattern, frequency, and volume of write requests, and scheduling of GC is controlled by logic internal to the SSD. SSDs can exhibit significant performance degradations when garbage collection (GC) conflicts with an ongoing I/O request stream. When using SSDs in a RAID array, the lack of coordination of the local GC processes amplifies these performance degradations. No RAID controller or SSD available today has the technology to overcome this limitation. In our previous work, we presented a Global Garbage Collection (GGC) mechanism to improve response times and reduce performance variability for a RAID array of SSDs. A coordination method is employed so that GCs in the array can run at the same time. The coordination can exhibit substantial performance improvement. In this paper, we explore various GC coordination algorithms. We develop reactive and proactive GC coordination algorithms and evaluate their I/O performance and block erase counts for various workloads. We show that a proactive GC coordination algorithm can improve the I/O response times by up to 9% further and increase the lifetime of SSDs by reducing the number of block erase counts by up to 79% compared to a reactive algorithm.

99 GENERAL AND MISCELLANEOUS↗