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,567 records · Page 87

Approach for Propagating Radiometric Data Uncertainties Through NASA Ocean Color Algorithms

Spectroradiometric satellite observations of the ocean are commonly referred to as “ocean color” remote sensing. NASA has continuously collected, processed, and distributed ocean color datasets since the launch of the Sea-viewing Wide-field-of-view Sensor (SeaWiFS) in 1997. While numerous ocean color algorithms have been developed in the past two decades that derive geophysical data products from sensor-observed radiometry, few papers have clearly demonstrated how to estimate measurement uncertainty in derived data products. As the uptake of ocean color data products continues to grow with the launch of new and advanced sensors, it is critical that pixel-by-pixel data product uncertainties are estimated during routine data processing. Knowledge of uncertainties can be used when studying long-term climate records, or to assist in the development and performance appraisal of bio-optical algorithms. In this method paper we provide a comprehensive overview of how to formulate first-order first-moment (FOFM) calculus for propagating radiometric uncertainties through a selection of bio-optical models. We demonstrate FOFM uncertainty formulations for the following NASA ocean color data products: chlorophyll-a pigment concentration (Chl), the diffuse attenuation coefficient at 490 nm (K(sub d,490)), particulate organic carbon (POC), normalized fluorescent line height (nflh), and inherent optical properties (IOPs). Using a quality-controlled in situ hyperspectral remote sensing reflectance (R(sub rs,i)) dataset, we show how computationally inexpensive, yet algebraically complex, FOFM calculations may be evaluated for correctness using the more computationally expensive Monte Carlo approach. We compare bio-optical product uncertainties derived using our test R(sub rs) dataset assuming spectrally-flat, uncorrelated relative uncertainties of 1, 5, and 10%. We also consider spectrally dependent, uncorrelated relative uncertainties in R(sub rs). The importance of considering spectral covariances in R(sub rs), where practicable, in the FOFM methodology is highlighted with an example SeaWiFS image. We also present a brief case study of two POC algorithms to illustrate how FOFM formulations may be used to construct measurement uncertainty budgets for ecologically-relevant data products. Such knowledge, even if rudimentary, may provide useful information to end-users when selecting data products or when developing their own algorithms.

Bio-optics↗

Data Fusion for a Vision-Radiological System for Source Tracking and Discovery

A multidisciplinary approach to allow the tracking of the movement of radioactive sources by fusing data from multiple radiological and visual sensors is under development. The goal is to improve the ability to detect, locate, track and identify nuclear/radiological threats. The key concept is that such widely available visual and depth sensors can impact radiological detection, since the intensity fall-off in the count rate can be correlated to movement in three dimensions. To enable this, we pose an important question; what is the right combination of sensing modalities and vision algorithms that can best compliment a radiological sensor, for the purpose of detection and tracking of radioactive material? Similarly what is the best radiation detection methods and unfolding algorithms suited for data fusion with tracking data? Data fusion of multi-sensor data for radiation detection have seen some interesting developments lately. Significant examples include intelligent radiation sensor systems (IRSS), which are based on larger numbers of distributed similar or identical radiation sensors coupled with position data for network capable to detect and locate radiation source. Other developments are gamma-ray imaging systems based on Compton scatter in segmented detector arrays. Similar developments using coded apertures or scatter cameras for neutrons have recently occurred. The main limitation of such systems is not so much in their capability but rather in their complexity and cost which is prohibitive for large scale deployment. Presented here is a fusion system based on simple, low-cost computer vision and radiological sensors for tracking of multiple objects and identifying potential radiological materials being transported or shipped. The main focus of this work is the development on two separate calibration algorithms for characterizing the fused sensor system. The deviation from a simple inverse square-root fall-off of radiation intensity is explored and accounted for. In particular, the computer vision system enables a map of distance-dependence of the sources being tracked. Infrared, laser or stereoscopic vision sensors are all options for computer-vision implementation depending on interior vs exterior deployment, resolution desired and other factors. Similarly the radiation sensors will be focused on gamma-ray or neutron detection due to the long travel length and ability to penetrate even moderate shielding. There is a significant difference between the vision sensors and radiation sensors in the way the 'source' or signals are generated. A vision sensor needs an external light-source to illuminate the object and then detects the re-emitted illumination (or lack thereof). However, for a radiation detector, the radioactive material is the source itself. The only exception to this is the field of active interrogations where radiation is beamed into a material to entice new/additional radiation emission beyond what the material would emit spontaneously. The aspect of the nuclear material being the source itself means that all other objects in the environment are 'illuminated' or irradiated by the source. Most radiation will readily penetrate regular material, scatter in new directions or be absorbed. Thus if a radiation source is located near a larger object that object will in turn scatter some radiation that was initially emitted in a direction other than the direction of the radiation detector, this can add to the count rate that is observed. The effect of these scatter is a deviation from the traditional distance dependence of the radiation signal and is a key challenge that needs a combined system calibration solution and algorithms. Thus both an algebraic approach as well as a statistical approach have been developed and independently evaluated to investigate the sensitivity to this deviation from the simplified radiation fall-off as a function of distance. The resulting calibrated system algorithms are used and demonstrated in various laboratory scenarios, and later in realistic tracking scenarios. The selection and testing of radiological and computer-vision sensors for the additional specific scenarios will be the subject of ongoing and future work. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Multi-core and many-core shared-memory parallel raycasting volume rendering optimization and tuning

