Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized algorithm”

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

PANTHER: Trajectory Analysis

We want to organize a body of trajectories in order to identify, search for, classify and predict behavior among objects such as aircraft and ships. Existing comparison functions such as the Fréchet distance are computationally expensive and yield counterintuitive results in some cases. We propose an approach using feature vectors whose components represent succinctly the salient information in trajectories. These features incorporate basic information such as total distance traveled and distance between start/stop points as well as geometric features related to the properties of the convex hull, trajectory curvature and general distance geometry. Additionally, these features can generally be mapped easily to behaviors of interest to humans that are searching large databases. Most of these geometric features are invariant under rigid transformation. We demonstrate the use of different subsets of these features to identify trajectories similar to an exemplar, cluster a database of several hundred thousand trajectories, predict destination and apply unsupervised machine learning algorithms.

42 ENGINEERING↗

Analog Systems for Edge Optimization

Over the past decade, analog computing has the subject of substantial research interest providing a path toward improved computational efficiency in the post-Dennard era. Analog matrix vector multiplication (MVM) accelerators provide a popular approach given the ubiquity of MVM operations in numerous applications. However, historically analog computing systems can struggle with applications requiring high precision due to the inherent susceptibility of these systems to analog non-idealities. Therefore, prior work on analog systems has focused either on applications known to be tolerant of limited precision (e.g., neural network inference), or using expensive techniques to emulate high-precision using many analog MVM operations. In this work, we propose an alternative approach. Motivated by recent advances in inexact nonlinear solvers and optimizers, we explore the potential of co-designing optimization algorithms which can take full advantage of the fundamentally inexact analog MVM operations. To enable these co-designed algorithms we also develop a general mathematical theory of the precision and energy efficiency of analog operations, and a new system architecture for tightly-coupled analog and digital computation. Finally, we examine the applicability of analog computing to a wider class of symmetric positive definite systems and find potential in using analog operations as a sparse approximate inverse preconditioner. With these core innovations, this project provides a path toward effectively implementing optimization algorithms on power-constrained autonomous and semi-autonomous systems.

97 MATHEMATICS AND COMPUTING↗

Distributed Coordinated Control of Large-Scale Nonlinear Networks

We provide a distributed coordinated approach to the stability analysis and control design of largescale nonlinear dynamical systems by using a vector Lyapunov functions approach. In this formulation the large-scale system is decomposed into a network of interacting subsystems and the stability of the system is analyzed through a comparison system. However finding such comparison system is not trivial. In this work, we propose a sum-of-squares based completely decentralized approach for computing the comparison systems for networks of nonlinear systems. Moreover, based on the comparison systems, we introduce a distributed optimal control strategy in which the individual subsystems (agents) coordinate with their immediate neighbors to design local control policies that can exponentially stabilize the full system under initial disturbances.We illustrate the control algorithm on a network of interacting Van der Pol systems.

42 ENGINEERING↗

Noise suppression for dual-energy CT via penalized weighted least-square optimization with similarity-based regularization

