Search NASA⌕ Search

SEARCH · Search NASA

Results for “Label Space”

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 55 records · Page 3

Two-dimensional noncommutative atom gas with the Anandan interaction

Landau-like quantization of the Anandan system in a special electromagnetic field is studied. Unlike the cases of the Aharonov-Casher (AC) system and the He-McKellar-Wilkens (HMW) system, the torques of the system on the magnetic dipole and the electric dipole do not vanish. By constructing Heisenberg algebra, the Landau analog levels and eigenstates on commutative space, noncommutative (NC) space, and NC phase space are obtained, respectively. By using the coherent state method, some statistical properties of such free-atom gas are studied and the expressions of some thermodynamic quantities related to revolution direction are obtained. Two particular cases of temperature are discussed and the more simple expressions of the free energy on the three spaces are obtained. We give the relation between the value of {sigma} and revolution direction clearly and find Landau like levels of the Anandan system are invariant and the levels between the AC system and the HMW system are interchanged each other under Maxwell dual transformations on the three spaces. The two sets of eigenstates labeled by {sigma} can be related by a supersymmetry transformation on commutative space, but the phenomenon do not occur on NC situation. We emphasize that some results relevant to Anandan interaction are suitable for the cases of AC interaction and HMW interaction under special conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Supervised pixel classification using a feature space derived from an artificial visual system

Image segmentation involves labelling pixels according to their membership in image regions. This requires the understanding of what a region is. Using supervised pixel classification, the paper investigates how groups of pixels labelled manually according to perceived image semantics map onto the feature space created by an Artificial Visual System. Multiscale structure of regions are investigated and it is shown that pixels form clusters based on their geometric roles in the image intensity function, not by image semantics. A tentative abstract definition of a 'region' is proposed based on this behavior.

Baxter, Lisa C.↗

Discrete phase-space structure of n-qubit mutually unbiased bases

We work out the phase-space structure for a system of n qubits. We replace the field of real numbers that label the axes of the continuous phase space by the finite field GF(2{sup n}) and investigate the geometrical structures compatible with the notion of unbiasedness. These consist of bundles of discrete curves intersecting only at the origin and satisfying certain additional properties. We provide a simple classification of such curves and study in detail the four- and eight-dimensional cases, analyzing also the effect of local transformations. In this way, we provide a comprehensive phase-space approach to the construction of mutually unbiased bases for n qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TPSAS-NF1676L-27431-DND

The Protocol Actions for Astronaut Dose Calculations were developed to provide participating agencies an opportunity to compare results best on their best practices. The results presented here were calculated using the HZETRN space radiation transport code and human response models developed for the On-Line Tool for the Assessment of Radiation in Space (OLTARIS). Two sets of results are presented: - The first set, labelled TARIS 4.0, were calculated using the latest version of the space radiation analysis tools developed for OLTARIS, but not yet incorporated into OLTARIS. - The second set, labelled OLTARIS (TARIS version 3.5), were calculated with the current version of OLTARIS and TIM participants should be able to reproduce these results.

Martha Clowdsley↗

A Semi-Supervised Learning Method for the Identification of Bad Exposures in Large Imaging Surveys

As the data volume of astronomical imaging surveys rapidly increases, traditional methods for image anomaly detection, such as visual inspection by human experts, are becoming impractical. We introduce a machine-learning-based approach to detect poor-quality exposures in large imaging surveys, with a focus on the DECam Legacy Survey (DECaLS) in regions of low extinction (i.e., E ( B − V ) < 0.04 ). Our semi-supervised pipeline integrates a vision transformer (ViT), trained via self-supervised learning (SSL), with a k-Nearest Neighbor (kNN) classifier. We train and validate our pipeline using a small set of labeled exposures observed by surveys with the Dark Energy Camera (DECam). A clustering-space analysis of where our pipeline places images labeled in good and bad categories suggests that our approach can efficiently and accurately determine the quality of exposures. Applied to new imaging being reduced for DECaLS Data Release 11, our pipeline identifies 780 problematic exposures, which we subsequently verify through visual inspection. Being highly efficient and adaptable, our method offers a scalable solution for quality control in other large imaging surveys.

