Search NASA⌕ Search

SEARCH · Search NASA

Results for “parameter 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 37 records · Page 2

A Parameter Subset Selection Algorithm for Mixed-Effects Models

Mixed-effects models are commonly used to statistically model phenomena that include attributes associated with a population or general underlying mechanism as well as effects specific to individuals or components of the general mechanism. This can include individual effects associated with data from multiple experiments. However, the parameterizations used to incorporate the population and individual effects are often unidentifiable in the sense that parameters are not uniquely specified by the data. As a result, the current literature focuses on model selection, by which insensitive parameters are fixed or removed from the model. Model selection methods that employ information criteria are applicable to both linear and nonlinear mixed-effects models, but such techniques are limited in that they are computationally prohibitive for large problems due to the number of possible models that must be tested. To limit the scope of possible models for model selection via information criteria, we introduce a parameter subset selection (PSS) algorithm for mixed-effects models, which orders the parameters by their significance. In conclusion, we provide examples to verify the effectiveness of the PSS algorithm and to test the performance of mixed-effects model selection that makes use of parameter subset selection.

97 MATHEMATICS AND COMPUTING↗

An Adaptive Multiparameter Penalty Selection Method for Multiconstraint and Multiblock ADMM

This work presents a new method for online selection of multiple penalty parameters for the alternating direction method of multipliers (ADMM) algorithm applied to optimization problems with multiple constraints or functions with block matrix components. ADMM is widely used for solving constrained optimization problems in a variety of fields, including signal and image processing. Implementations of ADMM often utilize a single hyperparameter, referred to as the penalty parameter, which needs to be tuned to control the rate of convergence. However, in problems with multiple constraints, ADMM may demonstrate slow convergence regardless of penalty parameter selection due to scale differences between constraints. Accounting for scale differences between constraints to improve convergence in these cases requires introducing a penalty parameter for each constraint. The proposed method is able to adaptively account for differences in scale between constraints, providing robustness with respect to problem transformations and initial selection of penalty parameters. It is also simple to understand and implement. Our numerical experiments demonstrate that the proposed method performs favorably compared to a variety of existing penalty parameter selection methods.

97 MATHEMATICS AND COMPUTING↗

Model selection and parameter estimation in tumor growth models using approximate Bayesian computation-ABC

Cancer is one of the most fatal diseases in the world. Governments and researchers from various areas have continuously concentrated efforts to better understand the disease and propose diagnostic and treatment techniques. The use of mathematical models of tumor growth is of great importance for the development of such techniques. Due to the variety of models nowadays available in the literature, the problems of model selection and parameter estimation come into picture, aiming at suitably predicting the patient’s status of the disease. As the available data on dependent variables of existing models might not justify the use of common likelihood functions, approximate Bayesian computation (ABC) becomes a very attractive tool for model selection and model calibration (parameter estimation) in tumor growth models. In the present study, a Monte Carlo approximate Bayesian computation (ABC) algorithm is applied to select among competing models of tumor growth, with and without chemotherapy treatment. Simulated measurements are used in this work. The results obtained show that the algorithm correctly selects the model and estimates the parameters used to generate the simulated measurements.

60 APPLIED LIFE SCIENCES↗

Target-specific optimization of four-dimensional cone beam computed tomography

Purpose: Under-sampling artifacts are a major problem in four-dimensional cone-beam computed tomography (4D-CBCT) and may compromise evaluation of target motion. Several studies have addressed scan parameter selection for minimizing under-sampling artifacts; however, the role of the target characteristics in scan parameter selection has not been investigated. In this work, the authors evaluated 4D-CBCT performance by assessing the accuracy of target motion measurements for various target sizes and motions. The results may serve as patient-specific guidelines for scan parameters selection in 4D-CBCT. Methods: The authors acquired 4D-CBCT scans of a moving phantom consisting of six water-filled sphere targets of sizes 10-37 mm, using various scan times ranging from 30 s to 3 min., setting the motion to 3-s and 6-s periods. The authors used automatic image registration to extract the target motion trajectories and evaluated these measurements for various target sizes and motions over various combinations of scan parameters including scan time, detector configuration, number of respiration phases, and reconstruction filters. Results: The most important object parameter to 4D-CBCT performance was the period of motion. Measurements for the 6-s motion were always systematically less accurate than measurements for the 3-s motion for 34 of 36 objects of various sizes and periods of motion. The 6-s motion required a greater scan time than the 3-s motion for equivalent measurement accuracy. The second most influential parameter was the target size. For the 3-s period of motion, objects larger than 13 mm were tracked with sub-millimeter accuracy with a 1-min scan time. For the 6-s period of motion, objects larger than 22-mm were tracked with sub-millimeter accuracy with a 1.5-min scan time. For all sizes and motions, temporal blurring was observed when the number of phases was fewer than 8. Offset detector configuration provided the same performance as centered detector except for small targets (20 mm.) at short scan times ({<=}1 min). Finally, reconstruction filtering and number of respiratory phases did not affect performance. Conclusions: Scan time should be set according to target size and motion. The authors have provided figures that provide the minimum scan time needed to achieve the particular motion measurement accuracy for a particular size and motion period.

