Search NASA⌕ Search

SEARCH · Search NASA

Results for “permutation”

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 145 records · Page 8

Assembly and comparative genome analysis of a Patagonian Aureobasidium pullulans isolate reveals unexpected intraspecific variation

Aureobasidium pullulans is a yeast-like fungus with remarkable phenotypic plasticity widely studied for its importance for the pharmaceutical and food industries. So far, genomic studies with strains from all over the world suggest they constitute a genetically unstructured population, with no association by habitat. However, the mechanisms by which this genome supports so many phenotypic permutations are still poorly understood. Recent works have shown the importance of sequencing yeast genomes from extreme environments to increase the repertoire of phenotypic diversity of unconventional yeasts. In this study, we present the genomic draft of A. pullulans strain from a Patagonian yeast diversity hotspot, re-evaluate its taxonomic classification based on taxogenomic approaches, and annotate its genome with high-depth transcriptomic data. Here, our analysis suggests this isolate could be considered a novel variant at an early stage of the speciation process. The discovery of divergent strains in a genomically homogeneous group, such as A. pullulans, can be valuable in understanding the evolution of the species. The identification and characterization of new variants will not only allow finding unique traits of biotechnological importance, but also optimize the choice of strains whose phenotypes will be characterized, providing new elements to explore questions about plasticity and adaptation.

59 BASIC BIOLOGICAL SCIENCES↗

Robustness of Deep Learning Classification to Adversarial Input on GPUs: Asynchronous Parallel Accumulation Is a Source of Vulnerability

The ability of machine learning (ML) classification models to resist small, targeted input perturbations—known as adversarial attacks—is a key measure of their safety and reliability. We show that floating-point non associativity (FPNA) coupled with asynchronous parallel programming on GPUs is sufficient to result in misclassification, without any perturbation to the input. Additionally, we show that this misclassification is particularly significant for inputs close to the decision boundary and that standard adversarial robustness results may be overestimated up to 4.6 when not considering machine-level details. We first study a linear classifier, before focusing on standard Graph Neural Network (GNN) architectures and datasets used in robustness assessments. We develop a novel black-box attack using Bayesian optimization to discover external workloads that can change the instruction scheduling which bias the output of reductions on GPUs and reliably lead to misclassification. Motivated by these results, we present a new learnable permutation (LP) gradient-based approach to learning floating-point operation orderings that lead to misclassifications. The LP approach provides a worst-case estimate in a computationally efficient manner, avoiding the need to run identical experiments tens of thousands of times over a potentially large set of possible GPU states or architectures. Finally, using instrumentation-based testing, we investigate parallel reduction ordering across different GPU architectures under external background workloads, when utilizing multi-GPU virtualization, and when applying power capping. Our results demonstrate that parallel reduction ordering varies significantly across architectures under the first two conditions, substantially increasing the search space required to fully test the effects of this parallel scheduler-based vulnerability. These results and the methods developed here can help to include machine-level considerations into adversarial robustness assessments, which can make a difference in safety and mission critical applications.

