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,333 records · Page 74

Retrieval of Polar Stratospheric Cloud Microphysical Properties from Lidar Measurements: Dependence on Particle Shape Assumptions

A retrieval algorithm has been developed for the microphysical analysis of polar stratospheric cloud (PSC) optical data obtained using lidar instrumentation. The parameterization scheme of the PSC microphysical properties allows for coexistence of up to three different particle types with size-dependent shapes. The finite difference time domain (FDTD) method has been used to calculate optical properties of particles with maximum dimensions equal to or less than 2 mu m and with shapes that can be considered more representative of PSCs on the scale of individual crystals than the commonly assumed spheroids. Specifically. these are irregular and hexagonal crystals. Selection of the optical parameters that are input to the inversion algorithm is based on a potential data set such as that gathered by two of the lidars on board the NASA DC-8 during the Stratospheric Aerosol and Gas Experiment 0 p (SAGE) Ozone Loss Validation experiment (SOLVE) campaign in winter 1999/2000: the Airborne Raman Ozone and Temperature Lidar (AROTEL) and the NASA Langley Differential Absorption Lidar (DIAL). The 0 microphysical retrieval algorithm has been applied to study how particle shape assumptions affect the inversion of lidar data measured in leewave PSCs. The model simulations show that under the assumption of spheroidal particle shapes, PSC surface and volume density are systematically smaller than the FDTD-based values by, respectively, approximately 10-30% and approximately 5-23%.

Reichardt, J.↗

TH-E-17A-01: Internal Respiratory Surrogate for 4D CT Using Fourier Transform and Anatomical Features

Purpose: To develop a novel algorithm to generate internal respiratory signals for sorting of four-dimensional (4D) computed tomography (CT) images. Methods: The proposed algorithm extracted multiple time resolved features as potential respiratory signals. These features were taken from the 4D CT images and its Fourier transformed space. Several low-frequency locations in the Fourier space and selected anatomical features from the images were used as potential respiratory signals. A clustering algorithm was then used to search for the group of appropriate potential respiratory signals. The chosen signals were then normalized and averaged to form the final internal respiratory signal. Performance of the algorithm was tested in 50 4D CT data sets and results were compared with external signals from the real-time position management (RPM) system. Results: In almost all cases, the proposed algorithm generated internal respiratory signals that visibly matched the external respiratory signals from the RPM system. On average, the end inspiration times calculated by the proposed algorithm were within 0.1 s of those given by the RPM system. Less than 3% of the calculated end inspiration times were more than one time frame away from those given by the RPM system. In 3 out of the 50 cases, the proposed algorithm generated internal respiratory signals that were significantly smoother than the RPM signals. In these cases, images sorted using the internal respiratory signals showed fewer artifacts in locations corresponding to the discrepancy in the internal and external respiratory signals. Conclusion: We developed a robust algorithm that generates internal respiratory signals from 4D CT images. In some cases, it even showed the potential to outperform the RPM system. The proposed algorithm is completely automatic and generally takes less than 2 min to process. It can be easily implemented into the clinic and can potentially replace the use of external surrogates.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Mobile transporter path planning

The use of a genetic algorithm (GA) for solving the mobile transporter path planning problem is investigated. The mobile transporter is a traveling robotic vehicle proposed for the space station which must be able to reach any point of the structure autonomously. Elements of the genetic algorithm are explored in both a theoretical and experimental sense. Specifically, double crossover, greedy crossover, and tournament selection techniques are examined. Additionally, the use of local optimization techniques working in concert with the GA are also explored. Recent developments in genetic algorithm theory are shown to be particularly effective in a path planning problem domain, though problem areas can be cited which require more research.

Baffes, Paul↗

DISCOVERY OF A LARGE NUMBER OF CANDIDATE PROTOCLUSTERS TRACED BY ∼15 Mpc-SCALE GALAXY OVERDENSITIES IN COSMOS