Luo, Yufeng (ORCID:0000000246230683)↗

TH-CD-206-02: BEST IN PHYSICS (IMAGING): 3D Prostate Segmentation in MR Images Using Patch-Based Anatomical Signature

Purpose: MRI has shown promise in identifying prostate tumors with high sensitivity and specificity for the detection of prostate cancer. Accurate segmentation of the prostate plays a key role various tasks: to accurately localize prostate boundaries for biopsy needle placement and radiotherapy, to initialize multi-modal registration algorithms or to obtain the region of interest for computer-aided detection of prostate cancer. However, manual segmentation during biopsy or radiation therapy can be time consuming and subject to inter- and intra-observer variation. This study’s purpose it to develop an automated method to address this technical challenge. Methods: We present an automated multi-atlas segmentation for MR prostate segmentation using patch-based label fusion. After an initial preprocessing for all images, all the atlases are non-rigidly registered to a target image. And then, the resulting transformation is used to propagate the anatomical structure labels of the atlas into the space of the target image. The top L similar atlases are further chosen by measuring intensity and structure difference in the region of interest around prostate. Finally, using voxel weighting based on patch-based anatomical signature, the label that the majority of all warped labels predict for each voxel is used for the final segmentation of the target image. Results: This segmentation technique was validated with a clinical study of 13 patients. The accuracy of our approach was assessed using the manual segmentation (gold standard). The mean volume Dice Overlap Coefficient was 89.5±2.9% between our and manual segmentation, which indicate that the automatic segmentation method works well and could be used for 3D MRI-guided prostate intervention. Conclusion: We have developed a new prostate segmentation approach based on the optimal feature learning label fusion framework, demonstrated its clinical feasibility, and validated its accuracy. This segmentation technique could be a useful tool in image-guided interventions for prostate-cancer diagnosis and treatment.

60 APPLIED LIFE SCIENCES↗

Turbulence driven widening of the near-SOL power width in ASDEX Upgrade H-Mode discharges

Divertor heat flux data from infra red (IR) from various tokamaks in H-Mode regime show that the power width, $\lambda_{q}$, scales approximately like 1.6 $(R/a) ρ_{s,pol}$. However, the IR based scaling comes with the restriction that only discharges were considered with attached divertor conditions. Here we set up a new data base covering low edge density data but also including high density plasmas reaching the H-mode density limit. We use Thomson-scattering to measure the electron temperature decay length which will set the near-SOL power width through parallel heat conduction. We present scaling results for the density, temperature and pressure separatrix fall-off lengths. As the principal result we derive a generalized power width scaling which reads as $\lambda_{q}\propto\,\rho_{s,pol}\cdot(1+2.1\alpha_{t}^{1.7})$ where $\alpha_{t}$ describes a normalized collisionality ($\alpha_{t} = 3\cdot\,10^{-18}\,R\,q^2\,n\,Z_{eff}T^{-2}$). The parameter $\alpha_{t}$ describes the relative importance of the interchange effect on drift-wave turbulence as proposed by Scott and is found to be closely linked to the diamagnetic parameter αd introduced by Rogers, Drake and Zeiler (RDZ). The edge operational space for ASDEX Upgrade displays a boundary qualitatively in agreement with the region labelled as density limit in the edge plasma phase space proposed by RDZ. The data base shows in the limit of low edge densities ($\alpha_{t}\simeq\,0.2$) accurate agreement to the IR based power width scaling. At elevated separatrix densities ($\alpha_{t}\simeq\,1$) the power width is broadened by a factor of up to about three accompanied by a reduction of the $\text{H}_{98,y2}$ confinement factor. Finally, plasmas with higher triangularity show higher values for $\text{H}_{98,y2}$ in the same range of normalized collisionality.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Multi-Class Anomaly Detection in Flight Data using Semi-Supervised Explainable Deep Learning Model

