Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sparse direct method”

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 271 records · Page 15

Land and Land-use Change in the Climate Sensitive High Plains: An Automated Approach with Landsat

The High Plains is an economically important and climatologically sensitive region of the United States and Canada. The High Plains contain 100,000 sq km of Holocene sand dunes and sand sheets that are currently stabilized by natural vegetation. Droughts and the larger threat of global warming are climate phenomena that could cause depletion of natural vegetation and make this region susceptible to sand dune reactivation. The original proposal was directed toward the use of Landsat TM data to establish the state and ongoing changes of the surface in the 1.2 million sq. km, semi-arid High Plains region of the central US, A key objective was to develop a model to predict the reactivation of the 100,000 sq. km of Holocene dunes found on the High Plains during an extended drought. At least one Landsat 5 image per year for 1985, 1988 and 1996 was obtained for 32 scenes on the High Plains to coincide with wet and dry years. Additional Landsat 7 data were acquired for 1999 and 2000 primarily for Colorado and Nebraska. As luck would have it, there was no severe drought during the study period 1985-2000. Attention was focused on developing methods for mapping dry vs. green vegetation on sparsely vegetated rangelands in sandy soils, since these were the areas most susceptible to surface reactivation during a drought.

Goetz, Alexander F.↗

A Novel Centrality Measure for Network-wide Cyber Vulnerability Assessment

In this work we propose a novel formulation that models the attack and compromise on a cyber network as a combination of two parts - direct compromise of a host and the compromise occurring through the spread of the attack on the network from a compromised host. The model parameters for the nodes are a concise representation of the host profiles that can include the risky behaviors of the associated human users while the model parameters for the edges are based on the existence of vulnerabilities between each pair of connected hosts. The edge models relate to the summary representations of the corresponding attack-graphs. This results in a formulation based on Random Walk with Restart (RWR) and the resulting centrality metric can be solved for in an efficient manner through the use of sparse linear solvers. Thus the formulation goes beyond mere topological considerations in centrality computations by summarizing the host profiles and the attack graphs into the model parameters. The computational efficiency of the method also allows us to also quantify the uncertainty in the centrality measure through Monte Carlo analysis.

Centrality↗

3D visualization of polymer nanostructure

Soft materials and structured polymers are extremely useful nanotechnology building blocks. Block copolymers, in particular, have served as 2D masks for nanolithography and 3D scaffolds for photonic crystals, nanoparticle fabrication, and solar cells. F or many of these applications, the precise 3 dimensional structure and the number and type of defects in the polymer is important for ultimate function. However, directly visualizing the 3D structure of a soft material from the nanometer to millimeter length scales is a significant technical challenge. Here, we propose to develop the instrumentation needed for direct 3D structure determination at near nanometer resolution throughout a nearly millimeter-cubed volume of a soft, potentially heterogeneous, material. This new capability will be a valuable research tool for LANL missions in chemistry, materials science, and nanoscience. Our approach to soft materials visualization builds upon exciting developments in super-resolution optical microscopy that have occurred over the past two years. To date, these new, truly revolutionary, imaging methods have been developed and almost exclusively used for biological applications. However, in addition to biological cells, these super-resolution imaging techniques hold extreme promise for direct visualization of many important nanostructured polymers and other heterogeneous chemical systems. Los Alamos has a unique opportunity to lead the development of these super-resolution imaging methods for problems of chemical rather than biological significance. While these optical methods are limited to systems transparent to visible wavelengths, we stress that many important functional chemicals such as polymers, glasses, sol-gels, aerogels, or colloidal assemblies meet this requirement, with specific examples including materials designed for optical communication, manipulation, or light-harvesting Our Research Goals are: (1) Develop the instrumentation necessary for imaging materials at {approx} 10 nm resolution over hundreds of microns in 3 spatial dimensions. Super-resolution microcopy methods based upon single molecule localization were originally limited to 2D slices. Recent advances in this field have extended these methods to three dimensions. However, the 3D rendering was limited to viewing sparsely labeled cellular structures over a z-depth of less than 1 micron. Our first goal is to extend super resolution microscopy to z-depths of hundreds of microns. This substantial improvement is needed to image polymer nanostructure over functionally relevant length scales. (2) Benchmark this instrument by studying the 3D nanostructure of diblock co-polymer morphologies. We will test and benchmark our instrument by imaging fluorescently labeled diblock copolymers, molecules that self-assemble into a variety of 3D nano-structures. We reiterate these polymers are useful for a variety of applications ranging from lithography to light harvesting.

