Search NASA⌕ Search

SEARCH · Search NASA

Results for “mathematical regularization”

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

Geometric quadratic stochastic operator on countable infinite set

In this paper we construct the family of Geometric quadratic stochastic operators defined on the countable sample space of nonnegative integers and investigate their trajectory behavior. Such operators can be reinterpreted in terms of of evolutionary operator of free population. We show that Geometric quadratic stochastic operators are regular transformations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Boundary regularity of Nevanlinna domains and univalent functions in model subspaces

In the paper we study boundary regularity of Nevanlinna domains, which have appeared in problems of uniform approximation by polyanalytic polynomials. A new method for constructing Nevanlinna domains with essentially irregular nonanalytic boundaries is suggested; this method is based on finding appropriate univalent functions in model subspaces, that is, in subspaces of the form K{sub {Theta}=}H{sup 2} ominus {Theta}H{sup 2}, where {Theta} is an inner function. To describe the irregularity of the boundaries of the domains obtained, recent results by Dolzhenko about boundary regularity of conformal mappings are used. Bibliography: 18 titles.

97 MATHEMATICS AND COMPUTING↗

A “loop” shape descriptor and its application to automated segmentation of airways from CT scans

Purpose: A novel shape descriptor is presented to aid an automated identification of the airways depicted on computed tomography (CT) images. Methods: Instead of simplifying the tubular characteristic of the airways as an ideal mathematical cylindrical or circular shape, the proposed “loop” shape descriptor exploits the fact that the cross sections of any tubular structure (regardless of its regularity) always appear as a loop. In implementation, the authors first reconstruct the anatomical structures in volumetric CT as a three-dimensional surface model using the classical marching cubes algorithm. Then, the loop descriptor is applied to locate the airways with a concave loop cross section. To deal with the variation of the airway walls in density as depicted on CT images, a multiple threshold strategy is proposed. A publicly available chest CT database consisting of 20 CT scans, which was designed specifically for evaluating an airway segmentation algorithm, was used for quantitative performance assessment. Measures, including length, branch count, and generations, were computed under the aid of a skeletonization operation. Results: For the test dataset, the airway length ranged from 64.6 to 429.8 cm, the generation ranged from 7 to 11, and the branch number ranged from 48 to 312. These results were comparable to the performance of the state-of-the-art algorithms validated on the same dataset. Conclusions: The authors’ quantitative experiment demonstrated the feasibility and reliability of the developed shape descriptor in identifying lung airways.

60 APPLIED LIFE SCIENCES↗

ManiNetCluster: a novel manifold learning approach to reveal the functional links between gene networks

BACKGROUND:The coordination of genomic functions is a critical and complex process across biological systems such as phenotypes or states (e.g., time, disease, organism, environmental perturbation). Understanding how the complexity of genomic function relates to these states remains a challenge. To address this, we have developed a novel computational method, ManiNetCluster, which simultaneously aligns and clusters gene networks (e.g., co-expression) to systematically reveal the links of genomic function between different conditions. Specifically, ManiNetCluster employs manifold learning to uncover and match local and non-linear structures among networks, and identifies cross-network functional links. RESULTS:We demonstrated that ManiNetCluster better aligns the orthologous genes from their developmental expression profiles across model organisms than state-of-the-art methods (p-value <2.2×10-16). This indicates the potential non-linear interactions of evolutionarily conserved genes across species in development. Furthermore, we applied ManiNetCluster to time series transcriptome data measured in the green alga Chlamydomonas reinhardtii to discover the genomic functions linking various metabolic processes between the light and dark periods of a diurnally cycling culture. We identified a number of genes putatively regulating processes across each lighting regime. CONCLUSIONS:ManiNetCluster provides a novel computational tool to uncover the genes linking various functions from different networks, providing new insight on how gene functions coordinate across different conditions. ManiNetCluster is publicly available as an R package at https://github.com/daifengwanglab/ManiNetCluster.

Comparative network analysis↗

Evaluation of PETSc on a Heterogeneous Architecture, the OLCF Summit System: Part II - Basic Communication Performance

Nearest-neighbor communication is at the heart of many high-performance parallel computations. We report on the performance of such communication on the Oak Ridge Leadership Computing Facility system Summit in the context of the PETSc communication module. The analysis in this report includes basic Ping-Pong point-to-point communication and regular and irregular nearest-neighbor communication.