Purpose: Dual-energy CT (DECT) expands applications of CT imaging in its capability to decompose CT images into material images. However, decomposition via direct matrix inversion leads to large noise amplification and limits quantitative use of DECT. Their group has previously developed a noise suppression algorithm via penalized weighted least-square optimization with edge-preservation regularization (PWLS-EPR). In this paper, the authors improve method performance using the same framework of penalized weighted least-square optimization but with similarity-based regularization (PWLS-SBR), which substantially enhances the quality of decomposed images by retaining a more uniform noise power spectrum (NPS). Methods: The design of PWLS-SBR is based on the fact that averaging pixels of similar materials gives a low-noise image. For each pixel, the authors calculate the similarity to other pixels in its neighborhood by comparing CT values. Using an empirical Gaussian model, the authors assign high/low similarity value to one neighboring pixel if its CT value is close/far to the CT value of the pixel of interest. These similarity values are organized in matrix form, such that multiplication of the similarity matrix to the image vector reduces image noise. The similarity matrices are calculated on both high- and low-energy CT images and averaged. In PWLS-SBR, the authors include a regularization term to minimize the L-2 norm of the difference between the images without and with noise suppression via similarity matrix multiplication. By using all pixel information of the initial CT images rather than just those lying on or near edges, PWLS-SBR is superior to the previously developed PWLS-EPR, as supported by comparison studies on phantoms and a head-and-neck patient. Results: On the line-pair slice of the Catphan{sup ©}600 phantom, PWLS-SBR outperforms PWLS-EPR and retains spatial resolution of 8 lp/cm, comparable to the original CT images, even at 90% reduction in noise standard deviation (STD). Similar performance on spatial resolution is observed on an anthropomorphic head phantom. In addition, results of PWLS-SBR show substantially improved image quality due to preservation of image NPS. On the Catphan{sup ©}600 phantom, NPS using PWLS-SBR has a correlation of 93% with that via direct matrix inversion, while the correlation drops to −52% for PWLS-EPR. Electron density measurement studies indicate high accuracy of PWLS-SBR. On seven different materials, the measured electron densities calculated from the decomposed material images using PWLS-SBR have a root-mean-square error (RMSE) of 1.20%, while the results of PWLS-EPR have a RMSE of 2.21%. In the study on a head-and-neck patient, PWLS-SBR is shown to reduce noise STD by a factor of 3 on material images with image qualities comparable to CT images, whereas fine structures are lost in the PWLS-EPR result. Additionally, PWLS-SBR better preserves low contrast on the tissue image. Conclusions: The authors propose improvements to the regularization term of an optimization framework which performs iterative image-domain decomposition for DECT with noise suppression. The regularization term avoids calculation of image gradient and is based on pixel similarity. The proposed method not only achieves a high decomposition accuracy, but also improves over the previous algorithm on NPS as well as spatial resolution.

60 APPLIED LIFE SCIENCES↗

Quantum Complexity of the Kronecker Coefficients

Whether or not the Kronecker coefficients of the symmetric group count some set of combinatorial objects is a longstanding open question. In this work we show that a given Kronecker coefficient is proportional to the rank of a projector that can be measured efficiently using a quantum computer. In other words a Kronecker coefficient counts the dimension of the vector space spanned by the accepting witnesses of a QMA verifier, where QMA is the quantum analogue of NP . This implies that approximating the Kronecker coefficients to within a given relative error is not harder than a certain natural class of problems that captures the complexity of estimating thermal properties of quantum many-body systems. A second consequence is that deciding positivity of Kronecker coefficients is contained in QMA , complementing a recent NP -hardness result of Ikenmeyer, Mulmuley, and Walter. We obtain similar results for the related problem of approximating row sums of the character table of the symmetric group. Finally, we discuss an efficient quantum algorithm that approximates normalized Kronecker coefficients to inverse-polynomial additive error. Published by the American Physical Society 2024

Physics↗

Distributed Inference with Sparse and Quantized Communication

Here, we consider the problem of distributed inference where agents in a network observe a stream of private signals generated by an unknown state, and aim to uniquely identify this state from a finite set of hypotheses. We focus on scenarios where communication between agents is costly, and takes place over channels with finite bandwidth. To reduce the frequency of communication, we develop a novel event-triggered distributed learning rule that is based on the principle of diffusing low beliefs on each false hypothesis. Building on this principle, we design a trigger condition under which an agent broadcasts only those components of its belief vector that have adequate innovation, to only those neighbors that require such information. We prove that our rule guarantees convergence to the true state exponentially fast almost surely despite sparse communication, and that it has the potential to significantly reduce information flow from uninformative agents to informative agents. Next, to deal with finite-precision communication channels, we propose a distributed learning rule that leverages the idea of adaptive quantization. We show that by sequentially refining the range of the quantizers, every agent can learn the truth exponentially fast almost surely, while using just 1 bit to encode its belief on each hypothesis. For both our proposed algorithms, we rigorously characterize the trade-offs between communication-efficiency and the learning rate.

42 ENGINEERING↗

FALCON: Framework for Anomaly Detection in Industrial Control Systems