36 MATERIALS SCIENCE↗

A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization

In this paper, we present a distributed-memory library for computations with dense structured matrices. A matrix is considered structured if its off-diagonal blocks can be approximated by a rank-deficient matrix with low numerical rank. Here, we use Hierarchically Semi-Separable (HSS) representations. Such matrices appear in many applications, for example, finite-element methods, boundary element methods, and so on. Exploiting this structure allows for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. The compression algorithm that we use, that computes the HSS form of an input dense matrix, relies on randomized sampling with a novel adaptive sampling mechanism. We discuss the parallelization of this algorithm and also present the parallelization of structured matrix-vector product, structured factorization, and solution routines. The efficiency of the approach is demonstrated on large problems from different academic and industrial applications, on up to 8,000 cores. Finally, this work is part of a more global effort, the STRUctured Matrices PACKage (STRUMPACK) software package for computations with sparse and dense structured matrices. Hence, although useful on their own right, the routines also represent a step in the direction of a distributed-memory sparse solver.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

SU-E-J-128: 3D Surface Reconstruction of a Patient Using Epipolar Geometry

Purpose: To obtain a 3D surface data of a patient in a non-invasive way can substantially reduce the effort for the registration of patient in radiation therapy. To achieve this goal, we introduced the multiple view stereo technique, which is known to be used in a 'photo tourism' on the internet. Methods: 70 Images were taken with a digital single-lens reflex camera from different angles and positions. The camera positions and angles were inferred later in the reconstruction step. A sparse 3D reconstruction model was locating by SIFT features, which is robust for rotation and shift variance, in each image. We then found a set of correspondences between pairs of images by computing the fundamental matrix using the eight-point algorithm with RANSAC. After the pair matching, we optimized the parameter including camera positions to minimize the reprojection error by use of bundle adjustment technique (non-linear optimization). As a final step, we performed dense reconstruction and associate a color with each point using the library of PMVS. Results: Surface data were reconstructed well by visual inspection. The human skin is reconstructed well, althogh the reconstruction was time-consuming for direct use in daily clinical practice. Conclusion: 3D reconstruction using multi view stereo geometry is a promising tool for reducing the effort of patient setup. This work was supported by JSPS KAKENHI(25861128)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Exact reconstruction of gene regulatory networks using compressive sensing

We consider the problem of reconstructing a gene regulatory network structure from limited time series gene expression data, without any a priori knowledge of connectivity. We assume that the network is sparse, meaning the connectivity among genes is much less than full connectivity. We develop a method for network reconstruction based on compressive sensing, which takes advantage of the network’s sparseness. For the case in which all genes are accessible for measurement, and there is no measurement noise, we show that our method can be used to exactly reconstruct the network. For the more general problem, in which hidden genes exist and all measurements are contaminated by noise, we show that our method leads to reliable reconstruction. In both cases, coherence of the model is used to assess the ability to reconstruct the network and to design new experiments. We demonstrate that it is possible to use the coherence distribution to guide biological experiment design effectively. By collecting a more informative dataset, the proposed method helps reduce the cost of experiments. For each problem, a set of numerical examples is presented. The method provides a guarantee on how well the inferred graph structure represents the underlying system, reveals deficiencies in the data and model, and suggests experimental directions to remedy the deficiencies.

59 BASIC BIOLOGICAL SCIENCES↗

Biological Research and Space Health Enabled by Machine Learning to Support Deep Space Missions