To demonstrate the feasibility of studying the epoch of massive galaxy cluster formation in a more systematic manner using current and future galaxy surveys, we report the discovery of a large sample of protocluster candidates in the 1.62 deg{sup 2} COSMOS/UltraVISTA field traced by optical/infrared selected galaxies using photometric redshifts. By comparing properly smoothed three-dimensional galaxy density maps of the observations and a set of matched simulations incorporating the dominant observational effects (galaxy selection and photometric redshift uncertainties), we first confirm that the observed ∼15 comoving Mpc-scale galaxy clustering is consistent with ΛCDM models. Using further the relation between high-z overdensity and the present day cluster mass calibrated in these matched simulations, we found 36 candidate structures at 1.6 < z < 3.1, showing overdensities consistent with the progenitors of M{sub z} {sub =} {sub 0} ∼ 10{sup 15} M {sub ☉} clusters. Taking into account the significant upward scattering of lower mass structures, the probabilities for the candidates to have at least M{sub z=} {sub 0} ∼ 10{sup 14} M {sub ☉} are ∼70%. For each structure, about 15%-40% of photometric galaxy candidates are expected to be true protocluster members that will merge into a cluster-scale halo by z = 0. With solely photometric redshifts, we successfully rediscover two spectroscopically confirmed structures in this field, suggesting that our algorithm is robust. This work generates a large sample of uniformly selected protocluster candidates, providing rich targets for spectroscopic follow-up and subsequent studies of cluster formation. Meanwhile, it demonstrates the potential for probing early cluster formation with upcoming redshift surveys such as the Hobby-Eberly Telescope Dark Energy Experiment and the Subaru Prime Focus Spectrograph survey.

79 ASTRONOMY AND ASTROPHYSICS↗

Coupling fracture facies with in-situ permeability measurements to generate stochastic simulations of tight carbonate aquifer properties: Example from the Lower Cretaceous aquifer, Northern Provence, SE France

The relationships between fracture facies and permeability distribution have been explored using a well-constrained 3D implicit structural model of hemipelagic low porosity/low permeability carbonate from the Northern Provence region, SE France. Fracture and permeability facies were determined using an extensive dataset of 99 hydrogeological wells. Data processing was undertaken using a step-by-step approach, involving: (i) identification of the fracture facies based on well logs detailing structure and stratigraphy; (ii) determination of permeability facies from the a priori correlation between the dimension of the hydraulic radius of influence (deduced from slug test analyses) and the type of reservoir heterogeneity (fissure, fracture, fault zone, etc.); (iii) three dimensional plot of fracture and permeability facies in the geological model using a variographic analysis of data. Thirty-three sequential indicator simulations (SIS) based on geostatistic analyses were realised on both fracture and permeability facies. Finally, a connectivity algorithm was developed to compute the probability of connection between selected infiltration areas and the major aquifer springs via moderate- to high-permeability geological bodies. Key results are: (i) fault zones have a greater role in controlling permeability facies distribution than on fracture facies repartition; (ii) there is little correlation between permeability and fracture facies distributions; (iii) connectivity results highlight the compartmentalisation of aquifers in the Cadarache area, the extensions of permeable geological bodies being limited by the N130 faults.

58 GEOSCIENCES↗

Probabilistic Context Neighborhood model for lattices

Here we present the Probabilistic Context Neighborhood model designed for two-dimensional lattices as a variation of a Markov random field assuming discrete values. In this model, the neighborhood structure has a fixed geometry but a variable order, depending on the neighbors’ values. Our model extends the Probabilistic Context Tree model, originally applicable to one-dimensional space. It retains advantageous properties, such as representing the dependence neighborhood structure as a graph in a tree format, facilitating an understanding of model complexity. Furthermore, we adapt the algorithm used to estimate the Probabilistic Context Tree to estimate the parameters of the proposed model. We illustrate the accuracy of our estimation methodology through simulation studies. Additionally, we apply the Probabilistic Context Neighborhood model to spatial real-world data, showcasing its practical utility.

97 MATHEMATICS AND COMPUTING↗

SANS quantification of bound water in water-soluble polymers across multiple concentration regimes