Industrial Control Systems (ICS) are used to control physical processes in critical infrastructure. These systems are used in a wide variety of operations such as water treatment, power generation and distribution, and manufacturing. While the safety and security of these systems are of serious concern, recent reports have shown an increase in targeted attacks aimed at manipulating physical processes to cause catastrophic consequences. This trend emphasizes the need for algorithms and tools that provide resilient and smart attack detection mechanisms to protect ICS. In this paper, we propose an anomaly detection framework for ICS based on a deep neural network. The proposed methodology uses dilated convolution and long short-term memory (LSTM) layers to learn temporal as well as long term dependencies within sensor and actuator data in an ICS. The sensor/actuator data are passed through a unique feature engineering pipeline where wavelet transformation is applied to the sensor signals to extract features that are fed into the model. Additionally, this paper explores four variations of supervised deep learning models, as well as an unsupervised support vector machine (SVM) model for this problem. The proposed framework is validated on Secure Water Treatment testbed results. This framework detects more attacks in a shorter period of time than previously published methods.

97 - MATHEMATICS AND COMPUTING↗

A novel flexible framework with automatic feature correspondence optimization for nonrigid registration in radiotherapy

Technical improvements in planning and dose delivery and in verification of patient positioning have substantially widened the therapeutic window for radiation treatment of cancer. However, changes in patient anatomy during the treatment limit the exploitation of these new techniques. To further improve radiation treatments, anatomical changes need to be modeled and accounted for. Nonrigid registration can be used for this purpose. This article describes the design, the implementation, and the validation of a new framework for nonrigid registration for radiotherapy applications. The core of this framework is an improved version of the thin plate spline robust point matching (TPS-RPM) algorithm. The TPS-RPM algorithm estimates a global correspondence and a transformation between the points that represent organs of interest belonging to two image sets. However, the algorithm does not allow for the inclusion of prior knowledge on the correspondence of subset of points, and therefore, it can lead to inconsistent anatomical solutions. In this article TPS-RPM was improved by employing a novel correspondence filter that supports simultaneous registration of multiple structures. The improved method allows for coherent organ registration and for the inclusion of user-defined landmarks, lines, and surfaces inside and outside of structures of interest. A procedure to generate control points from segmented organs is described. The framework parameters r and {lambda}, which control the number of points and the nonrigidness of the transformation, respectively, were optimized for three sites with different degrees of deformation (head and neck, prostate, and cervix) using two cases per site. For the head and neck cases, the salivary glands were manually contoured on CT scans, for the prostate cases the prostate and the vesicles, and for the cervix cases the cervix uterus, the bladder, and the rectum. The transformation error obtained using the best set of parameters was below 1 mm for all the studied cases. The lengths of the deformation vectors were on average ({+-}1 standard deviation) 5.8{+-}2.5 and 2.6{+-}1.1 mm for the head and neck cases, 7.2{+-}4.5 and 8.6{+-}1.9 mm for the prostate cases, and 19.0{+-}11.6 and 14.5{+-}9.3 mm for the cervix cases. Distinguishable anatomical features were identified for each case and were used to validate the registration by calculating residual distances after transformation: 1.5{+-}0.8, 2.3{+-}1.0, and 6.3{+-}2.9 mm for the head and neck, prostate, and cervix sites, respectively. Finally, the authors demonstrated how the inclusion of these anatomical features in the registration process reduced the residual distances to 0.8{+-}0.5, 0.6{+-}0.5, and 1.3{+-}0.7 mm for the head and neck, prostate, and cervix sites, respectively. The inclusion of additional anatomical features produced more anatomically coherent transformations without compromising the transformation error. The authors concluded that the presented nonrigid registration framework is a powerful tool to simultaneously register multiple segmented organs with very different complexities.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Interparameter trade-off quantification and reduction in isotropic-elastic full-waveform inversion: synthetic experiments and Hussar land data set application

