Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization methods”

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 901 records · Page 50

An optimization‐based phase‐field method for continuous‐discontinuous crack propagation

Summary A new continuous‐discontinuous strategy for the computational modeling of crack propagation within the context of phase‐field models of fracture is presented. The method is designed to introduce and update a sharp crack surface within an evolving damage band and to enhance the kinematics of the finite element approximation accordingly. The proposed approach relies on three key elements. First, we propose the use of a crack length functional to provide a trigger for initiating a continuous to discontinuous transition. Next, the crack path identification is addressed by introducing the concept of an auxiliary damage field that varies with an extension of the sharp crack surface. The sharp crack surface is extended through an optimization algorithm, in which the difference between the auxiliary field and the actual damage field stemming from the phase‐field framework is minimized. Finally, a strong discontinuity is inserted in the wake of the diffuse crack tip with the extended finite element method, completing the continuous to discontinuous transition. Several benchmark problems in two‐dimensional quasi‐static fracture mechanics are presented to demonstrate the accuracy and robustness of the method.

Geelen, Rudy J. M.↗

Classical Optimal Control for Energy Minimization Based On Diffeomorphic Modulation under Observable-Response-Preserving Homotopy

In this work, we introduce the so-called “Classical Optimal Control Optimization” (COCO) method for global energy minimization based on the implementation of the diffeomorphic modulation under observable-response-preserving homotopy (DMORPH) gradient algorithm. A probe particle with time-dependent mass $m(t;β)$ and dipole $μ(r,t;β)$ is evolved classically on the potential energy surface $V(r)$ coupled to an electric field $E(t;β)$, as described by the time-dependent density of states represented on a grid, or otherwise as a linear combination of Gaussians generated by the k-means clustering algorithm. Control parameters $β$ defining $m(t;β), μ(r,t;β),$ and $E(t;β)$ are optimized by following the gradients of the energy with respect to $β,$ adapting them to steer the particle toward the global minimum energy configuration. We find that the resulting COCO algorithm is capable of resolving near-degenerate states separated by large energy barriers and successfully locates the global minima of golf potentials on flat and rugged surfaces, previously explored for testing quantum annealing methodologies and the quantum optimal control optimization (QuOCO) method. Preliminary results show successful energy minimization of multidimensional Lennard-Jones clusters. Beyond the analysis of energy minimization in the specific model systems investigated, we anticipate COCO should be valuable for solving minimization problems in general, including optimization of parameters in applications to machine learning and molecular structure determination.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Method and system for providing flexible reserve power for power grid

An optimization-based method and system is disclosed to enable heterogeneous loads and distributed energy resources (DERs) to participate in grid ancillary services, such as spinning and non-spinning reserves, and ramping reserves. The method includes receiving inputs for decision parameters for optimizing an objective for obtaining flexible reserve power, solving the objective for obtaining flexible reserve power, determining a reserve power schedule for a prediction horizon for providing flexible reserve power based on the objective, generating a service bid based on the reserve power schedule for the power grid; and when the service bid is accepted, providing flexible reserve power to the power grid based on the service bid.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Efficiency Calibration of 4{pi} NaI(Tl) Gamma-ray Detectors for Plane Sources - Paper 130

4{pi} NaI(Tl) detectors are useful for low level gamma activity measurements due to the near 4{pi} solid angle that can be obtained with them. An analytical theoretical approach is presented here to calculate the absolute efficiencies for this type of detectors. The approach depends on the accurate calculation of two important factors; the path length, d, the photon traverses within the active volume of a gamma detector, and the geometrical solid angle,{Omega}, subtended by the source to the detector at the point of entrance. These two factors are theoretically derived through a straightforward analytical approach. In this work, this model is extended to an isotropic radiating point source, and a thin circular disk source. The results of the present absolute efficiency values were compared with the experimental and M.C. method works reported in the literature. The present theoretical and the experimental efficiency values are in good agreement. The present approach offers a good method to calibrate 4{pi} NaI(Tl) detectors over a large energy range without the need for standard sources, as is the case for experimental methods, nor optimization of detector parameters as for Monte Carlo simulations. Discrepancies with experimental results are reduced to lower than 4%. (author)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Fermilab Automation of Coil Winding System

