Search NASA⌕ Search

SEARCH · Search NASA

Results for “applied computing”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,099 records · Page 61

Next generation models for storage and representation of microbial biological annotation

Background: Traditional genome annotation systems were developed in a very different computing era, one where the World Wide Web was just emerging. Consequently, these systems are built as centralized black boxes focused on generating high quality annotation submissions to GenBank/EMBL supported by expert manual curation. The exponential growth of sequence data drives a growing need for increasingly higher quality and automatically generated annotation. Typical annotation pipelines utilize traditional database technologies, clustered computing resources, Perl, C, and UNIX file systems to process raw sequence data, identify genes, and predict and categorize gene function. These technologies tightly couple the annotation software system to hardware and third party software (e.g. relational database systems and schemas). This makes annotation systems hard to reproduce, inflexible to modification over time, difficult to assess, difficult to partition across multiple geographic sites, and difficult to understand for those who are not domain experts. These systems are not readily open to scrutiny and therefore not scientifically tractable. The advent of Semantic Web standards such as Resource Description Framework (RDF) and OWL Web Ontology Language (OWL) enables us to construct systems that address these challenges in a new comprehensive way. Results: Here, we develop a framework for linking traditional data to OWL-based ontologies in genome annotation. We show how data standards can decouple hardware and third party software tools from annotation pipelines, thereby making annotation pipelines easier to reproduce and assess. An illustrative example shows how TURTLE (Terse RDF Triple Language) can be used as a human readable, but also semantically-aware, equivalent to GenBank/EMBL files. Conclusions: The power of this approach lies in its ability to assemble annotation data from multiple databases across multiple locations into a representation that is understandable to researchers. In this way, all researchers, experimental and computational, will more easily understand the informatics processes constructing genome annotation and ultimately be able to help improve the systems that produce them.

Biochemistry & Molecular Biology↗

GeoTess v. 2.6.8

GeoTess facilitates access to a multi-level triangular tessellation of a unit sphere, including find the index of the triangle in which an arbitrary position on the sphere resides and computing the interpolation coefficients that should be applied to data stored on the nodes of the tessellation that defines the triangle. It is very common for Earth scientists to store values of various Earth properties on a grid that spans the globe. For convenience, they almost always choose a grid which is evenly spaced in both latitude and longitude over the surface of the globe. While these grids are evenly spaced in latitude-longitude coordinates, they are in reality very unevenly spaced when cell size is evaluated in square km since lines of longitude converge at the poles. Tessellations consisting of a set of approximately equal area triangles that span the globe are much more efficient way to impose a grid onto the surface of a sphere. The GeoTess software facilitates interacting with a triangular tessellation of a sphere and could significantly increase the efficiency of Earth science software codes. The code can construct variable resolution triangular tessellations. It can also load a previously constructed tessellation from an input file and implements a "walking triangle" search algorithm to find the index of the triangle on the tessellation that contains a user specified point of interest. It also computes the interpolation coefficients that should be applied to data stored on the nodes of the containing triangle

Ballard, Sanford↗

GeoTess v. 2.0

GeoTess facilitates access to a multi-level triangular tessellation of a unit sphere, including find the index of the triangle in which an arbitrary position on the sphere resides and computing the interpolation coefficients that should be applied to data stored on the nodes of the tessellation that defines the triangle. It is very common for Earth scientists to store values of various Earth properties on a grid that spans the globe. For convenience, they almost always choose a grid which is evenly spaced in both latitude and longitude over the surface of the globe. While these grids are evenly spaced in latitude-longitude coordinates, they are in reality very unevenly spaced when cell size is evaluated in square km since lines of longitude converge at the poles. Tessellations consisting of a set of approximately equal area triangles that span the globe are much more efficient way to impose a grid onto the surface of a sphere. The GeoTess software facilitates interacting with a triangular tessellation of a sphere and could significantly increase the efficiency of Earth science software codes. The code can construct variable resolution triangular tessellations. It can also load a previously constructed tessellation from an input file and implements a "walking triangle" search algorithm to find the index of the triangle on the tessellation that contains a user specified point of interest. It also computes the interpolation coefficients that should be applied to data stored on the nodes of the containing triangle