The problem of inverting for multiple physical parameters in the subsurface using seismic full-waveform inversion (FWI) is complicated by interparameter trade-off arising from inherent ambiguities between different physical parameters. Parameter resolution is often characterized using scattering radiation patterns, but these neglect some important aspects of interparameter trade-off. More general analysis and mitigation of interparameter trade-off in isotropic-elastic FWI is possible through judiciously chosen multiparameter Hessian matrix-vector products. We show that products of multiparameter Hessian off-diagonal blocks with model perturbation vectors, referred to as interparameter contamination kernels , are central to the approach. We then apply the multiparameter Hessian to various vectors designed to provide information regarding the strengths and characteristics of interparameter contamination, both locally and within the whole volume. With numerical experiments, we observe that S-wave velocity perturbations introduce strong contaminations into density and phase-reversed contaminations into P-wave velocity, but themselves experience only limited contaminations from other parameters. Based on these findings, we introduce a novel strategy to mitigate the influence of interparameter trade-off with approximate contamination kernels. Furthermore, we recommend that the local spatial and interparameter trade-off of the inverted models be quantified using extended multiparameter point spread functions (EMPSFs) obtained with pre-conditioned conjugate-gradient algorithm. Compared to traditional point spread functions, the EMPSFs appear to provide more accurate measurements for resolution analysis, by de-blurring the estimations, scaling magnitudes and mitigating interparameter contamination. Approximate eigenvalue volumes constructed with stochastic probing approach are proposed to evaluate the resolution of the inverted models within the whole model. With a synthetic Marmousi model example and a land seismic field data set from Hussar, Alberta, Canada, we confirm that the new inversion strategy suppresses the interparameter contamination effectively and provides more reliable density estimations in isotropic-elastic FWI as compared to standard simultaneous inversion approach.

58 GEOSCIENCES↗

TOPOS: A new topometric patient positioning and tracking system for radiation therapy based on structured white light

Purpose: A patient positioning system for radiation therapy based on structured white light and using off-the-shelf hardware components for flexibility and cost-effectiveness has been developed in house. Increased accuracy, patient comfort, abandonment of any skin marks, accelerated workflow, objective reading/recording, better usability and robust sensor design, compared to other positioning approaches, were the main goals of this work. Another aim was the application of a 6 degrees of freedom tracking system working without dose deposition. Methods: Two optical sensors are the main parts of the TOPOS Registered-Sign system (Topometrical Positioning, cyberTECHNOLOGIES, Germany). The components: cameras, projectors, and computers are commercial off-the-shelf products, allowing for low production costs. The black/white cameras of the prototype are capable of taking up to 240 frames per second (resolution: 640 Multiplication-Sign 488 pixels). The projector has a resolution of 1024 Multiplication-Sign 768 and a refresh rate of 120 Hz. The patient's body surface is measured continuously and registered to a reference surface, providing a transformation to superimpose the patient's surface to the reference (planning CT) surface as best as possible. The execution of the calculated transformation provides the correct patient position before the treatment starts. Due to the high-speed acquisition of the surfaces, a surveillance of the patient's (respiration) motion during treatment is also accomplished. The accuracy of the system was determined using a male mannequin. Two treatment sites were evaluated: one simulating a head and neck treatment and the other simulating a thoracic wall treatment. The mannequin was moved to predefined positions, and shift vectors given by the surface registration were evaluated. Additionally manual positioning using a color-coding system was evaluated. Results: Two prototypes have been developed, each allowing a continuous high density scan of a 500 Multiplication-Sign 500 Multiplication-Sign 400 mm{sup 3} (L Multiplication-Sign W Multiplication-Sign D) large volume with a refresh rate of 10 Hz (extendible to 20 Hz for a single sensor system). Surface and position correction display, as well as respiratory motion, is shown in real-time (delay < 200 ms) using present graphical hardware acceleration. For an intuitive view of the patient's misalignment, a fast surface registration algorithm has been developed and tested and a real-time color-coding technique is proposed and verified that allows the user to easily verify the position of the patient. Using first the surface registration and then the color coding the best results were obtained: for the head and neck case, the mean difference between the actual zero position and the final match was 0.1 {+-} 0.4, -0.2 {+-} 0.7, and -0.1 {+-} 0.3 mm in vertical, longitudinal, and lateral direction. For the thoracic case, the mean differences were 0.3 {+-} 0.5, -0.6 {+-} 1.9, 0.0 {+-} 0.4 mm. Conclusions: The presented system copes with the increasing demand for more accurate patient positioning due to more precise irradiation technologies and minimizes the preparation times for correct patient alignment, therefore optimizing the treatment workflow. Moreover, TOPOS is a versatile and cost effective image guided radiation therapy device. It allows an objective rating of the patient's position before and during the irradiation and could also be used for respiratory gating or tracking.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Reducing Parallel Communication in Algebraic Multigrid through Sparsification