The automated coil winder project creates a repeatable, scalable method for producing superconducting magnet coils with increased accuracy and efficiency. The design uses an ortho cyclic winding method to achieve high fill factors by combining computer numerical control (CNC), microcontroller-based controls, and sophisticated optimization techniques. The method optimizes coil turns, core geometry, and current consumption by utilizing analytical models based on magnetic moment, Ohm’s law, and power constraints. For particle accelerator applications, prototype testing using a 3D-printed coil winder has shown enhanced winding repeatability, thermal management, and manufacturability.

Dzida, Rafal [Northern Illinois U.]↗

DeCOIL: Optimization of Degenerate Codon Libraries for Machine Learning-Assisted Protein Engineering

With advances in machine learning (ML)-assisted protein engineering, models based on data, biophysics, and natural evolution are being used to propose informed libraries of protein variants to explore. Synthesizing these libraries for experimental screens is a major bottleneck, as the cost of obtaining large numbers of exact gene sequences is often prohibitive. Degenerate codon (DC) libraries are a cost-effective alternative for generating combinatorial mutagenesis libraries where mutations are targeted to a handful of amino acid sites. However, existing computational methods to optimize DC libraries to include desired protein variants are not well suited to design libraries for ML-assisted protein engineering. To address these drawbacks, we present DEgenerate Codon Optimization for Informed Libraries (DeCOIL), a generalized method which directly optimizes DC libraries to be useful for protein engineering: to sample protein variants that are likely to have both high fitness and high diversity in the sequence search space. Using computational simulations and wet-lab experiments, we demonstrate that DeCOIL is effective across two specific case studies, with potential to be applied to many other use cases. DeCOIL offers several advantages over existing methods, as it is direct, easy-to-use, generalizable, and scalable. With accompanying software, DeCOIL can be readily implemented to generate desired informed libraries.

59 BASIC BIOLOGICAL SCIENCES↗

Layer Time Control for Large Scale Additive Manufacturing Using High Performance Computing

This work proposes to optimize an additive manufacturing AM process to reduce energy and printing cost. The polymer AM process is inherently dependent on the time-temperature history of each layer to maintain geometric tolerances and mechanical integrity. Our preliminary study shows that regression-based layer time control model using thermal images could result in up to 30% build time reduction for simple geometries. This proposed work would use high-performance computing (HPC) to couple the data-driven model with thermal simulation for better predicting layer temperature profiles, improving throughput of large-scale additive manufacturing, and reducing its energy cost. We have developed a method to optimize a layer deposition time (a.k.a. layer time) for large-scale AM via physics-based simulations. A long layer time leads to an over-cooled surface on which a new layer is deposited, and therefore, it may result in a weak bonding or debonding between layers, cracking, or warping. A short layer time leads to a high temperature of the structure due to insufficient cooling, and therefore, the structure may not be stiff enough and may collapse during manufacturing. Therefore, it is important to estimate the optimal layer time in additive manufacturing for a high-quality product. The temperature of a top layer right before deposition is recommended to be slightly higher than the glass temperature of the material. A temperature cooling was approximated to an exponential function of time, and the optimized layer time was obtained based on a target temperature while maintaining a minimal printing time. The material used is carbon fiber-reinforced polycarbonate (CF/PC), and the large-scale deposition system used is LSAM TM from Thermwood Corporation. Three different layer time cases were used for experiments, and a series of thermal images were obtained via an infra-red (IR) camera during the entire AM processes. AM process simulations were performed using a finite element method and the temperature profiles from the simulation were in good agreements with those from experiments. The layer time optimization was performed based on the temperature profiles from the simulations. A layer temperature with the optimal layer time was confirmed as the target temperature through simulation. In addition to the development of a layer time optimization method, we have developed a numerical framework for AM simulation with element activations in sync with toolpath, based on an open source finite element framework, DEAL.II. A major portion of this work was presented at SAMPE 2022 Conference and Exhibition on May 2022, and published in Proceedings of SAMPE 2022.

42 ENGINEERING↗

SU-E-T-367: Optimization of DLG Using TG-119 Test Cases and a Weighted Mean Approach

