Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimal sizing 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 865 records · Page 48

Scale effects on core design, fuel costs, and spent fuel volume of pressurized water reactors

The desire to improve the economic competitiveness and deployment pace of nuclear energy through modularization, manufacturing, and series production had led to the development of smaller size reactors. As the standard 17x17 fuel technology is mainly maintained in the pressurized water reactors (PWRs) category, this translates into a lower number of fuel assemblies in the core and sometimes a reduced fuel height. To assess the impact of such scale change in core design on fuel cycle cost and spent fuel volume, a scoping analysis tool is developed based on infinite lattice calculations, leakage, fuel management reduced models, and levelized unit cost of electricity (LCOE) estimate. As such, cost dynamics driven by fuel specific power, burnup, core leakage, feed, cycle length, fuel assembly height as well as uranium market data are captured with consistent set of assumptions and analysis methods. A selection of 5 reactor designs representative of leading PWR developers is assessed and compared. Pursuing higher specific powers and optimal burnups are highlighted as the main fuel cost reduction drivers, nevertheless, practical limitations and opportunities must be evaluated to establish the feasibility of such enhanced fuel operation. In consequence, a detailed core design is performed using SIMULATE3 code for 5 PWR variations including natural and forced coolant circulation modes, two reactor scales, power densities of 73, 112, and 123 kW/l and higher discharge burnups. Design and optimization are performed at the lattice level, for the reflector, and at the core loading level. Satisfactory steady-state operation including power distribution, coolant operating limits, and reactivity requirements are analyzed and reported in this paper. The fuel economics of the detailed core designs confirm the scoping analysis findings. Despite the unlocked power uprates in small PWRs, the achievable burnup for a given fuel specific power requires more enrichment and shorter fuel height results in higher fabrication costs per mass of fuel, which makes scaling down core size a more expensive endeavor on the fuel cycle front. Spent fuel volumes are reported for the PWRs designed in this paper. Furthermore, these volumes are driven by the core average discharge burnup regardless of the scale in consideration. Additional cost and core performance aspects related to heavy reflector gains, fuel-reflector substitution, and disposal cost policy in the U.S. are examined.

42 ENGINEERING↗

Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets

Scattered data interpolation is a problem of interest in numerous areas such as electronic imaging, smooth surface modeling, and computational geometry. Our motivation arises from applications in geology and mining, which often involve large scattered data sets and a demand for high accuracy. The method of choice is ordinary kriging. This is because it is a best unbiased estimator. Unfortunately, this interpolant is computationally very expensive to compute exactly. For n scattered data points, computing the value of a single interpolant involves solving a dense linear system of size roughly n x n. This is infeasible for large n. In practice, kriging is solved approximately by local approaches that are based on considering only a relatively small'number of points that lie close to the query point. There are many problems with this local approach, however. The first is that determining the proper neighborhood size is tricky, and is usually solved by ad hoc methods such as selecting a fixed number of nearest neighbors or all the points lying within a fixed radius. Such fixed neighborhood sizes may not work well for all query points, depending on local density of the point distribution. Local methods also suffer from the problem that the resulting interpolant is not continuous. Meyer showed that while kriging produces smooth continues surfaces, it has zero order continuity along its borders. Thus, at interface boundaries where the neighborhood changes, the interpolant behaves discontinuously. Therefore, it is important to consider and solve the global system for each interpolant. However, solving such large dense systems for each query point is impractical. Recently a more principled approach to approximating kriging has been proposed based on a technique called covariance tapering. The problems arise from the fact that the covariance functions that are used in kriging have global support. Our implementations combine, utilize, and enhance a number of different approaches that have been introduced in literature for solving large linear systems for interpolation of scattered data points. For very large systems, exact methods such as Gaussian elimination are impractical since they require 0(n(exp 3)) time and 0(n(exp 2)) storage. As Billings et al. suggested, we use an iterative approach. In particular, we use the SYMMLQ method, for solving the large but sparse ordinary kriging systems that result from tapering. The main technical issue that need to be overcome in our algorithmic solution is that the points' covariance matrix for kriging should be symmetric positive definite. The goal of tapering is to obtain a sparse approximate representation of the covariance matrix while maintaining its positive definiteness. Furrer et al. used tapering to obtain a sparse linear system of the form Ax = b, where A is the tapered symmetric positive definite covariance matrix. Thus, Cholesky factorization could be used to solve their linear systems. They implemented an efficient sparse Cholesky decomposition method. They also showed if these tapers are used for a limited class of covariance models, the solution of the system converges to the solution of the original system. Matrix A in the ordinary kriging system, while symmetric, is not positive definite. Thus, their approach is not applicable to the ordinary kriging system. Therefore, we use tapering only to obtain a sparse linear system. Then, we use SYMMLQ to solve the ordinary kriging system. We show that solving large kriging systems becomes practical via tapering and iterative methods, and results in lower estimation errors compared to traditional local approaches, and significant memory savings compared to the original global system. We also developed a more efficient variant of the sparse SYMMLQ method for large ordinary kriging systems. This approach adaptively finds the correct local neighborhood for each query point in the interpolation process.

