Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized algorithm”

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,045 records · Page 58

Ascent guidance algorithm using lidar wind measurements

The formulation of a general nonlinear programming guidance algorithm that incorporates wind measurements in the computation of ascent guidance steering commands is discussed. A nonlinear programming (NLP) algorithm that is designed to solve a very general problem has the potential to address the diversity demanded by future launch systems. Using B-splines for the command functional form allows the NLP algorithm to adjust the shape of the command profile to achieve optimal performance. The algorithm flexibility is demonstrated by simulation of ascent with dynamic loading constraints through a set of random wind profiles with and without wind sensing capability.

Cramer, Evin J.↗

Using a Genetic Algorithm to Model Broadband Regional Waveforms for Crustal Structure in the Western United States

In this study, we analyze regional seismograms to obtain the crustal structure in the eastern Great Basin and western Colorado plateau. Adopting a for- ward-modeling approach, we develop a genetic algorithm (GA) based parameter search technique to constrain the one-dimensional crustal structure in these regions. The data are broadband three-component seismograms recorded at the 1994-95 IRIS PASSCAL Colorado Plateau to Great Basin experiment (CPGB) stations and supplemented by data from U.S. National Seismic Network (USNSN) stations in Utah and Nevada. We use the southwestern Wyoming mine collapse event (M(sub b) = 5.2) that occurred on 3 February 1995 as the seismic source. We model the regional seismograms using a four-layer crustal model with constant layer parameters. Timing of teleseismic receiver functions at CPGB stations are added as an additional constraint in the modeling. GA allows us to efficiently search the model space. A carefully chosen fitness function and a windowing scheme are added to the algorithm to prevent search stagnation. The technique is tested with synthetic data, both with and without random Gaussian noise added to it. Several separate model searches are carried out to estimate the variability of the model parameters. The average Colorado plateau crustal structure is characterized by a 40-km-thick crust with velocity increases at depths of about 10 and 25 km and a fast lower crust while the Great Basin has approximately 35- km-thick crust and a 2.9-km-thick sedimentary layer.

Bhattacharyya, Joydeep↗

Chest wall mechanics in sustained microgravity

We assessed the effects of sustained weightlessness on chest wall mechanics in five astronauts who were studied before, during, and after the 10-day Spacelab D-2 mission (n = 3) and the 180-day Euromir-95 mission (n = 2). We measured flow and pressure at the mouth and rib cage and abdominal volumes during resting breathing and during a relaxation maneuver from midinspiratory capacity to functional residual capacity. Microgravity produced marked and consistent changes (Delta) in the contribution of the abdomen to tidal volume [DeltaVab/(DeltaVab + DeltaVrc), where Vab is abdominal volume and Vrc is rib cage volume], which increased from 30.7 +/- 3. 5 (SE)% at 1 G head-to-foot acceleration to 58.3 +/- 5.7% at 0 G head-to-foot acceleration (P < 0.005). Values of DeltaVab/(DeltaVab + DeltaVrc) did not change significantly during the 180 days of the Euromir mission, but in the two subjects DeltaVab/(DeltaVab + DeltaVrc) was greater on postflight day 1 than on subsequent postflight days or preflight. In the two subjects who produced satisfactory relaxation maneuvers, the slope of the Konno-Mead plot decreased in microgravity; this decrease was entirely accounted for by an increase in abdominal compliance because rib cage compliance did not change. These alterations are similar to those previously reported during short periods of weightlessness inside aircrafts flying parabolic trajectories. They are also qualitatively similar to those observed on going from upright to supine posture; however, in contrast to microgravity, such postural change reduces rib cage compliance.

manned↗

Autonomous Information Unit for Fine-Grain Data Access Control and Information Protection in a Net-Centric System

As communication and networking technologies advance, networks will become highly complex and heterogeneous, interconnecting different network domains. There is a need to provide user authentication and data protection in order to further facilitate critical mission operations, especially in the tactical and mission-critical net-centric networking environment. The Autonomous Information Unit (AIU) technology was designed to provide the fine-grain data access and user control in a net-centric system-testing environment to meet these objectives. The AIU is a fundamental capability designed to enable fine-grain data access and user control in the cross-domain networking environments, where an AIU is composed of the mission data, metadata, and policy. An AIU provides a mechanism to establish trust among deployed AIUs based on recombining shared secrets, authentication and verify users with a username, X.509 certificate, enclave information, and classification level. AIU achieves data protection through (1) splitting data into multiple information pieces using the Shamir's secret sharing algorithm, (2) encrypting each individual information piece using military-grade AES-256 encryption, and (3) randomizing the position of the encrypted data based on the unbiased and memory efficient in-place Fisher-Yates shuffle method. Therefore, it becomes virtually impossible for attackers to compromise data since attackers need to obtain all distributed information as well as the encryption key and the random seeds to properly arrange the data. In addition, since policy can be associated with data in the AIU, different user access and data control strategies can be included. The AIU technology can greatly enhance information assurance and security management in the bandwidth-limited and ad hoc net-centric environments. In addition, AIU technology can be applicable to general complex network domains and applications where distributed user authentication and data protection are necessary. AIU achieves fine-grain data access and user control, reducing the security risk significantly, simplifying the complexity of various security operations, and providing the high information assurance across different network domains.