Purpose: Optimization of the dosimetric leaf gap (DLG) is an important step in commissioning the Eclipse treatment planning system for sliding window intensity-modulated radiation therapy (SW-IMRT) and RapidArc. Often the values needed for optimal dose delivery differ markedly from those measured at commissioning. We present a method to optimize this value using the AAPM TG-119 test cases. Methods: For SW-IMRT and RapidArc, TG-119 based test plans were created using a water-equivalent phantom. Dose distributions measured on film and ion chamber (IC) readings taken in low-gradient regions within the targets were analyzed separately. Since DLG is a single value per energy, SW-IMRT and RapidArc must be considered simultaneously. Plans were recalculated using a linear sweep from 0.02cm (the minimum DLG) to 0.3 cm. The calculated point doses were compared to the measured doses for each plan, and based on these comparisons an optimal DLG value was computed for each plan. TG-119 cases are designed to push the system in various ways, thus, a weighted mean of the DLG was computed where the relative importance of each type of plan was given a score from 0.0 to 1.0. Finally, SW-IMRT and RapidArc are assigned an overall weight based on clinical utilization. Our routine patient-QA (PQA) process was performed as independent validation. Results: For a Varian TrueBeam, the optimized DLG varied with σ = 0.044cm for SW-IMRT and σ = 0.035cm for RapidArc. The difference between the weighted mean SW-IMRT and RapidArc value was 0.038cm. We predicted utilization of 25% SW-IMRT and 75% RapidArc. The resulting DLG was ~1mm different than that found by commissioning and produced an average error of <1% for SW-IMRT and RapidArc PQA test cases separately. Conclusion: The weighted mean method presented is a useful tool for determining an optimal DLG value for commissioning Eclipse.

60 APPLIED LIFE SCIENCES↗

System and method of cylinder deactivation for optimal engine torque-speed map operation

This disclosure provides a system and method for determining cylinder deactivation in a vehicle engine to optimize fuel consumption while providing the desired or demanded power. In one aspect, data indicative of terrain variation is utilized in determining a vehicle target operating state. An optimal active cylinder distribution and corresponding fueling is determined from a recommendation from a supervisory agent monitoring the operating state of the vehicle of a subset of the total number of cylinders, and a determination as to which number of cylinders provides the optimal fuel consumption. Once the optimal cylinder number is determined, a transmission gear shift recommendation is provided in view of the determined active cylinder distribution and target operating state.

33 ADVANCED PROPULSION SYSTEMS↗

SU-E-T-258: Parallel Optimization of Beam Configurations for CyberKnife Treatments

Purpose: The CyberKnife delivers a large number of beams originating at different non-planar positions and with different orientation. We study how much the quality of treatment plans depends on the beams considered during plan optimization. Particularly, we evaluate a new approach to search for optimal treatment plans in parallel by running optimization steps concurrently. Methods: So far, no deterministic, complete and efficient method to select the optimal beam configuration for robotic SRS/SBRT is known. Considering a large candidate beam set increases the likelihood to achieve a good plan, but the optimization problem becomes large and impractical to solve. We have implemented an approach that parallelizes the search by solving multiple linear programming problems concurrently while iteratively resampling zero weighted beams. Each optimization problem contains the same set of constraints but different variables representing candidate beams. The search is synchronized by sharing the resulting basis variables among the parallel optimizations. We demonstrate the utility of the approach based on an actual spinal case with the objective to improve the coverage. Results: The objective function is falling and reaches a value of 5000 after 49, 31, 25 and 15 iterations for 1, 2, 4, and 8 parallel processes. This corresponds to approximately 97% coverage in 77%, 59%, and 36% of the mean number of iterations with one process for 2, 4, and 8 parallel processes, respectively. Overall, coverage increases from approximately 91.5% to approximately 98.5%. Conclusion: While on our current computer with uniform memory access the reduced number of iterations does not translate into a similar speedup, the approach illustrates how to effectively parallelize the search for the optimal beam configuration. The experimental results also indicate that for complex geometries the beam selection is critical for further plan optimization.

07 ISOTOPE AND RADIATION SOURCES↗

