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 955 records · Page 53

Patient-specific quantification of image quality: An automated method for measuring spatial resolution in clinical CT images

Purpose: To develop and validate an automated technique for evaluating the spatial resolution characteristics of clinical computed tomography (CT) images. Methods: Twenty one chest and abdominopelvic clinical CT datasets were examined in this study. An algorithm was developed to extract a CT resolution index (RI) analogous to the modulation transfer function from clinical CT images by measuring the edge-spread function (ESF) across the patient’s skin. A polygon mesh of the air-skin boundary was created. The faces of the mesh were then used to measure the ESF across the air-skin interface. The ESF was differentiated to obtain the line-spread function (LSF), and the LSF was Fourier transformed to obtain the RI. The algorithm’s ability to detect the radial dependence of the RI was investigated. RIs measured with the proposed method were compared with a conventional phantom-based method across two reconstruction algorithms (FBP and iterative) using the spatial frequency at 50% RI, f{sub 50}, as the metric for comparison. Three reconstruction kernels were investigated for each reconstruction algorithm. Finally, an observer study was conducted to determine if observers could visually perceive the differences in the measured blurriness of images reconstructed with a given reconstruction method. Results: RI measurements performed with the proposed technique exhibited the expected dependencies on the image reconstruction. The measured f{sub 50} values increased with harder kernels for both FBP and iterative reconstruction. Furthermore, the proposed algorithm was able to detect the radial dependence of the RI. Patient-specific measurements of the RI were comparable to the phantom-based technique, but the patient data exhibited a large spread in the measured f{sub 50}, indicating that some datasets were blurrier than others even when the projection data were reconstructed with the same reconstruction algorithm and kernel. Results from the observer study substantiated this finding. Conclusions: Clinically informed, patient-specific spatial resolution can be measured from clinical datasets. The method is sufficiently sensitive to reflect changes in spatial resolution due to different reconstruction parameters. The method can be applied to automatically assess the spatial resolution of patient images and quantify dependencies that may not be captured in phantom data.

60 APPLIED LIFE SCIENCES↗

A comparison of machine learning methods to classify radioactive elements using prompt-gamma-ray neutron activation data

The detection of illicit radiological materials is critical to establishing a robust second line of defence in nuclear security. Neutron-capture prompt-gamma activation analysis (PGAA) can be used to detect multiple radioactive materials across the entire Periodic Table. However, long detection times and a high rate of false positives pose a significant hindrance in the deployment of PGAA-based systems to identify the presence of illicit substances in nuclear forensics. In the present work, six different machine-learning algorithms were developed to classify radioactive elements based on the PGAA energy spectra. The model performance was evaluated using standard classification metrics and trend curves with an emphasis on comparing the effectiveness of algorithms that are best suited for classifying imbalanced datasets. We analyse the classification performance based on Precision, Recall, F1-score, Specificity, Confusion matrix, ROC-AUC curves, and Geometric Mean Score (GMS) measures. The tree-based algorithms (Decision Trees, Random Forest and AdaBoost) have consistently outperformed Support Vector Machine and K-Nearest Neighbours. Based on the results presented, AdaBoost is the preferred classifier to analyse data containing PGAA spectral information due to the high recall and minimal false negatives reported in the minority class.

97 MATHEMATICS AND COMPUTING↗

Parallel Algorithms for Efficient Computation of High-Order Line Graphs of Hypergraphs

This paper considers structures of systems beyond dyadic (pairwise) interactions and investigates mathematical modeling of multi-way interactions and connections as hypergraphs, where captured relationships among system entities are set-valued. To date, in most situations, entities in a hypergraph are considered connected as long as there is at least one common ``neighbor''. However, minimal commonality sometimes discards the ``strength'' of connections and interactions among groups. To this end, considering the ``width'' of a connection, referred to as the \emph{$s$-overlap} of neighbors, provides more meaningful insights into how closely the communities or entities interact with each other. In addition, $s$-overlap computation is the fundamental kernel to construct the line graph of a hypergraph, a low-order approximation of the hypergraph which can carry significant information about the original hypergraph. Subsequent stages of a data analytics pipeline then can apply highly-tuned graph algorithms on the line graph to reveal important features. Given a hypergraph, computing the $s$-overlaps by exhaustively considering all pairwise entities can be computationally prohibitive. To tackle this challenge, we develop efficient algorithms to compute $s$-overlaps and the corresponding line graph of a hypergraph. We propose several heuristics to avoid execution of redundant work and improve performance of the $s$-overlap computation. Our parallel algorithm, combined with these heuristics, is orders of magnitude (more than $10\times$) faster than the naive algorithm in all cases and the SpGEMM algorithm with filtration in most cases (especially with large $s$ value).