A key science goal of the NASA “Moon to Mars” campaign is to understand how biology responds to the Lunar, Martian, and deep space environments in order to advance fundamental knowledge, reduce risk, and support safe, productive human space missions. Through the powerful emerging computer science approaches of artificial intelligence (AI) and machine learning (ML), a paradigm shift has begun in biomedical science and engineered astronaut health systems, to enable Earth-independence and autonomy of mission operations. We present a decadal view of AI/ML architecture to support deep space mission goals, developed in concert with leaders in the field. We describe current AI/ML methods to support 1) fundamental biology, 2) in situ analytics, 3) high performance computing hardware, 4) automated science, 5) self-driving labs, 6) remote data management, 7) integrated real-time mission biomonitoring, and 8) a Precision Space Health system. Cutting-edge AI/ML approaches that can be integrated to support these domains include active learning, explainable AI, adaptive learning, causal inference, knowledge graphs, federated learning, transfer learning, and large language models. Finally, we present results from several current ML projects that are underway in the field to address key challenges of small sample n, high feature count, heterogeneity, and sparse data. These include 1) connecting omics data to phenotypic data using an ensemble model to infer causality of spaceflight rodent liver health disruption, 2) usage of explainable ML to interrogate the muscular underpinnings of spaceflight muscle atrophy, 3) ML models analyzing and determining directed acyclic graphs of human space health risk leveraging rodent bone datasets, 4) usage of large pre-trained models connecting biomedical knowledgebases with small spaceflight datasets to understand gene-to-gene interaction networks, and 5) a suite of benchmarked open science datasets (spaceflight mouse liver; radiation DNA damage) enabling programmers to identify the best ML algorithms to answer space biological science questions.

space biology↗

Biological Research and Space Health Enabled by Machine Learning to Support Deep Space Missions

A key science goal of the NASA “Moon to Mars” campaign is to understand how biology responds to the Lunar, Martian, and deep space environments in order to advance fundamental knowledge, reduce risk, and support safe, productive human space missions. Through the powerful emerging computer science approaches of artificial intelligence (AI) and machine learning (ML), a paradigm shift has begun in biomedical science and engineered astronaut health systems, to enable Earth-independence and autonomy of mission operations. We present a decadal view of AI/ML architecture to support deep space mission goals, developed in concert with leaders in the field. We describe current AI/ML methods to support 1) fundamental biology, 2) in situ analytics, 3) high performance computing hardware, 4) automated science, 5) self-driving labs, 6) remote data management, 7) integrated real-time mission biomonitoring, and 8) a Precision Space Health system. Cutting-edge AI/ML approaches that can be integrated to support these domains include active learning, explainable AI, adaptive learning, causal inference, knowledge graphs, federated learning, transfer learning, and large language models. Finally, we present results from several current ML projects that are underway in the field to address key challenges of small sample n, high feature count, heterogeneity, and sparse data. These include 1) connecting omics data to phenotypic data using an ensemble model to infer causality of spaceflight rodent liver health disruption, 2) usage of explainable ML to interrogate the muscular underpinnings of spaceflight muscle atrophy, 3) ML models analyzing and determining directed acyclic graphs of human space health risk leveraging rodent bone datasets, 4) usage of large pre-trained models connecting biomedical knowledgebases with small spaceflight datasets to understand gene-to-gene interaction networks, and 5) a suite of benchmarked open science datasets (spaceflight mouse liver; radiation DNA damage) enabling programmers to identify the best ML algorithms to answer space biological science questions.

space biology↗

Algebraic multigrid preconditioners for two-phase flow in porous media with phase transitions [Algebraic multigrid preconditioners for multiphase flow in porous media with phase transitions]

Multiphase flow is a critical process in a wide range of applications, including oil and gas recovery, carbon sequestration, and contaminant remediation. Numerical simulation of multiphase flow requires solving of a large, sparse linear system resulting from the discretization of the partial differential equations modeling the flow. In the case of multiphase multicomponent flow with miscible effect, this is a very challenging task. The problem becomes even more difficult if phase transitions are taken into account. A new approach to handle phase transitions is to formulate the system as a nonlinear complementarity problem (NCP). Unlike in the primary variable switching technique, the set of primary variables in this approach is fixed even when there is phase transition. Not only does this improve the robustness of the nonlinear solver, it opens up the possibility to use multigrid methods to solve the resulting linear system. The disadvantage of the complementarity approach, however, is that when a phase disappears, the linear system has the structure of a saddle point problem and becomes indefinite, and current algebraic multigrid (AMG) algorithms cannot be applied directly. In this study, we explore the effectiveness of a new multilevel strategy, based on the multigrid reduction technique, to deal with problems of this type. We demonstrate the effectiveness of the method through numerical results for the case of two-phase, two-component flow with phase appearance/disappearance. In conclusion, we also show that the strategy is efficient and scales optimally with problem size.

