Search NASA⌕ Search

SEARCH · Search NASA

Results for “applied computing”

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

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

At least 1,585 records · Page 88

A machine-learning-aided data recovery approach for predicting multi-material thermal behaviors in advanced test reactor capsules

Instrumented experiments conducted at test reactors are essential to the deployment of new advanced reactor systems. Designing new experiments and generating data on specific reactor conditions require significant investments in terms of both time and cost. Finite element analysis software can be used to create high-fidelity models of experiment environments in order to support the actual experiments, but computation time remains a concern in terms of applying outcomes to real-time usage of data (e.g., a digital twin [DT]). Here, the present research proposes a machine-learning (ML) aided approach to making temperature and displacement predictions based on the thickness of the outer gas gap on the experimental capsule used for in-pile demonstration of a novel new thermal conductivity probe in the Advanced Test Reactor (ATR). This capsule consisted of U10Zr fuel, a rodlet, sodium, and inner and outer capsules. Gas gaps existed between the fuel and the rodlet, and between the inner and the outer capsule. The learning data pertained to an experimental capsule's radial distributions of temperature and displacement, as obtained based on Abaqus and the physical features. For the first step of ML sequence, the temperature was predicted using three positional parameters. Next, the displacement was predicted using seven additional parameters. Each physical feature was normalized in order to be both nondimensional and standardized. The temperature and displacement predictions showed good agreement with the simulation results in all cases involving interpolation and extrapolation. Furthermore, data similarity enhancement increased the similarity between the training and the target data, thereby increasing the predictive accuracy of the ML models. In certain extrapolation cases involving limited original ML model accuracy, data similarity enhancement and data recovery was able to somewhat improve this accuracy.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Cost-optimized Automated Variance Reduction for Highly Angle-dependent Radiation Transport Analyses [Dissertation]

Monte Carlo variance-reduction techniques that directly bias particle direction have historically received limited attention despite being useful for many radiation transport applications such as those in which radiation travels through large regions with a low probability of colliding. One such technique is known as DXTRAN (short for deterministic transport) in the MCNP Monte Carlo radiation transport code. Until now, effectively applying DXTRAN in calculations is largely based on empirical observations of computational performance. Optimal DXTRAN parameters are identified through manual iteration. This work develops new mathematical descriptions of the DXTRAN variance-reduction process and demonstrates a new automated variance-reduction method that applies these mathematical formulations to determine the optimal application of DXTRAN in a given problem.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Computer-Vision-Based Vibration Tracking Using a Digital Camera: A Sparse-Optical-Flow-Based Target Tracking Method

Computer-vision-based target tracking is a technology applied to a wide range of research areas, including structural vibration monitoring. However, current target tracking methods suffer from noise in digital image processing. In this paper, a new target tracking method based on the sparse optical flow technique is introduced for improving the accuracy in tracking the target, especially when the target has a large displacement. The proposed method utilizes the Oriented FAST and Rotated BRIEF (ORB) technique which is based on FAST (Features from Accelerated Segment Test), a feature detector, and BRIEF (Binary Robust Independent Elementary Features), a binary descriptor. ORB maintains a variety of keypoints and combines the multi-level strategy with an optical flow algorithm to search the keypoints with a large motion vector for tracking. Then, an outlier removal method based on Hamming distance and interquartile range (IQR) score is introduced to minimize the error. The proposed target tracking method is verified through a lab experiment—a three-story shear building structure subjected to various harmonic excitations. It is compared with existing sparse-optical-flow-based target tracking methods and target tracking methods based on three other types of techniques, i.e., feature matching, dense optical flow, and template matching. The results show that the performance of target tracking is greatly improved through the use of a multi-level strategy and the proposed outlier removal method. The proposed sparse-optical-flow-based target tracking method achieves the best accuracy compared to other existing target tracking methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Computational Analysis of Interactions of the Oral Microbiota