Contrast-variation small-angle neutron scattering (CV-SANS) is a widely used technique for quantifying hydration water in soft matter systems, but it is predominantly applied in the dilute regime or for systems with a well-defined structure factor. Here, CV-SANS was used to quantify the number of hydration water molecules associating with three water-soluble polymers with different critical solution temperatures and types of water–solute interactions in dilute, semidilute, and concentrated solution through the exploration of novel methods of data fitting and analysis. Multiple SANS fitting workflows with varying levels of model assumptions were evaluated and compared to give insight into SANS model selection. These fitting pathways ranged from general, model-free algorithms to more standard form and structure factor fitting. In addition, Monte Carlo bootstrapping was evaluated as a method to estimate parameter uncertainty through simulation of technical replicates. The most robust fitting workflow for dilute solutions was found to be form factor fitting without CV-SANS ( i.e. polymer in 100% D 2 O). For semidilute and concentrated solutions, while the model-free approach can be mathematically defined for CV-SANS data, the addition of a structure factor imposes physical constraints on the optimization problem, suggesting that the optimal fitting pathway should include appropriate form and structure factor models. The measured hydration numbers were consistent with the number of tightly bound water molecules associated with each monomer unit, and the concentration dependence of the hydration number was largely governed by the chemistry-specific interactions between water and polymer. Polymers with weaker water–polymer interactions ( i.e. those with fewer hydration water molecules) were found to have more bound water at higher concentrations than those with stronger water–polymer interactions due to the increase in the number of forced water–polymer contacts in the concentrated system. This SANS-based method to count hydration water molecules can be applied to polymers in any concentration regime, which will lead to improved understanding of water–polymer interactions and their impact on materials design.

36 MATERIALS SCIENCE↗

Experience with the alpaka performance portability library in the CMS software

ion Library for Parallel Kernel Acceleration) is a header-only C++ library that provides performance portability across different back-ends, abstracting the underlying levels of parallelism. It supports serial and parallel execution on CPUs, and extremely parallel execution on NVIDIA, AMD and Intel GPUs.This contribution will show how alpaka is used in the CMS software to develop and maintain a single code base; to use different toolchains to build the code for each supported back-end, and link them into a single application; to seamlessly select the best backend at runtime, and implement portable reconstruction algorithms that run efficiently on CPUs and GPUs from different vendors. It will describe the validation and deployment of the alpaka-based implementation in the CMS High Level Trigger, and highlight how it achieves near-native performance.

Alawieh, Jaafar [CERN]↗

Targeted evolution of pinning landscapes for large superconducting critical currents

The ability of type II superconductors to carry large amounts of current at high magnetic fields is a key requirement for future design innovations in high-field magnets for accelerators and compact fusion reactors, and largely depends on the vortex pinning landscape comprised of material defects. The complex interaction of vortices with defects that can be grown chemically, e.g., self-assembled nanoparticles and nanorods, or introduced by postsynthesis particle irradiation precludes a priori prediction of the critical current and can result in highly nontrivial effects on the critical current. Here, we borrow concepts from biological evolution to create a vortex pinning genome based on a genetic algorithm, naturally evolving the pinning landscape to accommodate vortex pinning and determine the best possible configuration of inclusions for two different scenarios: a natural evolution process initiating from a pristine system and one starting with preexisting defects to demonstrate the potential for a postprocessing approach to enhance critical currents. Furthermore, the presented approach is even more general and can be adapted to address various other targeted material optimization problems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

CALIBRATION OF LOW-FREQUENCY, WIDE-FIELD RADIO INTERFEROMETERS USING DELAY/DELAY-RATE FILTERING

We present a filtering technique that can be applied to individual baselines of wide-bandwidth, wide-field interferometric data to geometrically select regions on the celestial sphere that contain primary calibration sources. The technique relies on the Fourier transformation of wide-band frequency spectra from a given baseline to obtain one-dimensional 'delay images', and then the transformation of a time-series of delay images to obtain two-dimensional 'delay/delay-rate images'. Source selection is possible in these images given appropriate combinations of baseline, bandwidth, integration time, and source location. Strong and persistent radio frequency interference (RFI) limits the effectiveness of this source selection owing to the removal of data by RFI excision algorithms. A one-dimensional, complex CLEAN algorithm has been developed to compensate for RFI-excision effects. This approach allows CLEANed, source-isolated data to be used to isolate bandpass and primary beam gain functions. These techniques are applied to data from the Precision Array for Probing the Epoch of Reionization as a demonstration of their value in calibrating a new generation of low-frequency radio interferometers with wide relative bandwidths and large fields of view.