02 PETROLEUM↗

Rapid Coal-Ash Characterization using Geophysical Methods & Machine Learning

Coal combustion products (CCP) are challenging to delineate in heterogeneous field settings. Conventional methods (test pits, coring, and laboratory analyses) are labor-intensive, slow, invasive, and provide sparse spatial coverage. This study evaluates whether rapid non-invasive geophysical screening methods—induced polarization (IP), magnetic susceptibility, and nuclear magnetic resonance (NMR) —combined with surface colorimetry (RGB_24), can discriminate CCP-soil mixtures and provide reliable estimates of CCP content. Laboratory measurements were collected on five CCP-soil mixtures (series) and modeled using (i) a linear baseline, (ii) a calibrated non-linear (power-mean) model, and (iii) a machine-learning (ML) Random Forest approach, with validation via leave-one-series-out and site-specific tests. Across the five series, individual signals—particularly IP and magnetic susceptibility—were strongly predictive of ash content but were consistently outperformed by combined models. The pooled calibrated non-linear and ML models captured the observed non-linearity and achieved high accuracy and precision, improving on linear fits. Colorimetry showed the weakest direct relationship with ash content for the tested samples but improved performance when included in multi-signal models. At pre-selected 3.5% decision threshold, calibrated and ML approaches yielded near-perfect classification (Matthews correlation coefficient ˜ 1), suggesting strong practical operability for field screening. Additionally, field-analog tests highlighted the role of endmembers—accuracy declined without access to end-member measurements but was largely recovered by collecting a minimal labeled pair for local recalibration. With end members, accuracy remained high. Globally trained models performed well on three operational unknowns; however, series-specific refits provided the most accurate predictions. Overall, these results highlight the potential of combining rapid geophysics and minimal local calibration for improved coal-ash delineation.

Peshtani, Klaudio↗

GUIDING NONLINEAR FORCE-FREE MODELING USING CORONAL OBSERVATIONS: FIRST RESULTS USING A QUASI-GRAD-RUBIN SCHEME

At present, many models of the coronal magnetic field rely on photospheric vector magnetograms, but these data have been shown to be problematic as the sole boundary information for nonlinear force-free field extrapolations. Magnetic fields in the corona manifest themselves in high-energy images (X-rays and EUV) in the shapes of coronal loops, providing an additional constraint that is not at present used as constraints in the computational domain, directly influencing the evolution of the model. This is in part due to the mathematical complications of incorporating such input into numerical models. Projection effects, confusion due to overlapping loops (the coronal plasma is optically thin), and the limited number of usable loops further complicate the use of information from coronal images. We develop and test a new algorithm to use images of coronal loops in the modeling of the solar coronal magnetic field. We first fit projected field lines with those of constant-{alpha} force-free fields to approximate the three-dimensional distribution of currents in the corona along a sparse set of trajectories. We then apply a Grad-Rubin-like iterative technique, which uses these trajectories as volume constraints on the values of {alpha}, to obtain a volume-filling nonlinear force-free model of the magnetic field, modifying a code and method presented by Wheatland. We thoroughly test the technique on known analytical and solar-like model magnetic fields previously used for comparing different extrapolation techniques and compare the results with those obtained by currently available methods relying only on the photospheric data. We conclude that we have developed a functioning method of modeling the coronal magnetic field by combining the line-of-sight component of the photospheric magnetic field with information from coronal images. Whereas we focus on the use of coronal loop information in combination with line-of-sight magnetograms, the method is readily extended to incorporate vector-magnetic data over any part of the photospheric boundary.

79 ASTRONOMY AND ASTROPHYSICS↗

On the Solution of ℓ 0 -Constrained Sparse Inverse Covariance Estimation Problems