Memarsadeghi, Nargess↗

Scalable multiscale modeling of platelets with 100 million particles

Here, we developed the core components of the AI-aided multiple time stepping algorithm for multiscale modeling of cell dynamics. This algorithm was implemented and analyzed on two supercomputer architectures with an application of simulating the aggregation of 250 platelets, or 102 million particles. To scale on these computers with complex memory and network architectures with GPUs, we devised a biomechanics-informed task mapping scheme to optimize load imbalance, communications, and memory utilization. Our simulations, scaling well up to 192 nodes on a Summit-like supercomputer with a peak speed of 11 petaflops, achieved a rate of 423 μs/day which is 500 times faster than the conventional algorithm using static time step and this has enabled studies of record size blood clots at record spatial–temporal resolutions. Additionally, we discovered the sensitive dependence of the scalability and execution time on the methods of decomposition, CPU–GPU coupling, and task mapping.

97 MATHEMATICS AND COMPUTING↗

Uncertainty quantification of mass models using ensemble Bayesian model averaging

Developments in the description of the masses of atomic nuclei have led to various nuclear mass models that provide predictions for masses across the whole chart of nuclides. These mass models play an important role in understanding the synthesis of heavy elements in the rapid neutron capture ( r ) process. However, it is still a challenging task to estimate the size of uncertainty associated with the predictions of each mass model. In this work, a method called ensemble Bayesian model averaging (EBMA) is introduced to quantify the uncertainty of one-neutron separation energies (S 1 n ) which are directly relevant in the calculations of r -process observables. Here, this Bayesian method provides a natural way to perform model averaging, selection, and uncertainty quantification, by combining the mass models as a mixture of normal distributions whose parameters are optimized against the experimental data, employing the Markov chain Monte Carlo method using the no-u-turn sampler. The EBMA model optimized with all the experimental S 1 n from the AME2003 nuclides are shown to provide reliable uncertainty estimates when tested with the new data in the AME2020.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Supersonic cruise research aircraft structural studies: Methods and results

NASA Langley Research Center SCAR in-house structural studies are reviewed. In methods development, advances include a new system of integrated computer programs called ISSYS, progress in determining aerodynamic loads and aerodynamically induced structural loads (including those due to gusts), flutter optimization for composite and metal airframe configurations using refined and simplified mathematical models, and synthesis of active controls. Results given address several aspects of various SCR configurations. These results include flutter penalties on composite wing, flutter suppression using active controls, roll control effectiveness, wing tip ground clearance, tail size effect on flutter, engine weight and mass distribution influence on flutter, and strength and flutter optimization of new configurations. The ISSYS system of integrated programs performed well in all the applications illustrated by the results, the diversity of which attests to ISSYS' versatility.

Sobieszczanski-Sobieski, J.↗

The space shuttle ascent vehicle aerodynamic challenges configuration design and data base development

The phase B Space Shuttle systems definition studies resulted in a generic configuration consisting of a delta wing orbiter, and two solid rocket boosters (SRB) attached to an external fuel tank (ET). The initial challenge facing the aerodynamic community was aerodynamically optimizing, within limits, this configuration. As the Shuttle program developed and the sensitivities of the vehicle to aerodynamics were better understood the requirements of the aerodynamic data base grew. Adequately characterizing the vehicle to support the various design studies exploded the size of the data base to proportions that created a data modeling/management challenge for the aerodynamicist. The ascent aerodynamic data base originated primarily from wind tunnel test results. The complexity of the configuration rendered conventional analytic methods of little use. Initial wind tunnel tests provided results which included undesirable effects from model support tructure, inadequate element proximity, and inadequate plume simulation. The challenge to improve the quality of test results by determining the extent of these undesirable effects and subsequently develop testing techniques to eliminate them was imposed on the aerodynamic community. The challenges to the ascent aerodynamics community documented are unique due to the aerodynamic complexity of the Shuttle launch. Never before was such a complex vehicle aerodynamically characterized. The challenges were met with innovative engineering analyses/methodology development and wind tunnel testing techniques.