Given the computing industry trend of increasing processing capacity by adding more cores to a chip, the focus of this work is tuning the performance of a staple visualization algorithm, raycasting volume rendering, for shared-memory parallelism on multi-core CPUs and many-core GPUs. Our approach is to vary tunable algorithmic settings, along with known algorithmic optimizations and two different memory layouts, and measure performance in terms of absolute runtime and L2 memory cache misses. Our results indicate there is a wide variation in runtime performance on all platforms, as much as 254% for the tunable parameters we test on multi-core CPUs and 265% on many-core GPUs, and the optimal configurations vary across platforms, often in a non-obvious way. For example, our results indicate the optimal configurations on the GPU occur at a crossover point between those that maintain good cache utilization and those that saturate computational throughput. This result is likely to be extremely difficult to predict with an empirical performance model for this particular algorithm because it has an unstructured memory access pattern that varies locally for individual rays and globally for the selected viewpoint. Our results also show that optimal parameters on modern architectures are markedly different from those in previous studies run on older architectures. In addition, given the dramatic performance variation across platforms for both optimal algorithm settings and performance results, there is a clear benefit for production visualization and analysis codes to adopt a strategy for performance optimization through auto-tuning. These benefits will likely become more pronounced in the future as the number of cores per chip and the cost of moving data through the memory hierarchy both increase.

97 MATHEMATICS AND COMPUTING↗

C-SAW: a framework for graph sampling and random walk on GPUs

Many applications require to learn, mine, analyze and visualize large-scale graphs. These graphs are often too large to be addressed efficiently using conventional graph processing technologies. Fortunately, recent research efforts find out graph sampling and random walk, which significantly reduce the size of original graphs, can benefit the tasks of learning, mining, analyzing and visualizing large graphs by capturing the desirable graph properties. This paper introduces C-SAW, the first framework that accelerates Sampling and Random Walk framework on GPUs. Particularly, C-SAW makes three contributions: First, our framework provides a generic API which allows users to implement a wide range of sampling and random walk algorithms with ease. Second, offloading this framework on GPU, we introduce warp-centric parallel selection, and two novel optimizations for collision migration. Third, towards supporting graphs that exceed the GPU memory capacity, we introduce efficient data transfer optimizations for out-of-memory and multi-GPU sampling, such as workload-aware scheduling and batched multi-instance sampling. Taken together, our framework constantly outperforms the state of the art projects in addition to the capability of supporting a wide range of sampling and random walk algorithms.

97 MATHEMATICS AND COMPUTING↗

SU-G-BRA-02: Development of a Learning Based Block Matching Algorithm for Ultrasound Tracking in Radiotherapy

