Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm selection”

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,207 records · Page 67

Functionality and operation of fluoroscopic automatic brightness control/automatic dose rate control logic in modern cardiovascular and interventional angiography systems: A Report of Task Group 125 Radiography/Fluoroscopy Subcommittee, Imaging Physics Committee, Science Council

Task Group 125 (TG 125) was charged with investigating the functionality of fluoroscopic automatic dose rate and image quality control logic in modern angiographic systems, paying specific attention to the spectral shaping filters and variations in the selected radiologic imaging parameters. The task group was also charged with describing the operational aspects of the imaging equipment for the purpose of assisting the clinical medical physicist with clinical set-up and performance evaluation. Although there are clear distinctions between the fluoroscopic operation of an angiographic system and its acquisition modes (digital cine, digital angiography, digital subtraction angiography, etc.), the scope of this work was limited to the fluoroscopic operation of the systems studied. The use of spectral shaping filters in cardiovascular and interventional angiography equipment has been shown to reduce patient dose. If the imaging control algorithm were programmed to work in conjunction with the selected spectral filter, and if the generator parameters were optimized for the selected filter, then image quality could also be improved. Although assessment of image quality was not included as part of this report, it was recognized that for fluoroscopic imaging the parameters that influence radiation output, differential absorption, and patient dose are also the same parameters that influence image quality. Therefore, this report will utilize the terminology ''automatic dose rate and image quality'' (ADRIQ) when describing the control logic in modern interventional angiographic systems and, where relevant, will describe the influence of controlled parameters on the subsequent image quality. A total of 22 angiography units were investigated by the task group and of these one each was chosen as representative of the equipment manufactured by GE Healthcare, Philips Medical Systems, Shimadzu Medical USA, and Siemens Medical Systems. All equipment, for which measurement data were included in this report, was manufactured within the three year period from 2006 to 2008. Using polymethylmethacrylate (PMMA) plastic to simulate patient attenuation, each angiographic imaging system was evaluated by recording the following parameters: tube potential in units of kilovolts peak (kVp), tube current in units of milliamperes (mA), pulse width (PW) in units of milliseconds (ms), spectral filtration setting, and patient air kerma rate (PAKR) as a function of the attenuator thickness. Data were graphically plotted to reveal the manner in which the ADRIQ control logic responded to changes in object attenuation. There were similarities in the manner in which the ADRIQ control logic operated that allowed the four chosen devices to be divided into two groups, with two of the systems in each group. There were also unique approaches to the ADRIQ control logic that were associated with some of the systems, and these are described in the report. The evaluation revealed relevant information about the testing procedure and also about the manner in which different manufacturers approach the utilization of spectral filtration, pulsed fluoroscopy, and maximum PAKR limitation. This information should be particularly valuable to the clinical medical physicist charged with acceptance testing and performance evaluation of modern angiographic systems.

61 RADIATION PROTECTION AND DOSIMETRY↗

Multi-channel Imager Algorithm (MIA): A novel cloud-top phase classification algorithm

The current Geostationary Operational Environmental Satellites (GOES-16 and 17) cloud-top phase classification algorithm is based primarily on empirical thresholds at multiple wavelengths that have varying absorption capabilities for water and ice. The performance of current GOES-16 cloud-top phase product largely depends on the accuracy of the selection of reflectance ratios. Here this study aims at presenting a novel cloud-top phase classification algorithm (the Multi-channel Imager Algorithm, MIA) that provides a more judicious selection of relationships between channels using a supervised K-mean clustering method on multi-channel Red-Green-Blue images. The K-mean clustering method works analogously to how human eyes separate different colors in a microphysical color rendering set of satellite images, which differentiates water, ice and unclassified thin clouds. For water phase, cloud-top temperature information is used to further distinguish supercooled water. To evaluate the performance of the MIA, an extensive comparison with Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP), Moderate Resolution Imaging Spectroradiometer, and current GOES-16 cloud-top phase products is conducted, using CALIOP as the benchmark. Compared to the current GOES-16 cloud-top phase product, MIA demonstrates a substantial improvement in phase classification, where hit rate increases from 69% to 76% over the Continental United States and 58% to 66% over the full disk domain.

54 ENVIRONMENTAL SCIENCES↗

NERSC-6 Workload Analysis and Benchmark Selection Process