97 MATHEMATICS AND COMPUTING↗

On T-Amorphous Association Schemes

An association scheme is said to be T-amorphous if it is antisymmetric and any tournament obtained by an appropriate merging of its classes is doubly regular. The goal of this paper is to study basic properties of T-amorphous schemes.

97 MATHEMATICS AND COMPUTING↗

On the local behaviour of the multidimensional {Lambda}-variation

Let two classes ({Lambda}{sup 1},...,{Lambda}{sup m})BV and (M{sup 1},...,M{sup m})BV on an interval {Delta} be given. In the paper, we find necessary and sufficient conditions for the {Lambda}-variation of any function in the M-class, over a neighbourhood of every regular point, to tend to zero as the neighbourhood decreases. Bibliography: 10 titles.

97 MATHEMATICS AND COMPUTING↗

Optical tomography reconstruction algorithm with the finite element method: An optimal approach with regularization tools

Highlights: •New strategies to improve the accuracy of the reconstruction through mesh and finite element parameterization. •Use of gradient filtering through an alternative inner product within the adjoint method. •An integral form of the cost function is used to make the reconstruction compatible with all finite element formulations, continuous and discontinuous. •Gradient-based algorithm with the adjoint method is used for the reconstruction. -- Abstract: Optical tomography is mathematically treated as a non-linear inverse problem where the optical properties of the probed medium are recovered through the minimization of the errors between the experimental measurements and their predictions with a numerical model at the locations of the detectors. According to the ill-posed behavior of the inverse problem, some regularization tools must be performed and the Tikhonov penalization type is the most commonly used in optical tomography applications. This paper introduces an optimized approach for optical tomography reconstruction with the finite element method. An integral form of the cost function is used to take into account the surfaces of the detectors and make the reconstruction compatible with all finite element formulations, continuous and discontinuous. Through a gradient-based algorithm where the adjoint method is used to compute the gradient of the cost function, an alternative inner product is employed for preconditioning the reconstruction algorithm. Moreover, appropriate re-parameterization of the optical properties is performed. These regularization strategies are compared with the classical Tikhonov penalization one. It is shown that both the re-parameterization and the use of the Sobolev cost function gradient are efficient for solving such an ill-posed inverse problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Callan-Symanzik equation and asymptotic freedom in the Marr-Shimamoto model

The exactly soluble nonrelativistic Marr-Shimamoto model was introduced in 1964 as an example of the Lee model with a propagator and a nontrivial vertex function. An exactly soluble relativistic version of this model, known as the Zachariasen model, has been found to be asymptotically free in terms of coupling constant renormalization at an arbitrary spacelike momentum and on the basis of exact solutions of the Gell-Mann-Low equations. This is accomplished with conventional cut-off regularization by setting up the Yukawa and Fermi coupling constants at Euclidean momenta in terms of on mass-shell couplings and then taking the asymptotic limit. In view of this background, it may be expected that an investigation of the nonrelativistic Marr-Shimamoto theory may also exhibit asymptotic freedom in view of its manifest mathematical similarity to that of the Zachariasen model. To prove this point, the present paper prefers to examine asymptotic freedom in the nonrelativistic Marr-Shimamoto theory using the powerful concepts of the renormalization group and the Callan-Symanzik equation, in conjunction with the specificity of dimensional regularization and on-shell renormalization. This approach is based on calculations of the Callan-Symanzik coefficients and determinations of the effective coupling constants. It is shown that the Marr-Shimamoto theory is asymptotically free for dimensions D<3 and for values of D>3 occurring in periodic intervals over the range of 0<D<27 of particular interest. This differs from the original Lee model which has been shown by several authors, using these same concepts, to be asymptotically free only for D<4.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Entropy–viscosity method for the single material Euler equations in Lagrangian frame

In this work, a new finite element method for solving the Euler equations in Lagrangian coordinates is proposed. The method is stabilized by adding artificial diffusion terms compatible with positivity of mass and internal energy, a minimum principle on the specific entropy, and all generalized entropy inequalities. Two options of first-order artificial diffusion are considered. One is in the spirit of the Eulerian based method (Guermond et al., 2011 [23, 22]; Zingan et al., 2013) and the other is similar to existing viscosity stabilizations in Lagrangian frame, e.g., Dobrev et al. (2012). The method is verified to be high-order for smooth solutions even with active viscosity terms. This is achieved by using high-order finite element spaces and an entropy-based viscosity stabilization that degenerates the first-order viscous terms. This stabilization automatically distinguishes smooth and singular regions. The formal accuracy and convergence properties of the proposed methods are tested on a series of benchmark problems. This is the first result extending the entropy–viscosity methodology to the Lagrangian hydrodynamics.