Chow, Edward T.↗

Dynamical Decoupling for Measuring and Suppressing Crosstalk

Dynamical decoupling (DD) is a noise-mitigating strategy in which sequences of pulses are applied to single qubits to average out their interaction with the environment. DD has been extensively studied and demonstrated for suppressing single-qubit decoherence and can be tailored for different noise spectrum. We report another important adaptation of DD where crosstalk between qubits are suppressed. We demonstrate the efficiency of this procedure on quantum circuits on superconducting transmon-based quantum devices. We designed a family of syncopated DD sequences that effectively suppress ZZ coupling between qubit pairs, which is the dominating crosstalk form on the device. We insert DD to a quantum circuit whenever single qubits are idle (often during two-qubits gates on other qubits). While standard periodic DD suppress crosstalk between these qubits and their neighbors, the syncopated DD further decouples crosstalk between these qubits. We further designed short sequences that maximize the application of DD without adding time to the quantum circuit execution. Such DD sequences yield significant improvement of the performance of the algorithm on the hardware. The performance is further boosted by combining DD with another mitigation strategy, randomized compilation. Our work demonstrated that syncopated DD is effective and practical way to suppress crosstalk in quantum circuits and serves as a great probe to characterize the crosstalk and inform hardware design.

Quantum Computing↗

CRACK MODELLING FOR RADIOGRAPHY

In this paper, possibility of creation of three-dimensional crack models, both random type and based on real-life radiographic images is discussed. Method for storing cracks in a number of two-dimensional matrices, as well algorithm for their reconstruction into three-dimensional objects is presented. Also the possibility of using iterative algorithm for matching simulated images of cracks to real-life radiographic images is discussed.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A Novel Local Learning based Approach With Application to Breast Cancer Diagnosis

The purpose of this study is to develop and evaluate a novel local learning-based approach for computer-assisted diagnosis of breast cancer. Our new local learning based algorithm using the linear logistic regression method as its base learner is described. Overall, our algorithm will perform its stochastic searching process until the total allowed computing time is used up by our random walk process in identifying the most suitable population subdivision scheme and their corresponding individual base learners. The proposed local learning-based approach was applied for the prediction of breast cancer given 11 mammographic and clinical findings reported by physicians using the BI-RADS lexicon. Our database consisted of 850 patients with biopsy confirmed diagnosis (290 malignant and 560 benign). We also compared the performance of our method with a collection of publicly available state-of-the-art machine learning methods. Predictive performance for all classifiers was evaluated using 10-fold cross validation and Receiver Operating Characteristics (ROC) analysis. Figure 1 reports the performance of 54 machine learning methods implemented in the machine learning toolkit Weka (version 3.0). We introduced a novel local learning-based classifier and compared it with an extensive list of other classifiers for the problem of breast cancer diagnosis. Our experiments show that the algorithm superior prediction performance outperforming a wide range of other well established machine learning techniques. Our conclusion complements the existing understanding in the machine learning field that local learning may capture complicated, non-linear relationships exhibited by real-world datasets.

59 BASIC BIOLOGICAL SCIENCES↗

Prostate brachytherapy postimplant dosimetry: Automatic plan reconstruction of stranded implants

Purpose: Plan reconstruction for permanent implant prostate brachytherapy is the process of determining the correspondence between planned and implanted seeds in postimplant analysis. Plan reconstruction informs many areas of brachytherapy quality assurance, including the verification of seed segmentation, misplacement and migration assessment, implant simulations, and the dosimetry of mixed-activity or mixed-species implants. Methods: An algorithm has been developed for stranded implants which uses the interseed spacing constraints imposed by the suture to improve the accuracy of reconstruction. Seventy randomly selected clinical cases with a mean of 23.6 (range 18-30) needles and mean density of 2.0 (range 1.6-2.6) 2.0 (range 1.6-2.6) seeds/cm{sup 3} were automatically reconstructed and the accuracy compared to manual reconstructions performed using a custom 3D graphical interface. Results: Using the automatic algorithm, the mean accuracy of the assignment relative to manual reconstruction was found to be 97.7{+-}0.5%. Fifty-two of the 70 cases (74%) were error-free; of seeds in the remaining cases, 96.7{+-}0.3% were found to be attributed to the correct strand and 97.0{+-}0.3% were correctly connected to their neighbors. Any necessary manual correction using the interface is usually straightforward. For the clinical data set tested, neither the number of seeds or needles, average density, nor the presence of clusters was found to have an effect on reconstruction accuracy using this method. Conclusions: Routine plan reconstruction of stranded implants can be performed with a high degree of accuracy to support postimplant dosimetry and quality analyses.