Source record↗

Smoky Mountain Data Challenge 2021: An Open Call to Solve Scientific Data Challenges Using Advanced Data Analytics and Edge Computing

The 2021 Smoky Mountains Computational Sciences and Engineering Conference enlists scientists from across Oak Ridge National Laboratory (ORNL) and industry to be data sponsors and help create data analytics and edge computing challenges for eminent datasets in a variety of scientific domains. This work describes the significance of each of the eight datasets and their associated challenge questions. The challenge questions for each dataset were required to cover multiple difficulty levels. An international call for participation was sent to students, asking them to form teams of up to six people and apply novel data analytics and edge computing methods to solve these challenges.

Devineni, Pravallika↗

Logical Development of the Cell Ontology

Background: The Cell Ontology (CL) is an ontology for the representation of in vivo cell types. As biological ontologies such as the CL grow in complexity, they become increasingly difficult to use and maintain. By making the information in the ontology computable, we can use automated reasoners to detect errors and assist with classification. Here we report on the generation of computable definitions for the hematopoietic cell types in the CL. Results: Computable definitions for over 340 CL classes have been created using a genus-differentia approach. These define cell types according to multiple axes of classification such as the protein complexes found on the surface of a cell type, the biological processes participated in by a cell type, or the phenotypic characteristics associated with a cell type. We employed automated reasoners to verify the ontology and to reveal mistakes in manual curation. The implementation of this process exposed areas in the ontology where new cell type classes were needed to accommodate species-specific expression of cellular markers. Our use of reasoners also inferred new relationships within the CL, and between the CL and the contributing ontologies. This restructured ontology can be used to identify immune cells by flow cytometry, supports sophisticated biological queries involving cells, and helps generate new hypotheses about cell function based on similarities to other cell types. Conclusion: Use of computable definitions enhances the development of the CL and supports the interoperability of OBO ontologies.

59 BASIC BIOLOGICAL SCIENCES↗

Fluid-structure interaction solver for transient dynamics of fracturing media

Computer implemented methods include providing a numerical simulation solid mesh comprising a plurality of solid nodes and a numerical simulation fluid mesh comprising a plurality of fluid nodes, and performing a numerical simulation with the solid mesh and fluid mesh including: determining a fluid-solid interaction between the fluid mesh and the solid mesh at a time step by (i) immersing boundaries of the solid and fluid meshes, (ii) computing current corrected fluid and solid velocities using an interaction parameter applied to an intermediate fluid-solid relative velocity, and (iii) computing a fluid-solid interaction force based on the current corrected fluid and solid velocities.

Rougier, Esteban↗

Utilizing Essential Symmetry Breaking in Auxiliary-Field Quantum Monte Carlo: Application to the Spin Gaps of the C 36 Fullerene and an Iron Porphyrin Model Complex

We present three distinct examples where phaseless auxiliary-field quantum Monte Carlo (ph-AFQMC) can be reliably performed with a single-determinant trial wave function with essential symmetry breaking. Essential symmetry breaking was first introduced by Lee and Head-Gordon [ Phys. Chem. Chem. Phys. 2019, 21, 4763-4778, 10.1039/C8CP07613H]. We utilized essential complex and time-reversal symmetry breaking with ph-AFQMC to compute the triplet–singlet energy gap in the TS12 set. We found statistically better performance of ph-AFQMC with complex-restricted orbitals than with spin-unrestricted orbitals. We then showed the utilization of essential spin symmetry breaking when computing the singlet–triplet gap of a known biradicaloid, C 36 . ph-AFQMC with spin-unrestricted Hartree–Fock (ph-AFQMC+UHF) fails catastrophically even with spin-projection and predicts no biradicaloid character. With approximate Brueckner orbitals obtained from regularized orbital-optimized second-order Møller–Plesset perturbation theory (κ-OOMP2), ph-AFQMC quantitatively captures strong biradicaloid character of C 36 . Lastly, we applied ph-AFQMC to the computation of the quintet–triplet gap in a model iron porphyrin complex where brute-force methods with a small active space fail to capture the triplet ground state. We show unambiguously that neither triplet nor quintet is strongly correlated using UHF, κ-OOMP2, and coupled-cluster with singles and doubles (CCSD) performed on UHF and κ-OOMP2 orbitals. There is no essential symmetry breaking in this problem. By virtue of this, we were able to perform UHF+ph-AFQMC reliably with a cc-pVTZ basis set and predicted a triplet ground state for this model geometry. The largest ph-AFQMC in this work correlated 186 electrons in 956 orbitals. Our work highlights the utility, scalability, and accuracy of ph-AFQMC with a single-determinant trial wave function with essential symmetry breaking for systems mainly dominated by dynamical correlation with little static correlation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Knowledge gaps for neuromorphic ionic computing