hypergraph algorithms, graph algorithms, parallel ↗

2D/3D registration algorithm for lung brachytherapy

Purpose: A 2D/3D registration algorithm is proposed for registering orthogonal x-ray images with a diagnostic CT volume for high dose rate (HDR) lung brachytherapy. Methods: The algorithm utilizes a rigid registration model based on a pixel/voxel intensity matching approach. To achieve accurate registration, a robust similarity measure combining normalized mutual information, image gradient, and intensity difference was developed. The algorithm was validated using a simple body and anthropomorphic phantoms. Transfer catheters were placed inside the phantoms to simulate the unique image features observed during treatment. The algorithm sensitivity to various degrees of initial misregistration and to the presence of foreign objects, such as ECG leads, was evaluated. Results: The mean registration error was 2.2 and 1.9 mm for the simple body and anthropomorphic phantoms, respectively. The error was comparable to the interoperator catheter digitization error of 1.6 mm. Preliminary analysis of data acquired from four patients indicated a mean registration error of 4.2 mm. Conclusions: Results obtained using the proposed algorithm are clinically acceptable especially considering the complications normally encountered when imaging during lung HDR brachytherapy.

60 APPLIED LIFE SCIENCES↗

SU-F-J-10: Sliding Mode Control of a SMA Actuated Active Flexible Needle for Medical Procedures

Purpose: In medical interventional procedures such as brachytherapy, ablative therapies and biopsy precise steering and accurate placement of needles are very important for anatomical obstacle avoidance and accurate targeting. This study presents the efficacy of a sliding mode controller for Shape Memory Alloy (SMA) actuated flexible needle for medical procedures. Methods: Second order system dynamics of the SMA actuated active flexible needle was used for deriving the sliding mode control equations. Both proportional-integral-derivative (PID) and adaptive PID sliding mode control (APIDSMC) algorithms were developed and implemented. The flexible needle was attached at the end of a 6 DOF robotic system. Through LabView programming environment, the control commands were generated using the PID and APIDSMC algorithms. Experiments with artificial tissue mimicking phantom were performed to evaluate the performance of the controller. The actual needle tip position was obtained using an electromagnetic (EM) tracking sensor (Aurora, NDI, waterloo, Canada) at a sampling period of 1ms. During experiment, external disturbances were created applying force and thermal shock to investigate the robustness of the controllers. Results: The root mean square error (RMSE) values for APIDSMC and PID controllers were 0.75 mm and 0.92 mm, respectively, for sinusoidal reference input. In the presence of external disturbances, the APIDSMC controller showed much smoother and less overshooting response compared to that of the PID controller. Conclusion: Performance of the APIDSMC was superior to the PID controller. The APIDSMC was proved to be more effective controller in compensating the SMA uncertainties and external disturbances with clinically acceptable thresholds.

60 APPLIED LIFE SCIENCES↗

Incorporating Uncertainty of Wind Power Generation Forecast into Power System Operation, Dispatch, and Unit Commitment Procedures