60 APPLIED LIFE SCIENCES↗

Machine Learning Correlation of Electron Micrographs and ToF-SIMS for the Analysis of Organic Biomarkers in Mudstone

The spatial distribution of organics in geological samples can be used to determine when and how these organics were incorporated into the host rock. Mass spectrometry (MS) imaging can rapidly collect a large amount of data, but ions produced are mixed without discrimination, resulting in complex mass spectra that can be difficult to interpret. Here, we apply unsupervised and supervised machine learning (ML) to help interpret spectra from time-of-flight-secondary ion mass spectrometry (ToF-SIMS) of an organic-carbon-rich mudstone of the Middle Jurassic of England (UK). It was previously shown that the presence of sterane molecular biomarkers in this sample can be detected via ToF-SIMS (Pasterski, M. J. et al., Astrobiology 2023, 23, 936). We use unsupervised ML on scanning electron microscopy–electron dispersive spectroscopy (SEM-EDS) measurements to define compositional categories based on differences in elemental abundances. We then test the ability of four ML algorithms─k-nearest neighbors (KNN), recursive partitioning and regressive trees (RPART), eXtreme gradient boost (XGBoost), and random forest (RF)─to classify the ToF-SIM spectra using (1) the categories assigned via SEM-EDS, (2) organic and inorganic labels assigned via SEM-EDS, and (3) the presence or absence of detectable steranes in ToF-SIMS spectra. In terms of predictive accuracy and balanced accuracy, KNN was the best performing model and RPART the worst. The feature importance, or the specific features of the ToF-SIM spectra used by the models to make classifications, cannot be determined for KNN, preventing posthoc model interpretation. Nevertheless, the feature importance extracted from the other models was useful for interpreting spectra. In conclusion, we determined that some of the organic ions used to classify biomarker containing spectra may be fragment ions derived from kerogen which is abundant in this mudstone sample.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Evaluating the Interplay between Trajectory Segmentation and Mode Inference Error

Travel behavior changes are essential to transportation decarbonization. Travel diaries, consisting of sequences of trips between places, are typically used to instrument human travel behavior. However, these diaries are only as accurate as the underlying methods used to construct them. Travel diary algorithms have been a popular research topic since the advent of Global Positioning System tracking surveys. These algorithms have typically been validated using prompted recall of presegmented trips, thus disregarding the continuity of mode inference. Phone operating systems have adopted battery-conserving techniques, but the resulting data collection errors have not been studied extensively. We introduce a framework to evaluate the accuracy of trip length computations and mode inference by analyzing continuous mode-segmented trajectories for groups of trips. We then use the framework to identify the input data quality and the impact of postprocessing. Our primary inputs to this evaluation are MobilityNet, a public dataset containing information from three artificial timelines covering 15 different travel modes, and sample open-source travel diary creation algorithms from the OpenPATH project. Our framework concretely shows that the variance of the distance error drops from (0.217, 0.0848) to (o.011, 0.0407) (Android, iOS) after postprocessing. Similarly, the weighted F-scores for mode inference increase from (0.25, 0.29) to (0.60, 0.74) (iOS, Android) between random forest and geographic information system-based models. We hope that this standardized method will be adapted to evaluate other, potentially proprietary, travel diary algorithms. Finally, the results can be used to understand and improve the state of the art in the travel diary creation field.

33 ADVANCED PROPULSION SYSTEMS↗

On the synchronizability and detectability of random PPM sequences

The problem of synchronization and detection of random pulse-position-modulation (PPM) sequences is investigated under the assumption of perfect slot synchronization. Maximum likelihood PPM symbol synchronization and receiver algorithms are derived that make decisions based both on soft as well as hard data; these algorithms are seen to be easily implementable. Bounds were derived on the symbol error probability as well as the probability of false synchronization that indicate the existence of a rather severe performance floor, which can easily be the limiting factor in the overall system performance. The performance floor is inherent in the PPM format and random data and becomes more serious as the PPM alphabet size Q is increased. A way to eliminate the performance floor is suggested by inserting special PPM symbols in the random data stream.