BACKGROUND Neuromorphic computing, inspired by the human brain’s ability to process information efficiently, represents a transformative approach to computation. In this Review, we explore the emerging field of neuromorphic ionic computing, which leverages ionic conduction and coupling to mimic neural processes, and identify critical knowledge gaps that must be addressed to realize its full potential. A central theme of the discussion is energy efficiency, a challenge that is both a limitation and an opportunity for this technology. Although complementary metal-oxide semiconductor (CMOS)–based neuromorphic technologies have made strides in scaling to billions of neurons and are increasingly applied in artificial intelligence and numerical computing, they remain orders of magnitude behind the human brain in terms of connectivity and energy efficiency. Neuromorphic ionic computing promises to overcome these limitations by leveraging the distinct architectural and operational principles of the brain. Our brains achieve this energy efficiency by combining several key features: using the same network elements to store and process information; using an incredibly complex and massively interconnected three-dimensional (3D) network of locally active elements that enables sparsity, robustness in the presence of noise, adaptation, and life-long learning; computing at comparatively low voltage and frequency; and last, taking advantage of a plethora of ions and small molecules as information carriers. Here, we propose that ionic computing systems can take advantage of similar features to achieve substantial gains in energy efficiency. ADVANCES Since the first reports of neuromorphic ionic behavior in nanofluidic channels, we have witnessed an explosion of reports that used ionic devices to produce synaptomimetic behaviors. However, achieving the goals of ionic computing requires not only implementation of much more sophisticated device functionality but also overcoming fundamental barriers in materials science, device architecture, and system integration. Current ionic devices, even those incorporating state-of-the-art materials, still suffer from limited functionality and stability, which restrict their performance and increase energy demands. Developing new materials with enhanced ionic properties is essential to overcome these limitations. Similarly, the design of neuromorphic devices must evolve to leverage the particular advantages of ionic processes. Existing architectures often follow a single-information-carrier logic of conventional electronics or are constructed of mesoscale fluidics, failing to capitalize on the energy-efficient mechanisms inherent to ionic systems or implement the multiple-information-carrier paradigm. Current neuromorphic chips focus on large-scale networks of analog memory elements based on mechanisms such as charge trap (flash), filamentary, phase change, or spin, which are built on top of a network of artificial CMOS neurons. Although such prototype networks have achieved impressive performance, it is difficult to envision how they can implement the key features such as massive connectivity, sophisticated plasticity, adaptability, sparsity, and “multichromatic” computing. Although small-scale devices have demonstrated promising results, integrating them, maintaining energy efficiency, and implementing temperature control as systems grow in complexity and size to computationally relevant scale remain major hurdles. Furthermore, interfacing neuromorphic ionic devices with existing computing technologies presents technical and conceptual challenges that will require innovative approaches that combine insights from neuroscience, materials science, and engineering. OUTLOOK Despite these challenges, the potential impact of neuromorphic ionic computing is profound with potential applications ranging from artificial intelligence to robotics and beyond. We also argue that neuromorphic ionic computing systems should not, at least in the beginning, compete with CMOS technologies but rather should focus on applications that require extreme energy efficiency with chemical and/or biological compatibility, such as biomedical applications (for example, brain-computer interfaces), environmental monitoring, and agricultural and food applications. Ultimately, this Review highlights the crucial role of interdisciplinary collaboration in advancing the field. Neuromorphic ionic computing is not merely a technological innovation; it represents a substantial step toward sustainable computation, aligning with the growing demand for energy-conscious solutions in a world that is increasingly reliant on data and computation.

Neuromorphic↗