60 APPLIED LIFE SCIENCES↗

Minimal spanning tree algorithm for γ-ray source detection in sparse photon images: cluster parameters and selection strategies

We present that the minimal spanning tree (MST) algorithm is a graph-theoretical cluster-finding method. We previously applied it to γ-ray bidimensional images, showing that it is quite sensitive in finding faint sources. Possible sources are associated with the regions where the photon arrival directions clusterize. MST selects clusters starting from a particular “tree” connecting all the point of the image and performing a cut based on the angular distance between photons, with a number of events higher than a given threshold. In this paper, we show how a further filtering, based on some parameters linked to the cluster properties, can be applied to reduce spurious detections. We find that the most efficient parameter for this secondary selection is the magnitudeM of a cluster, defined as the product of its number of events by its clustering degree. We test the sensitivity of the method by means of simulated and real Fermi-Large Area Telescope (LAT) fields. Our results show that √M is strongly correlated with other statistical significance parameters, derived from a wavelet based algorithm and maximum likelihood (ML) analysis, and that it can be used as a good estimator of statistical significance of MST detections. Finally, we apply the method to a 2-year LAT image at energies higher than 3 GeV, and we show the presence of new clusters, likely associated with BL Lac objects.

79 ASTRONOMY AND ASTROPHYSICS↗

Microsimulation model calibration using incremental mixture approximate Bayesian computation

Microsimulation models (MSMs) are used to inform policy by predicting population-level outcomes under different scenarios. MSMs simulate individual-level event histories that mark the disease process (such as the development of cancer) and the effect of policy actions (such as screening) on these events. MSMs often have many unknown parameters; calibration is the process of searching the parameter space to select parameters that result in accurate MSM prediction of a wide range of targets. We develop Incremental Mixture Approximate Bayesian Computation (IMABC) for MSM calibration which results in a simulated sample from the posterior distribution of model parameters given calibration targets. IMABC begins with a rejection-based ABC step, drawing a sample of points from the prior distribution of model parameters and accepting points that result in simulated targets that are near observed targets. Next, the sample is iteratively updated by drawing additional points from a mixture of multivariate normal distributions and accepting points that result in accurate predictions. Posterior estimates are obtained by weighting the final set of accepted points to account for the adaptive sampling scheme. We demonstrate IMABC by calibrating CRC-SPIN 2.0, an updated version of a MSM for colorectal cancer (CRC) that has been used to inform national CRC screening guidelines.

97 MATHEMATICS AND COMPUTING↗

Metal hydride alloys with improved rate performance

Methods of preparing improved metal hydride alloy materials are provided. The alloys include a mixture of at least four of vanadium, titanium, nickel, chromium, and iron. The alloy is processed by at least one of thermal and physical treatment to generate a refined microstructure exhibiting improved kinetics when used as electrodes in MH batteries (e.g., higher discharge current). The thermal treatment includes rapid cooling of the alloy at greater than 10.sup.4 K/s. The physical treatment includes mechanical pulverization of the alloy after cooling. The microstructure is a single phase (body centered cubic) with a heterogeneous composition including a plurality of primary regions having a lattice parameter selected from the range of 3.02 .ANG. to 3.22 .ANG. and a plurality of secondary regions having a lattice parameter selected from the range of 3.00 .ANG. to 3.22 .ANG. and at least one physical dimension having a maximum average value less than 1 .mu.m.

36 MATERIALS SCIENCE↗

Univariate Prediction of Hammett Parameters and Select Relative Reaction Rates Using Loewdin Atomic Charges

Loewdin charges from density functional theory calculations were used here to obtain general, univariate linear correlations for the prediction of experimental Hammett parameters and relative reaction rates. While previous studies have established that Hirshfeld and CM5 charges perform strongly as univariate predictors, the near-ubiquitous Loewdin charges have not yet been evaluated. To this end, we assess the predictive capability of Loewdin charges for three chemical systems. First, we show that Loewdin charges outperform Hirshfeld and CM5 charges for Hammett parameter prediction. Second, we see that Loewdin charges generally perform comparably to Hirshfeld charges for predicting the relative rates of olefin cleavage by photoexcited nitroarenes. The single case of poor correlation, between relative rates and the Loewdin charges on nitrogen sites, is ameliorated when considering the net charge on the NO 2 group. Third, we show that Loewdin, Hirshfeld, and CM5 charges all perform very well for generating correlations for relative reaction rates for C–H activation of 9-(4-X-phenyl)-9H-fluorene substrates by a transition metal catalyst. The equations generated throughout the study enable the prediction of Hammett parameters and relative reaction rates. Finally, these tools can accelerate synthetic and experimental studies by enabling the in silico prediction of uncharacterized chemical properties.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Enhancing Cluster Identification in Atom Probe Tomography Data Using Transfer Learning