TAS: 89 0227: TAS Recovery Act - Optimization and Control of Electric Power Systems: ARRA

The name SuperOPF is used to refer several projects, problem formulations and soft-ware tools intended to extend, improve and re-define some of the standard methods of optimizing electric power systems. Our work included applying primal-dual interior point methods to standard AC optimal power flow problems of large size, as well as extensions of this problem to include co-optimization of multiple scenarios. The original SuperOPF problem formulation was based on co-optimizing a base scenario along with multiple post-contingency scenarios, where all AC power flow models and constraints are enforced for each, to find optimal energy contracts, endogenously determined locational reserves and appropriate nodal energy prices for a single period optimal power flow problem with uncertainty. This led to example non-linear programming problems on the order of 1 million constraints and half a million variables. The second generation SuperOPF formulation extends this by adding multiple periods and multiple base scenarios per period. It also incorporates additional variables and constraints to model load following reserves, ramping costs, and storage resources. A third generation of the multi-period SuperOPF, adds both integer variables and a receding horizon framework in which the problem type is more challenging (mixed integer), the size is even larger, and it must be solved more frequently, pushing the limits of currently available algorithms and solvers. The consideration of transient stability constraints in optimal power flow (OPF) problems has become increasingly important in modern power systems. Transient stability constrained OPF (TSCOPF) is a nonlinear optimization problem subject to a set of algebraic and differential equations. Solving a TSCOPF problem can be challenging due to (i) the differential-equation constraints in an optimization problem, (ii) the lack of a true analytical expression for transient stability in OPF. To handle the dynamics in TSCOPF, the set of differential equations can be approximated or converted into equivalent algebraic equations before they are included in an OPF formulation. In Chapter 4, a rigorous evaluation of using a predefined and fixed threshold for rotor angles as a mean to determine transient stability of the system is developed. TSCOPF can be modeled as a large-scale nonlinear programming problem including the constraints of differential-algebraic equations (DAE). Solving a TSCOPF problem can be challenging due to (i) the differential-equation constraints in an optimization problem, (ii) the lack of a true analytical expression for transient stability constraint in OPF. Unfortunately, even the current best TSCOPF solvers still suffer from the curse of dimensionality and unacceptable computational time, especially for large-scale power systems with multiple contingencies. In chapter 5, thse issues will be addressed and a new method to incorporate the transient stability constraints will be presented.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Synthesis of Nickel-Doped Ceria Catalysts for Selective Acetylene Hydrogenation

Metallic nickel is known to be an active, but not a selective hydrogenation catalyst for conversion of alkynes to alkenes. On the other hand, nickel oxide is not active. Recently, we have demonstrated that nickel doped into ceria provides an inexpensive catalyst for selective hydrogenation of acetylene in the presence of ethylene. Here, we evaluate various synthesis methods to achieve optimal selective hydrogenation performance. We examined incipient wetness impregnation, coprecipitation, solution combustion, and sol-gel synthesis to study how the method of preparation affects catalytic structure and behavior. Sol-gel synthesis, coprecipitation, and solution combustion synthesis methods favor nickel incorporation into the ceria lattice, while incipient wetness impregnation creates segregated nickel species on the ceria surface. For hydrogenation of acetylene, these nickel surface species lead to poor ethylene selectivity due to ethane and oligomer formation. However, when nickel is incorporated into the ceria lattice, ethane formation is prevented even while achieving 100 % conversion of acetylene. Coke formation is also significantly reduced on these catalysts compared to conventional nanoparticle counterparts. Finally, we conclude that sol-gel synthesis provides the optimal method for creating a uniform dopant distribution within the high surface area ceria.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems

Challenging combinatorial optimization problems are ubiquitous in science and engineering. Several quantum methods for optimization have recently been developed, in different settings including both exact and approximate solvers. Addressing this field of research, this manuscript has three distinct purposes. First, we present an intuitive method for synthesizing and analyzing discrete (i.e., integer-based) optimization problems, wherein the problem and corresponding algorithmic primitives are expressed using a discrete quantum intermediate representation (DQIR) that is encoding-independent. This compact representation often allows for more efficient problem compilation, automated analyses of different encoding choices, easier interpretability, more complex runtime procedures, and richer programmability, as compared to previous approaches, which we demonstrate with a number of examples. Second, we perform numerical studies comparing several qubit encodings; the results exhibit a number of preliminary trends that help guide the choice of encoding for a particular set of hardware and a particular problem and algorithm. Our study includes problems related to graph coloring, the traveling salesperson problem, factory/machine scheduling, financial portfolio rebalancing, and integer linear programming. Third, we design low-depth graph-derived partial mixers (GDPMs) up to 16-level quantum variables, demonstrating that compact (binary) encodings are more amenable to QAOA than previously understood. We expect this toolkit of programming abstractions and low-level building blocks to aid in designing quantum algorithms for discrete combinatorial problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU-F-J-09: Radioactive Seed Localization for Breast Lumpectomy - Towards Optimization

Purpose: The aim of this work is to propose a method to optimize radioactive source localization (RSL) for non-palpable breast cancer surgery. RSL is commonly used as a guiding technique during surgery for excision of non-palpable tumors. A collimated hand-held detector is used to localize radioactive sources implanted in tumors. Incisions made by the surgeon are based on maximum observed detector counts, and tumors are subsequently resected based on an arbitrary estimate of the counts expected at the surgical margin boundary. This work focuses on building a framework to predict detector counts expected throughout the procedure to improve surgical margins. Methods: A gamma detection system called the Neoprobe GDS was used for this work. The probe consists of a cesium zinc telluride crystal and a collimator. For this work, an I-125 Best Medical model 2301 source was used. The source was placed in three different phantoms, a PMMA, a Breast (25%- glandular tissue/75%- adipose tissue) and a Breast (75-25) phantom with a backscatter thickness of 6 cm. Counts detected by the probe were recorded with varying amounts of phantom thicknesses placed on top of the source. A calibration curve was generated using MATLAB based on the counts recorded for the calibration dataset acquired with the PMMA phantom. Results: The observed detector counts data used as the validation set was accurately predicted to within ±3.2%, ±6.9%, ±8.4% for the PMMA, Breast (75-25), Breast (25–75) phantom respectively. The average difference between predicted and observed counts was −0.4%, 2.4%, 1.4% with a standard deviation of 1.2 %, 1.8%, 3.4% for the PMMA, Breast (75-25), Breast (25–75) phantom respectively. Conclusion: The results of this work provide a basis for characterization of a detector used for RSL. Counts were predicted to within ±9% for three different phantoms without the application of a density correction factor.

60 APPLIED LIFE SCIENCES↗

Perturbing engine performance measurements to determine optimal engine control settings

Methods and systems for optimizing a performance of a vehicle engine are provided. The method includes determining an initial value for a first engine control parameter based on one or more detected operating conditions of the vehicle engine, determining a value of an engine performance variable, and artificially perturbing the determined value of the engine performance variable. The initial value for the first engine control parameter is then adjusted based on the perturbed engine performance variable causing the engine performance variable to approach a target engine performance variable. Operation of the vehicle engine is controlled based on the adjusted initial value for the first engine control parameter. These acts are repeated until the engine performance variable approaches the target engine performance variable.

33 ADVANCED PROPULSION SYSTEMS↗

DiaMonD: An Integrated Multifaceted Approach to Mathematics at the Interfaces of Data, Models, and Decisions