Dill, C. C.↗

Conforming versus non-conforming boundary elements in three-dimensional elastostatics

A critical comparison of two basic formulations in three-dimensional elastostatics, using conforming and nonconforming boundary elements, is presented. The basic structure of the boundary element method is developed. The peculiarities that both types of boundary elements present in relation to the numerical implementation are discussed. Through selected examples, key issues such as the computational advantages and disadvantages of both formulations, mesh discretization and accuracy questions, and optimal location of the collocation nodes in the case of nonconforming elements are addressed. It is shown that conforming elements are able to produce more accurate results than nonconforming ones, with substantial economy in the final size of the system equations.

Manolis, G. D.↗

Multi-disciplinary optimization of aeroservoelastic systems

The purpose of the research project was to continue the development of new methods for efficient aeroservoelastic analysis and optimization. The main targets were as follows: to complete the development of analytical tools for the investigation of flutter with large stiffness changes; to continue the work on efficient continuous gust response and sensitivity derivatives; and to advance the techniques of calculating dynamic loads with control and unsteady aerodynamic effects. An efficient and highly accurate mathematical model for time-domain analysis of flutter during which large structural changes occur was developed in cooperation with Carol D. Wieseman of NASA LaRC. The model was based on the second-year work 'Modal Coordinates for Aeroelastic Analysis with Large Local Structural Variations'. The work on continuous gust response was completed. An abstract of the paper 'Continuous Gust Response and Sensitivity Derivatives Using State-Space Models' was submitted for presentation in the 33rd Israel Annual Conference on Aviation and Astronautics, Feb. 1993. The abstract is given in Appendix A. The work extends the optimization model to deal with continuous gust objectives in a way that facilitates their inclusion in the efficient multi-disciplinary optimization scheme. Currently under development is a work designed to extend the analysis and optimization capabilities to loads and stress considerations. The work is on aircraft dynamic loads in response to impulsive and non-impulsive excitation. The work extends the formulations of the mode-displacement and summation-of-forces methods to include modes with significant local distortions, and load modes. An abstract of the paper,'Structural Dynamic Loads in Response to Impulsive Excitation' is given in appendix B. Another work performed this year under the Grant was 'Size-Reduction Techniques for the Determination of Efficient Aeroservoelastic Models' given in Appendix C.

Karpel, Mardechay↗

Optimal Trajectories for the Helicopter in One-Engine-Inoperative Terminal-Area Operations

This paper presents a summary of a series of recent analytical studies conducted to investigate one-engine-inoperative (OEI) optimal control strategies and the associated optimal trajectories for a twin engine helicopter in Category-A terminal-area operations. These studies also examine the associated heliport size requirements and the maximum gross weight capability of the helicopter. Using an eight states, two controls, augmented point-mass model representative of the study helicopter, continued takeoff (CTO), rejected takeoff (RTO), balked landing (BL), and continued landing (CL) are investigated for both vertical-takeoff-and-landing (VTOL) and short-takeoff-and-landing (STOL) terminal-area operations. The formulation of the non-linear optimal control problems with considerations for realistic constraints, solution methods for the two-point boundary-value problem, a new real-time generation method for the optimal OEI trajectories, and the main results of this series of trajector optimization studies are presented. In particular, a new balanced-weight concept for determining the takeoff decision point for VTOL Category-A operations is proposed, extending the balanced-field length concept used for STOL operations.

Chen, Robert T. N.↗

PLUM: Parallel Load Balancing for Unstructured Adaptive Meshes