Georghiades, Costas N.↗

Controlled Nonlinear Stochastic Delay Equations: Part II: Approximations and Pipe-Flow Representations

This is the second part of a work dealing with key issues that have not been addressed in the modeling and numerical optimization of nonlinear stochastic delay systems. We consider new classes of models, such as those with nonlinear functions of several controls (such as products), each with is own delay, controlled random Poisson measure driving terms, admissions control with delayed retrials, and others. Part I was concerned with issues concerning the class of admissible controls and their approximations, since the classical definitions are inadequate for our models. This part is concerned with transportation equation representations and their approximations. Such representations of nonlinear stochastic delay models have been crucial in the development of numerical algorithms with much reduced memory and computational requirements. The representations for the new models are not obvious and are developed. They also provide a template for the adaptation of the Markov chain approximation numerical methods.

97 MATHEMATICS AND COMPUTING↗

Conservative tightly-coupled simulations of stochastic multiscale systems

Multiphysics problems often involve components whose macroscopic dynamics is driven by microscopic random fluctuations. The fidelity of simulations of such systems depends on their ability to propagate these random fluctuations throughout a computational domain, including subdomains represented by deterministic solvers. When the constituent processes take place in nonoverlapping subdomains, system behavior can be modeled via a domain-decomposition approach that couples separate components at the interfaces between these subdomains. Its coupling algorithm has to maintain a stable and efficient numerical time integration even at high noise strength. We propose a conservative domain-decomposition algorithm in which tight coupling is achieved by employing either Picard's or Newton's iterative method. Coupled diffusion equations, one of which has a Gaussian white-noise source term, provide a computational testbed for analysis of these two coupling strategies. Fully-converged (“implicit”) coupling with Newton's method typically outperforms its Picard counterpart, especially at high noise levels. This is because the number of Newton iterations scales linearly with the amplitude of the Gaussian noise, while the number of Picard iterations can scale superlinearly. At large time intervals between two subsequent inter-solver communications, the solution error for single-iteration (“explicit”) Picard's coupling can be several orders of magnitude higher than that for implicit coupling. Increasing the explicit coupling's communication frequency reduces this difference, but the resulting increase in computational cost can make it less efficient than implicit coupling at similar levels of solution error, depending on the communication frequency of the latter and the noise strength. This trend carries over into higher dimensions, although at high noise strength explicit coupling may be the only computationally viable option.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A High Performance Computing Approach to Tree Cover Delineation in 1-m NAIP Imagery Using a Probabilistic Learning Framework

Tree cover delineation is a useful instrument in deriving Above Ground Biomass (AGB) density estimates from Very High Resolution (VHR) airborne imagery data. Numerous algorithms have been designed to address this problem, but most of them do not scale to these datasets, which are of the order of terabytes. In this paper, we present a semi-automated probabilistic framework for the segmentation and classification of 1-m National Agriculture Imagery Program (NAIP) for tree-cover delineation for the whole of Continental United States, using a High Performance Computing Architecture. Classification is performed using a multi-layer Feedforward Backpropagation Neural Network and segmentation is performed using a Statistical Region Merging algorithm. The results from the classification and segmentation algorithms are then consolidated into a structured prediction framework using a discriminative undirected probabilistic graphical model based on Conditional Random Field, which helps in capturing the higher order contextual dependencies between neighboring pixels. Once the final probability maps are generated, the framework is updated and re-trained by relabeling misclassified image patches. This leads to a significant improvement in the true positive rates and reduction in false positive rates. The tree cover maps were generated for the whole state of California, spanning a total of 11,095 NAIP tiles covering a total geographical area of 163,696 sq. miles. The framework produced true positive rates of around 88% for fragmented forests and 74% for urban tree cover areas, with false positive rates lower than 2% for both landscapes. Comparative studies with the National Land Cover Data (NLCD) algorithm and the LiDAR canopy height model (CHM) showed the effectiveness of our framework for generating accurate high-resolution tree-cover maps.

Segments↗

Chaos as the cause of randomness in tearing mode onset times in DIII-D ITER baseline scenario plasmas

The first evidence of widespread chaotic plasma dynamics relevant to the onset of disruptive tearing modes is found in DIII-D tokamak discharges. This evidence is obtained by calculating positive maximal Lyapunov exponents from Mirnov signals using the Rosenstein algorithm, implying the chaotic growth and/or rotation of magnetohydrodynamic modes in DIII-D [Luxon, Nucl. Fusion 42, 614 (2002)] plasmas. Such chaotic dynamics offer an explanation for the random tearing mode onset times previously observed in ITER baseline scenario discharges. Further, the Lyapunov timescales associated with this chaos could inhibit reliable prediction of tearing mode onset beyond the angular momentum confinement timescale; this constraint should inform the design of plasma control systems on ITER.