Identifying precursor for safety incidents in aviation data is a crucial task, yet extremely challenging. The main approach, in practice, leverages domain expertise to define expected tolerances in system’s behavior and alarm exceedance from such safety margins. However, this approach is incapable of identifying unknown risk and vulnerabilities. Machine learning has been long studied and deployed to identify precursors for such anomalies, with the great challenge of the need for sufficient labelled set of data to achieve a reliable and accurate performance. In this article, we develop an explainable deep semi-supervised model for anomaly detection in aviation, building upon recent advancements in the machine learning literature. The proposed model combines feature engineering and classification in the feature space, while leveraging all available data (labelled and unlabeled). Validating on two case studies of anomaly detection in take-off and landing phases of commercial aircraft, we show that our model is able to outperform state-of-the-art supervised anomaly detection model and reach significantly high accuracy and low false alarm with minimum amount of available labelled data.

Anomaly Detection↗

Adaptable Constrained Genetic Programming: Extensions and Applications

An evolutionary algorithm applies evolution-based principles to problem solving. To solve a problem, the user defines the space of potential solutions, the representation space. Sample solutions are encoded in a chromosome-like structure. The algorithm maintains a population of such samples, which undergo simulated evolution by means of mutation, crossover, and survival of the fittest principles. Genetic Programming (GP) uses tree-like chromosomes, providing very rich representation suitable for many problems of interest. GP has been successfully applied to a number of practical problems such as learning Boolean functions and designing hardware circuits. To apply GP to a problem, the user needs to define the actual representation space, by defining the atomic functions and terminals labeling the actual trees. The sufficiency principle requires that the label set be sufficient to build the desired solution trees. The closure principle allows the labels to mix in any arity-consistent manner. To satisfy both principles, the user is often forced to provide a large label set, with ad hoc interpretations or penalties to deal with undesired local contexts. This unfortunately enlarges the actual representation space, and thus usually slows down the search. In the past few years, three different methodologies have been proposed to allow the user to alleviate the closure principle by providing means to define, and to process, constraints on mixing the labels in the trees. Last summer we proposed a new methodology to further alleviate the problem by discovering local heuristics for building quality solution trees. A pilot system was implemented last summer and tested throughout the year. This summer we have implemented a new revision, and produced a User's Manual so that the pilot system can be made available to other practitioners and researchers. We have also designed, and partly implemented, a larger system capable of dealing with much more powerful heuristics.

Janikow, Cezary Z.↗

The stellar parameters and elemental abundances from low-resolution spectra – I. 1.2 million giants from LAMOST DR8

As a typical data-driven method, deep learning becomes a natural choice for analysing astronomical data. In this study, we built a deep convolutional neural network (NN) to estimate basic stellar parameters $T\rm {_{eff}}$, log g , metallicity ([M/H] and [Fe/H]) and [α/M] along with nine individual elemental abundances ([C/Fe], [N/Fe], [O/Fe], [Mg/Fe], [Al/Fe], [Si/Fe], [Ca/Fe], [Mn/Fe], and [Ni/Fe]). The NN is trained using common stars between the APOGEE survey and the LAMOST survey. We used low-resolution spectra from LAMOST survey as input, and measurements from APOGEE as labels. For stellar spectra with the signal-to-noise ratio in g band larger than 10 in the test set, the mean absolute error (MAE) is 29 K for $T\rm {_{eff}}$, 0.07 dex for log g , 0.03 dex for both [Fe/H] and [M/H], and 0.02 dex for [α/M]. The MAE of most elements is between 0.02 and 0.04 dex. The trained NN was applied to 1210 145 giants, including sub-giants, from LAMOST DR8 within the range of stellar parameters 3500 K < $T\rm {_{eff}}$ < 5500 K, 0.0 dex < log g < 4.0 dex, −2.5 dex < [Fe/H] < 0.5 dex. The distribution of our results in the chemical spaces is highly consistent with APOGEE labels and stellar parameters show consistency with external high-resolution measurements from GALAH. The results in this study allow us to further studies based on LAMOST data and deepen our understanding of the accretion and evolution history of the Milky Way. The electronic version of the value added catalog is available at http://www.lamost.org/dr8/v1.1/doc/vac.