The human oral microbiome is a complex site containing many hundreds of species with the community response of this microbiome having a large effect on human health. The complexity of this site has spoken to the need for applying –omics techniques to better understand which microbial species are present, their contribution to the microbiome and how this may change as a function of disease. The kinds of datasets that emerge from these –omics studies require computational analysis to gain robust results. New research has also been focused on applying these methods to build computational networks and models that better describe the myriad of interactions between microbial species of the oral cavity and how this changes as a result of infection. In this work, I describe the state of the field at this point, what kinds of computational networks have been inferred and what they show. I also describe where the field is heading in the next few years and how more in depth –omics analysis can lead to more detailed models of interactions at this site and improve human health.

-omics↗

Study of serious adverse drug reactions using FDA-approved drug labeling and MedDRA

Background Adverse Drug Reactions (ADRs) are of great public health concern. FDA-approved drug labeling summarizes ADRs of a drug product mainly in three sections, i.e., Boxed Warning (BW), Warnings and Precautions (WP), and Adverse Reactions (AR), where the severity of ADRs are intended to decrease in the order of BW > WP > AR. Several reported studies have extracted ADRs from labeling documents, but most, if not all, did not discriminate the severity of the ADRs by the different labeling sections. Such a practice could overstate or underestimate the impact of certain ADRs to the public health. In this study, we applied the Medical Dictionary for Regulatory Activities (MedDRA) to drug labeling and systematically analyzed and compared the ADRs from the three labeling sections with a specific emphasis on analyzing serious ADRs presented in BW, which is of most drug safety concern. Results This study investigated New Drug Application (NDA) labeling documents for 1164 single-ingredient drugs using Oracle Text search to extract MedDRA terms. We found that only a small portion of MedDRA Preferred Terms (PTs), 3819 out of 21,920 or 17.42%, were observed in a whole set of documents. In detail, 466/3819 (12.0%) PTs were in BW, 2023/3819 (53.0%) were in WP, and 2961/3819 (77.5%) were in AR sections. We also found a higher overlap of top 20 occurring BW PTs with WP sections compared to AR sections. Within the MedDRA System Organ Class levels, serious ADRs (sADRs) from BW were prevalent in Nervous System disorders and Vascular disorders. A Hierarchical Cluster Analysis (HCA) revealed that drugs within the same therapeutic category shared the same ADR patterns in BW (e.g., nervous system drug class is highly associated with drug abuse terms such as dependence, substance abuse, and respiratory depression). Conclusions This study demonstrated that combining MedDRA standard terminologies with data mining techniques facilitated computer-aided ADR analysis of drug labeling. We also highlighted the importance of labeling sections that differ in seriousness and application in drug safety. Using sADRs primarily related to BW sections, we illustrated a prototype approach for computer-aided ADR monitoring and studies which can be applied to other public health documents.

59 BASIC BIOLOGICAL SCIENCES↗

A method for increasing expressivity of Gene Ontology annotations using a compositional approach

Background: The Gene Ontology project integrates data about the function of gene products across a diverse range of organisms, allowing the transfer of knowledge from model organisms to humans, and enabling computational analyses for interpretation of high-throughput experimental and clinical data. The core data structure is the annotation, an association between a gene product and a term from one of the three ontologies comprising the GO. Historically, it has not been possible to provide additional information about the context of a GO term, such as the target gene or the location of a molecular function. This has limited the specificity of knowledge that can be expressed by GO annotations. Results: The GO Consortium has introduced annotation extensions that enable manually curated GO annotations to capture additional contextual details. Extensions represent effector–target relationships such as localization dependencies, substrates of protein modifiers and regulation targets of signaling pathways and transcription factors as well as spatial and temporal aspects of processes such as cell or tissue type or developmental stage. We describe the content and structure of annotation extensions, provide examples, and summarize the current usage of annotation extensions. Conclusions: The additional contextual information captured by annotation extensions improves the utility of functional annotation by representing dependencies between annotations to terms in the different ontologies of GO, external ontologies, or an organism’s gene products. These enhanced annotations can also support sophisticated queries and reasoning, and will provide curated, directional links between many gene products to support pathway and network reconstruction.

59 BASIC BIOLOGICAL SCIENCES↗

Control System Applicable Use Assessment of the Secure Computing Corporation - Secure Firewall (Sidewinder)