This report describes efforts carried out during early 2008 to determine some of the science drivers for the"NERSC-6" next-generation high-performance computing system acquisition. Although the starting point was existing Greenbooks from DOE and the NERSC User Group, the main contribution of this work is an analysis of the current NERSC computational workload combined with requirements information elicited from key users and other scientists about expected needs in the 2009-2011 timeframe. The NERSC workload is described in terms of science areas, computer codes supporting research within those areas, and description of key algorithms that comprise the codes. This work was carried out in large part to help select a small set of benchmark programs that accurately capture the science and algorithmic characteristics of the workload. The report concludes with a description of the codes selected and some preliminary performance data for them on several important systems.

97 MATHEMATICS AND COMPUTING↗

Robust control design for aerospace applications

Time-domain control design for stability robustness of linear systems with structured uncertainty is addressed. Upper bounds on the linear perturbation of an asymptotically stable linear system are obtained, making it possible to maintain stability by using the structural information of the uncertainty. A quantitative measure called the stability robustness index is introduced and used to design controllers for robust stability. The proposed state feedback control design algorithm can be used, for a given set of perturbations, to select the range of control effort for which the system is stability-robust. Conversely it can be used, for a given control effort, to determine the size of the tolerable perturbation. The algorithm is illustrated with examples from aircraft control and large-space-structure control problems.

Yedavalli, Rama K.↗

Final Technical Report for ``Paths to Discovery at the LHC : Dark Matter and Track Triggering"

Particle Dark Matter (DM) is perhaps the most compelling and experimentally well-motivated new physics scenario anticipated at the Large Hadron Collider (LHC). The DE-SC0014073 award allowed the PI to define and pursue a path to the discovery of Dark Matter in Run-2 of the LHC with the Compact Muon Solenoid (CMS) experiment. CMS can probe regions of Dark Matter phase-space that direct and indirect detection experiments are unable to constrain. The PI’s team initiated the exploration of these regions, searching specifically for the associated production of Dark Matter with top quarks. The effort focuses on the high-yield, hadronic decays of W bosons produced in top decay, which provides the highest sensitivity to DM produced via through low-mass spin-0 mediators. The group developed identification algorithms that achieve high efficiency and purity in the selection of hadronic top decays, and analysis techniques that provide powerful signal discrimination in Run-2. The ultimate reach of new physics searches with CMS will be established at the high-luminosity LHC (HL-LHC). To fully realize the sensitivity the HL-LHC promises, CMS must minimize the impact of soft, inelastic (“pileup”) interactions on the real-time “trigger” system the experiment uses for data refinement. Charged particle trajectory information (“tracking”) will be essential for pileup mitigation at the HL-LHC. The award allowed the PI’s team to develop firmware-based data delivery and track fitting algorithms for an unprecedented, real-time tracking trigger to sustain the experiment’s sensitivity to new physics in the next decade.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A Shifted Block Lanczos Algorithm 1: The Block Recurrence

In this paper we describe a block Lanczos algorithm that is used as the key building block of a software package for the extraction of eigenvalues and eigenvectors of large sparse symmetric generalized eigenproblems. The software package comprises: a version of the block Lanczos algorithm specialized for spectrally transformed eigenproblems; an adaptive strategy for choosing shifts, and efficient codes for factoring large sparse symmetric indefinite matrices. This paper describes the algorithmic details of our block Lanczos recurrence. This uses a novel combination of block generalizations of several features that have only been investigated independently in the past. In particular new forms of partial reorthogonalization, selective reorthogonalization and local reorthogonalization are used, as is a new algorithm for obtaining the M-orthogonal factorization of a matrix. The heuristic shifting strategy, the integration with sparse linear equation solvers and numerical experience with the code are described in a companion paper.

Grimes, Roger G.↗

Simulation Model of Mobile Detection Systems

