Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Domain adaptation”

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 451 records · Page 25

A New ML-Based Adaptive Thinning Methodology to Improve the Impact of AIRS and CrIS Assimilation on Global Tropical Cyclone Forecasts

This work builds on previous research performed by this team to improve the forecast of Tropical Cyclones (TCs) by assimilating AIRS and CrIS radiances into the NASA Global Earth Observing System (GEOS). Past published work demonstrated that the assimilation of radiances with variable density was beneficial to TC forecasting in the GEOS. In the previous setup, a fixed-size moving square named 'TC domain' was activated by the so-called TC-vitals, an international real-time message accessible to all NWP forecasting centers, that documents the existence of a TC, its estimated position, and its size. The information from TC-vitals activated a switch in the GEOS, which allowed to reduce the distance used for thinning AIRS and CrIS data inside a 15 degrees by 15 degrees moving TC domain centered on the storm, so that more data were assimilated in the vicinity of the TC during its lifetime. The methodology produced improved TC analyses and led to better forecasts, particularly related to intensity, without damaging the global forecast skill. In the new version, the adaptive thinning methodology is based on a machine-learning technique. The technique searches for TCs and creates TC masks by using cloud-top temperatures from all geostationary satellites without the need for additional information. It is being trained against the International Best Track Archive for Climate Stewardship (IBTrACS) data base. Once a TC mask is created, a switch identical to the one used in the previous adaptive thinning method is activated, allowing the GEOS to ingest more data in the TC-shaped size-changing domain that follows the storm. As of today, the team has been able to successfully assimilate data inside the ML-detected TC domains. Future work includes an improved capability of reducing false alarm rates (i.e., cloud systems that are erroneously labeled as TCs).

Oreste Reale↗

Wideband Impedance Passivation of MMCs for Suppressing Harmonic Oscillations

Harmonic instability and associated oscillation events have become one of the main concerns in MMC-based HVdc systems. These oscillations can appear in the range from a few hundred hertz to several kilohertz, and the root cause is identified as delay-induced negative damping of MMC impedance appearing at the system resonance frequency. Here, this paper introduces a wideband impedance reshaping method through MMC control to eliminate such negative damping for both grid-following (GFL) and grid-forming (GFM) MMCs, which makes the MMC impedance completely passive from the second harmonic frequency upward, thus preventing all harmonic oscillations. First, simplified impedance models of MMCs are derived for the harmonic stability analysis and the impedance reshaping control design. Next, a passivity-based impedance reshaping method is presented, as well as practical considerations for its implementation. In addition, to maintain the MMC's disturbance ride-through capability, an adaptive activation scheme is developed, which enables the wideband impedance reshaping control only in the presence of harmonic oscillation events. The effectiveness of the proposed method is validated by frequency domain analysis and by electromagnetic transient (EMT) simulations of two typical MMC-based power systems.

17 WIND ENERGY↗

Overview of the Helios Version 2.0 Computational Platform for Rotorcraft Simulations

This article summarizes the capabilities and development of the Helios version 2.0, or Shasta, software for rotary wing simulations. Specific capabilities enabled by Shasta include off-body adaptive mesh refinement and the ability to handle multiple interacting rotorcraft components such as the fuselage, rotors, flaps and stores. In addition, a new run-mode to handle maneuvering flight has been added. Fundamental changes of the Helios interfaces have been introduced to streamline the integration of these capabilities. Various modifications have also been carried out in the underlying modules for near-body solution, off-body solution, domain connectivity, rotor fluid structure interface and comprehensive analysis to accommodate these interfaces and to enhance operational robustness and efficiency. Results are presented to demonstrate the mesh adaptation features of the software for the NACA0015 wing, TRAM rotor in hover and the UH-60A in forward flight.

Sankaran, Venkateswaran↗

Extension of the Time-Spectral Approach to Overset Solvers for Arbitrary Motion

