Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “singular value decomposition”

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 55 records · Page 3

Dynamic mode decomposition with core sketch

With the increase in collected data volumes, either from experimental measurements or high fidelity simulations, there is an ever-growing need to develop computationally efficient tools to process, analyze, and interpret these datasets. Modal analysis techniques have gained great interest due to their ability to identify patterns in the data and extract valuable information about the system being considered. Dynamic mode decomposition (DMD) relies on elements of the Koopman approximation theory to compute a set of modes, each associated with a fixed oscillation frequency and a decay/growth rate. Extracting these details from large datasets can be computationally expensive due to the need to implement singular value decomposition of the input data matrix. Sketching algorithms have become popular in numerical linear algebra where statistical theoretic approaches are utilized to reduce the cost of major operations. A sketch of a matrix is another matrix, which is significantly smaller, but still sufficiently approximates the original system. We put forth an efficient DMD framework, SketchyDMD, based on a core sketching algorithm that captures information about the range and corange (their mutual relationship) of input data. The proposed sketching-based framework can accelerate various portions of the DMD routines, compared to classical methods that operate directly on the raw input data. We conduct numerical experiments using the spherical shallow water equations as a prototypical model in the context of geophysical flows. In conclusion, we show that the proposed SketchyDMD is superior to existing randomized DMD methods that are based on capturing only the range of the input data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modeling Aerial Gamma-Ray Backgrounds Using Non-negative Matrix Factorization

Airborne gamma-ray surveys are useful for many applications, ranging from geology and mining to public health and nuclear security. In all these contexts, the ability to decompose a measured spectrum into a linear combination of background source terms can provide useful insights into the data and lead to improvements in the techniques that use spectral energy windows. Multiple methods for the linear decomposition of spectra exist but are subject to various drawbacks, such as allowing negative photon fluxes or requiring detailed Monte Carlo modeling. In this work, we propose using non-negative matrix factorization (NMF) as a data-driven approach to spectral decomposition. Using aerial surveys that include flights over water, we demonstrate that the mathematical approach of NMF finds physically relevant structure in the aerial gamma-ray background, namely, that measured spectra can be expressed as the sum of nearby terrestrial emission, distant terrestrial emission, and radon and cosmic emission. Furthermore, these NMF background components are compared with the background components obtained by noise-adjusted singular value decomposition (NASVD), which contain negative photon fluxes and, thus, do not represent the emission spectra in as straightforward a way. Finally, we comment on the potential areas of research that are enabled by NMF decompositions, such as new approaches to spectral anomaly detection and data fusion.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Evaluation of data driven low-rank matrix factorization for accelerated solutions of the Vlasov equation

Low-rank methods have shown success in accelerating simulations of a collisionless plasma described by the Vlasov equation, but still rely on computationally costly linear algebra every time step. We propose a data-driven factorization method using artificial neural networks, specifically with convolutional layer architecture, that trains on existing simulation data. At inference time, the model outputs a low-rank decomposition of the distribution field of the charged particles, and we demonstrate that this step is faster than the standard linear algebra technique. Numerical experiments show that the method achieves comparable reconstruction accuracy for interpolation tasks, generalizing to unseen test data in a manner beyond just memorizing training data; patterns in factorization also inherently followed the same numerical trend as those within algebraic methods (e.g., truncated singular-value decomposition). However, when training on the first 70% of a time-series data and testing on the remaining 30%, the method fails to meaningfully extrapolate. Despite this limiting result, the technique may have benefits for simulations in a statistical steady-state or otherwise showing temporal stability. These results suggest that while the model offers a computationally efficient alternative for datasets with temporal stability, its current formulation is best suited for interpolation rather than for predicting future states in time-evolving systems. This study thus lays the groundwork for further refinement of neural network-based approaches to low-rank matrix factorization in high-dimensional plasma simulations.

97 MATHEMATICS AND COMPUTING↗

PythonFOAM: In-situ data analyses with OpenFOAM and Python

