Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Automatic”

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,567 records · Page 87

Automatized full one-loop renormalization of the MSSM. II. The chargino-neutralino sector, the sfermion sector, and some applications

An on-shell renormalization program for the chargino/neutralino and the sfermion sectors within the minimal supersymmetric standard model as implemented in a fully automated code, sloops, for the calculation of one-loop processes at the colliders and in astrophysics, is presented. This is a sequel to our previous study where an on-shell renormalization of the Higgs (and the gauge/fermion) sector is performed. The issue of mixing is treated in a unified and coherent manner in all these sectors, in particular, we give some new insight into the renormalization of the mixing angle in the sfermion sector. Like with the issue of tan{beta} in the Higgs sector, we discuss different schemes for the mixing in the sfermion sector. We also perform numerical comparisons between our code sloops and different results found in the literature. In particular, we consider loop corrections to the neutralino and sfermion masses, chargino pair production and stau pair production in e{sup +}e{sup -} colliders as well as a few decays of the heavier chargino. For all these observables, we analyze the tan{beta} scheme dependence using different definitions of this parameter and comment on the impact of using different renormalization of the mixing parameter in the sfermion sector.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Automatic projection image registration for nanoscale X-ray tomographic reconstruction

Novel developments in X-ray sources, optics and detectors have significantly advanced the capability of X-ray microscopy at the nanoscale. Depending on the imaging modality and the photon energy, state-of-the-art X-ray microscopes are routinely operated at a spatial resolution of tens of nanometres for hard X-rays or ~ 10 nm for soft X-rays. The improvement in spatial resolution, however, has led to challenges in the tomographic reconstruction due to the fact that the imperfections of the mechanical system become clearly detectable in the projection images.Without proper registration of the projection images, a severe point spread function will be introduced into the tomographic reconstructions, causing the reduction of the three-dimensional (3D) spatial resolution as well as the enhancement of image artifacts. In this work, the development of a method that iteratively performs registration of the experimentally measured projection images to those that are numerically calculated by reprojecting the 3D matrix in the corresponding viewing angles is shown. Multiple algorithms are implemented to conduct the registration, which corrects the translational and/ or the rotational errors. A sequence that offers a superior performance is presented and discussed. Going beyond the visual assessment of the reconstruction results, the morphological quantification of a battery electrode particle that has gone through substantial cycling is investigated. The results show that the presented method has led to a better quality tomographic reconstruction, which, subsequently, promotes the fidelity in the quantification of the sample morphology.

42 ENGINEERING↗

Automatic Black-Box Model Order Reduction using Radial Basis Functions

Finite elements methods have long made use of model order reduction (MOR), particularly in the context of fast freqeucny sweeps. In this paper, we discuss a black-box MOR technique, applicable to a many solution methods and not restricted only to spectral responses. We also discuss automated methods for generating a reduced order model that meets a given error tolerance. Numerical examples demonstrate the effectiveness and wide applicability of the method. With the advent of improved computing hardware and numerous fast solution techniques, the field of computational electromagnetics are progressed rapidly in terms of the size and complexity of problems that can be solved. Numerous applications, however, require the solution of a problem for many different configurations, including optimization, parameter exploration, and uncertainly quantification, where the parameters that may be changed include frequency, material properties, geometric dimensions, etc. In such cases, thousands of solutions may be needed, so solve times of even a few minutes can be burdensome. Model order reduction (MOR) may alleviate this difficulty by creating a small model that can be evaluated quickly. Many MOR techniques have been applied to electromagnetic problems over the past few decades, particularly in the context of fast frequency sweeps. Recent works have extended these methods to allow more than one parameter and to allow the parameters to represent material and geometric properties. There are still limitations with these methods, however. First, they almost always assume that the finite element method is used to solve the problem, so that the system matrix is a known function of the parameters. Second, although some authors have presented adaptive methods (e.g., [2]), the order of the model is often determined before the MOR process begins, with little insight about what order is actually needed to reach the desired accuracy. Finally, it not clear how to efficiently extend most methods to the multiparameter case. This paper address the above shortcomings be developing a method that uses a block-box approach to the solution method, is adaptive, and is easily extensible to many parameters.

42 ENGINEERING↗

Automatic Fault Characterization via Abnormality-Enhanced Classification

Enterprise and high-performance computing systems are growing extremely large and complex, employing hundreds to hundreds of thousands of processors and software/hardware stacks built by many people across many organizations. As the growing scale of these machines increases the frequency of faults, system complexity makes these faults difficult to detect and to diagnose. Current system management techniques, which focus primarily on efficient data access and query mechanisms, require system administrators to examine the behavior of various system services manually. Growing system complexity is making this manual process unmanageable: administrators require more effective management tools that can detect faults and help to identify their root causes. System administrators need timely notification when a fault is manifested that includes the type of fault, the time period in which it occurred and the processor on which it originated. Statistical modeling approaches can accurately characterize system behavior. However, the complex effects of system faults make these tools difficult to apply effectively. This paper investigates the application of classification and clustering algorithms to fault detection and characterization. We show experimentally that naively applying these methods achieves poor accuracy. Further, we design novel techniques that combine classification algorithms with information on the abnormality of application behavior to improve detection and characterization accuracy. Our experiments demonstrate that these techniques can detect and characterize faults with 65% accuracy, compared to just 5% accuracy for naive approaches.