Dynamic mesh adaption on unstructured grids is a powerful tool for computing large-scale problems that require grid modifications to efficiently resolve solution features. Unfortunately, an efficient parallel implementation is difficult to achieve, primarily due to the load imbalance created by the dynamically-changing nonuniform grid. To address this problem, we have developed PLUM, an automatic portable framework for performing adaptive large-scale numerical computations in a message-passing environment. First, we present an efficient parallel implementation of a tetrahedral mesh adaption scheme. Extremely promising parallel performance is achieved for various refinement and coarsening strategies on a realistic-sized domain. Next we describe PLUM, a novel method for dynamically balancing the processor workloads in adaptive grid computations. This research includes interfacing the parallel mesh adaption procedure based on actual flow solutions to a data remapping module, and incorporating an efficient parallel mesh repartitioner. A significant runtime improvement is achieved by observing that data movement for a refinement step should be performed after the edge-marking phase but before the actual subdivision. We also present optimal and heuristic remapping cost metrics that can accurately predict the total overhead for data redistribution. Several experiments are performed to verify the effectiveness of PLUM on sequences of dynamically adapted unstructured grids. Portability is demonstrated by presenting results on the two vastly different architectures of the SP2 and the Origin2OOO. Additionally, we evaluate the performance of five state-of-the-art partitioning algorithms that can be used within PLUM. It is shown that for certain classes of unsteady adaption, globally repartitioning the computational mesh produces higher quality results than diffusive repartitioning schemes. We also demonstrate that a coarse starting mesh produces high quality load balancing, at a fraction of the cost required a fine initial mesh. Results indicate that our parallel load balancing strategy will remain viable on large numbers of processors.

Oliker, Leonid↗

Predicting Spacecraft Trajectories by the WeavEncke Method

A combination of methods is proposed of predicting spacecraft trajectories that possibly include multiple maneuvers and/or perturbing accelerations, with greater speed, accuracy, and repeatability than were heretofore achievable. The combination is denoted the WeavEncke method because it is based on unpublished studies by Jonathan Weaver of the orbit-prediction formulation of the noted astronomer Johann Franz Encke. Weaver evaluated a number of alternatives that arise within that formulation, arriving at an orbit-predicting algorithm optimized for complex trajectory operations. In the WeavEncke method, Encke's method of prediction of perturbed orbits is enhanced by application of modern numerical methods. Among these methods are efficient Kepler s-equation time-of-flight solutions and self-starting numerical integration with time as the independent variable. Self-starting numerical integration satisfies the requirements for accuracy, reproducibility, and efficiency (and, hence, speed). Self-starting numerical integration also supports fully analytic regulation of integration step sizes, thereby further increasing speed while maintaining accuracy.

Weaver, Jonathan K.↗

Joint Fleet Sizing and Charging System Planning for Autonomous Electric Vehicles

This paper studies the joint fleet sizing and charging system planning problem for a company operating a fleet of autonomous electric vehicles (AEVs) for passenger and goods transportation. Most of the relevant published papers focus on intracity scenarios and adopt heuristic approaches, e.g., agent based simulation, which do not guarantee optimality. In contrast, we propose a mixed integer linear programming model for intercity scenarios. This model incorporates comprehensive considerations of 1) limited AEV driving range; 2) optimal AEV routing and relocating operations; 3) time-varying origin-destination transport demands; and 4) differentiated operation cost structure of passenger and goods transportation. The proposed model can be computational expensive when the scale of the transportation network is large. We then exploit the structure of this program to expedite its solution. Numerical experiments are conducted to validate the proposed method. Our experimental results show that AEVs in passenger and goods transportation have remarkable planning and operation differences. We also demonstrate that intelligent routing and relocating operations, charging system and vehicle parameters, e.g., charging power, battery capacity, driving speed etc., can significantly affect the economic efficiency and the planning results of an AEV fleet.

33 ADVANCED PROPULSION SYSTEMS↗

TESS Discoveries