79 ASTRONOMY AND ASTROPHYSICS↗

Comparative Assessment of U-Net-Based Deep Learning Models for Segmenting Microfractures and Pore Spaces in Digital Rocks

Segmentation of high-resolution X-ray microcomputed tomography (µCT) images is crucial in digital rock physics (DRP), affecting the characterization and analysis of microscale phenomena in the porous media. The complexity of geological structures and nonideal scanning conditions pose significant challenges to conventional image segmentation approaches. Motivated by the recent increasing popularity of deep learning (DL) techniques in image processing, this work undertakes a comparative study of DL models, specifically U-Net and its variants, for segmenting multiple targets with distinguished features in digital rocks, including discrete fracture networks (DFNs), pore spaces, and solid rock. Particularly, DFNs have a smaller volumetric fraction over others, bringing in a substantial challenge of imbalanced segmentation. The primary focus is to evaluate the architecture and feature enhancement strategies of various DL models, including U-Net, attention U-Net, residual U-Net, U-Net++, and residual U-Net++. The models were designed as 2.5D, utilizing a central 2D image and its two adjacent upper and lower 2D images as input to provide a pseudo-3D context. In addition, because the ground truth of segmentation was unknown for real-world digital rocks, we created a benchmark data set following the inverse operations of segmentation. The data synthesis started from the label images (i.e., solid rock, pore spaces, and DFNs), followed by simulating partial volume blurring, adding random background noise, and introducing ring artifacts to mimic real raw X-ray µCT images. The data set, which included various rock types (i.e., sandstone and artificial data), scanning resolution, and magnitudes of noise and artifacts, was divided into training and testing data sets with a 90% and 10% ratio, respectively. Moreover, in addition to the conventional pixel-wise evaluation metrics, the physics-based metric of the lattice-Boltzmann method (LBM) simulated permeability provided more comprehensive assessments. The results demonstrated that the residual connections, nested architectures, and redesigned skip connections contribute to the model performance and give the residual U-Net++ the highest accuracy. The improvements were mainly on the boundaries and small targets, especially the DFNs, which dominate the interconnectivity and therefore affect the permeability greatly. This study also rigorously evaluated the efficiency and generalization of each model, demonstrating that the sophisticated architectures achieved excellent practicability and maintained robust performance on completely unseen data, ensuring their suitability for diverse and challenging DRP applications.

58 GEOSCIENCES↗

Measurement contextuality is implied by macroscopic realism

Ontological theories of quantum mechanics provide a realistic description of single systems by means of well-defined quantities conditioning the measurement outcomes. In order to be complete, they should also fulfill the minimal condition of macroscopic realism. Under the assumption of outcome determinism and for Hilbert space dimension greater than 2, they were all proved to be contextual for projective measurements. In recent years a generalized concept of noncontextuality was introduced that applies also to the case of outcome indeterminism and unsharp measurements. It was pointed out that the Beltrametti-Bugajski model is an example of measurement noncontextual indeterminist theory. Here we provide a simple proof that this model is the only one with such a feature for projective measurements and Hilbert space dimension greater than 2. In other words, there is no extension of quantum theory providing more accurate predictions of outcomes and simultaneously preserving the minimal labeling of events through projective operators. As a corollary, noncontextuality for projective measurements implies noncontextuality for unsharp measurements. By noting that the condition of macroscopic realism requires an extension of quantum theory, unless a breaking of unitarity is invoked, we arrive at the conclusion that the only way to solve the measurement problem in the framework of an ontological theory is by relaxing the hypothesis of measurement noncontextuality in its generalized sense.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Coherent spin-networks