An approach to evaluate the uncertainties of the balancing capacity, ramping capability, and ramp duration requirements is proposed. The approach includes three steps: forecast data acquisition, statistical analysis of retrospective information, and prediction of grid balancing requirements for a specified time horizon and a given confidence level. An assessment of the capacity and ramping requirements is performed using a specially developed probabilistic algorithm based on histogram analysis, incorporating sources of uncertainty - both continuous (wind and load forecast errors) and discrete (forced generator outages and start-up failures). A new method called the 'flying-brick' technique is developed to evaluate the look-ahead required generation performance envelope for the worst case scenario within a user-specified confidence level. A self-validation process is used to validate the accuracy of the confidence intervals. To demonstrate the validity of the developed uncertainty assessment methods and its impact on grid operation, a framework for integrating the proposed methods with an EMS system is developed. Demonstration through EMS integration illustrates the applicability of the proposed methodology and the developed tool for actual grid operation and paves the road for integration with EMS systems in control rooms.

17 WIND ENERGY↗

Simulated JWST Data Sets for Multispectral and Hyperspectral Image Fusion

The James Webb Space Telescope (JWST) will provide multispectral and hyperspectral infrared images of a large number of astrophysical scenes. Multispectral images will have the highest angular resolution, while hyperspectral images (e.g., with integral field unit spectrometers) will provide the best spectral resolution. This paper aims at providing a comprehensive framework to generate an astrophysical scene and to simulate realistic hyperspectral and multispectral data acquired by two JWST instruments, namely, NIRCam Imager and NIRSpec IFU. We want to show that this simulation framework can be resorted to assess the benefits of fusing these images to recover an image of high spatial and spectral resolutions. To do so, we make a synthetic scene associated with a canonical infrared source, the Orion Bar. We develop forward models including corresponding noises for the two JWST instruments based on their physical features. JWST observations are then simulated by applying the forward models to the aforementioned synthetic scene. We test a dedicated fusion algorithm we developed on these simulated observations. We show that the fusion process reconstructs the high spatio-spectral resolution scene with a good accuracy on most areas, and we identify some limitations of the method to be tackled in future works. The synthetic scene and observations presented in the paper can be used, for instance, to evaluate instrument models, pipelines, or more sophisticated algorithms dedicated to JWST data analysis. Besides, fusion methods such as the one presented in this paper are shown to be promising tools to fully exploit the unprecedented capabilities of the JWST.

79 ASTRONOMY AND ASTROPHYSICS↗

Calculating the grain boundary inclination of voxelated grain structures using a smoothing algorithm

We have developed a flexible method for calculating the grain boundary (GB) inclinations of voxelated grain structure data using smoothing algorithms. We compared the performance of four algorithms: the linear interpolation, Allen–Cahn, level-set, and vertex algorithms. We assessed their accuracy using 2D and 3D cases with known inclinations. The vertex algorithm provided the best balance between accuracy and efficiency for 2D structures while the linear interpolation algorithm provided the best balance for 3D structures. We compared the GB inclinations calculated using our smoothing method on a 3D high energy X-ray diffraction microscopy (HEDM) dataset to those determined by meshing the GBs. The two approaches determined similar GB plane distributions, though they varied significantly at triple junctions. In conclusion, the smoothing method was demonstrated for two sources of 3D voxelated grain structures: HEDM data and results from Monte Carlo Potts grain growth simulations.

36 MATERIALS SCIENCE↗

Results of a Multi-Institution Deformable Registration Accuracy Study (MIDRAS)

Purpose: To assess the accuracy, reproducibility, and computational performance of deformable image registration algorithms under development at multiple institutions on common datasets. Methods and Materials: Datasets from a lung patient (four-dimensional computed tomography [4D-CT]), a liver patient (4D-CT and magnetic resonance imaging [MRI] at exhale), and a prostate patient (repeat MRI) were obtained. Radiation oncologists localized anatomic structures for accuracy assessment. Algorithm accuracy was determined by comparing the computer-predicted displacement at each bifurcation point with the displacement computed from the oncologists' annotations. Thirty-seven academic institutions and medical device manufacturers with published evidence of active deformable image registration capabilities were invited to participate. Results: Twenty-seven groups agreed to participate; 6 did not return results. Sixteen completed the liver 4D-CT, 12 the lung 4D-CT, 3 the prostate MRI, and 3 the liver MRI-CT. The range of average absolute error for the lung 4D-CT was 0.6-1.2 mm (left-right [LR]), 0.5-1.8 mm (anterior-posterior [AP]), and 0.7-2.0 mm (superior-inferior [SI]); the liver 4D-CT was 0.8-1.5 mm (LR), 1.0-5.2 mm (AP), and 1.0-5.9 mm (SI); the liver MRI-CT was 1.1-2.6 mm (LR), 2.0-5.0 mm (AP), and 2.2-2.6 mm (SI); and the repeat prostate MRI prostate datasets was 0.5-6.2 mm (LR), 3.1-3.7 mm (AP), and 0.4-2.0 mm (SI). Conclusions: An infrastructure was developed to assess multi-institution deformable registration accuracy. The results indicate large discrepancies in reported shifts, although the majority of deformable registration algorithms performed at an accuracy equivalent to the voxel size, promising to improve treatment planning, delivery, and assessment.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A finite-difference time-domain simulation of high power microwave generated plasma at atmospheric pressures