Battelle’s National Security & Defense objective is, “applying unmatched expertise and unique facilities to deliver homeland security solutions. From detection and protection against weapons of mass destruction to emergency preparedness/response and protection of critical infrastructure, we are working with industry and government to integrate policy, operational, technological, and logistical parameters that will secure a safe future”. In an ongoing effort to meet this mission, engagements with industry that are intended to improve operational and technical attributes of commercial solutions that are related to national security initiatives are necessary. This necessity will ensure that capabilities for protecting critical infrastructure assets are considered by commercial entities in their development, design, and deployment lifecycles thus addressing the alignment of identified deficiencies and improvements needed to support national cyber security initiatives. The Secure Firewall (Sidewinder) appliance by Secure Computing was assessed for applicable use in critical infrastructure control system environments, such as electric power, nuclear and other facilities containing critical systems that require augmented protection from cyber threat. The testing was performed in the Pacific Northwest National Laboratory’s (PNNL) Electric Infrastructure Operations Center (EIOC). The Secure Firewall was tested in a network configuration that emulates a typical control center network and then evaluated. A number of observations and recommendations are included in this report relating to features currently included in the Secure Firewall that support critical infrastructure security needs.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Quantum Computer Scale-up

Quantum computers are creating buzz from Silicon Valley to the halls of Congress. But the hardware has only been prototyped at small scale. Could applying the engineering processes used to scale up semiconductors also accelerate quantum computer development?

97 MATHEMATICS AND COMPUTING↗

The need for application-based adaptation of deformable image registration

Purpose: To utilize a deformable phantom to objectively evaluate the accuracy of 11 different deformable image registration (DIR) algorithms. Methods: The phantom represents an axial plane of the pelvic anatomy. Urethane plastic serves as the bony anatomy and urethane rubber with three levels of Hounsfield units (HU) is used to represent fat and organs, including the prostate. A plastic insert is placed into the phantom to simulate bladder filling. Nonradiopaque markers reside on the phantom surface. Optical camera images of these markers are used to measure the positions and determine the deformation from the bladder insert. Eleven different DIR algorithms are applied to the full and empty-bladder computed tomography images of the phantom (fixed and moving volumes, respectively) to calculate the deformation. The algorithms include those from MIM Software (MIM) and Velocity Medical Solutions (VEL) and nine different implementations from the deformable image registration and adaptive radiotherapy toolbox for Matlab. These algorithms warp one image to make it similar to another, but must utilize a method for regularization to avoid physically unrealistic deformation scenarios. The mean absolute difference (MAD) between the HUs at the marker locations on one image and the calculated location on the other serves as a metric to evaluate the balance between image similarity and regularization. To demonstrate the effect of regularization on registration accuracy, an additional beta version of MIM was created with a variable smoothness factor that controls the emphasis of the algorithm on regularization. The distance to agreement between the measured and calculated marker deformations is used to compare the overall spatial accuracy of the DIR algorithms. This overall spatial accuracy is also utilized to evaluate the phantom geometry and the ability of the phantom soft-tissue heterogeneity to represent patient data. To evaluate the ability of the DIR algorithms to accurately transfer anatomical contours, the rectum is delineated on both the fixed and moving images. A Dice similarity coefficient is then calculated between the contour on the fixed image and that transferred, via the calculated deformation, from the moving to the fixed image. Results: The phantom possesses sufficient soft-tissue heterogeneity to act as a proxy for patient data. Large discrepancies appear between the algorithms and the measured ground-truth deformation. VEL yields the smallest mean spatial error and a Dice coefficient of 0.90. MIM produces the lowest MAD value and the highest Dice coefficient of 0.96, but creates the largest spatial errors. Increasing the MIM smoothness factor above the default value improves the overall spatial accuracy, but the factor associated with the lowest mean error decreases the Dice coefficient to 0.85. Conclusions: Different applications of DIR require disparate balances between image similarity and regularization. A DIR algorithm that is optimized only for its ability to transfer anatomical contours will yield large deformation errors in homogeneous regions, which is problematic for dose mapping. For this reason, these algorithms must be tested for their overall spatial accuracy. The developed phantom is an objective tool for this purpose.

60 APPLIED LIFE SCIENCES↗