Forced periodic flows arise in a broad range of aerodynamic applications such as rotorcraft, turbomachinery, and flapping wing configurations. Standard practice involves solving the unsteady flow equations forward in time until the initial transient exits the domain and a statistically stationary flow is achieved. It is often required to simulate through several periods to remove the initial transient making unsteady design optimization prohibitively expensive for most realistic problems. An effort to reduce the computational cost of these calculations led to the development of the Harmonic Balance method [1, 2] which capitalizes on the periodic nature of the solution. The approach exploits the fact that forced temporally periodic flow, while varying in the time domain, is invariant in the frequency domain. Expanding the temporal variation at each spatial node into a Fourier series transforms the unsteady governing equations into a steady set of equations in integer harmonics that can be tackled with the acceleration techniques afforded to steady-state flow solvers. Other similar approaches, such as the Nonlinear Frequency Domain [3,4,5], Reduced Frequency [6] and Time-Spectral [7, 8, 9] methods, were developed shortly thereafter. Additionally, adjoint-based optimization techniques can be applied [10, 11] as well as frequency-adaptive methods [12, 13, 14] to provide even more flexibility to the method. The Fourier temporal basis functions imply spectral convergence as the number of harmonic modes, and correspondingly number of time samples, N, is increased. Some elect to solve the equations in the frequency domain directly, while others choose to transform the equations back into the time domain to simplify the process of adding this capability to existing solvers, but each harnesses the underlying steady solution in the frequency domain. These temporal projection methods will herein be collectively referred to as Time-Spectral methods. Time-Spectral methods have demonstrated marked success in reducing the computational costs associated with simulating periodic forced flows, but have yet to be fully applied to overset or Cartesian solvers for arbitrary motion with dynamic hole-cutting. Overset and Cartesian grid methodologies are versatile techniques capable of handling complex geometry configurations in practical engineering applications, and the combination of the Time-Spectral approach with this general capability potentially provides an enabling new design and analysis tool. In an arbitrary moving-body scenario for these approaches, a Lagrangian body moves through a fixed Eulerian mesh and mesh points in the Eulerian mesh interior to the solid body are removed (cut or blanked), leaving a hole in the Eulerian mesh. During the dynamic motion some gridpoints in the domain are blanked and do not have a complete set of time-samples preventing a direct implementation of the Time-Spectral method. Murman[6] demonstrated the Time-Spectral approach for a Cartesian solver with a rigid domain motion, wherein the hole cutting remains constant. Similarly, Custer et al. [15, 16] used the NASA overset OVERFLOW solver and limited the amount of relative motion to ensure static hole-cutting and interpolation. Recently, Mavriplis and Mundis[17] demonstrated a qualitative method for applying the Time-Spectral approach to an unstructured overset solver for arbitrary motion. The goal of the current work is to develop a robust and general method for handling arbitrary motion with the Time-Spectral approach within an overset or Cartesian mesh method, while still approaching the spectral convergence rate of the original Time-Spectral approach. The viscous OVERFLOW solver will be augmented with the new Time-Spectral algorithm and the capability of the method for benchmark problems in rotorcraft and turbomachinery will be demonstrated. This abstract begins with a brief synopsis of the Time-Spectral approach for overset grids and provides details of e current approach to allow for arbitrary motion. Model problem results in one and two dimensions are included to demonstrate the viability of the method and the convergence properties. Section IV briefly outlines the implementation into the OVERFLOW solver, and the abstract closes with a description of the benchmark test cases which will be included in the final paper.

Leffell, Joshua Isaac↗

Deep learning for time series forecasting: a survey of recent advances

Time series forecasting plays a critical role in numerous real-world applications, such as finance, healthcare, transportation, and scientific computing. In recent years, deep learning has become a powerful tool for modeling complex temporal patterns and improving forecasting accuracy. This survey provides an overview of recent deep learning approaches for time series forecasting, involving various architectures including RNNs, CNNs, GNNs, transformers, large language models, MLP-based models, and diffusion models. We first identify key challenges in the field, such as temporal dependency, efficiency, and cross-variable dependency, which drive the development of forecasting techniques. Then, the general advantages and limitations of each architecture are discussed to contextualize their adaptation in time series forecasting. Furthermore, we highlight promising design trends like multi-scale modeling, decomposition, and frequency-domain techniques, which are shaping the future of the field. This paper serves as a compact reference for researchers and practitioners seeking to understand the current landscape and future trajectory of deep learning in time series forecasting.

97 MATHEMATICS AND COMPUTING↗