A finite-difference algorithm was developed to calculate several RF breakdown parameters, for example, the formative delay time that is observed between the initial application of a RF field to a dielectric surface and the formation of field-induced plasma interrupting the RF power flow. The analysis is focused on the surface being exposed to a background gas pressure above 50 Torr. The finite-difference algorithm provides numerical solutions to partial differential equations with high resolution in the time domain, making it suitable for simulating the time evolving interaction of microwaves with plasma; in lieu of direct particle tracking, a macroscopic electron density is used to model growth and transport. This approach is presented as an alternative to particle-in-cell methods due to its low complexity and runtime leading to more efficient analysis for a simulation of a microsecond scale pulse. The effect and development of the plasma is modeled in the simulation using scaling laws for ionization rates, momentum transfer collision rates, and diffusion coefficients, as a function of electric field, gas type and pressure. The incorporation of plasma material into the simulation involves using the Z-transform to derive a time-domain algorithm from the complex frequency-dependent permittivity of plasma. Therefore, the effect of the developing plasma on the instantaneous microwave field is calculated. Simulation results are compared with power measurements using an apparatus designed to facilitate surface flashover across a polycarbonate boundary in a controlled N{sub 2}, air, or argon environment at pressures exceeding 50 Torr.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms

The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constraints. In this work, we develop an algorithm that decomposes the QAOA input problem graph into a smaller problem and solves MaxCut using QAOA on the reduced graph. The algorithm requires a subroutine that can be classical or quantum—in this work, we implement the algorithm twice on each graph. One implementation uses the classical solver Gurobi in the subroutine and the other uses QAOA. We solve these reduced problems with QAOA. On average, the reduced problems require only approximately 1/10 of the number of vertices than the original MaxCut instances. Furthermore, the average approximation ratio of the original MaxCut problems is 0.75, while the approximation ratios of the decomposed graphs are on average of 0.96 for both Gurobi and QAOA. With this decomposition, we are able to measure optimal solutions for ten 100-vertex graphs by running single-layer QAOA circuits on the Quantinuum trapped-ion quantum computer H1-1, sampling each circuit only 500 times. This approach is best suited for sparse, particularly k-regular graphs, as k-regular graphs on n vertices can be decomposed into a graph with at most $\frac{nk}{k+1}$ vertices in polynomial time. Further reductions can be obtained with a potential trade-off in computational time. In conclusion, while this paper applies the decomposition method to the MaxCut problem, it can be applied to more general classes of combinatorial optimization problems.

97 MATHEMATICS AND COMPUTING↗

Real-time Simulation Framework for Hardware-in-the-Loop Testing of Multi-port Autonomous Reconfigurable Solar Power Plant (MARS)

Multiport autonomous reconfigurable solar power plant (MARS) has been proposed for integrated development of photovoltaic (PV) and energy storage system (ESS) that can connect to high-voltage direct current (HVdc) and alternating current (ac) transmission grid. To de-risk the development of this complex integrated system that consists of hundreds to thousands of power electronics modules, a controller hardware-in-the-loop (cHIL) test setup will be extremely beneficial. The cHIL testing can be used for evaluation of modules as well as the hierarchical control system in MARS. With the unique configuration of power electronics modules in MARS, it becomes necessary to develop custom-designed real-time simulation models in the cHIL setup in absence of off-the-shelf models. In this paper, high-fidelity dynamic model of MARS, control algorithms at the lower level, and required communication algorithms are developed and optimized for real-time performance in the cHIL setup. Real-time experimental results from the cHIL are provided.