Investigations of Beam Dynamics Issues at Current and Future Hadron Accelerators (Final Report)

There is a synergy between the fields of Beam Dynamics (BD) in modern particle accelerators and Applied Mathematics (AMa). We have formulated significant problems in BD and have developed and applied tools within the contexts of dynamical systems, topological methods, numerical analysis and scientific computing, probability and stochastic processes, and mathematical statistics. We summarize the three main areas of our AMa work since 2011. First, we continued our study of Vlasov-Maxwell systems. Previously, we developed a state of the art algorithm and code (VM3@A) to calculate coherent synchrotron radiation in single pass systems. In this cycle we carefully analyzed the major expense, namely the integral-over-history (IOH), and developed two approaches to speed up integration. The first strategy uses a representation of the Bessel function J0 in terms of exponentials. The second relies on “local sequences” developed recently for radiation boundary conditions, which are used to reduce computational domains. Although motivated by practicality, both strategies involve interesting and rather deep analysis and approximation theory. As an alternative to VM3@A, we are integrating Maxwell’s equations by a time-stepping method, bypass- ing the IOH, using a Discontinuous Galerkin (DG) method. DG is a generalization of Finite Element and Finite Volume methods. It is spectrally convergent, unlike the commonly used Finite Difference methods, and can handle complicated vacuum chamber geometries. We have applied this in several contexts and have obtained very nice results including an explanation of an experiment at the Canadian Light Source, where the geometry is quite complex. Second, we continued our study of spin dynamics in storage rings. There is much current and proposed activity where spin polarized beams are being used in testing the Standard Model and its modifications. Our work has focused on invariant spin fields (ISFs) and amplitude dependent spin tunes (ADSTs), which are essential for estimating beam polarization. Several algorithms have been developed since the 1980s for computing the ISF, among them the Heinemann- Hoffstaetter method of stroboscopic averaging (SA) which is implemented in the code SPRINT. SA, which computes the ISF by using spin tracking data, can find the ISF to computer precision if it exists and thus can give evidence for existence of the ISF. Central to our work is resolving the ISF conjecture, which says that, off orbital resonance, an ISF exists. Thus Heinemann developed, in his 2010 PhD thesis, a new framework which unifies and generalizes the notions of ISF and ADST by using bundle theory. This lead to a long paper which was a major collaborative effort during the recent cycle. In a nutshell, our bundle approach elegantly unifies the dynamics of spin-1/2 and spin-1 particles, e.g., protons and deuterons. In fact it is well known that these two kinds of dynamics are driven by the same spin transfer matrix and in our approach one sees the deeper reason for this: the spin transfer matrix carries the natural dynamics of a principal bundle whereas the difference between the spin-1/2 and spin-1 dynamics lies in their different geometrical situation, i.e., different underlying associated bundles. Thus one arrives at new results for polarized beams, among them the Invariant Reduction Theorem (IRT) and the Cross Section Theorem (CST). The IRT gives a necessary and sufficient condition for the ISF to exist. The SA technique revealed, 20 years ago, that each ISF can be viewed as a complex agglomerate of spin tracking data. The bundle approach goes one step further by using the IRT and the CST to glue spin tracking data into agglomerates which are candidates for ISFs. We gain insight because the “good” agglomerates, in the presence of an ISF, are very different from the “bad” ones. Finally we mention that the bundle approach has analogies to the approach used in geometrical Yang-Mills theory. Third, we studied X-Ray Free Electron Lasers (FELs), which are electron accelerators producing coherent undulator radiation over a wide range of frequencies from microwaves to x-rays. The photon beams produced in FEL undulators are used to study material samples in biology, material science etc. We developed a mathematical analysis, based on the 6D Lorentz system, of energetic electrons moving through a planar undulator excited by a Maxwell traveling wave field of wavelength λ. Our Method of Averaging perturbation analysis yields non-resonant and near-to-resonant normal form approximations as a function of λ, which we present in two averaging theorems. We prove the theorems in detail, error bounds and giving a tutorial on mathematically rigorous perturbation theory in a context where proofs are easily understood. To our knowledge the planar problem has not been analyzed with the generality here nor has the standard FEL pendulum system, which appears on resonance, been derived with error bounds. In addition to the domains of validity of the normal forms we obtain new insights that require further study, including a more general low gain theory. With a firm foundation in the non-collective case above we are studying the 3D collective case from start up from noise to high gain and saturation. We have formulated the noise start up as a problem of going from the microscopic Klimontovich-Maxwell to the macroscopic Vlasov-Maxwell with a Vlasov correction term. In the 1D setting, we seek an alternative to the phenomenological Vlasov approach which models shot noise by a perturbation on an initial “smooth” density. The 1D wave equation with a Klimontovich source is often the starting point for the 1D FEL high gain theory. We have a new representation of solutions which may lead to new insights.