TESS discoveries have already become fruitful targets for HST follow up, and this will undoubtedly continue through the JWST era. In addition to providing targets for atmospheric characterization, TESS' Level One Science Requirement is to measure masses for 50 transiting planets smaller than 4 Earth radii. A full suite of ground based facilities will be working together to optimize the TESS science yield. Somewhat surprisingly though, no study has quantified the accuracy of mass constraints required to yield robust atmospheric properties of small planets. Previous work showed that the mass of a transiting exoplanet could be inferred from its transmission spectrum alone. The method leverages the effect of the planet's surface gravity on the atmospheric scale height, which in turn influences the transmission spectrum. However, significant degeneracies exist between transmission spectra of planets with different masses and compositions, making difficult to unambiguously determine the planet's mass and composition in many cases. I will present the first quantitative answer to this pressing question. Our analysis places definitive limits on how accurate mass constraints need to be in order to unambiguously determine atmospheric composition for a diverse array of planets ranging from terrestrial-size (TRAPPIST-1-like) to mini-Neptunes and hot Jupiters. These results broadly impact the community of scientists working on exoplanets -- from the full breadth of ground based observers conducting TESS follow-up, to those studying planet populations, and finally to those planning atmospheric investigations. This is particularly timely as the STScI Director charged the HST-TESS Advisory committee to report to the Space Telescope Users Committee on how HST can best support follow-up observations of TESS exoplanet discoveries. The community needs to determine optimal strategies for maximizing the rapid scientific return from TESS targets.

Batalha, Natasha E.↗

ELSI — An open infrastructure for electronic structure solvers

Routine applications of electronic structure theory to molecules and periodic systems need to compute the electron density from given Hamiltonian and, in case of non-orthogonal basis sets, overlap matrices. System sizes can range from few to thousands or, in some examples, millions of atoms. Different discretization schemes (basis sets) and different system geometries (finite non-periodic vs. infinite periodic boundary conditions) yield matrices with different structures. The ELectronic Structure Infrastructure (ELSI) project provides an open-source software interface to facilitate the implementation and optimal use of high-performance solver libraries covering cubic scaling eigensolvers, linear scaling density-matrix-based algorithms, and other reduced scaling methods in between. In this paper, we present recent improvements and developments inside ELSI, mainly covering (1) new solvers connected to the interface, (2) matrix layout and communication adapted for parallel calculations of periodic and/or spin-polarized systems, (3) routines for density matrix extrapolation in geometry optimization and molecular dynamics calculations, and (4) general utilities such as parallel matrix I/O and JSON output. The ELSI interface has been integrated into four electronic structure code projects (DFTB+, DGDFT, FHI-aims, SIESTA), allowing us to rigorously benchmark the performance of the solvers on an equal footing. Based on results of a systematic set of large-scale benchmarks performed with Kohn–Sham density-functional theory and density-functional tight-binding theory, we identify factors that strongly affect the efficiency of the solvers, and propose a decision layer that assists with the solver selection process. As a result, we describe a reverse communication interface encoding matrix-free iterative solver strategies that are amenable, e.g., for use with planewave basis sets.

97 MATHEMATICS AND COMPUTING↗

Black-box optimization of CT acquisition and reconstruction parameters: a reinforcement learning approach

Protocol optimization is critical in Computed Tomography (CT) for achieving desired diagnostic image quality while minimizing radiation dose. Due to the inter-effect of influencing CT parameters, traditional optimization methods rely on the testing of exhaustive combinations of these parameters. This poses a notable limitation due to the impracticality of exhaustive parameter testing. This study introduces a novel methodology leveraging Virtual Imaging Trials (VITs) and reinforcement learning to more efficiently optimize CT protocols. Computational phantoms with liver lesions were imaged using a validated CT simulator and reconstructed with a novel CT reconstruction Toolkit. The optimization parameter space included tube voltage, tube current, reconstruction kernel, slice thickness, and pixel size. The optimization process was done using a Proximal Policy Optimization (PPO) agent which was trained to maximize the Detectability Index (d’) of the liver lesion for each reconstructed image. Results showed that our reinforcement learning approach found the absolute maximum d’ across the test cases while requiring 79.7% fewer steps compared to an exhaustive search, demonstrating both accuracy and computational efficiency, offering a efficient and robust framework for CT protocol optimization. The flexibility of the proposed technique allows for use of varying image quality metrics as the objective metric to maximize for. Our findings highlight the advantages of combining VIT and reinforcement learning for CT protocol management.

Fenwick, David [Duke University Medical Center]↗

Machine learning enhanced characterization and optimization of photonic cured MAPbI 3 for efficient perovskite solar cells