Insights into the Lysine Acetylome of the Haloarchaeon Haloferax volcanii during Oxidative Stress by Quantitative SILAC-Based Proteomics

Oxidative stress adaptation strategies are important to cell function and are linked to cardiac, neurodegenerative disease, and cancer. Representatives of the Archaea domain are used as model organisms based on their extreme tolerance to oxidants and close evolutionary relationship with eukaryotes. A study of the halophilic archaeon Haloferax volcanii reveals lysine acetylation to be associated with oxidative stress responses. The strong oxidant hypochlorite: (i) stimulates an increase in lysine acetyltransferase HvPat2 to HvPat1 abundance ratios and (ii) selects for lysine deacetylase sir2 mutants. Here we report the dynamic occupancy of the lysine acetylome of glycerol-grown H. volcanii as it shifts in profile in response to hypochlorite. These findings are revealed by the: (1) quantitative multiplex proteomics of the SILAC-compatible parent and Δsir2 mutant strains and (2) label-free proteomics of H26 ‘wild type’ cells. The results show that lysine acetylation is associated with key biological processes including DNA topology, central metabolism, cobalamin biosynthesis, and translation. Lysine acetylation targets are found conserved across species. Moreover, lysine residues modified by acetylation and ubiquitin-like sampylation are identified suggesting post-translational modification (PTM) crosstalk. Overall, the results of this study expand the current knowledge of lysine acetylation in Archaea, with the long-term goal to provide a balanced evolutionary perspective of PTM systems in living organisms.

59 BASIC BIOLOGICAL SCIENCES↗

Adaptive grid refinement for the Euler and compressible Navier-Stokes equations

The incorporation of a simple a posteriori adaptive mesh method into an explicit finite element based procedure for the solution of compressible flow problems is described. The re-interpolation problem is discussed and results are presented that indicate the improvement in solution quality which can be obtained via such an adaptive mesh approach. The method may lead to the appearance of some badly deformed elements which are removed from the domain of computation.

Lohner, R.↗

Applications of domain decomposition methods to turbomachinery flows

Domain decomposition techniques can be used to great advantage by computational fluid dynamicists in computing flows about complex geometries and adapting the grid to the solution. These techniques are particularly useful in computing flows about several bodies that are in relative motion such as rotor/stator configurations in turbomachinery or helicopter rotor/fuselage configurations. This paper discusses some of the basic ideas involved in transferring information between subdomains in a multidomain calculation and presents results for a simple rotor/stator configuration.

Rai, M. M.↗

Domain decomposition methods in computational fluid dynamics

The divide-and-conquer paradigm of iterative domain decomposition, or substructuring, has become a practical tool in computational fluid dynamic applications because of its flexibility in accommodating adaptive refinement through locally uniform (or quasi-uniform) grids, its ability to exploit multiple discretizations of the operator equations, and the modular pathway it provides towards parallelism. These features are illustrated on the classic model problem of flow over a backstep using Newton's method as the nonlinear iteration. Multiple discretizations (second-order in the operator and first-order in the preconditioner) and locally uniform mesh refinement pay dividends separately, and they can be combined synergistically. Sample performance results are included from an Intel iPSC/860 hypercube implementation.

Gropp, William D.↗

Domain decomposition methods in computational fluid dynamics

The divide-and-conquer paradigm of iterative domain decomposition, or substructuring, has become a practical tool in computational fluid dynamic applications because of its flexibility in accommodating adaptive refinement through locally uniform (or quasi-uniform) grids, its ability to exploit multiple discretizations of the operator equations, and the modular pathway it provides towards parallelism. These features are illustrated on the classic model problem of flow over a backstep using Newton's method as the nonlinear iteration. Multiple discretizations (second-order in the operator and first-order in the preconditioner) and locally uniform mesh refinement pay dividends separately, and they can be combined synergistically. Sample performance results are included from an Intel iPSC/860 hypercube implementation.

Gropp, William D.↗

A-Posteriori Error Estimation for Hyperbolic Conservation Laws with Constraint