43 PARTICLE ACCELERATORS↗

Parallel exponential time differencing methods for geophysical flow simulations

Two ocean models are considered for geophysical flow simulations: the multilayer shallow water equations and the multilayer primitive equations. For the former, we investigate the parallel performance of exponential time differencing (ETD) methods, including exponential Rosenbrock–Euler, ETD2wave, and B-ETD2wave. For the latter, we take advantage of the splitting of barotropic and baroclinic modes and propose a new two-level method in which an ETD method is applied to solve the fast barotropic mode. Furthermore, these methods could improve the computational efficiency of numerical simulations because ETD methods allow for much larger time step sizes than traditional explicit time-stepping techniques that are commonly used in existing computational ocean models. Several standard benchmark tests for ocean modeling are performed and comparison of the numerical results demonstrates a great potential of applying the parallel ETD methods for simulating real-world geophysical flows.

54 ENVIRONMENTAL SCIENCES↗

Dynamic Species Reduction for Multi-Cycle CFD Simulations (Final Technical Report)

This project primarily sought to address some of the computational cost concerns of detailed simulations by developing improved methods of handling species transport, and chemical kinetics evaluation in a commercial 3D Computational Fluid Dynamics (CFD) environment. Secondary goals were to apply these techniques to fuels and conditions of interest to better understand the key species and reactions required to adequately capture cycle to cycle coupling. Improved modeling will lead to better understanding of these combustion modes and their dependence on fuel composition, which can then enable more clean and efficient engines, ultimately benefiting the consumer as well as the general public. Two approaches were used to address the computational cost. A “Dynamic Species Reduction” (DSR) procedure was developed to remove chemical species from the simulation during periods when chemical reactions were not expected to be important, particularly during gas exchange when temperatures are low and little fuel remains. This modelling procedure automatically detects relevant species to retain in the simulation domain based on their local concentration, removes species below a specified concentration threshold, and then adjusts the remaining species mass to conserve not only the number of H, C, and O atoms in each cell, but also the relative proportions between species and the heating value of the mixture in every cell. The second procedure was a “Product Directed Remapping” (PDR) updates the algorithm used to group individual computational cells for chemical kinetics evaluation to account for non-uniform temperature distributions and the CO to CO 2 ratio in the cells. The model techniques developed in this work successfully demonstrated computational performance improvements for a range of conditions relevant for Highly Dilute SI and HCCI engine operation. Runtime reductions of 10% were observed for small mechanisms, with further reductions of up to 36% observed for larger mechanisms. Improvements were primarily related to reducing the number of chemical species tracked during the gas exchange process using the Dynamic Species Reduction method. With smaller benefits observed from changes to the kinetics binning and evaluation strategy in the post combustion region using the PDR method. The results of this work show the potential for improved computational runtime for complicated simulations. They can and should be extended to additional conditions and new bio-derived and renewable fuels as they are developed and new kinetic mechanisms become available.

10 SYNTHETIC FUELS↗

Pickaxe: a Python library for the prediction of novel metabolic reactions