Atom Probe Tomography (APT) is a powerful technique for visualizing the atomic-scale distribution of solutes in materials, but quantitative cluster analysis of APT datasets remains a challenge due to the need for subjective parameter selection in clustering algorithms. While distance-based and density-based methods such as HDBSCAN are widely used, their performance is highly sensitive to user-defined parameters, which undermines reproducibility and accuracy. This study proposes an image-based, deep learning-aided workflow for automating parameter selection and cluster detection in APT data analysis. By projecting 3D APT point clouds onto 2D planes, we leverage pretrained convolutional neural networks (ConvNeXt-Tiny and ResNet-50) through transfer learning to predict the number of clusters present in synthetic datasets. The output is used to guide K-means clustering and estimate HDBSCAN parameters, specifically minimum cluster size and minimum sample points. This approach reduces reliance on manual parameter tuning, improving consistency and scalability. The methodology demonstrates the feasibility of using image-based deep learning for interpreting complex spatial patterns in APT data, enabling faster and more objective analysis. The complete workflow and code are made publicly available to support reproducibility and future research.

Density-based clustering↗

Characterizing How Meteorological Forcing Selection and Parameter Uncertainty Influence Community Land Model Version 5 Hydrological Applications in the United States

Despite the increasing use of large-scale Land Surface Models (LSMs) in predicting hydrological responses in extreme conditions, there's a critical gap in understanding the uncertainties in these predictions. This study addresses this gap through a detailed diagnostic evaluation of the uncertainties arising from meteorological forcing selection and model parametrization in hydrological simulations of the Community Land Model version 5 (CLM5). CLM5 is configured at a spatial scale of about 12-km to simulate runoff processes for 464 headwater watersheds, selected from the Catchment Attributes for Large-Sample Studies (CAMELS) dataset to be representative of physiographic and climatic gradients across the conterminous United States. For each watershed, CLM5 is driven by five commonly used gridded forcing datasets in combination with a large ensemble (> 1200) of key CLM5 hydrologic parameters. Our results suggest that uncertainty in CLM5 runoff simulations resulting from both forcing and parametric sources is markedly higher in arid regions, e.g., Great Plains and Midwest regions. Uncertainty in low flow is dominated by parametric uncertainty, while the selection of meteorological forcing contributes more dominantly to high flow and seasonal flows during fall and spring. Our analysis also demonstrates that the selection of forcing datasets and the metrics used to calibrate CLM5 significantly impact the model’s predictive accuracy in extreme event severity for both floods and droughts. Overall, the results from this study highlight the need to understand and account for forcing and parametric uncertainties in CLM5 simulations, particularly for hazard and risk assessments addressing hydrologic extremes.

54 ENVIRONMENTAL SCIENCES↗

Optimization Through Multi-Fidelity Modeling

We present a novel method for optimizing parameter selection for simulations with an evaluation budget. We start with an existing method for building a multi-fidelity model out of many low-fidelity simulations and few high-fidelity simulations. We propose a novel method to simplify parameter selection without sacrificing performance. We verify these results and compare with existing literature. Next, we propose a novel algorithm which uses this difference model to suggest new points in the parameter design space to simulate. We add each point we simulate to the model to improve its quality for the next iteration. The algorithm trades off reducing the uncertainty of the existing model with optimization of the objective. The first is more useful when a large fraction of the computation budget remains. The second is more useful when a small fraction of the computation budget remains. Our method converges to the optimum by using a high-fidelity evaluation for just 16 of the 427 points. Our method is general enough to work if there is no low-fidelity model. Furthermore, it is agnostic to the underlying physics of the problem. Therefore, both the low-fidelity and high-fidelity models can be generated by any arbitrary function, including simulations and physical experiments.

97 MATHEMATICS AND COMPUTING↗

Data depth based clustering analysis

Here, this paper proposes a new algorithm for identifying patterns within data, based on data depth. Such a clustering analysis has an enormous potential to discover previously unknown insights from existing data sets. Many clustering algorithms already exist for this purpose. However, most algorithms are not affine invariant. Therefore, they must operate with different parameters after the data sets are rotated, scaled, or translated. Further, most clustering algorithms, based on Euclidean distance, can be sensitive to noises because they have no global perspective. Parameter selection also significantly affects the clustering results of each algorithm. Unlike many existing clustering algorithms, the proposed algorithm, called data depth based clustering analysis (DBCA), is able to detect coherent clusters after the data sets are affine transformed without changing a parameter. It is also robust to noises because using data depth can measure centrality and outlyingness of the underlying data. Further, it can generate relatively stable clusters by varying the parameter. The experimental comparison with the leading state-of-the-art alternatives demonstrates that the proposed algorithm outperforms DBSCAN and HDBSCAN in terms of affine invariance, and exceeds or matches the ro-bustness to noises of DBSCAN or HDBSCAN. The robust-ness to parameter selection is also demonstrated through the case study of clustering twitter data.

58 GEOSCIENCES↗