Algebraic multigrid (AMG) is an $\mathcal{O}(n)$ solution process for many large sparse linear systems. A hierarchy of progressively coarser grids which utilize complementary relaxation and interpolation operators is constructed. High-energy error is reduced by relaxation, while low-energy error is mapped to coarse-grid matrices and reduced there. However, large parallel communication costs often limit parallel scalability. Furthermore, as the multigrid hierarchy is formed, each coarse matrix is formed through a triple matrix product. The resulting coarse grids often have significantly more nonzeros per row than the original fine-grid operator, thereby generating high parallel communication costs associated with sparse matrix-vector multiplication (SpMV) on coarse levels. In this paper, we introduce a method that systematically removes entries in coarse-grid matrices after the hierarchy is formed, leading to improved communication costs. We sparsify by removing weakly connected or unimportant entries in the matrix, leading to improved solve time. The main trade-off is that if the heuristic identifying unimportant entries is used too aggressively, then AMG convergence can suffer. To counteract this, the original hierarchy is retained, allowing entries to be reintroduced into the solver hierarchy if convergence is too slow. This enables a balance between communication cost and convergence, as necessary. In this paper we present new algorithms for reducing communication and present a number of computational experiments in support.

97 MATHEMATICS AND COMPUTING↗

Deep Learning Estimation of Daily Ground–Level NO 2 Concentrations from Remote Sensing Data

The limited number of nitrogen dioxide (NO 2 ) surface measurements calls for the development of highly accurate approaches to estimating surface NO 2 concentrations. In this study, we leverage a new satellite instrument, the TROPOspheric Monitoring Instrument (TROPOMI), along with other predictor variables, to estimate daily surface NO 2 concentrations over Texas in 2019. We use the deep convolutional neural network (Deep-CNN), an advanced deep learning algorithm, to obtain estimates and achieve a correlation coefficient (R) of 0.91, an index of agreement (IOA) of 0.95, and a mean absolute bias (MAB) of 1.75 ppb in surface NO 2 estimation. Additionally, we leverage a novel approach, SHapley Additive exPlanations (SHAP), to describe how Deep-CNN understands each predictor variable. The SHAP results show that the Deep-CNN model has an advanced understanding of the dataset, revealing that TROPOMI closely captures levels of NO 2 . In addition, we show the superiority of our Deep-CNN model at estimating surface NO 2 over other well-known machine learning and regression models in the field, including the support vector machines (SVM), random forest (RF), and multiple linear regression (MLR). Although SVM and RF show strong capabilities at estimating surface NO 2 concentrations, their accuracy is inferior to that of the Deep-CNN model, ranking second and third in model accuracy in this study. The MLR, however, shows a poor ability at NO 2 estimation and ranks last among all models. Furthermore, testing the impact of sample size on model performance, we also show that, compared to other models, Deep-CNN needs more samples to trigger its strength at surface NO 2 estimation.

54 ENVIRONMENTAL SCIENCES↗

Unsupervised Clustering-Based Short-Term Solar Forecasting

Solar forecasting accuracy is highly affected by weather conditions, therefore, weather awareness forecasting models are expected to improve the forecasting performance. However, it may not be available or reliable to classify different forecasting tasks by only using predefined meteorological weather categorization. In this paper, an unsupervised clustering-based (UC-based) solar forecasting method is developed for short-term (1-h-ahead) global horizontal irradiance (GHI) forecasting. This UC-based method consists of three parts: GHI time series unsupervised clustering, pattern recognition, and UC-based forecasting. The daily GHI time series is first clustered by an Optimized Cross-validated ClUsteRing (OCCUR) method, which determines the optimal number of clusters and best clustering results. Then, support vector machine pattern recognition is adopted to recognize the category of a certain day using the first four hours' data in the forecasting stage. GHI forecasts are generated by the most suitable models in different clusters, which are built by a two-layer machine learning based multi-model (M3) forecasting framework. The developed UC-M3 method is validated by using 1-year of data with 13 solar features from three information sources. Numerical results show that 1) UC-based models outperform non-UC (all-in-one) models with the same M3 architecture by approximately 20%; and 2) M3-based models also outperform the single-algorithm machine learning models by approximately 20%.