Abstract Background Biochemical reaction prediction tools leverage enzymatic promiscuity rules to generate reaction networks containing novel compounds and reactions. The resulting reaction networks can be used for multiple applications such as designing novel biosynthetic pathways and annotating untargeted metabolomics data. It is vital for these tools to provide a robust, user-friendly method to generate networks for a given application. However, existing tools lack the flexibility to easily generate networks that are tailor-fit for a user’s application due to lack of exhaustive reaction rules, restriction to pre-computed networks, and difficulty in using the software due to lack of documentation. Results Here we present Pickaxe, an open-source, flexible software that provides a user-friendly method to generate novel reaction networks. This software iteratively applies reaction rules to a set of metabolites to generate novel reactions. Users can select rules from the prepackaged JN1224min ruleset, derived from MetaCyc, or define their own custom rules. Additionally, filters are provided which allow for the pruning of a network on-the-fly based on compound and reaction properties. The filters include chemical similarity to target molecules, metabolomics, thermodynamics, and reaction feasibility filters. Example applications are given to highlight the capabilities of Pickaxe: the expansion of common biological databases with novel reactions, the generation of industrially useful chemicals from a yeast metabolome database, and the annotation of untargeted metabolomics peaks from an E. coli dataset. Conclusion Pickaxe predicts novel metabolic reactions and compounds, which can be used for a variety of applications. This software is open-source and available as part of the MINE Database python package ( https://pypi.org/project/minedatabase/ ) or on GitHub ( https://github.com/tyo-nu/MINE-Database ). Documentation and examples can be found on Read the Docs ( https://mine-database.readthedocs.io/en/latest/ ). Through its documentation, pre-packaged features, and customizable nature, Pickaxe allows users to generate novel reaction networks tailored to their application.

59 BASIC BIOLOGICAL SCIENCES↗

Evaluation of MOPITT Version 7 joint TIR–NIR X CO retrievals with TCCON

Observations of carbon monoxide (CO) from the Measurements Of Pollution In The Troposphere (MOPITT) instrument aboard the Terra spacecraft were expected to have an accuracy of 10 % prior to the launch in 1999. Here we evaluate MOPITT Version 7 joint (V7J) thermal-infrared and near-infrared (TIR–NIR) retrieval accuracy and precision and suggest ways to further improve the accuracy of the observations. We take five steps involving filtering or bias corrections to reduce scatter and bias in the data relative to other MOPITT soundings and ground-based measurements. (1) We apply a preliminary filtering scheme in which measurements over snow and ice are removed. (2) We find a systematic pairwise bias among the four MOPITT along-track detectors (pixels) on the order of 3–4 ppb with a small temporal trend, which we remove on a global scale using a temporally trended bias correction. (3) Using a small-region approximation (SRA), a new filtering scheme is developed and applied based on additional quality indicators such as the signal-to-noise ratio (SNR). After applying these new filters, the root-mean-squared error computed using the local median from the SRA over 16 years of global observations decreases from 3.84 to 2.55 ppb. (4) We also use the SRA to find variability in MOPITT retrieval anomalies that relates to retrieval parameters. We apply a bias correction to one parameter from this analysis. (5) After applying the previous bias corrections and filtering, we compare the MOPITT results with the GGG2014 ground-based Total Carbon Column Observing Network (TCCON) observations to obtain an overall global bias correction. These comparisons show that MOPITT V7J is biased high by about 6 %–8 %, which is similar to past studies using independent validation datasets on V6J. When using TCCON spectrometric column retrievals without the standard airmass correction or scaling to aircraft (WMO scale), the ground- and satellite-based observations overall agree to better than 0.5 %. GEOS-Chem data assimilations are used to estimate the influence of filtering and scaling to TCCON on global CO and tend to pull concentrations away from the prior fluxes and closer to the truth. We conclude with suggestions for further improving the MOPITT data products.

Hedelius, Jacob K. (ORCID:0000000320257519)↗

Classifier-guided sampling for discrete variable, discontinuous design space exploration: Convergence and computational performance

A classifier-guided sampling (CGS) method is introduced for solving engineering design optimization problems with discrete and/or continuous variables and continuous and/or discontinuous responses. The method merges concepts from metamodel-guided sampling and population-based optimization algorithms. The CGS method uses a Bayesian network classifier for predicting the performance of new designs based on a set of known observations or training points. Unlike most metamodeling techniques, however, the classifier assigns a categorical class label to a new design, rather than predicting the resulting response in continuous space, and thereby accommodates nondifferentiable and discontinuous functions of discrete or categorical variables. The CGS method uses these classifiers to guide a population-based sampling process towards combinations of discrete and/or continuous variable values with a high probability of yielding preferred performance. Accordingly, the CGS method is appropriate for discrete/discontinuous design problems that are ill-suited for conventional metamodeling techniques and too computationally expensive to be solved by population-based algorithms alone. In addition, the rates of convergence and computational properties of the CGS method are investigated when applied to a set of discrete variable optimization problems. Results show that the CGS method significantly improves the rate of convergence towards known global optima, on average, when compared to genetic algorithms.

42 ENGINEERING↗

SHF: Symmetrical Hierarchical Forest with Pretrained Vision Transformer Encoder for High-Resolution Medical Segmentation

This paper presents a novel approach to addressing the long-sequence problem in high-resolution medical images for Vision Transformers (ViTs). Using smaller patches as tokens can enhance ViT performance, but quadratically increases computation and memory requirements. Therefore, the common practice for applying ViTs to high-resolution images is either to: (a) employ complex sub-quadratic attention schemes or (b) use large to medium-sized patches and rely on additional mechanisms within the model to capture the spatial hierarchy of details. We propose Symmetrical Hierarchical Forest (SHF), a lightweight approach that adaptively patches the input image to increase token information density and encode hierarchical spatial structures into the input embedding. We then apply a reverse depatching scheme to the output embeddings of the transformer encoder, eliminating the need for convolution-based decoders. Unlike previous methods that modify attention mechanisms or use a complex hierarchy of interacting models, SHF can be retrofitted to any ViT model to allow it to learn the hierarchical structure of details in high-resolution images without requiring architectural changes. Experimental results demonstrate significant gains in computational efficiency and performance: on the PAIP WSI dataset, we achieved a 3∼32×speedup or a 2.95%∼7.03% increase in accuracy (measured by Dice score) at a 64K2 resolution with the same computational budget, compared to state-of-the-art production models. On the 3D medical datasets BTCV and KiTS, training was 6×faster, with accuracy gains of 6.93% and 5.9%, respectively, compared to models without SHF.

Zhang, Enzhi [Hokkaido University, Japan]↗

Efficient Algorithms for Convolutional Sparse Representations

When applying sparse representation techniques to images, the standard approach is to independently compute the representations for a set of overlapping image patches. This method performs very well in a variety of applications, but results in a representation that is multi-valued and not optimized with respect to the entire image. Additionally, an alternative representation structure is provided by a convolutional sparse representation, in which a sparse representation of an entire image is computed by replacing the linear combination of a set of dictionary vectors by the sum of a set of convolutions with dictionary filters. The resulting representation is both single-valued and jointly optimized over the entire image. While this form of a sparse representation has been applied to a variety of problems in signal and image processing and computer vision, the computational expense of the corresponding optimization problems has restricted application to relatively small signals and images. Here, this paper presents new, efficient algorithms that substantially improve on the performance of other recent methods, contributing to the development of this type of representation as a practical tool for a wider range of problems.

97 MATHEMATICS AND COMPUTING↗

Load‐balanced and locality‐aware scheduling for data‐intensive workloads at extreme scales

Summary Data‐driven programming models such as many‐task computing (MTC) have been prevalent for running data‐intensive scientific applications. MTC applies over‐decomposition to enable distributed scheduling. To achieve extreme scalability, MTC proposes a fully distributed task scheduling architecture that employs as many schedulers as the compute nodes to make scheduling decisions. Achieving distributed load balancing and best exploiting data locality are two important goals for the best performance of distributed scheduling of data‐intensive applications. Our previous research proposed a data‐aware work‐stealing technique to optimize both load balancing and data locality by using both dedicated and shared task ready queues in each scheduler. Tasks were organized in queues based on the input data size and location. Distributed key‐value store was applied to manage task metadata. We implemented the technique in MATRIX, a distributed MTC task execution framework. In this work, we devise an analytical suboptimal upper bound of the proposed technique, compare MATRIX with other scheduling systems, and explore the scalability of the technique at extreme scales. Results show that the technique is not only scalable but can achieve performance within 15% of the suboptimal solution. Copyright © 2015 John Wiley & Sons, Ltd.

Wang, Ke↗