In this paper, we consider a mobile source that we attempt to detect with man-portable, vehicle-mounted or boat-mounted radiation detectors. The source is assumed to transit an area populated with these mobile detectors, and the objective is to detect the source before it reaches a perimeter. We describe a simulation model developed to estimate the probability that one of the mobile detectors will come in to close proximity of the moving source and detect it. We illustrate with a maritime simulation example. Our simulation takes place in a 10 km by 5 km rectangular bay patrolled by boats equipped with 2-inch x 4-inch x 16-inch NaI detectors. Boats to be inspected enter the bay and randomly proceed to one of seven harbors on the shore. A source-bearing boat enters the mouth of the bay and proceeds to a pier on the opposite side. We wish to determine the probability that the source is detected and its range from target when detected. Patrol boats select the nearest in-bound boat for inspection and initiate an intercept course. Once within an operational range for the detection system, a detection algorithm is started. If the patrol boat confirms the source is not present, it selects the next nearest boat for inspection. Each run of the simulation ends either when a patrol successfully detects a source or when the source reaches its target. Several statistical detection algorithms have been implemented in the simulation model. First, a simple k-sigma algorithm, which alarms with the counts in a time window exceeds the mean background plus k times the standard deviation of background, is available to the user. The time window used is optimized with respect to the signal-to-background ratio for that range and relative speed. Second, a sequential probability ratio test [Wald 1947] is available, and configured in this simulation with a target false positive probability of 0.001 and false negative probability of 0.1. This test is utilized when the mobile detector maintains a constant range to the vessel being inspected. Finally, a variation of the sequential probability ratio test that is more appropriate when source and detector are not at constant range is available [Nelson 2005]. Each patrol boat in the fleet can be assigned a particular zone of the bay, or all boats can be assigned to monitor the entire bay. Boats assigned to a zone will only intercept and inspect other boats when they enter their zone. In our example simulation, each of two patrol boats operate in a 5 km by 5 km zone. Other parameters for this example include: (1) Detection range - 15 m range maintained between patrol boat and inspected boat; (2) Inbound boat arrival rate - Poisson process with mean arrival rate of 30 boats per hour; (3) Speed of boats to be inspected - Random between 4.5 and 9 knots; (4) Patrol boat speed - 10 knots; (5) Number of detectors per patrol boat - 4-2-inch x 4-inch x 16-inch NaI detectors; (6) Background radiation - 40 counts/sec per detector; and (7) Detector response due to radiation source at 1 meter - 1,589 counts/sec per detector. Simulation results indicate that two patrol boats are able to detect the source 81% of the time without zones and 90% of the time with zones. The average distances between the source and target at the end of the simulation is 5,866 km and 5,712 km for non-zoned and zoned patrols, respectively. Of those that did not reach the target, the average distance to the target is 7,305 km and 6,441 km respectively. Note that a design trade-off exists. While zoned patrols provide a higher probability of detection, the nonzoned patrols tend to detect the source farther from its target. Figure 1 displays the location of the source at the end of 1,000 simulations for the 5 x 10 km bay simulation. The simulation model and analysis described here can be used to determine the number of mobile detectors one would need to deploy in order to have a have reasonable chance of detecting a source in transit. By fixing the source speed to zero, the same model could be used to estimate how long it would take to detect a stationary source. For example, the model could predict how long it would take plant staff performing assigned duties carrying dosimeters to discover a contaminated spot in the facility.

61 RADIATION PROTECTION AND DOSIMETRY↗

Management of analytical redundancy in digital flight control systems for aircraft

This paper presents a design method for optimal redundancy management for nonlinear systems with application to highly maneuvering aircraft. The approach taken is based on selecting the failure states to be covered by the system design and constructing a cost function that represents the cost of making an incorrect decision. The decision logic which minimizes the cost requires a bank of extended Kalman filters running in parallel. This produces a severe computational requirement. To reduce this requirement, a suboptimal logic is developed based on using a nonlinear single-stage prediction algorithm in the filters with filter gains and decision logic selected using steady-state results obtained from a linearization of the vehicle and sensor dynamics. The design process is then applied to designing a redundancy management system for the F8-C aircraft. Results indicate that the system is superior in failure detection to a system using the same structure but using a linear single-stage prediction algorithm in the filters.

Montgomery, R. C.↗

Numerical stability of relativistic beam multidimensional PIC simulations employing the Esirkepov algorithm

Rapidly growing numerical instabilities routinely occur in multidimensional particle-in-cell computer simulations of plasma-based particle accelerators, astrophysical phenomena, and relativistic charged particle beams. Reducing instability growth to acceptable levels has necessitated higher resolution grids, high-order field solvers, current filtering, etc. except for certain ratios of the time step to the axial cell size, for which numerical growth rates and saturation levels are reduced substantially. This paper derives and solves the cold beam dispersion relation for numerical instabilities in multidimensional, relativistic, electromagnetic particle-in-cell programs employing either the standard or the Cole–Karkkainnen finite difference field solver on a staggered mesh and the common Esirkepov current-gathering algorithm. Good overall agreement is achieved with previously reported results of the WARP code. In particular, the existence of select time steps for which instabilities are minimized is explained. Additionally, an alternative field interpolation algorithm is proposed for which instabilities are almost completely eliminated for a particular time step in ultra-relativistic simulations.