The sparse inverse covariance matrix is used to model conditional dependencies between variables in a graphical model to fit a multivariate Gaussian distribution. Estimating the matrix from data are well known to be computationally expensive for large-scale problems. Sparsity is employed to handle noise in the data and to promote interpretability of a learning model. Although the use of a convex ℓ 1 regularizer to encourage sparsity is common practice, the combinatorial ℓ 0 penalty often has more favorable statistical properties. In this paper, we directly constrain sparsity by specifying a maximally allowable number of nonzeros, in other words, by imposing an ℓ 0 constraint. Here, we introduce an efficient approximate Newton algorithm using warm starts for solving the nonconvex ℓ 0 -constrained inverse covariance learning problem. Numerical experiments on standard data sets show that the performance of the proposed algorithm is competitive with state-of-the-art methods.

$\ell_0$-Constrained↗

Evaluation of average leaf inclination angle quantified by indirect optical instruments in crop fields

Average leaf inclination angle ($\overline{θ}$ L ) is an important canopy structure variable that influences light regime, photosynthesis, and evapotranspiration of plants. $\overline{θ}$ L can be measured through direct methods (e.g., protractor), which are labor-intensive and time-consuming, or through indirect optical instruments, which are more efficient than the direct methods. However, uncertainties of different indirect optical instruments for quantifying $\overline{θ}$ L remain largely unquantified. In this study, we evaluated and compared the performances of three major indirect optical instruments: (1) LAI-2200, (2) 30°-tilted camera, and (3) digital hemispherical photography (DHP), in different crop fields over a growing season, benchmarked with direct measurements. LAI-2200 and 30°-tilted camera showed higher agreement with direct $\overline{θ}$ measurements (R 2 = 0.54, RMSE = 7.37°; R 2 = 0.58, RMSE = 8.08°) than DHP (R 2 = 0.14, RMSE = 13.96°). Different performances of indirect optical instruments could be attributed to the accuracy of gap fraction measurement and the performance of the $\overline{θ}$ L quantification algorithms. When using the LAI-2200 algorithm, larger gap fraction gradients over view zenith angles led to larger $\overline{θ}$ L values, and smaller gap fraction gradients led to smaller $\overline{θ}$ L values. Such error propagation was larger in sparse canopy than in dense canopy. The Wilson G function of the LAI-2200 algorithm performed better in estimating $\overline{θ}$ L than the G function based on the ellipsoidal LAD function used by the CAN_EYE algorithm. We also proposed a modification of the LAI-2200 algorithm, which further improved the performance of LAI-2200 and 30°-tilted cameras in estimating $\overline{θ}$ L . We envision that the low-cost 30°-tilted cameras provide a promising sensor solution to continuously monitor canopy structure for various ecosystems.

30°-tilted camera↗

Representation-Independent Iteration of Sparse Data Arrays

An approach is defined that describes a method of iterating over massively large arrays containing sparse data using an approach that is implementation independent of how the contents of the sparse arrays are laid out in memory. What is unique and important here is the decoupling of the iteration over the sparse set of array elements from how they are internally represented in memory. This enables this approach to be backward compatible with existing schemes for representing sparse arrays as well as new approaches. What is novel here is a new approach for efficiently iterating over sparse arrays that is independent of the underlying memory layout representation of the array. A functional interface is defined for implementing sparse arrays in any modern programming language with a particular focus for the Chapel programming language. Examples are provided that show the translation of a loop that computes a matrix vector product into this representation for both the distributed and not-distributed cases. This work is directly applicable to NASA and its High Productivity Computing Systems (HPCS) program that JPL and our current program are engaged in. The goal of this program is to create powerful, scalable, and economically viable high-powered computer systems suitable for use in national security and industry by 2010. This is important to NASA for its computationally intensive requirements for analyzing and understanding the volumes of science data from our returned missions.

James, Mark↗

New perspectives on superparameterization for geophysical turbulence