This lecture considers a-posteriori error estimates for the numerical solution of conservation laws with time invariant constraints such as those arising in magnetohydrodynamics (MHD) and gravitational physics. Using standard duality arguments, a-posteriori error estimates for the discontinuous Galerkin finite element method are then presented for MHD with solenoidal constraint. From these estimates, a procedure for adaptive discretization is outlined. A taxonomy of Green's functions for the linearized MHD operator is given which characterizes the domain of dependence for pointwise errors. The extension to other constrained systems such as the Einstein equations of gravitational physics are then considered. Finally, future directions and open problems are discussed.

Barth, Timothy↗

OpenCGRA: An Open-Source Unified Framework for Modeling,Testing, and Evaluating CGRAs

Coarse-grained reconfigurable arrays (CGRAs),loosely defined as arrays of functional units (e.g, adder, sub-tractor, multiplier, divider, or larger multi-operation units, butsmaller than a general-purpose core) interconnected through aNetwork-on-Chip, provide higher flexibility than domain-specificASIC accelerators while offering increased hardware efficiencywith respect to fine-grained reconfigurable devices, such as FieldProgrammable Gate Arrays (FPGAs). The fast evolving fieldsof machine learning and edge computing, which are seeing acontinuous flow of novel algorithms and larger models, makeCGRAs ideal target architectures to allow domain specializationwithout loosing too much generality. They also generally offerquicker and more effective reconfigurability than FPGAs, po-tentially allowing adaptation during actual algorithm execution,and implement a dataflow programming paradigm that adaptswell to these emerging workloads. Designing and generating aCGRA, however, still requires to define the type and number ofthe specific functional units, implement their interconnect andthe network topology, and perform its simulation and validation,given a variety of workloads of interest.In this paper, we propose OpenCGRA, a Python-based unifiedframework that integrates generation, modeling, testing and eval-uation for CGRAs. OpenCGRA is the first open-source integratedframework able to support the full top-to-bottom design flow forspecializing and implementing CGRAs: modeling at different ab-straction levels (functional level, cycle level, register-transfer level),generation, simulation, testing at different granularities (unit test-ing, integration testing, property-based testing), and characteriza-tion (area, power, and timing). OpenCGRAs will be made availableon GitHub.

CGRA, synthesis↗

Incompressible viscous flows on adaptive, multi-block grids

Adaptive, multi-block grid solutions to incompressible viscous flows using a pseudocompressibility approach in generalized three-dimensional coordinates are presented. The multi-block approach described in this paper allows the user to compute flows in arbitrary geometries without the necessity of ad hoc modifications to the flow code. Complete grid continuity at block interfaces is assumed and block-to-block connectivity in a domain, including all boundary conditions, is specified by user input through the NAMELIST utility. Therefore, solution continuity across block interfaces is achieved through automatic communication among adjacent blocks. Also, adaptive grid generation is employed to enhance grid quality in response to the evolving solution in order to better resolve the flow field. Several two- and three-dimensional solutions are compared with equivalent non-adaptive solutions and available experimental data to validate the present method for both laminar and turbulent cases.

Kim, Young-Mog↗

Development of Collaborative Research Initiatives to Advance the Aerospace Sciences-via the Communications, Electronics, Information Systems Focus Group

The primary goal of the Adaptive Vision Laboratory Research project was to develop advanced computer vision systems for automatic target recognition. The approach used in this effort combined several machine learning paradigms including evolutionary learning algorithms, neural networks, and adaptive clustering techniques to develop the E-MOR.PH system. This system is capable of generating pattern recognition systems to solve a wide variety of complex recognition tasks. A series of simulation experiments were conducted using E-MORPH to solve problems in OCR, military target recognition, industrial inspection, and medical image analysis. The bulk of the funds provided through this grant were used to purchase computer hardware and software to support these computationally intensive simulations. The payoff from this effort is the reduced need for human involvement in the design and implementation of recognition systems. We have shown that the techniques used in E-MORPH are generic and readily transition to other problem domains. Specifically, E-MORPH is multi-phase evolutionary leaming system that evolves cooperative sets of features detectors and combines their response using an adaptive classifier to form a complete pattern recognition system. The system can operate on binary or grayscale images. In our most recent experiments, we used multi-resolution images that are formed by applying a Gabor wavelet transform to a set of grayscale input images. To begin the leaming process, candidate chips are extracted from the multi-resolution images to form a training set and a test set. A population of detector sets is randomly initialized to start the evolutionary process. Using a combination of evolutionary programming and genetic algorithms, the feature detectors are enhanced to solve a recognition problem. The design of E-MORPH and recognition results for a complex problem in medical image analysis are described at the end of this report. The specific task involves the identification of vertebrae in x-ray images of human spinal columns. This problem is extremely challenging because the individual vertebra exhibit variation in shape, scale, orientation, and contrast. E-MORPH generated several accurate recognition systems to solve this task. This dual use of this ATR technology clearly demonstrates the flexibility and power of our approach.