In this paper we discuss a proposal of coherent states for loop quantum gravity. These states are labeled by a point in the phase space of general relativity as captured by a spin-network graph. They are defined as the gauge-invariant projection of a product over links of Hall's heat kernels for the cotangent bundle of SU(2). The labels of the state are written in terms of two unit vectors, a spin and an angle for each link of the graph. The heat-kernel time is chosen to be a function of the spin. These labels are the ones used in the spin-foam setting and admit a clear geometric interpretation. Moreover, the set of labels per link can be written as an element of SL(2,C). These states coincide with Thiemann's coherent states with the area operator as complexifier. We study the properties of semiclassicality of these states and show that, for large spins, they reproduce a superposition over spins of spin-networks with nodes labeled by Livine-Speziale coherent intertwiners. Moreover, the weight associated to spins on links turns out to be given by a Gaussian times a phase as originally proposed by Rovelli.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

PREDICTION OF SOLAR FLARE SIZE AND TIME-TO-FLARE USING SUPPORT VECTOR MACHINE REGRESSION

We study the prediction of solar flare size and time-to-flare using 38 features describing magnetic complexity of the photospheric magnetic field. This work uses support vector regression to formulate a mapping from the 38-dimensional feature space to a continuous-valued label vector representing flare size or time-to-flare. When we consider flaring regions only, we find an average error in estimating flare size of approximately half a geostationary operational environmental satellite (GOES) class. When we additionally consider non-flaring regions, we find an increased average error of approximately three-fourths a GOES class. We also consider thresholding the regressed flare size for the experiment containing both flaring and non-flaring regions and find a true positive rate of 0.69 and a true negative rate of 0.86 for flare prediction. The results for both of these size regression experiments are consistent across a wide range of predictive time windows, indicating that the magnetic complexity features may be persistent in appearance long before flare activity. This is supported by our larger error rates of some 40 hr in the time-to-flare regression problem. The 38 magnetic complexity features considered here appear to have discriminative potential for flare size, but their persistence in time makes them less discriminative for the time-to-flare problem.

79 ASTRONOMY AND ASTROPHYSICS↗

Labels as a feature: Network homophily for systematically annotating human GPCR drug-target interactions

Machine learning has revolutionized drug discovery by enabling the exploration of vast, uncharted chemical spaces essential for discovering novel patentable drugs. Despite the critical role of human G protein-coupled receptors in FDA-approved drugs, exhaustive in-distribution drug-target interaction testing across all pairs of human G protein-coupled receptors and known drugs is rare due to significant economic and technical challenges. This often leaves off-target effects unexplored, which poses a considerable risk to drug safety. In contrast to the traditional focus on out-of-distribution exploration (drug discovery), we introduce a neighborhood-to-prediction model termed Chemical Space Neural Networks that leverages network homophily and training-free graph neural networks with labels as features. We show that Chemical Space Neural Networks’ ability to make accurate predictions strongly correlates with network homophily. Thus, labels as features strongly increase a machine learning model’s capacity to enhance in-distribution prediction accuracy, which we show by integrating labeled data during inference. We validate these advancements in a high-throughput yeast biosensing system (3773 drug-target interactions, 539 compounds, 7 human G protein-coupled receptors) to discover novel drug-target interactions for FDA-approved drugs and to expand the general understanding of how to build reliable predictors to guide experimental verification.

Hansson, Frederik G↗

CoSHA: Code for Stellar Properties Heuristic Assignment—for the MaStar Stellar Library

We introduce CoSHA: a Code for Stellar properties Heuristic Assignment. In order to estimate the stellar properties, CoSHA implements a Gradient Tree Boosting algorithm to label each star across the parameter space (T eff , $\mathrm{log}g$, [Fe/H], and [α/Fe]). We use CoSHA to estimate the stellar atmospheric parameters of 22,000 unique stars in the MaNGA Stellar Library (MaStar). To quantify the reliability of our approach, we run internal tests, using both the Göttingen Stellar Library (a theoretical library) and the first data release of MaStar, and external tests, by comparing the resulting distributions in the parameter space with the APOGEE estimates of the same properties. In summary, our parameter estimates span the ranges T eff = [2900, 12,000] K, $\mathrm{log}g=[-0.5,5.6]$, [Fe/H] = [-3.74, 0.81], and αM = [-0.22, 1.17]. We report internal (external) uncertainties of the properties of ${\sigma }_{{T}_{\mathrm{eff}}}\sim 43(240)$ K, ${\sigma }_{\mathrm{log}g}\sim 0.2(0.4)$, σ [Fe/H] ~ 0.16(0.24), and σ [α/Fe] ~ 0.09(0.08). These uncertainties are comparable to those of other methods with similar objectives. Despite the fact that CoSHA is not aware of the spatial distributions of these physical properties in the Milky Way, we are able to recover the main trends known in the literature. The catalog of physical properties for MaStar can be accessed online.