14 SOLAR ENERGY↗

Modern energy density functional for nuclei and the nuclear matter equation of state

We discuss a method of determining a modern energy density functional (EDF) in nuclei. We adopt a Skyrme type EDF and fit the Skyrme parameters to an extensive set of experimental data on the ground-state binding energies, radii, and the breathing mode energies of a wide range of nuclei. We further constrain the values of the Skyrme parameters by requiring positive values for the slope of the symmetry energy S, the enhancement factor {kappa}, associated with the isovector giant dipole resonance, and the Landau parameter G{sub 0}{sup '}. This is done within the approaches of Hartree-Fock (HF) and HF with the inclusion of correlation effects, using a simulated-annealing based algorithm forminimizing {chi}{sup 2}.We also present results of HF based random phase approximation for the excitation strength function of the breathing mode and discuss the current status of the nuclear matter incompressibility coefficient.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch

Two parallelized hybrid methods are presented for single-function optimization problems with side constraints. The optimization problems are difficult not only due to possible existence of local minima and nonsmoothness of functions, but also due to the fact that objective function and constraint values for a solution vector can only be obtained by querying a black box whose execution requires considerable computational effort. Examples are optimization problems in Engineering where objective function and constraint values are computed via complex simulation programs, and where local minima exist and smoothness of functions is not assured. The hybrid methods consist of the well-known method NOMAD and two new methods called DENCON and DENPAR that are based on the linesearch scheme CS-DFN. The hybrid methods compute for each query a set of solution vectors that are evaluated in parallel. The hybrid methods have been tested on a set of difficult optimization problems produced by a certain seeding scheme for multiobjective optimization. We compare computational results with solution by NOMAD, DENCON, and DENPAR as stand-alone methods. It turns out that among the stand-alone methods, NOMAD is significantly better than DENCON and DENPAR. However, the hybrid methods are definitely better than NOMAD.

97 MATHEMATICS AND COMPUTING↗

Leveraging operator learning to accelerate convergence of the preconditioned conjugate gradient method

We propose a new deflation strategy to accelerate the convergence of the preconditioned conjugate gradient (PCG) method for solving parametric large-scale linear systems of equations. Unlike traditional deflation techniques that rely on eigenvector approximations or recycled Krylov subspaces, we generate the deflation subspaces using operator learning, specifically the Deep Operator Network (DeepONet). To this aim, we introduce two complementary approaches for assembling the deflation operators. The first approach approximates near-null space vectors of the discrete PDE operator using the basis functions learned by the DeepONet. The second approach directly leverages solutions predicted by the DeepONet. To further enhance convergence, we also propose several strategies for prescribing the sparsity pattern of the deflation operator. Here, a comprehensive set of numerical experiments encompassing steady-state, time-dependent, scalar, and vector-valued problems posed on both structured and unstructured geometries is presented and demonstrates the effectiveness of the proposed DeepONet-based deflated PCG method, as well as its generalization across a wide range of model parameters and problem resolutions.

Deflation↗

Fully Distributed Multi-Material Magnetic Sensing Structures for Multiparameter DAS Applications

This dissertation demonstrates the first of its kind distributed magnetic field sensor based on a fiber optic distributed acoustic sensing (DAS) scheme. Ferromagnetic nickel and Metglas® were dispersed internally within a fiber optic preform and then drawn on an in-house fiber optic draw tower to lengths in the kilometers. Due to the close proximity of the ferromagnetic metals and fiber optic core, the magnetostrictive strain response of the ferromagnetic materials when exposed to a magnetic field would perturbate within the fiber cladding and transfer that strain, internally, to the fiber optic core. Strain resulting from the magnetostrictive effect allows the DAS based sensor to accurately translate strain into readable magnetic field data. Due to the high sensitivity seen in this sensor design, multiparameter sources, acoustic and magnetic fields, were tested and validated and a three dimensional magnetic-field vector sensor was proposed. Numerical analysis of the novel sensor design was first implemented using COMSOL Multiphysics, where inputs such as magnetostrictive element shape, size, distance, and number were first investigated. Upon optimizing system constraints, the sensor design was further modified such that single mode operation was consistent across multiple fiber draws while retaining high strain transfer from the ferromagnetic elements to the fiber optic core. Ferromagnetic material selection was evaluated as a function of the saturation magnetostriction constants and a total of 4 modules were used to fully characterize the complex physics involved in this sensor design. All fabrication and testing were performed in-house using a full scale 3-story fiber draw tower and custom environmental testing stations to imitate naturally occurring events such as magnetic or acoustic point sources. A unique stacking method was used to embed ferromagnetic nickel and Metglas® into a fiber optic preform which when combined with a custom fiber draw process resulted in consistent multi-material fibers drawn to lengths of 1-km. In-house testing facilities included different types of electromagnetic generators, in addition to a soil test bed, and an outdoor test bed which allowed 100 meters of fiber to be tested simultaneously. All tested sensors demonstrated high strain transfer capabilities on the order of 0.01-10 μϵ depending on the materials used, ferromagnetic rod number, and core to metal spacing. Due to the sensitivity of the system the difference between AC and DC was distinct, and directional magnetostriction was studied. Transverse and longitudinal magnetic wave propagation was controlled through a solenoid and rectangular Helmholtz coil, both built in-house. A three-dimensional magnetic field vector sensor was proposed due to the success of the magnetic field sensor, and a design was proposed and initially tested to validate direction as a function of field strength and distance. To summarize, this dissertation explores the first fully distributed magnetic field sensor using DAS based techniques and one of the first multi-material fiber draw processes which can produce consistent single mode fiber up to 1-km. Due to extensive FEA modeling, multiple iterations of the magnetic sensor were fully characterized and an equation describing the relationship between sensor design and strain transfer has been created and validated experimentally. Multi-parameter tests including acoustic and magnetic fields were implemented and an algorithm was developed to separate the mixed signals. Finally, a test was performed to demonstrate the feasibility of sensing magnetic fields directionally. Cumulative results demonstrate a high-quality sensor alternative to current designs which may surpass other magnetic sensors due to innate multi-parameter capabilities, in addition to the inexpensive production cost and extremely long operating lengths.

02 PETROLEUM↗

Influence of molecular clustering on the interpretation of diffractograms of hydrocarbon films from tokamak T-10

The influence of molecular clustering on the formerly suggested interpretation of diffraction patterns of hydrocarbon films formed in the vacuum vessel of the tokamak T-10 is analyzed numerically. The simulation of clustering of simple hydrocarbon molecules C(D, H){sub 4}, C{sub 2}(D, H){sub 4}, and C{sub 6}(D, H){sub 6} and molecules composed of curved graphene (fullerenes and toroidal nanotubes) is carried out with the rigid body molecular dynamics method. It is shown that formerly neglected atomic correlations C–C and C–D(H) in the amorphous hydrocarbon component decrease the calculated values of the scattered intensity in the range of scattering vector modulus 5 < q < 20 nm{sup –1} because of homogenization of scatters on the spatial scale of ∼1 nm. The allowance for these correlations does not change the diffraction patterns in the range q > 20 nm{sup –1}. The results suggest the necessity to introduce to the procedure of determining the structural content of the films, similar to those from the tokamak T-10, the clusters formed by the van der Waals adhesion of hydrocarbon molecules to “graphene” nanoparticles. This simplifies the mathematical optimization to the former level of complexity—but for an extended ensemble of objects—and makes it possible to calculate the diffraction patterns of these objects using the distributed computing resources. A modified algorithm of structural content identification on the basis of joint X-ray and neutron diffractometry is suggested.

36 MATERIALS SCIENCE↗