Shanmugavelu, Sanjif [Maxeler Technologies, a Groq↗

Entanglement versus entwinement in symmetric product orbifolds

We study the entanglement entropy of gauged internal degrees of freedom in a two dimensional symmetric product orbifold CFT, whose configurations consist of N strands sewn together into “long” strings, with wavefunctions symmetrized under permutations. In earlier work a related notion of “entwinement” was introduced. Here we treat this system analogously to a system of N identical particles. From an algebraic point of view, we point out that the reduced density matrix on k out of N particles is not associated with a subalgebra of operators, but rather with a linear subspace, which we explain is sufficient. In the orbifold CFT, we compute the entropy of a single strand in states holographically dual in the D1/D5 system to a conical defect geometry or a massless BTZ black hole and find a result identical to entwinement. We also calculate the entropy of two strands in the state that represents the conical defect; the result differs from entwinement. In this case, matching entwinement would require finding a gauge-invariant way to impose continuity across strands.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Composing effective prediction at five points

Color-kinematics duality in the adjoint has proven key to the relationship between gauge and gravity theory scattering amplitude predictions. In recent work, we demonstrated that at four-point tree-level, a small number of color-dual EFT building blocks could encode all higher-derivative single-trace massless corrections to gauge and gravity theories compatible with adjoint double-copy. One critical aspect was the trivialization of building higher-derivative color-weights — indeed, it is the mixing of kinematics with non-adjoint-type color-weights (like the permutation-invariant d 4 ) which permits description via adjoint double-copy. Here we find that such ideas clarify the predictions of local five-point higher-dimensional operators as well. We demonstrate how a single scalar building block can be combined with color structures to build higher-derivative color factors that generate, through double copy, the amplitudes associated with higher-derivative gauge-theory operators. These may then be suitably mapped, through another double-copy, to higher-derivative corrections in gravity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Is infrared-collinear safe information all you need for jet classification?

Machine learning-based jet classifiers are able to achieve impressive tagging performance in a variety of applications in high-energy and nuclear physics. However, it remains unclear in many cases which aspects of jets give rise to this discriminating power, and whether jet observables that are tractable in perturbative QCD such as those obeying infrared-collinear (IRC) safety serve as sufficient inputs. In this article, we introduce a new classifier, Jet Flow Networks (JFNs), in an effort to address the question of whether IRC unsafe information provides additional discriminating power in jet classification. JFNs are permutation-invariant neural networks (deep sets) that take as input the kinematic information of reconstructed subjets. The subjet radius and a cut on the subjet’s transverse momenta serve as tunable hyperparameters enabling a controllable sensitivity to soft emissions and nonperturbative effects. We demonstrate the performance of JFNs for quark vs. gluon and Z vs. QCD jet tagging. For small subjet radii and transverse momentum cuts, the performance of JFNs is equivalent to the IRC-unsafe Particle Flow Networks (PFNs), demonstrating that infrared-collinear unsafe information is not necessary to achieve strong discrimination for both cases. As the subjet radius is increased, the performance of the JFNs remains essentially unchanged until physical thresholds that we identify are crossed. For relatively large subjet radii, we show that the JFNs may offer an increased model independence with a modest tradeoff in performance compared to classifiers that use the full particle information of the jet. These results shed new light on how machines learn patterns in high-energy physics data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Residual symmetries and scalar multiplet vacuum alignment in non-Abelian flavour models

We demonstrate that, upon minimizing a renormalizable, single-scalar potential invariant under a non-Abelian symmetry, special orientations in the associated vacuum alignment of the scalar multiplet correspond to the preservation of a discrete residual flavour symmetry in the broken phase of the theory. Conversely, we show that these special scalar alignments are perturbed when additional Lagrangian operators (e.g. renormalizable, multi-flavon operators and/or effective, higher-dimensional operators) are present that break said residual symmetry, leading to a vacuum reorientation and phenomenological consequences. We therefore construct a one-to-one correspondence principle between broken residual symmetries and vacuum alignment corrections, providing a mechanism to identify (and correct) a subtle but persistent form of phenomenologically relevant fine-tuning embedded in — but often ignored by — most successful non-Abelian flavour models. We first establish this correspondence in a set of toy models based on the S4 permutation symmetry, and then apply the lessons learned to the more realistic A4 Altarelli-Feruglio and ∆(27) Universal Texture Zero models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Symmetry-enriched quantum spin liquids in (3 + 1)d

We use the intrinsic one-form and two-form global symmetries of (3+1)d bosonic field theories to classify quantum phases enriched by ordinary (0-form) global symmetry. Different symmetry-enriched phases correspond to different ways of coupling the theory to the background gauge field of the ordinary symmetry. The input of the classification is the higher-form symmetries and a permutation action of the 0-form symmetry on the lines and surfaces of the theory. From these data we classify the couplings to the background gauge field by the 0-form symmetry defects constructed from the higher-form symmetry defects. For trivial two-form symmetry the classification coincides with the classification for symmetry fractionalizations in (2 + 1)d. We also provide a systematic method to obtain the symmetry protected topological phases that can be absorbed by the coupling, and we give the relative ’t Hooft anomaly for different couplings. We discuss several examples including the gapless pure U(1) gauge theory and the gapped Abelian finite group gauge theory. As an application, we discover a tension with a conjectured duality in (3 + 1)d for SU(2) gauge theory with two adjoint Weyl fermions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Fitting a deep generative hadronization model

Hadronization is a critical step in the simulation of high-energy particle and nuclear physics experiments. As there is no first principles understanding of this process, physically-inspired hadronization models have a large number of parameters that are fit to data. Deep generative models are a natural replacement for classical techniques, since they are more flexible and may be able to improve the overall precision. Proof of principle studies have shown how to use neural networks to emulate specific hadronization when trained using the inputs and outputs of classical methods. However, these approaches will not work with data, where we do not have a matching between observed hadrons and partons. In this paper, we develop a protocol for fitting a deep generative hadronization model in a realistic setting, where we only have access to a set of hadrons in data. Our approach uses a variation of a Generative Adversarial Network with a permutation invariant discriminator. We find that this setup is able to match the hadronization model in Herwig with multiple sets of parameters. This work represents a significant step forward in a longer term program to develop, train, and integrate machine learning-based hadronization models into parton shower Monte Carlo programs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Next-to-$\mathrm{MHV}$ Yang-Mills kinematic algebra

Kinematic numerators of Yang-Mills scattering amplitudes possess a rich Lie algebraic structure that suggest the existence of a hidden infinite-dimensional kinematic algebra. Explicitly realizing such a kinematic algebra is a longstanding open problem that only has had partial success for simple helicity sectors. In past work, we introduced a framework using tensor currents and fusion rules to generate BCJ numerators of a special subsector of NMHV amplitudes in Yang-Mills theory. Here we enlarge the scope and explicitly realize a kinematic algebra for all NMHV amplitudes. Master numerators are obtained directly from the algebraic rules and through commutators and kinematic Jacobi identities other numerators can be generated. Inspecting the output of the algebra, we conjecture a closed-form expression for the master BCJ numerator up to any multiplicity. We also introduce a new method, based on group algebra of the permutation group, to solve for the generalized gauge freedom of BCJ numerators. It uses the recently introduced binary BCJ relations to provide a complete set of NMHV kinematic numerators that consist of pure gauge.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Target space entanglement in Matrix Models

We study target space entanglement in gauged multi-matrix models as models of entanglement between groups of D-branes separated by a planar entangling surface, paying close attention to the implementation of gauge invariance. We open with a review of target space entanglement between identical particles, which shares some important features (specifically a gauged permutation symmetry) with our main problem. For our matrix models, we implement a gauge fixing well-adapted to the entangling surface. In this gauge, we map the matrix model problem to that of entanglement of a U(1) gauge theory on a complete or all-to-all lattice. Matrix elements corresponding to open strings stretching across the entangling surface in the target space lead to interesting contributions to the entanglement entropy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum chaos in the Brownian SYK model with large finite N: OTOCs and tripartite information

We consider the Brownian SYK model of N interacting Majorana fermions, with random couplings that are taken to vary independently at each time. We study the out-of-time-ordered correlators (OTOCs) of arbitrary observables and the Rényi-2 tripartite information of the unitary evolution operator, which were proposed as diagnostic tools for quantum chaos and scrambling, respectively. We show that their averaged dynamics can be studied as a quench problem at imaginary times in a model of N qudits, where the Hamiltonian displays site-permutational symmetry. By exploiting a description in terms of bosonic collective modes, we show that for the quantities of interest the dynamics takes place in a subspace of the effective Hilbert space whose dimension grows either linearly or quadratically with N, allowing us to perform numerically exact calculations up to N = 10 6 . We analyze in detail the interesting features of the OTOCs, including their dependence on the chosen observables, and of the tripartite information. We observe explicitly the emergence of a scrambling time t* ~ ln N controlling the onset of both chaotic and scrambling behavior, after which we characterize the exponential decay of the quantities of interest to the corresponding Haar scrambled values.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Calculating the Symmetry Number of Flexible Sphere Clusters

We present a theoretical and computational framework to compute the symmetry number of a flexible sphere cluster in R 3 , using a definition of symmetry that arises naturally when calculating the equilibrium probability of a cluster of spheres in the sticky-sphere limit. We define the sticky symmetry group of the cluster as the set of permutations and inversions of the spheres which preserve adjacency and can be realized by continuous deformations of the cluster that do not change the set of contacts or cause particles to overlap. The symmetry number is the size of the sticky symmetry group. We introduce a numerical algorithm to compute the sticky symmetry group and symmetry number, and show it works well on several test cases. Furthermore, we show that once the sticky symmetry group has been calculated for indistinguishable spheres, the symmetry group for partially distinguishable spheres (those with nonidentical interactions) can be efficiently obtained without repeating the laborious parts of the computations. Finally, we use our algorithm to calculate the partition functions of every possible connected cluster of six identical sticky spheres, generating data that may be used to design interactions between spheres so they self-assemble into a desired structure.

97 MATHEMATICS AND COMPUTING↗

Topological Optimization with Big Steps

Using persistent homology to guide optimization has emerged as a novel application of topological data analysis. Existing methods treat persistence calculation as a black box and backpropagate gradients only onto the simplices involved in particular pairs. We show how the cycles and chains used in the persistence calculation can be used to prescribe gradients to larger subsets of the domain. In particular, we show that in a special case, which serves as a building block for general losses, the problem can be solved exactly in linear time. This relies on another contribution of this paper, which eliminates the need to examine a factorial number of permutations of simplices with the same value. Here, we present empirical experiments that show the practical benefits of our algorithm: the number of steps required for the optimization is reduced by an order of magnitude.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Mallat Scattering Transformation based surrogate for Magnetohydrodynamics

Abstract A Machine and Deep Learning (MLDL) methodology is developed and applied to give a high fidelity, fast surrogate for 2D resistive MagnetoHydroDynamic (MHD) simulations of Magnetic Liner Inertial Fusion (MagLIF) implosions. The resistive MHD code is used to generate an ensemble of implosions with different liner aspect ratios, initial gas preheat temperatures (that is, different adiabats), and different liner perturbations. The liner density and magnetic field as functions of x , y , and z were generated. The Mallat Scattering Transformation (MST) is taken of the logarithm of both fields and a Principal Components Analysis (PCA) is done on the logarithm of the MST of both fields. The fields are projected onto the PCA vectors and a small number of these PCA vector components are kept. Singular Value Decompositions of the cross correlation of the input parameters to the output logarithm of the MST of the fields, and of the cross correlation of the SVD vector components to the PCA vector components are done. This allows the identification of the PCA vectors vis-a-vis the input parameters. Finally, a Multi Layer Perceptron (MLP) neural network with ReLU activation and a simple three layer encoder/decoder architecture is trained on this dataset to predict the PCA vector components of the fields as a function of time. Details of the implosion, stagnation, and the disassembly are well captured. Examination of the PCA vectors and a permutation importance analysis of the MLP show definitive evidence of an inverse turbulent cascade into a dipole emergent behavior. The orientation of the dipole is set by the initial liner perturbation. The analysis is repeated with a version of the MST which includes phase, called Wavelet Phase Harmonics (WPH). While WPH do not give the physical insight of the MST, they can and are inverted to give field configurations as a function of time, including field-to-field correlations.

97 MATHEMATICS AND COMPUTING↗

Finite Size Effects in Anisotropic u = ∞ Hubbard Ladder Rings

We apply perturbation theory and cyclic spin permutation formalism to study the lowest energy states of the infinite-repulsion Hubbard model on finite fragments of n-leg ladder rings and show jump-wise behavior of the ground state spin S{sub 0} as a function of fragment parameters.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

On the τ-Compactness of Products of τ -Measurable Operators Adjoint to Semi-Finite Von Neumann Algebras

Let M be the von Neumann algebra of operators in a Hilbert space H and τ be an exact normal semi-finite trace on M. We obtain inequalities for permutations of products of τ-measurable operators. We apply these inequalities to obtain new submajorizations (in the sense of Hardy, Littlewood, and Pólya) of products of τ -measurable operators and a sufficient condition of orthogonality of certain nonnegative τ-measurable operators. We state sufficient conditions of the τ –compactness of products of self-adjoint τ -measurable operators and obtain a criterion of the τ -compactness of the product of a nonnegative τ-measurable operator and an arbitrary τ -measurable operator. We present an example that shows that the nonnegativity of one of the factors is substantial. We also state a criterion of the elementary nature of the product of nonnegative operators from M . All results are new for the *-algebra B(H) of all bounded linear operators in H endowed with the canonical trace τ = tr.

97 MATHEMATICS AND COMPUTING↗

Offshore application of landslide susceptibility mapping using gradient-boosted decision trees: a Gulf of Mexico case study

Abstract Among natural hazards occurring offshore, submarine landslides pose a significant risk to offshore infrastructure installations attached to the seafloor. With the offshore being important for current and future energy production, there is a need to anticipate where future landslide events are likely to occur to support planning and development projects. Using the northern Gulf of Mexico (GoM) as a case study, this paper performs Landslide Susceptibility Mapping (LSM) using a gradient-boosted decision tree (GBDT) model to characterize the spatial patterns of submarine landslide probability over the United States Exclusive Economic Zone (EEZ) where water depths are greater than 120 m. With known spatial extents of historic submarine landslides and a Geographic Information System (GIS) database of known topographical, geomorphological, geological, and geochemical factors, the resulting model was capable of accurately forecasting potential locations of sediment instability. Results of a permutation modelling approach indicated that LSM accuracy is sensitive to the number of unique training locations with model accuracy becoming more stable as the number of training regions was increased. The influence that each input feature had on predicting landslide susceptibility was evaluated using the SHapely Additive exPlanations (SHAP) feature attribution method. Areas of high and very high susceptibility were associated with steep terrain including salt basins and escarpments. This case study serves as an initial assessment of the machine learning (ML) capabilities for producing accurate submarine landslide susceptibility maps given the current state of available natural hazard-related datasets and conveys both successes and limitations.

Dyer, Alec S. (ORCID:0000000219813904)↗

An iris biometric protection scheme using 4D hyperchaotic system and modified equal modulus decomposition in hybrid multi resolution wavelet domain

In this paper, a hybrid iris biometric protection scheme using 4D hyperchaotic system by means of coherent superposition and modified equal modulus decomposition in hybrid multi-resolution wavelet domain is proposed. The 4D hyperchaotic framework is employed for producing the permutation keystream for pixel swap-over mechanism. The hybrid multi-resolution is produced by means of Kronecker product of Walsh transform and fractional Fourier transform of different orders. Fractional orders of the hybrid multiresolution wavelet along with the parameters and initial conditions of the 4D hyperchaotic framework, later fill in as additional keys, thus enhancing the key space of the proposed mechanism. The proposed scheme has nonlinear characteristics and has high robustness against brute-force attack attributable to its enormous key-space. Numerical simulations have been carried out on grayscale images to prove the authenticity and efficacy of the proposed cryptosystem. The functioning of the proposed cryptosystem is investigated against various attacks including special attack. Outcomes display that the proposed iris template protection scheme not only has higher robustness against noise attack but is also unassailable to the iterative transform-based attacks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