Thermochromic VO{sub 2} nanorods made by sputter deposition: Growth conditions and optical modeling

Reactive dc magnetron sputtering onto glass-based substrates yielded deposits of thermochromic VO{sub 2} with well-developed nanorods and nanowires. Their formation was promoted by high substrate temperature (above {approx}500 Degree-Sign C), sufficient film thickness, proper inlet of the reactive gas, dispersed gold 'seeds,' and pronounced substrate roughness. Rutherford back scattering ascertained mass thicknesses, scanning electron microscopy depicted the nanostructures, and glancing incidence X-ray diffraction proved that single-phase VO{sub 2} was normally formed. Spectrophotometric measurements of total and diffuse transmittance and reflectance on VO{sub 2} thin films, at room temperature and {approx}100 Degree-Sign C, allowed us to determine complex dielectric functions below and above the 'critical' temperature for thermochromic switching ({approx}68 Degree-Sign C). These data were then used in computations based on the Bruggeman effective medium theory applied to randomly oriented prolate spheroidal structural units to derive the optical properties of the deposits. Experimental and computed data on spectral absorptance were found to be in good qualitative agreement.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Analysis of the VERA Core Physics Benchmark Problems using cosRMC Code

In reactor physics, two kinds of numerical methods are generally employed to solve the neutron transport equations, one of which is the deterministic method and the other one is the Monte Carlo method. Monte Carlo is widely used to provide reference solution because of its ability to deal with continuous energy cross sections and complex geometry. Just like any statistical process, the Monte Carlo method requires repetition to achieve a small relative uncertainty, and therefore may inevitably have larger simulation times than deterministic method. Fortunately, the great advancements of computer technology make it possible to apply Monte Carlo method in reactor core analysis. To promote nuclear power plant system design and simulation software self-reliance development, a Monte Carlo neutron/photon transport code cosRMC has been developed jointly by State Nuclear Power Software Development Center (SNPSDC) and Tsinghua University. The cosRMC is aimed at achieving full core calculations and analysis with high fidelity and efficiency by means of advanced methodologies and algorithms as well as high performance computing techniques. The cosRMC has many functions as criticality calculation, fixed-source calculation, burnup calculation, etc. In order to ensure its reliability, several types of verification and validation (V and V) work have been and are being carried out for cosRMC. The simulation results of cosRMC based on Problem 1 to 3 of VERA Core Physics Benchmark showed its good capability of 2D lattice and 3D assembly modeling. In this paper, some progressive verification results of multi-assembly and full core problems are presented.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

solveME: fast and reliable solution of nonlinear ME models

Background Genome-scale models of metabolism and macromolecular expression (ME) significantly expand the scope and predictive capabilities of constraint-based modeling. ME models present considerable computational challenges: they are much (>30 times) larger than corresponding metabolic reconstructions (M models), are multiscale, and growth maximization is a nonlinear programming (NLP) problem, mainly due to macromolecule dilution constraints. Results Here, we address these computational challenges. We develop a fast and numerically reliable solution method for growth maximization in ME models using a quad-precision NLP solver (Quad MINOS). Our method was up to 45 % faster than binary search for six significant digits in growth rate. We also develop a fast, quad-precision flux variability analysis that is accelerated (up to 60× speedup) via solver warm-starts. Finally, we employ the tools developed to investigate growth-coupled succinate overproduction, accounting for proteome constraints. Conclusions Just as genome-scale metabolic reconstructions have become an invaluable tool for computational and systems biologists, we anticipate that these fast and numerically reliable ME solution methods will accelerate the wide-spread adoption of ME models for researchers in these fields.

Biochemistry & Molecular Biology↗

SU-D-BRD-02: A Web-Based Image Processing and Plan Evaluation Platform (WIPPEP) for Future Cloud-Based Radiotherapy