79 ASTRONOMY AND ASTROPHYSICS↗

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes

A code trellis is a graphical representation of a code, block or convolutional, in which every path represents a codeword (or a code sequence for a convolutional code). This representation makes it possible to implement Maximum Likelihood Decoding (MLD) of a code with reduced decoding complexity. The most well known trellis-based MLD algorithm is the Viterbi algorithm. The trellis representation was first introduced and used for convolutional codes [23]. This representation, together with the Viterbi decoding algorithm, has resulted in a wide range of applications of convolutional codes for error control in digital communications over the last two decades. There are two major reasons for this inactive period of research in this area. First, most coding theorists at that time believed that block codes did not have simple trellis structure like convolutional codes and maximum likelihood decoding of linear block codes using the Viterbi algorithm was practically impossible, except for very short block codes. Second, since almost all of the linear block codes are constructed algebraically or based on finite geometries, it was the belief of many coding theorists that algebraic decoding was the only way to decode these codes. These two reasons seriously hindered the development of efficient soft-decision decoding methods for linear block codes and their applications to error control in digital communications. This led to a general belief that block codes are inferior to convolutional codes and hence, that they were not useful. Chapter 2 gives a brief review of linear block codes. The goal is to provide the essential background material for the development of trellis structure and trellis-based decoding algorithms for linear block codes in the later chapters. Chapters 3 through 6 present the fundamental concepts, finite-state machine model, state space formulation, basic structural properties, state labeling, construction procedures, complexity, minimality, and sectionalization of trellises. Chapter 7 discusses trellis decomposition and subtrellises for low-weight codewords. Chapter 8 first presents well known methods for constructing long powerful codes from short component codes or component codes of smaller dimensions, and then provides methods for constructing their trellises which include Shannon and Cartesian product techniques. Chapter 9 deals with convolutional codes, puncturing, zero-tail termination and tail-biting.Chapters 10 through 13 present various trellis-based decoding algorithms, old and new. Chapter 10 first discusses the application of the well known Viterbi decoding algorithm to linear block codes, optimum sectionalization of a code trellis to minimize computation complexity, and design issues for IC (integrated circuit) implementation of a Viterbi decoder. Then it presents a new decoding algorithm for convolutional codes, named Differential Trellis Decoding (DTD) algorithm. Chapter 12 presents a suboptimum reliability-based iterative decoding algorithm with a low-weight trellis search for the most likely codeword. This decoding algorithm provides a good trade-off between error performance and decoding complexity. All the decoding algorithms presented in Chapters 10 through 12 are devised to minimize word error probability. Chapter 13 presents decoding algorithms that minimize bit error probability and provide the corresponding soft (reliability) information at the output of the decoder. Decoding algorithms presented are the MAP (maximum a posteriori probability) decoding algorithm and the Soft-Output Viterbi Algorithm (SOVA) algorithm. Finally, the minimization of bit error probability in trellis-based MLD is discussed.

Lin, Shu↗

Radiation Effects of Commercial Resistive Random Access Memories

We present results for the single-event effect response of commercial production-level resistive random access memories. We found that the resistive memory arrays are immune to heavy ion-induced upsets. However, the devices were susceptible to single-event functional interrupts, due to upsets from the control circuits. The intrinsic radiation tolerant nature of resistive memory makes the technology an attractive consideration for future space applications.

Random Access Memory (RAM)↗