Here, we outline the development of a general-purpose Python-based data analysis tool for OpenFOAM. Our implementation relies on the construction of OpenFOAM applications that have bindings to data analysis libraries in Python. Double precision data in OpenFOAM is cast to a NumPy array using the NumPy C-API and Python modules may then be used for arbitrary data analysis and manipulation on flow-field information. We highlight how the proposed wrapper may be used for an in-situ online singular value decomposition (SVD) implemented in Python and accessed from the OpenFOAM solver PimpleFOAM. Here, 'in-situ' refers to a programming paradigm that allows for a concurrent computation of the data analysis on the same computational resources utilized for the partial differential equation solver. In addition, to demonstrate parallel deployments, we deploy a distributed SVD, which collects snapshot data across the ranks of a distributed simulation to compute the global left singular vectors. Crucially, both OpenFOAM and Python share the same message passing interface (MPI) communicator for this deployment which allows Python objects and functions to exchange NumPy arrays across ranks. Subsequently, we provide scaling assessments of this distributed SVD on multiple nodes of Intel Broadwell and KNL architectures for canonical test cases such as the large eddy simulations of a backward facing step and a channel flow at friction Reynolds number of 395. Finally, we demonstrate the deployment of a deep neural network for compressing the flow-field information using an autoencoder to demonstrate an ability to use state-of-the-art machine learning tools in the Python ecosystem.

97 MATHEMATICS AND COMPUTING↗

Neural network-based classification and regression of magnetohydrodynamic modes in tokamaks

We present a machine learning-based magnetohydrodynamic (MHD) classifier and regressor that utilizes real or complex-valued 3D magnetic sensor array data to determine neoclassical tearing mode (NTM) onset times in tokamaks with millisecond accuracy. The input dataset consists of poloidal profiles of complex Fourier amplitudes with an n = 1 toroidal mode number from 144 human-labeled ITER Baseline Scenario discharges in the DIII-D tokamak, spanning both tearing-dominated and sawtooth-dominated regimes. Since m, n = 2,1 NTMs frequently emerge alongside sawteeth at the same frequency in this scenario, the focus is on isolating the m = 1 and m = 2 components of the n = 1 MHD mode near the tearing onset. To improve model regularization and prediction stability, singular value decomposition was applied to balance the sawtooth and tearing datasets. The enriched datasets facilitated training neural networks that learn the key distinguishing features of sawtooth and tearing modes in the poloidal profiles of their magnetic amplitude and phase. When the modes occur independently, the networks achieve perfect classification due to the modes’ distinct characteristics and low measurement noise. In the more experimentally relevant case where both modes coexist, the networks maintain exceptional performance across key metrics. Tests on synthetic data with known ground truth demonstrate the superior accuracy of the neural network trained on complex-valued input compared to models using real amplitude, phase, or pseudo-complex data, achieving both a mean time delay and standard deviation below 1 ms. Notably, standard linear regression methods fitting the dominant singular modes to the data closely match the neural network’s performance. Applying these methods across a broad range of H-mode scenarios will enable future studies to systematically identify dominant NTM triggers as scenario-specific variables, paving the way for more effective tearing mode avoidance strategies in future fusion reactor designs.

machine learning↗

Computing rank‐revealing factorizations of matrices stored out‐of‐core

This paper describes efficient algorithms for computing rank-revealing factorizations of matrices that are too large to fit in main memory (RAM), and must instead be stored on slow external memory devices such as disks (out-of-core or out-of-memory). Traditional algorithms for computing rank-revealing factorizations (such as the column pivoted QR factorization and the singular value decomposition) are very communication intensive as they require many vector-vector and matrix-vector operations, which become prohibitively expensive when data is not in RAM. Randomization allows to reformulate new methods so that large contiguous blocks of the matrix are processed in bulk. The paper describes two distinct methods. The first is a blocked version of column pivoted Householder QR, organized as a “left-looking” method to minimize the number of the expensive write operations. The second method results employs a UTV factorization. It is organized as an algorithm-by-blocks to overlap computations and I/O operations. As it incorporates power iterations, it is much better at revealing the numerical rank. Numerical experiments on several computers demonstrate that the new algorithms are almost as fast when processing data stored on slow memory devices as traditional algorithms are for data stored in RAM.

97 MATHEMATICS AND COMPUTING↗

Sparse matrix‐vector and matrix‐multivector products for the truncated SVD on graphics processors