Purpose: To develop an ultrasound learning-based tracking algorithm with the potential to provide real-time motion traces of anatomy-based fiducials that may aid in the effective delivery of external beam radiation. Methods: The algorithm was developed in Matlab R2015a and consists of two main stages: reference frame selection, and localized block matching. Immediately following frame acquisition, a normalized cross-correlation (NCC) similarity metric is used to determine a reference frame most similar to the current frame from a series of training set images that were acquired during a pretreatment scan. Segmented features in the reference frame provide the basis for the localized block matching to determine the feature locations in the current frame. The boundary points of the reference frame segmentation are used as the initial locations for the block matching and NCC is used to find the most similar block in the current frame. The best matched block locations in the current frame comprise the updated feature boundary. The algorithm was tested using five features from two sets of ultrasound patient data obtained from MICCAI 2014 CLUST. Due to the lack of a training set associated with the image sequences, the first 200 frames of the image sets were considered a valid training set for preliminary testing, and tracking was performed over the remaining frames. Results: Tracking of the five vessel features resulted in an average tracking error of 1.21 mm relative to predefined annotations. The average analysis rate was 15.7 FPS with analysis for one of the two patients reaching real-time speeds. Computations were performed on an i5-3230M at 2.60 GHz. Conclusion: Preliminary tests show tracking errors comparable with similar algorithms at close to real-time speeds. Extension of the work onto a GPU platform has the potential to achieve real-time performance, making tracking for therapy applications a feasible option. This work is partially funded by NIH grant R01CA190298.

60 APPLIED LIFE SCIENCES↗

THE DETECTION AND STATISTICS OF GIANT ARCS BEHIND CLASH CLUSTERS

We developed an algorithm to find and characterize gravitationally lensed galaxies (arcs) to perform a comparison of the observed and simulated arc abundance. Observations are from the Cluster Lensing And Supernova survey with Hubble (CLASH). Simulated CLASH images are created using the MOKA package and also clusters selected from the high-resolution, hydrodynamical simulations, MUSIC, over the same mass and redshift range as the CLASH sample. The algorithm's arc elongation accuracy, completeness, and false positive rate are determined and used to compute an estimate of the true arc abundance. We derive a lensing efficiency of 4 ± 1 arcs (with length ≥6″ and length-to-width ratio ≥7) per cluster for the X-ray-selected CLASH sample, 4 ± 1 arcs per cluster for the MOKA-simulated sample, and 3 ± 1 arcs per cluster for the MUSIC-simulated sample. The observed and simulated arc statistics are in full agreement. We measure the photometric redshifts of all detected arcs and find a median redshift z{sub s} = 1.9 with 33% of the detected arcs having z{sub s} > 3. We find that the arc abundance does not depend strongly on the source redshift distribution but is sensitive to the mass distribution of the dark matter halos (e.g., the c–M relation). Our results show that consistency between the observed and simulated distributions of lensed arc sizes and axial ratios can be achieved by using cluster-lensing simulations that are carefully matched to the selection criteria used in the observations.

79 ASTRONOMY AND ASTROPHYSICS↗

Beyond 100 Gb/s: Capacity, Flexibility, and Network Optimization

Here, we discuss building blocks that enable the exploitation of optical capacities beyond 100 Gb/s. Optical networks will benefit from more flexibility and agility in their network elements, especially from coherent transceivers. To achieve capacities of 400 Gb/s and more, coherent transceivers will operate at higher symbol rates. This will be made possible with higher bandwidth components using new electro-optic technologies implemented with indium phosphide and silicon photonics. Digital signal processing will benefit from new algorithms. Multi-dimensional modulation, of which some formats are already in existence in current flexible coherent transceivers, will provide improved tolerance to noise and fiber nonlinearities. Constellation shaping will further improve these tolerances while allowing a finer granularity in the selection of capacity. Frequency-division multiplexing will also provide improved tolerance to the nonlinear characteristics of fibers. Algorithms with reduced computation complexity will allow the implementation, at speeds, of direct pre-compensation of nonlinear propagation effects. Advancement in forward error correction will shrink the performance gap with Shannon's limit. At the network control and management level, new tools are being developed to achieve a more efficient utilization of networks. This will also allow for network virtualization, orchestration, and management. Lastly, FlexEthernet and FlexOTN will be put in place to allow network operators to optimize capacity in their optical transport networks without manual changes to the client hardware.