Purpose: Visualization and processing of medical images and radiation treatment plan evaluation have traditionally been constrained to local workstations with limited computation power and ability of data sharing and software update. We present a web-based image processing and planning evaluation platform (WIPPEP) for radiotherapy applications with high efficiency, ubiquitous web access, and real-time data sharing. Methods: This software platform consists of three parts: web server, image server and computation server. Each independent server communicates with each other through HTTP requests. The web server is the key component that provides visualizations and user interface through front-end web browsers and relay information to the backend to process user requests. The image server serves as a PACS system. The computation server performs the actual image processing and dose calculation. The web server backend is developed using Java Servlets and the frontend is developed using HTML5, Javascript, and jQuery. The image server is based on open source DCME4CHEE PACS system. The computation server can be written in any programming language as long as it can send/receive HTTP requests. Our computation server was implemented in Delphi, Python and PHP, which can process data directly or via a C++ program DLL. Results: This software platform is running on a 32-core CPU server virtually hosting the web server, image server, and computation servers separately. Users can visit our internal website with Chrome browser, select a specific patient, visualize image and RT structures belonging to this patient and perform image segmentation running Delphi computation server and Monte Carlo dose calculation on Python or PHP computation server. Conclusion: We have developed a webbased image processing and plan evaluation platform prototype for radiotherapy. This system has clearly demonstrated the feasibility of performing image processing and plan evaluation platform through a web browser and exhibited potential for future cloud based radiotherapy.

60 APPLIED LIFE SCIENCES↗

I/O Access Patterns in HPC Applications: A 360-Degree Survey

The high-performance computing I/O stack has been complex due to multiple software layers, the inter-dependencies among these layers, and the different performance tuning options for each layer. In this complex stack, the definition of an “I/O access pattern” has been reappropriated to describe what an application is doing to write or read data from the perspective of different layers of the stack, often comprising a different set of features. It has become common to have to redefine what is meant when discussing a pattern in every new study, as no assumption can be made. This survey aims to propose a baseline taxonomy, harnessing the I/O community’s knowledge over the past 20 years. This definition can serve as a common ground for high-performance computing I/O researchers and developers to apply known I/O tuning strategies and design new strategies for improving I/O performance. We seek to summarize and bring a consensus to the multiple ways to describe a pattern based on common features already used by the community over the years.

97 MATHEMATICS AND COMPUTING↗

Machine learning for arbitrary single-qubit rotations on an embedded device

Here, in this study, we present a technique for using machine learning (ML) for single-qubit gate synthesis on field-programmable logic for a superconducting transmon-based quantum computer based on simulated studies. Our approach is multi-stage. We first “bootstrap” a model based on simulation with access to the full state vector for measuring gate fidelity. We next present an algorithm, named adapted randomized benchmarking (ARB), for fine-tuning the gate on hardware based on measurements of the devices. We also present techniques for deploying the model on programmable devices with care to reduce the required resources. While the techniques here are applied to a transmon-based computer, many of them are portable to other architectures.

97 MATHEMATICS AND COMPUTING↗

The ghost in the radiation: robust encodings of the black hole interior

We reconsider the black hole firewall puzzle, emphasizing that quantum error-correction, computational complexity, and pseudorandomness are crucial concepts for understanding the black hole interior. We assume that the Hawking radiation emitted by an old black hole is pseudorandom, meaning that it cannot be distinguished from a perfectly thermal state by any efficient quantum computation acting on the radiation alone. We then infer the existence of a subspace of the radiation system which we interpret as an encoding of the black hole interior. This encoded interior is entangled with the late outgoing Hawking quanta emitted by the old black hole, and is inaccessible to computationally bounded observers who are outside the black hole. Specifically, efficient operations acting on the radiation, those with quantum computational complexity polynomial in the entropy of the remaining black hole, commute with a complete set of logical operators acting on the encoded interior, up to corrections which are exponentially small in the entropy. Thus, under our pseudorandomness assumption, the black hole interior is well protected from exterior observers as long as the remaining black hole is macroscopic. On the other hand, if the radiation is not pseudorandom, an exterior observer may be able to create a firewall by applying a polynomial-time quantum computation to the radiation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adiabatic quantum computation along quasienergies