Knasel, T. Michael↗

Solution-Adaptive Cartesian Cell Approach for Viscous and Inviscid Flows

A Cartesian cell-based approach for adaptively refined solutions of the Euler and Navier-Stokes equations in two dimensions is presented. Grids about geometrically complicated bodies are generated automatically, by the recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, polygonal cut cells are created using modified polygon-clipping algorithms. The grid is stored in a binary tree data structure that provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite volume formulation. The convective terms are upwinded: A linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The results of a study comparing the accuracy and positivity of two classes of cell-centered, viscous gradient reconstruction procedures is briefly summarized. Adaptively refined solutions of the Navier-Stokes equations are shown using the more robust of these gradient reconstruction procedures, where the results computed by the Cartesian approach are compared to theory, experiment, and other accepted computational results for a series of low and moderate Reynolds number flows.

Coirier, William J.↗

Sensor Domain of Histidine Kinase VxrA of Vibrio cholerae : Hairpin-Swapped Dimer and Its Conformational Change

VxrA and VxrB are cognate histidine kinase (HK)-response regulator (RR) pairs of a two-component signaling system (TCS) found in Vibrio cholerae, a bacterial pathogen that causes cholera. The VxrAB TCS positively regulates virulence, the type VI secretion system, biofilm formation, and cell wall homeostasis in V. cholerae, providing protection from environmental stresses and contributing to the transmission and virulence of the pathogen. The VxrA HK has a unique periplasmic sensor domain (SD) and, remarkably, lacks a cytoplasmic linker domain between the second transmembrane helix and the dimerization and histidine phosphotransfer (DHp) domain, indicating that this system may utilize a potentially unique signal sensing and transmission TCS mechanism. Here, we have determined several crystal structures of VxrA-SD and its mutants. These structures reveal a novel structural fold forming an unusual β hairpin-swapped dimer. A conformational change caused by relative rotation of the two monomers in a VxrA-SD dimer could potentially change the association of transmembrane helices and, subsequently, the pairing of cytoplasmic DHp domains. Based on the structural observation, we propose a putative scissor-like closing regulation mechanism for the VxrA HK. IMPORTANCE V. cholerae has a dynamic life cycle, which requires rapid adaptation to changing external conditions. Two-component signal transduction (TCS) systems allow V. cholerae to sense and respond to these environmental changes. The VxrAB TCS positively regulates a number of important V. cholerae phenotypes, including virulence, the type six secretion system, biofilm formation, and cell wall homeostasis. Here, we provide the crystal structures of the VxrA sensor histidine kinase sensing domain and propose a mechanism for signal transduction. The cognate signal for VxrAB remains unknown; however, in this work we couple our structural analysis with functional assessments of key residues to further our understanding of this important TCS.

59 BASIC BIOLOGICAL SCIENCES↗

Enhancing Air Traffic Control Planning with Automatic Speech Recognition