47 OTHER INSTRUMENTATION↗

A Parallel Ghosting Algorithm for The Flexible Distributed Mesh Database

Critical to the scalability of parallel adaptive simulations are parallel control functions including load balancing, reduced inter-process communication and optimal data decomposition. In distributed meshes, many mesh-based applications frequently access neighborhood information for computational purposes which must be transmitted efficiently to avoid parallel performance degradation when the neighbors are on different processors. This article presents a parallel algorithm of creating and deleting data copies, referred to as ghost copies, which localize neighborhood data for computation purposes while minimizing inter-process communication. The key characteristics of the algorithm are: (1) It can create ghost copies of any permissible topological order in a 1D, 2D or 3D mesh based on selected adjacencies. (2) It exploits neighborhood communication patterns during the ghost creation process thus eliminating all-to-all communication. (3) For applications that need neighbors of neighbors, the algorithm can create n number of ghost layers up to a point where the whole partitioned mesh can be ghosted. Strong and weak scaling results are presented for the IBM BG/P and Cray XE6 architectures up to a core count of 32,768 processors. The algorithm also leads to scalable results when used in a parallel super-convergent patch recovery error estimator, an application that frequently accesses neighborhood data to carry out computation.

Mubarak, Misbah↗

Geostationary Lightning Mapper for GOES-R

The Geostationary Lightning Mapper (GLM) is a single channel, near-IR optical detector, used to detect, locate and measure total lightning activity over the full-disk as part of a 3-axis stabilized, geostationary weather satellite system. The next generation NOAA Geostationary Operational Environmental Satellite (GOES-R) series with a planned launch in 2014 will carry a GLM that will provide continuous day and night observations of lightning from the west coast of Africa (GOES-E) to New Zealand (GOES-W) when the constellation is fully operational. The mission objectives for the GLM are to 1) provide continuous, full-disk lightning measurements for storm warning and Nowcasting, 2) provide early warning of tornadic activity, and 3) accumulate a long-term database to track decadal changes of lightning. The GLM owes its heritage to the NASA Lightning Imaging Sensor (1997-Present) and the Optical Transient Detector (1995-2000), which were developed for the Earth Observing System and have produced a combined 11 year data record of global lightning activity. Instrument formulation studies begun in January 2006 will be completed in March 2007, with implementation expected to begin in September 2007. Proxy total lightning data from the NASA Lightning Imaging Sensor on the Tropical Rainfall Measuring Mission (TRMM) satellite, airborne science missions (e.g., African Monsoon Multi-disciplinary Analysis, AMMA), and regional test beds (e.g, Lightning Mapping Arrays) are being used to develop the pre-launch algorithms and applications, and also improve our knowledge of thunderstorm initiation and evolution. Real time lightning mapping data now being provided to selected forecast offices will lead to improved understanding of the application of these data in the severe storm warning process and accelerate the development of the pre-launch algorithms and Nowcasting applications. Proxy data combined with MODIS and Meteosat Second Generation SEVERI observations will also lead to new applications (e.g., multi-sensor precipitation algorithms blending the GLM with the Advanced Baseline Imager, convective cloud initiation and identification, early warnings of lightning threat, storm tracking, and data assimilation).

Goodman, Steven↗

High-dimensional multivariate autoregressive model estimation of human electrophysiological data using fMRI priors