The parametric deformations of quasienergies and eigenvectors of unitary operators are applied to the design of quantum adiabatic algorithms. The conventional, standard adiabatic quantum computation proceeds along eigenenergies of parameter-dependent Hamiltonians. By contrast, discrete adiabatic computation utilizes adiabatic passage along the quasienergies of parameter-dependent unitary operators. For example, such computation can be realized by a concatenation of parameterized quantum circuits, with an adiabatic though inevitably discrete change of the parameter. A design principle of adiabatic passage along quasienergy was recently proposed: Cheon's quasienergy and eigenspace anholonomies on unitary operators is available to realize anholonomic adiabatic algorithms [A. Tanaka and M. Miyamoto, Phys. Rev. Lett. 98, 160407 (2007)], which compose a nontrivial family of discrete adiabatic algorithms. It is straightforward to port a standard adiabatic algorithm to an anholonomic adiabatic one, except an introduction of a parameter |v>, which is available to adjust the gaps of the quasienergies to control the running time steps. In Grover's database search problem, the costs to prepare |v> for the qualitatively different (i.e., power or exponential) running time steps are shown to be qualitatively different.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A divide-conquer-recombine algorithmic paradigm for large spatiotemporal quantum molecular dynamics simulations

We introduce an extension of the divide-and-conquer (DC) algorithmic paradigm called divide-conquer-recombine (DCR) to perform large quantum molecular dynamics (QMD) simulations on massively parallel supercomputers, in which interatomic forces are computed quantum mechanically in the framework of density functional theory (DFT). In DCR, the DC phase constructs globally informed, overlapping local-domain solutions, which in the recombine phase are synthesized into a global solution encompassing large spatiotemporal scales. For the DC phase, we design a lean divide-and-conquer (LDC) DFT algorithm, which significantly reduces the prefactor of the O(N) computational cost for N electrons by applying a density-adaptive boundary condition at the peripheries of the DC domains. Our globally scalable and locally efficient solver is based on a hybrid real-reciprocal space approach that combines: (1) a highly scalable real-space multigrid to represent the global charge density; and (2) a numerically efficient plane-wave basis for local electronic wave functions and charge density within each domain. Hybrid space-band decomposition is used to implement the LDC-DFT algorithm on parallel computers. A benchmark test on an IBM Blue Gene/Q computer exhibits an isogranular parallel efficiency of 0.984 on 786 432 cores for a 50.3 × 10{sup 6}-atom SiC system. As a test of production runs, LDC-DFT-based QMD simulation involving 16 661 atoms is performed on the Blue Gene/Q to study on-demand production of hydrogen gas from water using LiAl alloy particles. As an example of the recombine phase, LDC-DFT electronic structures are used as a basis set to describe global photoexcitation dynamics with nonadiabatic QMD (NAQMD) and kinetic Monte Carlo (KMC) methods. The NAQMD simulations are based on the linear response time-dependent density functional theory to describe electronic excited states and a surface-hopping approach to describe transitions between the excited states. A series of techniques are employed for efficiently calculating the long-range exact exchange correction and excited-state forces. The NAQMD trajectories are analyzed to extract the rates of various excitonic processes, which are then used in KMC simulation to study the dynamics of the global exciton flow network. This has allowed the study of large-scale photoexcitation dynamics in 6400-atom amorphous molecular solid, reaching the experimental time scales.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Spatial Heterogeneities and Onset of Passivation Breakdown at Lithium Anode Interfaces

Effective passivation of lithium metal surfaces, and prevention of battery-shorting lithium dendrite growth, are critical for implementing lithium metal anodes for batteries with increased power densities. Nanoscale surface heterogeneities can be “hot spots” where anode passivation breaks down. Motivated by the observation of lithium dendrites in pores and grain boundaries in all-solid batteries, we examine lithium metal surfaces covered with Li 2 O and/or LiF thin films with grain boundaries in them. Electronic structure calculations show that at >0.25 V computed equilibrium overpotential Li 2 O grain boundaries with sufficiently large pores can accommodate Li0 atoms which aid e– leakage and passivation breakdown. Strain often accompanies Li insertion; applying an ~1.7% strain already lowers the computed overpotential to 0.1 V. Lithium metal nanostructures as thin as 12 Å are thermodynamically favored inside cracks in Li 2 O films, becoming “incipient lithium filaments”. LiF films are more resistant to lithium metal growth. Finally, the models used herein should in turn inform passivating strategies in all-solid-state batteries.

25 ENERGY STORAGE↗