The decisions made during the Federal Aviation Administration Air Traffic Control System Command Center's planning teleconferences hold significant sway over the National Airspace System. Held every two hours, these teleconferences convene air traffic managers and stakeholders from across the nation to discuss airspace conditions, weather, and constraints, leading to the formulation and adjustment of traffic management initiatives. Given the critical nature of these decisions, the need for accurate and efficient record-keeping is paramount. In recent years, the application of automatic speech recognition has gained popularity across diverse industries, including aviation. While traditional applications focus on transcribing air traffic control communication, this paper explores a unique application of automatic speech recognition by converting the audio from planning teleconferences into text transcriptions. This innovative approach addresses key challenges in the field, presenting potential benefits for quality assurance, real-time participation, and downstream natural language processing tasks. A notable breakthrough in the machine learning community, namely the transformer neural network architecture, forms the backbone of the proposed solution in this paper. The transformer architecture's role in this research represents a paradigm shift in the efficiency of automatic speech recognition models. By reducing the amount of in-domain training data required, this architecture allows for the fine-tuning of such models like Whisper, originally pretrained on vast English speech datasets. The adaptability of the transformer architecture proves invaluable in capturing the nuances of aviation terminology and specific language used in planning teleconferences. Leveraging the Whisper model as a baseline, our research details the fine-tuning and validation using a dataset comprising 20 hours of meticulously transcribed planning teleconferences. Notably, the baseline pretrained Whisper model exhibited a word error rate of 18.77%. Through the fine-tuning process, the model achieved a substantial improvement, demonstrating an impressive performance with a reduced word error rate of 6.82%. This substantial decrease in WER not only highlights the effectiveness of the transformer architecture but also emphasizes the practical advancements achieved through the application of automatic speech recognition in this specific domain. The utilization of automatic speech recognition in planning teleconferences in this work introduces several novelties. Firstly, the creation of text transcriptions offers a valuable tool for quality assurance and facilitates the efficient review of teleconferences. This is an important aspect of the proposed solution, given the time-sensitive and high-stakes nature of decisions made during these meetings. Furthermore, text-searchable transcriptions provide a streamlined approach for locating and validating critical information, potentially saving hours of manual effort in searching through audio recordings. Moreover, our research identifies a key use case for external facilities and stakeholders. In situations where attendance at the planning teleconference is not feasible, having access to text transcriptions in real-time or shortly after the teleconference ends, proves to be a time-saving and informative resource. This feature enhances collaboration and ensures that stakeholders can stay abreast of important discussions and decisions even in their absence. Despite the efficiency gains facilitated by the transformer architecture in automatic speech recognition technology, it is essential to acknowledge the human factors in data creation. Subject matter experts play a crucial role in accurately transcribing planning teleconferences due to the specificity and complexity of the information discussed. The research dataset, consisting of 20 hours of transcribed planning teleconferences, forms the foundation for fine-tuning and validating the Whisper model. The achieved word error rate of 6.82% demonstrates promising advancements, particularly in recognizing essential aviation terminology within the teleconferences. In conclusion, this paper presents a comprehensive exploration of the application of automatic speech recognition in Air Traffic Control System Command Center planning teleconferences, leveraging the transformer architecture for enhanced efficiency. The novel contributions lie in the improved accessibility of decision-making records, real-time participation opportunities for external stakeholders, and the potential for downstream natural language processing advancements. As the aviation industry continues to evolve, the integration of automatic speech recognition technologies holds the promise of revolutionizing decision-making processes and contributing to the overall safety and efficiency of air traffic management.

ATM↗

An Ontology for Requesting Distant Robotic Action: A Case Study in Naming and Action Identification for Planning on the Mars Exploration Rover Mission

This paper focuses on the development and use of the abbreviated names as well as an emergent ontology associated with making requests for action of a distant robotic rover during the 2003-2004 NASA Mars Exploration Rover (MER) mission, run by the Jet Propulsion Laboratory. The infancy of the domain of Martian telerobotic science, in which specialists request work from a rover moving through the landscape, as well as the need to consider the interdisciplinary teams involved in the work required an empirical approach. The formulation of this ontology is grounded in human behavior and work practice. The purpose of this paper is to identify general issues for an ontology of action (specifically for requests for action), while maintaining sensitivity to the users, tools and the work system within a specific technical domain. We found that this ontology of action must take into account a dynamic environment, changing in response to the movement of the rover, changes on the rover itself, as well as be responsive to the purposeful intent of the science requestors. Analysis of MER mission events demonstrates that the work practice and even robotic tool usage changes over time. Therefore, an ontology must adapt and represent both incremental change and revolutionary change, and the ontology can never be more than a partial agreement on the conceptualizations involved. Although examined in a rather unique technical domain, the general issues pertain to the control of any complex, distributed work system as well as the archival record of its accomplishments.

Wales, Roxana C.↗