Dong, Zerui↗

Traffic Prediction for Merging Coordination Control in Mixed Traffic Scenarios

Connected and autonomous vehicles (CAVs) have the potential to bring in safety, mobility, and energy benefits to transportation. The control decisions of CAVs are usually determined for a look-ahead horizon based on previewed traffic information. This requires an effective prediction of future traffic conditions and its integration with the CAV control framework. However, the short-term traffic prediction using information from connectivity is a challenging research topic, especially for mixed traffic scenarios. This work focuses on the development of a traffic prediction framework for a merging coordination controller. The previously developed merging controller coordinates the merging sequence and travel speed of CAVs to maximize the energy efficiency and overall mobility. In mixed traffic scenarios, the controller receives information regarding the position of all the vehicles traveling inside a control zone and controls the desired speed of all CAVs. The controller has no control on the human-driven vehicles. The merging controller does not have direct information or an explicit prediction on the behaviors of human-driven vehicles. Aiming to improve the performance of the merging controller in various mixed traffic conditions, a traffic prediction algorithm is developed and evaluated in this work. The performance of this traffic prediction algorithm is investigated for various penetration rates of connectivity for a single-lane secondary road merging to a single-lane primary road. The results show that compared to a constant speed assumption of human-driven vehicles, the proposed traffic prediction algorithm is able to reduce the prediction error of the arrival time of human-driven vehicles at the merging zone by more than 50%.

Shao, Yunli↗

First-order convex feasibility algorithms for x-ray CT

Purpose: Iterative image reconstruction (IIR) algorithms in computed tomography (CT) are based on algorithms for solving a particular optimization problem. Design of the IIR algorithm, therefore, is aided by knowledge of the solution to the optimization problem on which it is based. Often times, however, it is impractical to achieve accurate solution to the optimization of interest, which complicates design of IIR algorithms. This issue is particularly acute for CT with a limited angular-range scan, which leads to poorly conditioned system matrices and difficult to solve optimization problems. In this paper, we develop IIR algorithms which solve a certain type of optimization called convex feasibility. The convex feasibility approach can provide alternatives to unconstrained optimization approaches and at the same time allow for rapidly convergent algorithms for their solution-thereby facilitating the IIR algorithm design process. Methods: An accelerated version of the Chambolle-Pock (CP) algorithm is adapted to various convex feasibility problems of potential interest to IIR in CT. One of the proposed problems is seen to be equivalent to least-squares minimization, and two other problems provide alternatives to penalized, least-squares minimization. Results: The accelerated CP algorithms are demonstrated on a simulation of circular fan-beam CT with a limited scanning arc of 144 Degree-Sign . The CP algorithms are seen in the empirical results to converge to the solution of their respective convex feasibility problems. Conclusions: Formulation of convex feasibility problems can provide a useful alternative to unconstrained optimization when designing IIR algorithms for CT. The approach is amenable to recent methods for accelerating first-order algorithms which may be particularly useful for CT with limited angular-range scanning. The present paper demonstrates the methodology, and future work will illustrate its utility in actual CT application.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Testing and Expertise for Marine Energy (TEAMER) Program Support - Numerical Modeling Assistance for iProTech's "PIP" WEC Device: Cooperative Research and Development Final Report, CRADA Number CRD-20-17303