97 MATHEMATICS AND COMPUTING↗

Kinetics-Informed Neural Networks

Chemical kinetics and reaction engineering consists of the phenomenological framework for the disentanglement of reaction mechanisms, optimization of reaction performance and the rational design of chemical processes. Here, we utilize feed-forward artificial neural networks as basis functions to solve ordinary differential equations (ODEs) constrained by differential algebraic equations (DAEs) that describe microkinetic models (MKMs). We present an algebraic framework for the mathematical description and classification of reaction networks, types of elementary reaction, and chemical species. Under this framework, we demonstrate that the simultaneous training of neural nets and kinetic model parameters in a regularized multi-objective optimization setting leads to the solution of the inverse problem through the estimation of kinetic parameters from synthetic experimental data. We analyze a set of scenarios to establish the extent to which kinetic parameters can be retrieved from transient kinetic data, and assess the robustness of the methodology with respect to statistical noise. Furthermore, this approach to inverse kinetic ODEs can assist in the elucidation of reaction mechanisms based on transient data.

36 MATERIALS SCIENCE↗

Well posedness for the nonlinear Klein-Gordon-Schroedinger equations with heterointeractions

In this paper we study the well posedness of solution to a certain system of nonlinear Klein-Gordon-Schroedinger equations in three space dimensions. Basing on the Strichartz estimates, we obtain the global existence, uniqueness of the solutions, and continuous dependence with respect to initial data in the Sobolev spaces of low regularities by setting appropriate contraction and taking difference estimates.

97 MATHEMATICS AND COMPUTING↗

The Dirichlet problem for polyanalytic functions

Connections between the boundary behaviour of polyanalytic functions and the structure of the boundary are investigated. In particular, a Jordan domain with Lipschitz boundary is constructed which is regular for the Dirichlet problem in the class of bianalytic functions. Bibliography: 14 titles.

97 MATHEMATICS AND COMPUTING↗

Assessment of ALEGRA Computation for Magnetostatic Configurations

Here, a closed-form solution is described here for the equilibrium configurations of the magnetic field in a simple heterogeneous domain. This problem and its solution are used for rigorous assessment of the accuracy of the ALEGRA code in the quasistatic limit. By the equilibrium configuration we understand the static condition, or the stationary states without macroscopic current. The analysis includes quite a general class of 2D solutions for which a linear isotropic metallic matrix is placed inside a stationary magnetic field approaching a constant value H i ° at infinity. The process of evolution of the magnetic fields inside and outside the inclusion and the parameters for which the quasi-static approach provides for self-consistent results is also explored. Lastly, it is demonstrated that under spatial mesh refinement, ALEGRA converges to the analytic solution for the interior of the inclusion at the expected rate, for both body-fitted and regular rectangular meshes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

False Positive and False Negative Effects on Network Attacks

Robustness against attacks serves as evidence for complex network structures and failure mechanisms that lie behind them. Most often, due to detection capability limitation or good disguises, attacks on networks are subject to false positives and false negatives, meaning that functional nodes may be falsely regarded as compromised by the attacker and vice versa. In this work, we initiate a study of false positive/negative effects on network robustness against three fundamental types of attack strategies, namely, random attacks (RA), localized attacks (LA), and targeted attack (TA). By developing a general mathematical framework based upon the percolation model, we investigate analytically and by numerical simulations of attack robustness with false positive/negative rate (FPR/FNR) on three benchmark models including Erdős-Rényi (ER) networks, random regular (RR) networks, and scale-free (SF) networks. We show that ER networks are equivalently robust against RA and LA only when FPR equals zero or the initial network is intact. We find several interesting crossovers in RR and SF networks when FPR is taken into consideration. By defining the cost of attack, we observe diminishing marginal attack efficiency for RA, LA, and TA. Our finding highlights the potential risk of underestimating or ignoring FPR in understanding attack robustness. The results may provide insights into ways of enhancing robustness of network architecture and improve the level of protection of critical infrastructures.

97 MATHEMATICS AND COMPUTING↗