97 MATHEMATICS AND COMPUTING↗

HPC Network Simulation Tuning via Automatic Extraction of Hardware Parameters

Popular HPC network interconnection simulators such as SST/macro provide a variety of configurable parameters to explore the design space of hardware components such as network interface cards (NIC), switches, and links among them. While such knobs provide flexibility to explore design trade-offs for novel hardware, manually configuring simulations for matching configurations of the existing hardware to focus on topology exploration can be cumbersome and error-prone, leading to widely inaccurate simulations. This challenge is compounded when specifications of various (proprietary) technologies are not readily available or intentionally omitted. In this work, we propose a framework to autotune the multiple network models’ simulation configurations within SST/macro using Tree-structured Parzen Estimator-based Bayesian optimization to observe the effect on simulation accuracy across different message regimes. These regimes consist of small to large message sizes and latency to bandwidth-bound messages. We provide a detailed analysis of the simulation error for four representative HPC systems. Our Bayesian optimization based autotuning framework for network models achieves a maximum of 5x improvement in accuracy over best-effort manual configurations based on available hardware specifications.

Simulation, autotuning↗

AutoReP: Automatic ReLU Replacement for Fast Private Network Inference

The proliferation of the Machine-Learning-As-A-Service (MLaaS) market has brought to light a number of clients’ data privacy and security concerns. One promising solution is private inference (PI) techniques using cryptographic primitives. These techniques often come with high computation and communication overhead associated with the non-linear operator such as ReLU. Several approaches have been developed in reducing the number of ReLU operations, however, they either require a heuristic threshold selection or introduce significant accuracy drop. This work presents AutoReP, a gradient-based framework for non-linear operators reduction that aims to mitigate these concerns from a systematic perspective. AutoReP automates the process of discrete selection of ReLU and polynomial functions on neurons to accelerate PI applications. We also introduce distribution-aware polynomial approximation (DaPa) to accurately approximate ReLUs under given distribution, preserving model expressivity. Our experimental results demonstrate significant accuracy improvements of 6.12% (94.31%, 12.9K ReLU budget, CIFAR-10), 8.39% (74.92%, 12.9K ReLU budget, CIFAR-100), and 9.45% (63.69%, 55K ReLU budget, Tiny-ImageNet) over current state-of-the-art methods, e.g., SNL. Morever, AutoReP is applied to EfficientNet-B2 on ImageNet dataset, and achieved 75.55% accuracy with 176.1 × ReLU budget reduction.

Peng, Hongwu↗

Deep Learning Scene Classification Experiments in Automatic Detection of Slums on Planetscope Imagery

Population growth is increasingly happening in slum settlements of the large urban centers in the Global South. The term "slum" encompasses a wide range of communities, located mostly in underserved areas, and often exhibiting distinct structural and functional informalities with a relatively high concentration of marginalized populations. To address the issues confronting slums for effective planning and development, including the realistic estimation of the resident population, identifying them accurately is fundamental. Given the disagreements over a universal definition, diverse characteristic features, and socio-political limitations, global detection of slums is a veritable challenge. In this paper, we present experiments in slum detection using a scene classification algorithm and 3-meter spatial resolution satellite imagery. We train and evaluate the model for slum detection in Mumbai, India for the year 2023 and test the temporal generalization of the trained model on Mumbai in 2020 and 2018. In addition, we explore the pathways toward geographic generalization to Kolkata and Delhi (India). We discuss several limitations in the workflow and model, situate our findings in the existing literature, and suggest improvements and alternatives. With this, we establish baseline methods and experiments as a first step towards developing an image-based global slum detection framework and algorithm. This work adds to the community discussion on methods, data challenges, and open questions related to the detection of slums globally. With this research, we hope to improve our understanding of human settlements, especially in critical areas, improve population estimates, and help measure progress towards the sustainable development goals.

Arndt, Jacob↗

Automatic Detection of Clear-Sky Periods From Irradiance Data

Recent degradation studies have illustrated the importance of considering cloud cover when calculating degradation rates, finding more reliable values when the data are restricted to clear sky periods. Several automated methods of determining clear sky periods have been previously developed, but parameterizing and testing the models has been difficult. Here, we use clear sky classifications determined from satellite data to develop an algorithm that determines clear sky periods using only measured irradiance values and modeled clear sky irradiance as inputs. This approach is tested on global horizontal irradiance (GHI) data from ground collectors at six sites across the United States and compared against independent satellite-based classifications. First, 30 separate models were optimized on each individual site at GHI data intervals of 1, 5, 10, 15, and 30 min (sampled on the first minute of the interval). The models had an average F 0.5 score of 0.949 ± 0.035 on a holdout test set. Next, optimizations were performed by aggregating data from different locations at the same interval, yielding one model per data interval. This paper yielded an average F 0.5 of 0.946 ± 0.037. A final, 'universal' optimization that was trained on data from all sites at all intervals provided an F 0.5 score of 0.943 ± 0.040. The optimizations all provide improvements on a prior, unoptimized clear sky detection algorithm that produces F 0.5 scores that average to 0.903 ± 0.067. Our paper indicates that a single algorithm can accurately classify clear sky periods across locations and data sampling intervals.

14 SOLAR ENERGY↗