Chaotic dynamics↗

Passive neutron coincidence counting with plastic scintillators for the characterization of radioactive waste drums

The quantification of radioactive material is essential in the fields of safeguards, criticality control of nuclear processes, dismantling of nuclear facilities and components, or radioactive waste characterization. The Nuclear Measurement Laboratory (LMN) of CEA is involved in the development of time-correlated neutron detection techniques using plastic scintillators. Usually, 3He proportional counters are used for passive neutron coincidence counting owing to their high thermal neutron capture efficiency and gamma insensitivity. However, the global {sup 3}He shortage in the past few years has made these detectors extremely expensive. In addition, contrary to {sup 3}He counters for which a few tens of microseconds are needed to thermalize fast neutrons, in view to maximize the {sup 3}He(n,p){sup 3}H capture cross section, plastic scintillators are based on elastic scattering and therefore the light signal is formed within a few nanoseconds, correlated pulses being detected within a few dozen- or hundred nanoseconds. This time span reflects fission particles time of flight, which allows reducing accordingly the duration of the coincidence gate and thus the rate of random coincidences, which may totally blind fission coincidences when using {sup 3}He counters in case of a high (α,n) reaction rate. However, plastic scintillators are very sensitive to gamma rays, requiring the use of a thick metallic shield to reduce the corresponding background. Cross talk between detectors is also a major issue, which consists on the detection of one particle by several detectors due to elastic or inelastic scattering, leading to true but undesired coincidences. Data analysis algorithms are tested to minimize cross-talk in simultaneously activated detectors. The distinction between useful fission coincidences and the correlated background due to cross-talk, (α,n) and induced (n,2n) or (n,n'γ) reactions, is achieved by measuring 3-fold coincidences. The performances of a passive neutron coincidence counting system for radioactive waste drums using plastic scintillators have been studied using the Monte Carlo radiation transport code MCNPX-PoliMi v2.0 coupled to data processing algorithms developed with ROOT data analysis software. In addition to the correlated background, accidental coincidences are taken into account in the simulation by randomly merging pulses from different calculations with fission and (α,n) sources. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods

A framework is proposed for solving general convex quadratic programs (CQPs) from an infeasible starting point by invoking an existing feasible-start algorithm tailored for inequality-constrained CQPs. The central tool is an exact penalty function scheme equipped with a penalty-parameter updating rule. The feasible-start algorithm merely has to satisfy certain general requirements, and so is the updating rule. Under mild assumptions, the framework is proved to converge on CQPs with both inequality and equality constraints and, at a negligible additional cost per iteration, produces an infeasibility certificate, together with a feasible point for an (approximately) ℓ 1 -least relaxed feasible problem, when the given problem does not have a feasible solution. The framework is applied to a feasible-start constraint-reduced interior-point algorithm previously proved to be highly performant on problems with many more inequality constraints than variables (“imbalanced”). Numerical comparison with popular codes (OSQP, qpOASES, MOSEK) is reported on both randomly generated problems and support-vector machine classifier training problems. The results show that the former typically outperforms the latter on imbalanced problems. Finally, application of the proposed infeasible-start framework to other feasible-start algorithms is briefly considered, and is tested on a simplex iteration.

97 MATHEMATICS AND COMPUTING↗

Time Series, Stochastic Processes and Completeness of Quantum Theory

Most of physical experiments are usually described as repeated measurements of some random variables. Experimental data registered by on-line computers form time series of outcomes. The frequencies of different outcomes are compared with the probabilities provided by the algorithms of quantum theory (QT). In spite of statistical predictions of QT a claim was made that it provided the most complete description of the data and of the underlying physical phenomena. This claim could be easily rejected if some fine structures, averaged out in the standard descriptive statistical analysis, were found in time series of experimental data. To search for these structures one has to use more subtle statistical tools which were developed to study time series produced by various stochastic processes. In this talk we review some of these tools. As an example we show how the standard descriptive statistical analysis of the data is unable to reveal a fine structure in a simulated sample of AR (2) stochastic process. We emphasize once again that the violation of Bell inequalities gives no information on the completeness or the non locality of QT. The appropriate way to test the completeness of quantum theory is to search for fine structures in time series of the experimental data by means of the purity tests or by studying the autocorrelation and partial autocorrelation functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