79 ASTRONOMY AND ASTROPHYSICS↗

Data-driven selection and spectral classification of white dwarf stars

The next generation of spectroscopic surveys is expected to provide spectra for hundreds of thousands of white dwarf (WD) candidates in the upcoming years. Currently, spectroscopic classification of white dwarfs is mostly done by visual inspection, requiring substantial amounts of expert attention. We propose a data-driven pipeline for fast, automatic selection, and spectroscopic classification of WD candidates, trained using spectroscopically confirmed objects with available Gaia astrometry, photometry, and Sloan Digital Sky Survey (SDSS) spectra with signal-to-noise ratios ≥9. The pipeline selects WD candidates with improved accuracy and completeness over existing algorithms, classifies their primary spectroscopic type with ≥ 90 % accuracy, and spectroscopically detects main sequence companions with similar performance. We apply our pipeline to the Gaia Data Release 3 cross-matched with the SDSS Data Release 17 (DR17), identifying 424 096 high-confidence WD candidates and providing the first catalogue of automated and quantifiable classification for 36 523 WD spectra. Both the catalogue and pipeline are made available online. Such a tool will prove particularly useful for the undergoing SDSS-V survey, allowing for rapid classification of thousands of spectra at every data release.

79 ASTRONOMY AND ASTROPHYSICS↗

Dark Energy Surveyed Year 1 results: calibration of cluster mis-centring in the redMaPPer catalogues

Abstract The centre determination of a galaxy cluster from an optical cluster finding algorithm can be offset from theoretical prescriptions or N-body definitions of its host halo centre. These offsets impact the recovered cluster statistics, affecting both richness measurements and the weak lensing shear profile around the clusters. This paper models the centring performance of the redMaPPer cluster finding algorithm using archival X-ray observations of redMaPPer-selected clusters. Assuming the X-ray emission peaks as the fiducial halo centres, and through analysing their offsets to the redMaPPer centres, we find that ${\sim } 75\pm 8 {{\ \rm per\ cent}}$ of the redMaPPer clusters are well centred and the mis-centred offset follows a Gamma distribution in normalized, projected distance. These mis-centring offsets cause a systematic underestimation of cluster richness relative to the well-centred clusters, for which we propose a descriptive model. Our results enable the DES Y1 cluster cosmology analysis by characterizing the necessary corrections to both the weak lensing and richness abundance functions of the DES Y1 redMaPPer cluster catalogue.

79 ASTRONOMY AND ASTROPHYSICS↗

SU-E-T-618: Dosimetric Comparison of Manual and Beam Angle Optimization of Gantry Angles in IMRT for Cervical Cancer

Purpose: To evaluate the dosimetric characteristics of intensity-modulated radiotherapy (IMRT) treatment plan with beam angle optimization. Methods: Ten post-operation patients with cervical cancer were included in this analysis. Two IMRT plans using seven beams were designed in each patient. A standard coplanar equi-space beam angles were used in the first plan (plan 1), whereas the selection of beam angle was optimized by beam angle optimization algorithm in Varian Eclipse treatment planning system for the same number of beams in the second plan (plan 2). Two plans were designed for each patient with the same dose-volume constraints and prescription dose. All plans were normalized to the mean dose to PTV. The dose distribution in the target, the dose to the organs at risk and total MU were compared. Results: For conformity and homogeneity in PTV, no statistically differences were observed in the two plans. For the mean dose in bladder, plan 2 were significantly lower than plan 1(p<0.05). No statistically significant differences were observed between two plans for the mean doses in rectum, left and right femur heads. Compared with plan1, the average monitor units reduced 16% in plan 2. Conclusion: The IMRT plan based on beam angle optimization for cervical cancer could reduce the dose delivered to bladder and also reduce MU. Therefore there were some dosimetric advantages in the IMRT plan with beam angle optimization for cervical cancer.