Develop a time-domain, 3 degree of freedom numerical model of IProTech's PIP device, including power take-off (PTO), that can be used to develop control algorithms and establish a baseline technology performance level (TPL). This is important to IProTech because having a good numerical model allows IProTech to optimize design and control algorithms on an ongoing basis. A baseline TPL enables the PIP technology to be benchmarked against other wave energy converter (WEC) concepts, providing (i) justification (or not) for investment in wave tank model testing, (ii) identifying optimum design parameters and control algorithms for the test model, (iii) specifying test conditions and (iv) interpreting wave tank test results. An accredited WEC-Sim model of the PIP device is an essential tool for further development of the technology. 1) The development of numerical models of the PIP concept will enable iProTech to evaluate the potential performance of this concept, and to investigate how sensitive the device is to different variables within the system (e.g. hydraulic components, geometry dimensions, etc.) 2) The numerical models were developed with WEC-Sim and PTO-Sim -- the de-facto industry standard WEC numerical modeling tools. A detailed model of the system's hydraulic circuit was developed with PTO-Sim. However, WEC-Sim is based on linear hydrodynamics and has several limitations; validation against high fidelity models/physical scale models would help to build confidence in the results.

16 TIDAL AND WAVE POWER↗

Development of a randomized 3D cell model for Monte Carlo microdosimetry simulations

Purpose: The objective of the current work was to develop an algorithm for growing a macroscopic tumor volume from individual randomized quasi-realistic cells. The major physical and chemical components of the cell need to be modeled. It is intended to import the tumor volume into GEANT4 (and potentially other Monte Carlo packages) to simulate ionization events within the cell regions. Methods: A MATLAB Copyright-Sign code was developed to produce a tumor coordinate system consisting of individual ellipsoidal cells randomized in their spatial coordinates, sizes, and rotations. An eigenvalue method using a mathematical equation to represent individual cells was used to detect overlapping cells. GEANT4 code was then developed to import the coordinate system into GEANT4 and populate it with individual cells of varying sizes and composed of the membrane, cytoplasm, reticulum, nucleus, and nucleolus. Each region is composed of chemically realistic materials. Results: The in-house developed MATLAB Copyright-Sign code was able to grow semi-realistic cell distributions ({approx}2 Multiplication-Sign 10{sup 8} cells in 1 cm{sup 3}) in under 36 h. The cell distribution can be used in any number of Monte Carlo particle tracking toolkits including GEANT4, which has been demonstrated in this work. Conclusions: Using the cell distribution and GEANT4, the authors were able to simulate ionization events in the individual cell components resulting from 80 keV gamma radiation (the code is applicable to other particles and a wide range of energies). This virtual microdosimetry tool will allow for a more complete picture of cell damage to be developed.

61 RADIATION PROTECTION AND DOSIMETRY↗

Multistage Stochastic optimization for mid-term integrated generation and maintenance scheduling of cascaded hydroelectric system with renewable energy uncertainty

The uncertainties resulting from the escalating penetration of renewable energy resources pose severe challenges to the efficient operation of modern power systems. Hydroelectricity is characterized by its flexibility, controllability, and reliability, and thus becomes one of the most ideal energy resources to hedge against such uncertainties. This paper studies the mid-term integrated generation and maintenance scheduling of a cascaded hydroelectric system (CHS) consisting of multiple cascaded reservoirs and hydroelectric units. To precisely describe the mid-term water regulation policies, the hydraulic coupling relationship and water-energy nexus of CHS are incorporated into the proposed optimization model. The uncertainties of natural water inflow and the power outputs of wind/solar energy generation are taken into consideration and captured via a stochastic process modeled by a scenario tree. A multistage stochastic optimization (MSO) approach is developed to coordinate the complementary operations of multiple energy resources, by optimizing the mid-term water resource management, generation scheduling, and maintenance scheduling of CHS. The proposed MSO model is formulated as a large-scale mixed-integer linear program that presents significant computational intractability. To address this issue, a tailored Benders decomposition algorithm is developed. Two real-world case studies are conducted to demonstrate the capability and characteristics of the proposed model and algorithm. The computational results show that the proposed MSO model can exploit the flexibility of hydroelectricity to efficiently respond to variable wind and solar power, and reserve water resources for the generation in peak months to reduce the consumption of fossil fuel. Furthermore, the proposed solution approach also exhibits promising computational efficiency when handling large-scale models.

13 HYDRO ENERGY↗