Summary Many practical algorithms for numerical rank computations implement an iterative procedure that involves repeated multiplications of a vector, or a collection of vectors, with both a sparse matrix and its transpose. Unfortunately, the realization of these sparse products on current high performance libraries often deliver much lower arithmetic throughput when the matrix involved in the product is transposed. In this work, we propose a hybrid sparse matrix layout, named CSRC, that combines the flexibility of some well‐known sparse formats to offer a number of appealing properties: (1) CSRC can be obtained at low cost from the popular CSR (compressed sparse row) format; (2) CSRC has similar storage requirements as CSR; and especially, (3) the implementation of the sparse product kernels delivers high performance for both the direct product and its transposed variant on modern graphics accelerators thanks to a significant reduction of atomic operations compared to a conventional implementation based on CSR. This solution thus renders considerably higher performance when integrated into an iterative algorithm for the truncated singular value decomposition (SVD), such as the randomized SVD or, as demonstrated in the experimental results, the block Golub–Kahan–Lanczos algorithm.

Aliaga, José I.↗

BCARS Simulated Phantom Dataset for Evaluation of Processing Pipelines

Broadband coherent anti-Stokes Raman scattering (BCARS) microscopy is a powerful label-free biological imaging technique, but the raw signal requires careful processing. The vibrationally resonant (Raman) fingerprint signal is usually small compared with instrumental noise sources and the nonresonant background (NRB) inherent in the BCARS signal. Fortunately, the NRB exhibits a systematic phase relationship with the coherent Raman response, acting as a heterodyne amplifier for the weak fingerprint signal. Due to this heterodyne effect, the Raman response can be recovered quantitatively and invariantly across different instruments, provided the NRB shape is known. Even with heterodyne amplification, the amplitudes of fingerprint signal components are often comparable to system noise. Singular value decomposition (SVD), which utilizes spatial information, is often employed for additional noise filtering. Consequently, finding optimal processing parameters to properly distinguish the NRB and Raman responses and suppress noise in the complex BCARS signal requires a reference system that realistically represents the spectral and spatial properties of BCARS signals obtained from biological samples. We present a digital tissue phantom that meets these criteria as a tool for testing candidate signal processing pipelines. The digital phantom is generated with simulated hyperspectral Raman images having system-specific noise and background characteristics. Here, we analyze phantom datasets with differing background and signal-to-noise conditions to evaluate their impact on the performance of multiple signal processing pipelines. Specifically, we investigate the application of a Butterworth filter-based routine to directly estimate the NRB from the BCARS signal. Additionally, we evaluate a Lorentzian wavelet transform as an alternative to the Hilbert transform for extracting the Raman spectrum from the BCARS signal. While we demonstrate this phantom for BCARS, it can be used for any spectroscopic Raman imaging approach.