60 APPLIED LIFE SCIENCES↗

Path selection process utilizing rapid estimation scheme

The paper describes the use of a rapid estimation scheme for path selection by a roving vehicle. Essentially, the evaluation procedure simulates movement of the rover over each of several corridors lying radially outward from the scanning position. Two levels of corridors are used, and the path selection scheme selects the optimal primary corridor according to a dynamic programming algorithm. In the present version, the length of the corridors is variable. The rapid estimation scheme provides information to define corridor dimensions. This corridor structure, which varies as a function of the terrain, eliminates the need for backtracking, except in certain extreme cases. Computer results are promising in that obstacles were avoided while corridor lengths were kept to a maximum where safety permitted.

Ring, H.↗

Short-interval SMS wind vector determinations for a severe local storms area

Short-interval SMS-2 visible digital image data are used to derive wind vectors from cloud tracking on time-lapsed sequences of geosynchronous satellite images. The cloud tracking areas are located in the Central Plains, where on May 6, 1975 hail-producing thunderstorms occurred ahead of a well defined dry line. Cloud tracking is performed on the Goddard Space Flight Center Atmospheric and Oceanographic Information Processing System. Lower tropospheric cumulus tracers are selected with the assistance of a cloud-top height algorithm. Divergence is derived from the cloud motions using a modified Cressman (1959) objective analysis technique which is designed to organize irregularly spaced wind vectors into uniformly gridded wind fields. The results demonstrate the feasibility of using satellite-derived wind vectors and their associated divergence fields in describing the conditions preceding severe local storm development. For this case, an area of convergence appeared ahead of the dry line and coincided with the developing area of severe weather. The magnitude of the maximum convergence varied between -10 to the -5th and -10 to the -14th per sec. The number of satellite-derived wind vectors which were required to describe conditions of the low-level atmosphere was adequate before numerous cumulonimbus cells formed. This technique is limited in areas of advanced convection.

Peslen, C. A.↗

LANDSAT-4 image data quality analysis

Seven heterogeneous areas within the entire Des Moines, Iowa test site were selected to define candidate spectral training classes using a clustering algorithm. In addition to the 91 cluster nonsupervised classes, three supervised training classes were defined. The original candidate training classes were reduced to 42 spectrally separable training classes. The minimum and average transformed divergence values for the 42 spectral classes and for the best subsets of Y TM spectral bands are shown in a table. The best spectral band for any combination of 1 through 7 bands is the first middle IR band. The next best band is the near IR, followed by the red band and than the thermal IR. The best combination of four bands includes one from each of the four regions of the spectrum (visible, near IR, middle IR, and thermal IR).

Anuta, P. E.↗

LANDSAT-4 image data quality analysis

Seven heterogeneous areas within the Des Moines, Iowa area test site were selected to define candidate spectral training classes using a clustering algorithm. In addition to the 91 cluster (nonsupervised) classes, three supervised training classes were defined and subsequently included in the training statistics file. The identity of all 94 candidate classes were determined using available reference data. Through analysis of the interclass separabilities, the original 94 candidate training classes were reduced to 42 spectrally separable final classes. The minimum average transformed divergence values for the 42 spectral classes and for the best subsets of TM spectral bands are shown in a table.

Anuta, P. E.↗

Efficient spares matrix multiplication scheme for the CYBER 203

This work has been directed toward the development of an efficient algorithm for performing this computation on the CYBER-203. The desire to provide software which gives the user the choice between the often conflicting goals of minimizing central processing (CPU) time or storage requirements has led to a diagonal-based algorithm in which one of three types of storage is selected for each diagonal. For each storage type, an initialization sub-routine estimates the CPU and storage requirements based upon results from previously performed numerical experimentation. These requirements are adjusted by weights provided by the user which reflect the relative importance the user places on the resources. The three storage types employed were chosen to be efficient on the CYBER-203 for diagonals which are sparse, moderately sparse, or dense; however, for many densities, no diagonal type is most efficient with respect to both resource requirements. The user-supplied weights dictate the choice.

Lambiotte, J. J., Jr.↗