This is a research expository paper regarding superparameterization, a class of multi-scale numerical methods designed to cope with the intermittent multi-scale effects of inhomogeneous geophysical turbulence where energy often inverse-cascades from the unresolved scales to the large scales through the effects of waves, jets, vortices, and latent heat release from moist processes. Original as well as sparse space–time superparameterization algorithms are discussed for the important case of moist atmospheric convection including the role of multi-scale asymptotic methods in providing self-consistent constraints on superparameterization algorithms and related deterministic and stochastic multi-cloud parameterizations. Test models for the statistical numerical analysis of superparameterization algorithms are discussed both to elucidate the performance of the basic algorithms and to test their potential role in efficient multi-scale data assimilation. The very recent development of grid-free seamless stochastic superparameterization methods for geophysical turbulence appropriate for “eddy-permitting” mesoscale ocean turbulence is presented here including a general formulation and illustrative applications to two-layer quasigeostrophic turbulence, and another difficult test case involving one-dimensional models of dispersive wave turbulence. This last test case has randomly generated solitons as coherent structures which collapse and radiate wave energy back to the larger scales, resulting in strong direct and inverse turbulent energy cascades.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scaled Vecchia Approximation for Fast Computer-Model Emulation

Many scientific phenomena are studied using computer experiments consisting of multiple runs of a computer model while varying the input settings. Gaussian processes (GPs) are a popular tool for the analysis of computer experiments, enabling interpolation between input settings, but direct GP inference is computationally infeasible for large datasets. We adapt and extend a powerful class of GP methods from spatial statistics to enable the scalable analysis and emulation of large computer experiments. Specifically, we apply Vecchia’s ordered conditional approximation in a transformed input space, with each input scaled according to how strongly it relates to the computer-model response. The scaling is learned from the data by estimating parameters in the GP covariance function using Fisher scoring. Our methods are highly scalable, enabling estimation, joint prediction, and simulation in near-linear time in the number of model runs. In several numerical examples, our approach substantially outperformed existing methods.

97 MATHEMATICS AND COMPUTING↗

Accurate data-driven surrogates of dynamical systems for forward propagation of uncertainty

Stochastic collocation (SC) is a well-known non-intrusive method of constructing surrogate models for uncertainty quantification. In dynamical systems, SC is especially suited for full-field uncertainty propagation that characterizes the distributions of the high-dimensional solution fields of a model with stochastic input parameters. However, due to the highly nonlinear nature of the parameter-to-solution map in even the simplest dynamical systems, the constructed SC surrogates are often inaccurate. Here, this work presents an alternative approach, where we apply the SC approximation over the dynamics of the model, rather than the solution. By combining the data-driven sparse identification of nonlinear dynamics framework with SC, we construct dynamics surrogates and integrate them through time to construct the surrogate solutions. We demonstrate that the SC-over-dynamics framework leads to smaller errors, both in terms of the approximated system trajectories as well as the model state distributions, when compared against full-field SC applied to the solutions directly. We present numerical evidence of this improvement using three test problems: a chaotic ordinary differential equation, and two partial differential equations from solid mechanics.

42 ENGINEERING↗

A state-space Bayesian framework for estimating biogeochemical transformations using time-lapse geophysical data

We develop a state-space Bayesian framework to combine time-lapse geophysical data with other types of information for quantitative estimation of biogeochemical parameters during bioremediation. We consider characteristics of end-products of biogeochemical transformations as state vectors, which evolve under constraints of local environments through evolution equations, and consider time-lapse geophysical data as available observations, which could be linked to the state vectors through petrophysical models. We estimate the state vectors and their associated unknown parameters over time using Markov chain Monte Carlo sampling methods. To demonstrate the use of the state-space approach, we apply it to complex resistivity data collected during laboratory column biostimulation experiments that were poised to precipitate iron and zinc sulfides during sulfate reduction. We develop a petrophysical model based on sphere-shaped cells to link the sulfide precipitate properties to the time-lapse geophysical attributes and estimate volume fraction of the sulfide precipitates, fraction of the dispersed, sulfide-encrusted cells, mean radius of the aggregated clusters, and permeability over the course of the experiments. Results of the case study suggest that the developed state-space approach permits the use of geophysical datasets for providing quantitative estimates of end-product characteristics and hydrological feedbacks associated with biogeochemical transformations. Although tested here on laboratory column experiment datasets, the developed framework provides the foundation needed for quantitative field-scale estimation of biogeochemical parameters over space and time using direct, but often sparse wellbore data with indirect, but more spatially extensive geophysical datasets.

54 ENVIRONMENTAL SCIENCES↗