Dixon, Jessica Z. [Georgia Institute of Technology↗

Mallat Scattering Transformation based surrogate for Magnetohydrodynamics

Abstract A Machine and Deep Learning (MLDL) methodology is developed and applied to give a high fidelity, fast surrogate for 2D resistive MagnetoHydroDynamic (MHD) simulations of Magnetic Liner Inertial Fusion (MagLIF) implosions. The resistive MHD code is used to generate an ensemble of implosions with different liner aspect ratios, initial gas preheat temperatures (that is, different adiabats), and different liner perturbations. The liner density and magnetic field as functions of x , y , and z were generated. The Mallat Scattering Transformation (MST) is taken of the logarithm of both fields and a Principal Components Analysis (PCA) is done on the logarithm of the MST of both fields. The fields are projected onto the PCA vectors and a small number of these PCA vector components are kept. Singular Value Decompositions of the cross correlation of the input parameters to the output logarithm of the MST of the fields, and of the cross correlation of the SVD vector components to the PCA vector components are done. This allows the identification of the PCA vectors vis-a-vis the input parameters. Finally, a Multi Layer Perceptron (MLP) neural network with ReLU activation and a simple three layer encoder/decoder architecture is trained on this dataset to predict the PCA vector components of the fields as a function of time. Details of the implosion, stagnation, and the disassembly are well captured. Examination of the PCA vectors and a permutation importance analysis of the MLP show definitive evidence of an inverse turbulent cascade into a dipole emergent behavior. The orientation of the dipole is set by the initial liner perturbation. The analysis is repeated with a version of the MST which includes phase, called Wavelet Phase Harmonics (WPH). While WPH do not give the physical insight of the MST, they can and are inverted to give field configurations as a function of time, including field-to-field correlations.

97 MATHEMATICS AND COMPUTING↗

Toward memory-efficient melt pool monitoring: a classification framework using event-based imaging and sparse sensing technique

Vision sensors like CMOS and CCD cameras are often used for in-process monitoring of melt pools in laser-based additive and welding processes, but they require transferring large amounts of data and computational processing resources. Event-based neuromorphic imagery, on the other hand, detects only the change in pixel intensity, thus potentially reducing the data amount and latency. With an event imager, this study develops a framework for melt pool condition classification, including image construction, time scale selection, optimal pixel selection, and sparse classification, to achieve a highly memory-efficient scheme. These are based on sparse sensing techniques with singular value decomposition (SVD) and QR pivoting, the two fundamental matrix transformations for linear dimensionality reduction. The framework is then validated by classifying a controlled experiment by exciting various mode shapes of liquid gallium pools of varying depths (3, 6, and 8 mm). At 200 pixels, the classifier can reach overall accuracy of 75%, while at 2000 pixels (0.013% of the total possible pixels), the accuracy is nearly 90% (89.86%). At the same number of pixels, random selection can only achieve 46% and 67%, respectively. The memory savings of the sparsely sampled event data compared to a conventional imager is about 500 times. In addition to performance, implementation and limitations of the framework are also discussed.

42 ENGINEERING↗

A Local Macroscopic Conservative (LoMaC) Low Rank Tensor Method for the Vlasov Dynamics

Abstract In this paper, we propose a novel Local Macroscopic Conservative (LoMaC) low rank tensor method for simulating the Vlasov-Poisson (VP) system. The LoMaC property refers to the exact local conservation of macroscopic mass, momentum and energy at the discrete level. This is a follow-up work of our previous development of a conservative low rank tensor approach for Vlasov dynamics ( arXiv:2201.10397 ). In that work, we applied a low rank tensor method with a conservative singular value decomposition to the high dimensional VP system to mitigate the curse of dimensionality, while maintaining the local conservation of mass and momentum. However, energy conservation is not guaranteed, which is a critical property to avoid unphysical plasma self-heating or cooling. The new ingredient in the LoMaC low rank tensor algorithm is that we simultaneously evolve the macroscopic conservation laws of mass, momentum and energy using a flux-difference form with kinetic flux vector splitting; then the LoMaC property is realized by projecting the low rank kinetic solution onto a subspace that shares the same macroscopic observables by a conservative orthogonal projection. The algorithm is extended to the high dimensional problems by hierarchical Tuck decomposition of solution tensors and a corresponding conservative projection algorithm. Extensive numerical tests on the VP system are showcased for the algorithm’s efficacy.

Guo, Wei↗

Ensemble Kalman filter for data assimilation coupled with low-resolution computations techniques applied in fluid dynamics

This paper presents an innovative Reduced-order model (ROM) for merging experimental and simulation data using data assimilation (DA) to estimate the "True" state of a fluid dynamics system, leading to more accurate predictions. Our methodology introduces a novel approach by implementing the ensemble Kalman filter (EnKF) within a reduced-dimensional framework, grounded in a robust theoretical foundation and applied to fluid dynamics. To address the substantial computational demands of DA, the proposed ROM employs low-resolution (LR) techniques to drastically reduce computational costs. This innovative approach involves downsampling datasets for DA computations, followed by an advanced reconstruction technique based on low-cost singular value decomposition (lcSVD). The lcSVD method, a key innovation in this paper, has never been applied to DA before and offers a highly efficient way to enhance resolution with minimal computational resources. Our results demonstrate significant reductions in both computation time and RAM usage through these LR techniques without compromising the accuracy of the estimations. For instance, in a turbulent test case, for a data compression rate of 15.9, the LR approach can achieve a speed-up of 13.7 and a RAM compression of 90.9% while maintaining a low relative root mean square error (RRMSE) of 2.6%, compared to 0.8% in the high-resolution (HR) reference. Furthermore, we highlight the effectiveness of the EnKF in estimating and predicting the state of fluid flow systems based on limited observations and given low-fidelity numerical data. This paper highlights the potential of the proposed DA method in fluid dynamics applications, particularly for improving computational efficiency in CFD and related fields. Its ability to balance accuracy with low computational and memory costs makes it especially suitable for large-scale and real-time applications, such as environmental monitoring or engineering design. This method will be incorporated into ModelFLOWs-app.

Data Assimilation↗

Towards a reliable assessment of charging effects during surface analysis: Accurate spectral shapes of ZrO 2 and Pd/ZrO 2 via X-ray Photoelectron Spectroscopy

X-ray Photoelectron Spectroscopy of large bandgap or insulating material surfaces relies on an effective mechanism that compensates for the emission (loss) of electrons by maintaining the material surface at a steady-state uniform potential. While a steady-state may be attained by utilizing an active compensation, such as low power electron emitting filament, there is the possibility that the surface potential is not uniform over the area analyzed, leading to peak shifts and incorrect spectral interpretation. Here, in this work, a spectral data processing method based on mapping the ZrO 2 and Pd/ZrO 2 surfaces utilizing photoemission peak binding energy is proposed, which provides information about the response of specific material surfaces to charge compensation. Spectromicroscopy of ZrO 2 and Pd/ZrO 2 surfaces without spatial information is used to monitor the efficacy of charge compensation. Exploiting counts distributed over many bins require the use of procedures and algorithms essential to practical mapping peak positions. Iterative singular value decomposition is therefore introduced and utilized as a means of efficiently delivering spatially resolved spectra from which binding energy for peaks is computed. The concepts developed in this work result in robust and accurate peak models of ZrO 2 and Pd/ZrO 2 that can be applied in XPS analysis of not only ZrO 2 but other large bandgap or insulating material surfaces. Supporting arguments for a peak model representing signal from Zr 3p and Pd 3d are developed within this work are presented.

36 MATERIALS SCIENCE↗

Use of Fisher's Ratio assisted multivariate curve resolution- alternating least squares for discovery-based analysis using ultrahigh pressure liquid chromatography-high resolution mass spectrometry

Non-targeted analysis of complex chemical mixtures can be difficult considering the convoluted nature of the matrix and the potential unknown chemical differences between samples or classes of samples. Ultrahigh pressure liquid chromatography coupled to quadrupole time-of-flight mass spectrometry (UHPLC-QTOF) is an ideal technique to probe chemical differences for a wide variety of samples. While UHPLC-QTOF can discover minute chemical differences down to low part per billion (ppb) concentrations with a high degree of confidence, the application of high-resolution mass spectrometry can yield massive amounts of information (∼ 10 gb per sample) that cannot be analyzed manually. Therefore, the application of chemometric techniques is mandatory for the interrogation of complex samples. Fisher's ratio (FR) assisted multivariate curve resolution-alternating least squares (MCR-ALS) was used to the discover and identify the chemical differences between two classes of materials: 1) a pond water matrix and 2) the matrix spiked with a pharmaceutical standard mix containing 17 compounds. Thirteen of the seventeen spiked compounds were discovered using FR analysis, and then five were successfully deconvoluted using MCR-ALS wherein the number of curves chosen were automatically determined using singular value decomposition (SVD). In conclusion, the use of an automated FR assisted MCR-ALS will aid in discovering trace levels of chemical components without the need for the researcher to provide potentially biased input which will aid in non-targeted workflow.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Jacobian-based model diagnostics and application to equation oriented modeling of a carbon capture system

It can be difficult to identify the specific variables or equations responsible for convergence issues in large mathematical programming models. The Institute for the Design of Advanced Energy Systems Integrated Platform (IDAES-IP) contains a tool to identify poorly scaled constraints and variables by searching for rows and columns of the Jacobian matrix with small L2-norms. A singular value decomposition is then performed to identify degenerate sets of equations and remaining scaling issues. Here, this work presents a flowsheet developed for post-combustion carbon capture using a monoethanolamine (MEA) solvent system as a case study. This work takes the reader through the entire process of model diagnostics and reformulation, from a basic introduction to the mathematics behind these model diagnostics to the reformulations necessary to make the model numerically robust, including a significantly modified enhancement factor model.

IDAES↗

Permutation-adapted complete and independent basis for atomic cluster expansion descriptors

Atomic cluster expansion (ACE) methods provide a systematic way to describe particle local environments of arbitrary body order. For practical applications it is often required that the basis of cluster functions be symmetrized with respect to rotations and permutations. Existing methodologies yield sets of symmetrized functions that are over-complete. These methodologies thus require an additional numerical procedure, such as singular value decomposition (SVD), to eliminate redundant functions. In this work, it is shown that analytical linear relationships for subsets of cluster functions may be derived using recursion and permutation properties of generalized Wigner symbols. From these relationships, subsets (blocks) of cluster functions can be selected such that, within each block, functions are guaranteed to be linearly independent. It is conjectured that this block-wise independent set of permutation-adapted rotation and permutation invariant (PA-RPI) functions forms a complete, independent basis for ACE. Along with the first analytical proofs of block-wise linear dependence of ACE cluster functions and other theoretical arguments, numerical results are offered to demonstrate this. The utility of the method is demonstrated in the development of an ACE interatomic potential for tantalum. Using the new basis functions in combination with Bayesian compressive sensing sparse regression, some high degree descriptors are observed to persist and help achieve high-accuracy models.

Angular momentum↗

DESPERATE: A Python Library for Processing and Denoising NMR Spectra

NMR spectroscopy is an inherently insensitive technique with respect to the amount of observable signal. A common element in all NMR spectra is random thermal noise that is often characterized by a signal-to-noise ratio (SNR). SNR can be generically improved experimentally with repetitive signal averaging or during post-processing with apodization; the former of which often results in long experimental times and the latter results in the loss of spectral resolution. Denoising techniques can instead be used during post-processing to enhance SNR without compromising resolution. The most common approach relies on the singular-value decomposition (SVD) to discard noisy components of NMR data. SVD-based approaches work well, such as Cadzow and PCA, but are computationally expensive when used for large datasets that are often encountered in NMR (e.g., Carr-Purcell/Meiboom-Gill and nD datasets). Herein, we describe the implementation of a new wavelet transform (WT) routine for the fast and robust denoising of 1D and 2D NMR spectra. Several simulated and experimental datasets are denoised with both SVD-based Cadzow or PCA and WT’s, and the resulting SNR enhancements and spectral uniformity are compared. WT denoising offers similar and improved denoising compared with SVD and operates faster by several orders-of-magnitude in some cases. Further, all denoising and processing routines used in this work are included in a free and open-source Python library called DESPERATE.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Principal Component Analysis of azimuthal flow in intermediate-energy heavy-ion reactions

Principal Component Analysis (PCA) via Singular Value Decomposition (SVD) of large datasets is an adaptive exploratory method to uncover natural patterns underlying the data. Several recent applications of the PCA-SVD to event-by-event single-particle azimuthal angle distribution matrices in ultra-relativistic heavy-ion collisions at RHIC-LHC energies indicate that the sine and cosine functions chosen a priori in the traditional Fourier analysis are naturally the most optimal basis for azimuthal flow studies according to the data itself. We perform PCA-SVD analyses of mid-central Au+Au collisions at $E$ $beam$ / $A$ =1.23 GeV simulated using an isospin-dependent Boltzmann-Uehling-Uhlenbeck (IBUU) transport model to address the following two questions: (1) if the principal components of the covariance matrix of nucleon azimuthal angle distributions in heavy-ion reactions around 1 GeV/nucleon are naturally sine and/or cosine functions and (2) what if any advantages the PCA-SVD may have over the traditional flow analysis using the Fourier expansion for studying the EOS of dense nuclear matter. In conclusion, we find that (1) in none of our analyses the principal components come out naturally as sine and/or cosine functions, (2) while both the eigenvectors and eigenvalues of the covariance matrix are appreciably EOS dependent, the PCA-SVD has no apparent advantage over the traditional Fourier analysis for studying the EOS of dense nuclear matter using the azimuthal collective flow in heavy-ion collisions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