For many problems in computational science and engineering, the so-called forward problem-solution of the underlying mathematical model to yield output quantities of interest, given input parameters--is difficult enough for frontier complex models, which are often characterized by coupled multiphysics and possibly stochastic behavior over a wide range of length and time scales. However, we face the need to move beyond the forward problem, to address what is often the ultimate goal of CS&E: decision-making. This requires us to tackle a spectrum of mathematical problems that subsume, and are thus even more difficult than, the forward problem. First, given experimental data, we wish to estimate unknown parameters characterizing a model of a natural or engineered system by solving an inverse problem. Second, we seek the optimal con figuration of the system (or experiments) by solving an optimal design problem. Third, the optimal operation of the system must be determined by solving an optimal control problem. And fourth, we must quantify uncertainties as they propagate through all of the preceding problems, from data to model inference to prediction and finally to optimal design and control. Optimal mathematical methods and algorithms for such end-to-end, data-to-decisions modeling and simulation of complex problems--requiring integrated solution of forward, inverse, optimization, and UQ problems for large, multiphysics, multiscale models--entails challenges of the highest order, while also presenting great opportunities for applied mathematics research. Unfortunately, research on forward, inverse, optimization, and UQ problems has all-too-often progressed in isolation. This has led to mathematical methods that perform well when considering the forward simulation in isolation, but are prohibitive or suboptimal or unstable when combined with other methods within the framework of inversion, optimization, or UQ. The reverse is also true: general-purpose methods developed within the inversion, optimization, and UQ fields often become prohibitive when applied to complex CS&E problems since they do not exploit their structure. DiaMonD is a multi-institutional DOE MMICC effort that aims to address the challenges of end-to-end, data-to-decisions modeling and simulation for complex CS&E problems in a unifi ed, systematic, and integrated fashion. Institutions involved are Colorado State, Florida State, Los Alamos, MIT, Oak Ridge, Stanford, and UT-Austin. The goals of DiaMonD are (1) to develop advanced mathematical methods and analysis for multimodel, multiphysics, multiscale model problems driven by frontier DOE applications, including those in subsurface energy and environmental flows, materials for energy storage and conversion, and ice sheet dynamics; (2) to create theory and algorithms for integrated inversion, optimization, and uncertainty quantification for these complex problems; and (3) to disseminate the philosophy of an integrated end-to-end, data-to-decisions approach to modeling and simulation of complex problems to the broader applied math and computational science communities through workshops and other outreach.

97 MATHEMATICS AND COMPUTING↗

Gamma-ray timing of redback PSR J2339–0533: Hints for gravitational quadrupole moment changes

We present the results of precision gamma-ray timing measurements of the binary millisecond pulsar PSR J2339–0533, an irradiating system of the “redback” type, using data from the Fermi Large Area Telescope. We describe an optimized analysis method to determine a long-term phase-coherent timing solution spanning more than six years, including a measured eccentricity of the binary orbit and constraints on the proper motion of the system. A major result of this timing analysis is the discovery of an extreme variation of the nominal 4.6 hr orbital period P{sub orb} over time, showing alternating epochs of decrease and increase. We inferred a cyclic modulation of P{sub orb} with an approximate cycle duration of 4.2 yr and a modulation amplitude of ΔP{sub orb}/P{sub orb}=2.3×10{sup −7}. Considering different possible physical causes, the observed orbital-period modulation most likely results from a variable gravitational quadrupole moment of the companion star due to cyclic magnetic activity in its convective zone.

79 ASTRONOMY AND ASTROPHYSICS↗

DEVELOPMENT AND APPLICATION OF RISK ANALYSIS TOOLKIT FOR PLANT RESOURCE OPTIMIZATION

This paper presents the development of methods and tools that are being designed to optimize plant operations (e.g., maintenance/replacement schedules and optimal maintenance postures for plant components) in a manner that is more cost effective than current approaches and makes better use of available component health and cost data. These methods include both data- and model-based optimization methods. Model-based optimization methods directly include reliability and cost models to determine an optimal plant operational strategy. We consider gradient-based and evolutionary (based on genetic algorithms) optimization methods. The second class of methods target more specific use cases (e.g., project schedule optimization) and are not based on reliability models directly, but they require specific component reliability and cost data. This class of methods is based on variants of the knapsack problem with an aim to determine an optimal project schedule that maximizes the overall NPV. This paper also presents multi-objective methods designed to identify an optimal maintenance posture based on a Pareto frontier analysis. Rather than dictating the “right” tradeoff (i.e., identify the absolute best posture), we show how it is possible to perform a trade space exploration approach (i.e., identify value and costs of several postures and let the analysis account for desired value and cost metrics). This is performed by identifying maintenance postures that maximize value (e.g., system availability) and minimize operational costs, i.e., the Pareto frontier in a value-cost trade space. For all these methods we present detailed applicative examples that show their validity from a decision-making perspective.

97 - MATHEMATICS AND COMPUTING↗