Multivariate autoregressive (MVAR) model estimation enables assessment of causal interactions in brain networks. However, accurately estimating MVAR models for high-dimensional electrophysiological recordings is challenging due to the extensive data requirements. Hence, the applicability of MVAR models for study of brain behavior over hundreds of recording sites has been very limited. Prior work has focused on different strategies for selecting a subset of important MVAR coefficients in the model to reduce the data requirements of conventional least-squares estimation algorithms. Here we propose incorporating prior information, such as resting state functional connectivity derived from functional magnetic resonance imaging, into MVAR model estimation using a weighted group least absolute shrinkage and selection operator (LASSO) regularization strategy. The proposed approach is shown to reduce data requirements by a factor of two relative to the recently proposed group LASSO method of Endemann et al (Neuroimage 254:119057, 2022) while resulting in models that are both more parsimonious and more accurate. The effectiveness of the method is demonstrated using simulation studies of physiologically realistic MVAR models derived from intracranial electroencephalography (iEEG) data. The robustness of the approach to deviations between the conditions under which the prior information and iEEG data is obtained is illustrated using models from data collected in different sleep stages. This approach allows accurate effective connectivity analyses over short time scales, facilitating investigations of causal interactions in the brain underlying perception and cognition during rapid transitions in behavioral state.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

SU-F-T-664: The Efficacy of Gold Nanoparticles as Contrast Agents in Mice

Purpose: Micro-Computed Tomography (micro-CT) has been widely used as a non-invasive, high-resolution imaging modality in preclinical research. However, tumors cannot be well distinguished, since their density are similar to those of surrounding tissues, and the tumors’ natural contrast is very low. The benefits of using Gold Nanoparticles (AuNPs) as a promising high atomic weight contrast agent have been published in recent years. The aim of this study is to investigate the efficacy of AuNPs as contrast agents using different energy x-rays. Methods: The left flank of an immune-compromised athymic nude mouse was implanted with subcutaneous xenograft model of human lung cancer line, A549 cells (from ATCC). After 14 days, this mouse was imaged with dual energy cone-beam micro-CT. The selected energies were 45 kVp and 65 kVp. 10µg AuNPs (200 µg/ml concentration) approximately 12 nm in size were injected subcutaneously into the tumor. The mouse was imaged 0, 3 and 24 hours post-injection. During scanning, this mouse was anesthetized. All projection raw data have been optimized and then images were reconstructed with the FDK Algorithm. Results: Based on images, at 0 hour, AuNPs provided obvious contrast no matter which energy selected, 45 kVp or 65 kVp; and using 45 kVp X-ray, AuNps showed greater contrast. After 3 hours or evenand longer, AuNPs distributed throughout the whole body of mouse, and they were not shown clearly shown in the images. Conclusion: In this study, we investigated the efficacy of AuNPs as image contrast agents at different energies with dual-energy micro-CT, using 200µg/mL of AuNPs. Sufficiently high concentrations of AuNPs are needed to be able to track intratumoral distribution. Images showed good contrast immediately following the administration of the agent but results were poor after 3 hours.

60 APPLIED LIFE SCIENCES↗

SU-E-J-87: Lung Deformable Image Registration Using Surface Mesh Deformation for Dose Distribution Combination

Purpose: To allow a reliable deformable image registration (DIR) method for dose calculation in radiation therapy. This work proposes a performance assessment of a morphological segmentation algorithm that generates a deformation field from lung surface displacements with 4DCT datasets. Methods: From the 4DCT scans of 15 selected patients, the deep exhale phase of the breathing cycle is identified as the reference scan. Varian TPS EclipseTM is used to draw lung contours, which are given as input to the morphological segmentation algorithm. Voxelized contours are smoothed by a Gaussian filter and then transformed into a surface mesh representation. Such mesh is adapted by rigid and elastic deformations to match each subsequent lung volumes. The segmentation efficiency is assessed by comparing the segmented lung contour and the TPS contour considering two volume metrics, defined as Volumetric Overlap Error (VOE) [%] and Relative Volume Difference (RVD) [%] and three surface metrics, defined as Average Symmetric Surface Distance (ASSD) [mm], Root Mean Square Symmetric Surface Distance (RMSSD) [mm] and Maximum Symmetric Surface Distance (MSSD) [mm]. Then, the surface deformation between two breathing phases is determined by the displacement of corresponding vertices in each deformed surface. The lung surface deformation is linearly propagated in the lung volume to generate 3D deformation fields for each breathing phase. Results: The metrics were averaged over the 15 patients and calculated with the same segmentation parameters. The volume metrics obtained are a VOE of 5.2% and a RVD of 2.6%. The surface metrics computed are an ASSD of 0.5 mm, a RMSSD of 0.8 mm and a MSSD of 6.9 mm. Conclusion: This study shows that the morphological segmentation algorithm can provide an automatic method to capture an organ motion from 4DCT scans and translate it into a volume deformation grid needed by DIR method for dose distribution combination.