43 PARTICLE ACCELERATORS↗

SU-E-T-210: Independent MU Dose Calculation Software for S and S IMRT Using Modified Clarkson Integration Sector

Purpose: The purpose of this work was to develop and validate an open source independent MU dose calculation software for S and S IMRT based in the algorithm proposed by Kung et.al. Methods: Treatment plans were done using Iplan v4.5 BrainLAB TPS and S and S IMRT modality. A 6MV photon beam produced by a Primus linear accelerator equipped with an Optifocus MLC was used. TPS dose calculation algorithms were pencil beam and Monte Carlo. 230 IMRT treatments plans were selected for the study. The software was written under MALTLAB environment. Treatment plans were imported by the software using RTP format. Field fluences were reconstructed adding all segments.The algorithm implemented in the software calculates the dose at a reference point as the sum of primary and scatter dose. The primary dose is obtained by masking the fluence map with a circle of radius 1cm. The scatter dose is obtained through a shaped ring mask around the previous circle with a thickness of 0.5cm; the rings are increased one after another with constant thickness until cover the entire map of influence. The dosimetric parameters Sc, Sp and TPR vary depending on radio, the transmission effect of the MLC, inverse square law and dose profile are used for the calculation. Results: The average difference between measured and independent calculated dose was 0.4% ± 2.2% [−6.8%, 6.4%]. For 91% of the studied plans the difference was less than 3%. The difference between the measured and TPS dose with pencilbeam algorithm was 2.6% ± 1.41% [−2.0%, 5.6%] and Monte Carlo algorithm was 0.4% ± 1.5% [−4.9%, 3.7%]. The differences obtained are comparable to that obtained with the ionization chamber and TPS. Conclusion: The developed software is suitable for use in S and S IMRT dose calculation. This application is open and can be downloading under request.

07 ISOTOPE AND RADIATION SOURCES↗

SU-E-T-211: Induced Release of Nanocarrier Encapsulated Chemotherapeutic Drugs Using Proton Radiotherapy Beams

Purpose: The purpose of this work was to develop and validate an open source independent MU dose calculation software for S and S IMRT based in the algorithm proposed by Kung et.al. Methods: Treatment plans were done using Iplan v4.5 BrainLAB TPS and S and S IMRT modality. A 6MV photon beam produced by a Primus linear accelerator equipped with an Optifocus MLC was used. TPS dose calculation algorithms were pencil beam and Monte Carlo. 230 IMRT treatments plans were selected for the study. The software was written under MALTLAB environment. Treatment plans were imported by the software using RTP format. Field fluences were reconstructed adding all segments.The algorithm implemented in the software calculates the dose at a reference point as the sum of primary and scatter dose. The primary dose is obtained by masking the fluence map with a circle of radius 1cm. The scatter dose is obtained through a shaped ring mask around the previous circle with a thickness of 0.5cm; the rings are increased one after another with constant thickness until cover the entire map of influence. The dosimetric parameters Sc, Sp and TPR vary depending on radio, the transmission effect of the MLC, inverse square law and dose profile are used for the calculation. Results: The average difference between measured and independent calculated dose was 0.4% ± 2.2% [−6.8%, 6.4%]. For 91% of the studied plans the difference was less than 3%. The difference between the measured and TPS dose with pencilbeam algorithm was 2.6% ± 1.41% [−2.0%, 5.6%] and Monte Carlo algorithm was 0.4% ± 1.5% [−4.9%, 3.7%]. The differences obtained are comparable to that obtained with the ionization chamber and TPS. Conclusion: The developed software is suitable for use in S and S IMRT dose calculation. This application is open and can be downloading under request.

60 APPLIED LIFE SCIENCES↗

SU-F-T-20: Novel Catheter Lumen Recognition Algorithm for Rapid Digitization