Photonic curing (PC) can facilitate high-speed perovskite solar cell (PSC) manufacturing because it uses high-intensity light pulses to crystallize perovskite films in milliseconds. However, optimizing PC conditions is challenging due to its many variables, and using power conversion efficiency (PCE) as the optimization metric is both time-consuming and labor-intensive. This work presents a machine learning (ML) approach to optimize PC conditions for fabricating methylammonium lead iodide (MAPbI 3 ) films by quantitatively comparing their ultraviolet-visible (UV-vis) absorbance spectra to thermal annealed (TA) films using four similarity metrics. We perform Bayesian optimization coupled with Gaussian process regression (BO-GP) to minimize the similarity metrics. Refining PC conditions using active learning based on BO-GP models, we achieve a PC MAPbI3 film with an absorbance spectrum closely matching a TA reference film, which is further verified by its crystalline and morphological properties. Thus, we demonstrate that the UV-vis absorption spectrum can accurately proxy film quality. Additionally, we use an AI-based segmentation model for a more efficient grain size analysis. However, when we use the optimized PC condition to fabricate PSCs, we find that interaction between MAPbI 3 and the hole transport layer (HTL) during PC critically degrades the PSC performance. By adding a buffer layer between the HTL and MAPbI 3 , the optimized PC PSCs produce a champion PCE of 11.8%, comparable to the TA reference of 11.7%. Using UV-vis similarity metrics instead of device PCE as the objective in our BO-GP method accelerates the optimization of PC processing conditions for MAPbI 3 films.

14 SOLAR ENERGY↗

A tri-level optimization model for interdependent infrastructure network resilience against compound hazard events

Resilient operation of interdependent infrastructures against compound hazard events is essential for maintaining societal well-being. To address consequence assessment challenges in this problem space, we propose a novel policy-guided tri-level optimization model applied to a proof-of-concept case study with fuel distribution and transportation networks – encompassing one realistic network; one fictitious, yet realistic network; as well as networks drawn from three synthetic distributions. Mathematically, our approach takes the form of a defender-attacker-defender (DAD) model—a multi-agent tri-level optimization, comprised of a defender, attacker, and an operator acting in sequence. Here, in this study, our notional operator may choose proxy actions to operate an interdependent system comprised of fuel terminals and gas stations (functioning as supplies) and a transportation network with traffic flow (functioning as demand) to minimize unmet demand at gas stations. A notional attacker aims to hypothetically disrupt normal operations by reducing supply at the supply terminals, and the notional defender aims to identify best proxy defense policy options which include hardening supply terminals or allowing alternative distribution methods such as trucking reserve supplies. We solve our DAD formulation at a metropolitan scale and present practical defense policy insights against hypothetical compound hazards. We demonstrate the generalizability of our framework by presenting results for a realistic network; a fictitious, yet realistic network; as well as for three networks drawn from synthetic distributions. Additionally, we demonstrate the scalability of the framework by investigating runtime performance as a function of the network size. Steps for future research are also discussed.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Development of an optimized and scalable method for isolation of umbilical cord blood-derived small extracellular vesicles for future clinical use

Abstract Extracellular vesicles (EV) are a promising therapeutic tool in regenerative medicine. These particles were shown to accelerate wound healing, through delivery of regenerative mediators, such as microRNAs. Herein we describe an optimized and upscalable process for the isolation of EV smaller than 200 nm (sEV), secreted by umbilical cord blood mononuclear cells (UCB-MNC) under ischemic conditions and propose quality control thresholds for the isolated vesicles, based on the thorough characterization of their protein, lipid and RNA content. Ultrafiltration and size exclusion chromatography (UF/SEC) optimized methodology proved superior to traditional ultracentrifugation (UC), regarding production time, standardization, scalability, and vesicle yield. Using UF/SEC, we were able to recover approximately 400 times more sEV per mL of media than with UC, and upscaling this process further increases EV yield by about 3-fold. UF/SEC-isolated sEV display many of the sEV/exosomes classical markers and are enriched in molecules with anti-inflammatory and regenerative capacity, such as hemopexin and miR-150. Accordingly, treatment with sEV promotes angiogenesis and extracellular matrix remodeling, in vitro. In vivo, UCB-MNC-sEV significantly accelerate skin regeneration in a mouse model of delayed wound healing. The proposed isolation protocol constitutes a significant improvement compared to UC, the gold-standard in the field. Isolated sEV maintain their regenerative properties, whereas downstream contaminants are minimized. The use of UF/SEC allows for the standardization and upscalability required for mass production of sEV to be used in a clinical setting.

Cardoso, Renato M. S.↗