60 APPLIED LIFE SCIENCES↗

Completeness map evaluation demonstrated with candidate next-generation cardiac CT architectures

Purpose: In this report, the authors introduce the general concept of the completeness map, as a means to evaluate the completeness of data acquired by a given CT system design (architecture and scan mode). They illustrate the utility of completeness map by applying the completeness map concept to a number of candidate CT system designs, as part of a study to advance the state-of-the-art in cardiac CT. Methods: In order to optimally reconstruct a point within a volume of interest (VOI), the Radon transform on all possible planes through that point should be measured. The authors quantified the extent to which this ideal condition is satisfied for the entire image volume. They first determined a Radon completeness number for each point in the VOI, as the percentage of possible planes that is actually measured. A completeness map is then defined as a 3D matrix of the completeness numbers for the entire VOI. The authors proposed algorithms to analyze the projection datasets in Radon space and compute the completeness number for a fixed point and apply these algorithms to various architectures and scan modes that they are evaluating. In this report, the authors consider four selected candidate architectures, operating with different scan modes, for a total of five system design alternatives. Each of these alternatives is evaluated using completeness map. Results: If the detector size and cone angle are large enough to cover the entire cardiac VOI, a single-source circular scan can have {>=}99% completeness over the entire VOI. However, only the central z-slice can be exactly reconstructed, which corresponds to 100% completeness. For a typical single-source architecture, if the detector is limited to an axial dimension of 40 mm, a helical scan needs about five rotations to form an exact reconstruction region covering the cardiac VOI, while a triple-source helical scan only requires two rotations, leading to a 2.5x improvement in temporal resolution. If the source and detector of an inverse-geometry (IGCT) system have the same axial extent, and the spacing of source points in the axial and transaxial directions is sufficiently small, the IGCT can also form an exact reconstruction region for the cardiac VOI. If the VOI can be covered by the x-ray beam in any view, a composite-circling scan can generate an exact reconstruction region covering the VOI. Conclusions: The completeness map evaluation provides useful information for selecting the next-generation cardiac CT system design. The proposed completeness map method provides a practical tool for analyzing complex scanning trajectories, where the theoretical image quality for some complex system designs is impossible to predict, without yet-undeveloped reconstruction algorithms.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

MER-DIMES : a planetary landing application of computer vision

During the Mars Exploration Rovers (MER) landings, the Descent Image Motion Estimation System (DIMES) was used for horizontal velocity estimation. The DIMES algorithm combines measurements from a descent camera, a radar altimeter and an inertial measurement unit. To deal with large changes in scale and orientation between descent images, the algorithm uses altitude and attitude measurements to rectify image data to level ground plane. Feature selection and tracking is employed in the rectified data to compute the horizontal motion between images. Differences of motion estimates are then compared to inertial measurements to verify correct feature tracking. DIMES combines sensor data from multiple sources in a novel way to create a low-cost, robust and computationally efficient velocity estimation solution, and DIMES is the first use of computer vision to control a spacecraft during planetary landing. In this paper, the detailed implementation of the DIMES algorithm and the results from the two landings on Mars are presented.

landing systems↗

MaxEnt-Burg Application to Muon-Spin Resonance