Purpose: Manual catheter recognition remains a time-consuming aspect of high-dose-rate brachytherapy (HDR) treatment planning. In this work, a novel catheter lumen recognition algorithm was created for accurate and rapid digitization. Methods: MatLab v8.5 was used to create the catheter recognition algorithm. Initially, the algorithm searches the patient CT dataset using an intensity based k-means filter designed to locate catheters. Once the catheters have been located, seed points are manually selected to initialize digitization of each catheter. From each seed point, the algorithm searches locally in order to automatically digitize the remaining catheter. This digitization is accomplished by finding pixels with similar image curvature and divergence parameters compared to the seed pixel. Newly digitized pixels are treated as new seed positions, and hessian image analysis is used to direct the algorithm toward neighboring catheter pixels, and to make the algorithm insensitive to adjacent catheters that are unresolvable on CT, air pockets, and high Z artifacts. The algorithm was tested using 11 HDR treatment plans, including the Syed template, tandem and ovoid applicator, and multi-catheter lung brachytherapy. Digitization error was calculated by comparing manually determined catheter positions to those determined by the algorithm. Results: he digitization error was 0.23 mm ± 0.14 mm axially and 0.62 mm ± 0.13 mm longitudinally at the tip. The time of digitization, following initial seed placement was less than 1 second per catheter. The maximum total time required to digitize all tested applicators was 4 minutes (Syed template with 15 needles). Conclusion: This algorithm successfully digitizes HDR catheters for a variety of applicators with or without CT markers. The minimal axial error demonstrates the accuracy of the algorithm, and its insensitivity to image artifacts and challenging catheter positioning. Future work to automatically place initial seed positions would improve the algorithm speed.

60 APPLIED LIFE SCIENCES↗

Parallel Processing Systems for Passive Ranging During Helicopter Flight

The complexity of rotorcraft missions involving operations close to the ground result in high pilot workload. In order to allow a pilot time to perform mission-oriented tasks, sensor-aiding and automation of some of the guidance and control functions are highly desirable. Images from an electro-optical sensor provide a covert way of detecting objects in the flight path of a low-flying helicopter. Passive ranging consists of processing a sequence of images using techniques based on optical low computation and recursive estimation. The passive ranging algorithm has to extract obstacle information from imagery at rates varying from five to thirty or more frames per second depending on the helicopter speed. We have implemented and tested the passive ranging algorithm off-line using helicopter-collected images. However, the real-time data and computation requirements of the algorithm are beyond the capability of any off-the-shelf microprocessor or digital signal processor. This paper describes the computational requirements of the algorithm and uses parallel processing technology to meet these requirements. Various issues in the selection of a parallel processing architecture are discussed and four different computer architectures are evaluated regarding their suitability to process the algorithm in real-time. Based on this evaluation, we conclude that real-time passive ranging is a realistic goal and can be achieved with a short time.

Sridhar, Bavavar↗

Investigation of Near Shannon Limit Coding Schemes

Turbo codes can deliver performance that is very close to the Shannon limit. This report investigates algorithms for convolutional turbo codes and block turbo codes. Both coding schemes can achieve performance near Shannon limit. The performance of the schemes is obtained using computer simulations. There are three sections in this report. First section is the introduction. The fundamental knowledge about coding, block coding and convolutional coding is discussed. In the second section, the basic concepts of convolutional turbo codes are introduced and the performance of turbo codes, especially high rate turbo codes, is provided from the simulation results. After introducing all the parameters that help turbo codes achieve such a good performance, it is concluded that output weight distribution should be the main consideration in designing turbo codes. Based on the output weight distribution, the performance bounds for turbo codes are given. Then, the relationships between the output weight distribution and the factors like generator polynomial, interleaver and puncturing pattern are examined. The criterion for the best selection of system components is provided. The puncturing pattern algorithm is discussed in detail. Different puncturing patterns are compared for each high rate. For most of the high rate codes, the puncturing pattern does not show any significant effect on the code performance if pseudo - random interleaver is used in the system. For some special rate codes with poor performance, an alternative puncturing algorithm is designed which restores their performance close to the Shannon limit. Finally, in section three, for iterative decoding of block codes, the method of building trellis for block codes, the structure of the iterative decoding system and the calculation of extrinsic values are discussed.

Kwatra, S. C.↗

Optimized aperiodic multilayer structures for use as narrow-angular absorbers

In this paper, we investigate aperiodic multilayer structures for use as narrow-angular absorbers. The layer thicknesses and materials are optimized using a genetic global optimization algorithm coupled to a transfer matrix code to maximize the angular selectivity in the absorptance at a single or multiple wavelengths. We first consider structures composed of alternating layers of tungsten and silicon or silica, and find that it is not possible to achieve angular selectivity in the absorptance with such structures. We next consider structures composed of alternating layers of silicon and silica, and show that when optimized they exhibit high angular selectivity in absorptance. In addition, as the angular selectivity in absorptance increases, the wavelength range of high angular selectivity also decreases. Optimizing the material composition of the multilayer structures, in addition to optimizing the layer thicknesses, leads to marginal improvement in angular selectivity. Finally, we show that by optimizing the absorptance of the multilayer structures at multiple wavelengths, we can obtain structures exhibiting almost perfect absorptance at normal incidence and narrow angular width in absorptance at these wavelengths. Similar to the structures optimized at a single wavelength, the wavelength range of high angularly selective absorptance is narrow.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Compression Algorithm Analysis of In-Situ (S)TEM Video: Towards Automatic Event Detection and Characterization