Muon-Spin Rotation ({mu}SR) is an experimental technique similar to Nuclear Magnetic Resonance (NMR). {mu}SR data are recorded as a set of time-series histograms of muon-decay events. Both {mu}SR and NMR regularly produce signals that are overlapping, weak and/or broadened in frequency space. These {mu}SR histograms are usually analyzed by curve fitting and Fourier transformations. However, several NMR and {mu}SR groups have developed Maximum Entropy (MaxEnt, ME) applications to improve the sensitivity of the time series analysis. We have focused on the application of the ME-Burg algorithm. The optimal number of autoregression coefficients is between N/3 and N/5 where N is the total number of data points. Selected results for simulated data and real data ME-{mu}SR applications are reported. Most of our {mu}SR work is for cuprate superconductor studies. The strength of the ME-Burg algorithm is fully used, as there is a clear relationship between the muon-spin signal S(i) at any time i and the signals S(i-k) at earlier times. ME-Burg has the major advantage of producing in the frequency transform only structure for which sufficient statistical evidence is present.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Method and apparatus for calibrating multi-axis load cells in a dexterous robot

A robotic system includes a dexterous robot having robotic joints, angle sensors adapted for measuring joint angles at a corresponding one of the joints, load cells for measuring a set of strain values imparted to a corresponding one of the load cells during a predetermined pose of the robot, and a host machine. The host machine is electrically connected to the load cells and angle sensors, and receives the joint angle values and strain values during the predetermined pose. The robot presses together mating pairs of load cells to form the poses. The host machine executes an algorithm to process the joint angles and strain values, and from the set of all calibration matrices that minimize error in force balance equations, selects the set of calibration matrices that is closest in a value to a pre-specified value. A method for calibrating the load cells via the algorithm is also provided.

Wampler, II, Charles W.↗

Optimal artificial neural network architecture selection for performance prediction of compact heat exchanger with the EBaLM-OTR technique

Artificial Neural Networks (ANN) have been used in the past to predict the performance of printed circuit heat exchangers (PCHE) with satisfactory accuracy. Typically published literature has focused on optimizing ANN using a training dataset to train the network and a testing dataset to evaluate it. Although this may produce outputs that agree with experimental results, there is a risk of over-training or overlearning the network rather than generalizing it, which should be the ultimate goal. An over-trained network is able to produce good results with the training dataset but fails when new datasets with subtle changes are introduced. In this paper we present EBaLM-OTR (error back propagation and Levenberg-Marquardt algorithms for over training resilience) technique, which is based on a previously discussed method of selecting neural network architecture that uses a separate validation set to evaluate different network architectures based on mean square error (MSE), and standard deviation of MSE. The method uses k-fold cross validation. Therefore in order to select the optimal architecture for the problem, the dataset is divided into three parts which are used to train, validate and test each network architecture. Then each architecture is evaluated according to their generalization capability and capability to conform to original data. The method proved to be a comprehensive tool in identifying the weaknesses and advantages of different network architectures. The method also highlighted the fact that the architecture with the lowest training error is not always the most generalized and therefore not the optimal. Using the method the testing error achieved was in the order of magnitude of within 10{sup -5} - 10{sup -3}. It was also show that the absolute error achieved by EBaLM-OTR was an order of magnitude better than the lowest error achieved by EBaLM-THP.

99 GENERAL AND MISCELLANEOUS↗

Retrieve Optically Thick Ice Cloud Microphysical Properties by Using Airborne Dual-Wavelength Radar Measurements

An algorithm to retrieve optically thick ice cloud microphysical property profiles is developed by using the GSFC 9.6 GHz ER-2 Doppler Radar (EDOP) and the 94 GHz Cloud Radar System (CRS) measurements aboard the high-altitude ER-2 aircraft. In situ size distribution and total water content data from the CRYSTAL-FACE field campaign are used for the algorithm development. To reduce uncertainty in calculated radar reflectivity factors (Ze) at these wavelengths, coincident radar measurements and size distribution data are used to guide the selection of mass-length relationships and to deal with the density and non-spherical effects of ice crystals on the Ze calculations. The algorithm is able to retrieve microphysical property profiles of optically thick ice clouds, such as, deep convective and anvil clouds, which are very challenging for single frequency radar and lidar. Examples of retrieved microphysical properties for a deep convective clouds are presented, which show that EDOP and CRS measurements provide rich information to study cloud structure and evolution. Good agreement between IWPs derived from an independent submillimeter-wave radiometer, CoSSIR, and dual-wavelength radar measurements indicates accuracy of the IWC retrieved from the two-frequency radar algorithm.

Wang, Zhien↗