Precise analysis of both (S)TEM images and video are time and labor intensive processes. As an example, determining when crystal growth and shrinkage occurs during the dynamic process of Li dendrite deposition and stripping involves manually scanning through each frame in the video to extract a specific set of frames/images. For large numbers of images, this process can be very time consuming, so a fast and accurate automated method is desirable. Given this need, we developed software that uses analysis of video compression statistics for detecting and characterizing events in large data sets. This software works by converting the data into a series of images which it compresses into an MPEG-2 video using the open source “avconv” utility [1]. The software does not use the video itself, but rather analyzes the video statistics from the first pass of the video encoding that avconv records in the log file. This file contains statistics for each frame of the video including the frame quality, intra-texture and predicted texture bits, forward and backward motion vector resolution, among others. In all, avconv records 15 statistics for each frame. By combining different statistics, we have been able to detect events in various types of data. We have developed an interactive tool for exploring the data and the statistics that aids the analyst in selecting useful statistics for each analysis. Going forward, an algorithm for detecting and possibly describing events automatically can be written based on statistic(s) for each data type.

algorithm analysis↗

Fast algorithm for calculating chemical kinetics in turbulent reacting flow

This paper addresses the need for a fast batch chemistry solver to perform the kinetics part of a split operator formulation of turbulent reacting flows, with special attention focused on the solution of the ordinary differential equations governing a homogeneous gas-phase chemical reaction. For this purpose, a two-part predictor-corrector algorithm which incorporates an exponentially fitted trapezoidal method was developed. The algorithm performs filtering of ill-posed initial conditions, automatic step-size selection, and automatic selection of Jacobi-Newton or Newton-Raphson iteration for convergence to achieve maximum computational efficiency while observing a prescribed error tolerance. The new algorithm, termed CREK1D (combustion reaction kinetics, one-dimensional), compared favorably with the code LSODE when tested on two representative problems drawn from combustion kinetics, and is faster than LSODE.

Radhakrishnan, K.↗

Co-optimization of CO 2 -EOR and Storage Processes under Geological Uncertainty

This paper presents an integrated numerical framework to co-optimize EOR and CO 2 storage performance in the Farnsworth field unit (FWU), Ochiltree County, Texas. The framework includes a field-scale compositional reservoir flow model, an uncertainty quantification model and a neural network optimization process. The reservoir flow model has been constructed based on the field geophysical, geological, and engineering data. A laboratory fluid analysis was tuned to an equation of state and subsequently used to predict the thermodynamic minimum miscible pressure (MMP). A history match of primary and secondary recovery processes was conducted to estimate the reservoir and multiphase flow parameters as the baseline case for analyzing the effect of recycling produced gas, infill drilling and water alternating gas (WAG) cycles on oil recovery and CO 2 storage. A multi-objective optimization model was defined for maximizing both oil recovery and CO 2 storage. The uncertainty quantification model comprising the Latin Hypercube sampling, Monte Carlo simulation, and sensitivity analysis, was used to study the effects of uncertain variables on the defined objective functions. Uncertain variables such as bottom hole injection pressure, WAG cycle, injection and production group rates, and gas-oil ratio among others were selected. The most significant variables were selected as control variables to be used for the optimization process. A neural network optimization algorithm was utilized to optimize the objective function both with and without geological uncertainty. The vertical permeability anisotropy (Kv/Kh) was selected as one of the uncertain parameters in the optimization process. The simulation results were compared to a scenario baseline case that predicted CO 2 storage of 74%. The results showed an improved approach for optimizing oil recovery and CO 2 storage in the FWU. The optimization process predicted more than 94% of CO 2 storage and most importantly about 28% of incremental oil recovery. The sensitivity analysis reduced the number of control variables to decrease computational time. A risk aversion factor was used to represent results at various confidence levels to assist management in the decision-making process. The defined objective functions were proved to be a robust approach to co-optimize oil recovery and CO 2 storage. The Farnsworth CO 2 project will serve as a benchmark for future CO 2 –EOR or CCUS projects in the Anadarko basin or geologically similar basins throughout the world.

54 ENVIRONMENTAL SCIENCES↗