Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Multidimensional”

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 307 records · Page 17

FY 2025 Multidimensional Data Correlation Platform: Unified Software Architecture for Advanced Materials and Manufacturing Technologies Data Management and Processing

The Advanced Materials and Manufacturing Technologies (AMMT) program continues to advance a data-driven approach to demonstrate the utility of additive manufacturing for fabricating components for nuclear applications. A key scientific goal is to leverage data to better understand manufacturing outcomes and thereby improve the performance, reliability, and lifespan of nuclear components. Ultimately, this effort supports the development of standards for certification and qualification of additively manufactured components, enabling broader industry adoption. In support of this objective, the AMMT program is building and deploying a data management platform to record, index, analyze, and make available the manufacturing data generated across the AMMT program. In FY 2023, the team conceptualized the architecture of the platform and, in FY 2024, deployed the first functional version at the Oak Ridge National Laboratory (ORNL) Manufacturing Demonstration Facility (MDF). In FY 2025, the platform was officially opened to all AMMT members. To enable this expansion, core modifications and enhancements were developed, including improvements to the user interface and workflows for data entry and retrieval. Most notably, robust security and access control mechanisms were implemented to protect data and manage information sharing. This effort featured a logging system, protected views, and controlled access mechanisms. This report documents these enhancements and the transition of the platform into program-wide use.

36 MATERIALS SCIENCE↗

DEEP CELLULAR RECURRENT NEURAL ARCHITECTURE FOR EFFICIENT MULTIDIMENSIONAL TIME-SERIES DATA PROCESSING

Efficient processing of time series data is a fundamental yet challenging problem in pattern recognition. Though recent developments in machine learning and deep learning have enabled remarkable improvements in processing large scale datasets in many application domains, most are designed and regulated to handle inputs that are static in time. Many real-world data, such as in biomedical, surveillance and security, financial, manufacturing and engineering applications, are rarely static in time, and demand models able to recognize patterns in both space and time. Current machine learning (ML) and deep learning (DL) models adapted for time series processing tend to grow in complexity and size to accommodate the additional dimensionality of time. Specifically, the biologically inspired learning based models known as artificial neural networks that have shown extraordinary success in pattern recognition, tend to grow prohibitively large and cumbersome in the presence of large scale multi-dimensional time series biomedical data such as EEG. Consequently, this work aims to develop representative ML and DL models for robust and efficient large scale time series processing. First, we design a novel ML pipeline with efficient feature engineering to process a large scale multi-channel scalp EEG dataset for automated detection of epileptic seizures. With the use of a sophisticated yet computationally efficient time-frequency analysis technique known as harmonic wavelet packet transform and an efficient self-similarity computation based on fractal dimension, we achieve state-of-the-art performance for automated seizure detection in EEG data. Subsequently, we investigate the development of a novel efficient deep recurrent learning model for large scale time series processing. For this, we first study the functionality and training of a biologically inspired neural network architecture known as cellular simultaneous recurrent neural network (CSRN). We obtain a generalization of this network for multiple topological image processing tasks and investigate the learning efficacy of the complex cellular architecture using several state-of-the?art training methods. Finally, we develop a novel deep cellular recurrent neural network (CDRNN) architecture based on the biologically inspired distributed processing used in CSRN for processing time series data. The proposed DCRNN leverages the cellular recurrent architecture to promote extensive weight sharing and efficient, individualized, synchronous processing of multi-source time series data. Experiments on a large scale multi-channel scalp EEG, and a machine fault detection dataset show that the proposed DCRNN offers state-of-the-art recognition performance while using substantially fewer trainable recurrent units.

Vidyaratne, Lasitha S.↗

Multidimensional Nova Simulations with an Extended Buffer and Lower Initial Mixing Temperatures

A classical nova is a thermonuclear runaway initiated on a white dwarf accreting solar-like material from its stellar companion. Once the white dwarf accretes enough mass, the pressure at the base of the accreted layer reaches a critical point, leading to the ignition of the hydrogen fuel at their interface. This paper presents a set of two-dimensional CO classical nova simulations with an extended buffer zone of a fixed low density and temperature between the top of the accreted layer and the upper boundary, allowing us to capture the thermonuclear outburst in the domain. Our domain reduces the role of the upper-outflow boundary condition that has affected previous simulations and allows us to explore the nucleosynthesis evolution in detail. We also study the effects of the initial temperature perturbation and buffer size to explore their sensitivity in our simulations. Finally, we start our simulations with a lower temperature at the base of the accreted layer ( 7 × 10 7 K ) than previous work, allowing us to capture mixing earlier in the evolution, reducing the effects of the mixing-length-theory assumptions. This allows for a more realistic description of convective transport in our models.

Smith Clark, Alexander (ORCID:0000000159611680)↗

Multidimensional Vlasov–Poisson Simulations with High-order Monotonicity- and Positivity-preserving Schemes

We develop new numerical schemes for Vlasov–Poisson equations with high-order accuracy. Our methods are based on a spatially monotonicity-preserving (MP) scheme and are modified suitably so that the positivity of the distribution function is also preserved. We adopt an efficient semi-Lagrangian time integration scheme that is more accurate and computationally less expensive than the three-stage TVD Runge–Kutta integration. We apply our spatially fifth- and seventh-order schemes to a suite of simulations of collisionless self-gravitating systems and electrostatic plasma simulations, including linear and nonlinear Landau damping in one dimension and Vlasov–Poisson simulations in a six-dimensional phase space. The high-order schemes achieve a significantly improved accuracy in comparison with the third-order positive-flux-conserved scheme adopted in our previous study. With the semi-Lagrangian time integration, the computational cost of our high-order schemes does not significantly increase, but remains roughly the same as that of the third-order scheme. Vlasov–Poisson simulations on 128{sup 3}×128{sup 3} mesh grids have been successfully performed on a massively parallel computer.

79 ASTRONOMY AND ASTROPHYSICS↗

A nearest neighbors approach to multidimensional filtering.

The concept of nearest neighbor interaction is applied as a basis for data filtering in two-dimensional steady state problems. A steady state process represented by a potential equation with additive white noise is used to illustrate the application of this concept. It is demonstrated that significant dimensionality reductions can be achieved by applying this concept to various linear steady state problems.

Angel, E.↗

Multidimensional heat conduction

Computer program computes transient temperature history or steady state solution for complex body geometries in three geometries. Program allows option of four methods of solution: forward difference method, midpoint difference (Crank-Nicholson) method, backward difference method, and alternating direction technique.

Connors, T. C., Jr.↗

Computational aspects of the prediction of multidimensional transonic flows in turbomachinery

The analytical prediction and description of transonic flow in turbomachinery is complicated by three fundamental effects: (1) the fluid equations describing the transonic regime are inherently nonlinear, (2) shock waves may be present in the flow, and (3) turbomachine blading is geometrically complex, possessing large amounts of curvature, stagger, and twist. A three-dimensional computation procedure for the study of transonic turbomachine fluid mechanics is described. The fluid differential equations and corresponding difference operators are presented, the boundary conditions for complex blade shapes are described, and the computational implementation and mapping procedures are developed. Illustrative results of a typical unthrottled transonic rotor are also presented.

Oliver, D. A.↗

Multidimensional histograms

Program computes four dimensional histogram of Landsat multispectral image data. System enhances image handling and significantly reduces reprocessing costs.

Jayroe, R. R., Jr.↗

On the clustering of multidimensional pictorial data

Obvious approaches to reducing the cost (in computer resources) of applying current clustering techniques to the problem of remote sensing are discussed. The use of spatial information in finding fields and in classifying mixture pixels is examined, and the AMOEBA clustering program is described. Internally, a pattern recognition program, from without, AMOEBA appears to be an unsupervised clustering program. It is fast and automatic. No choices (such as arbitrary thresholds to set split/combine sequences) need be made. The problem of finding the number of clusters is solved automatically. At the conclusion of the program, all points in the scene are classified; however, a provision is included for a reject classification of some points which, within the theoretical framework, cannot rationally be assigned to any cluster.

Bryant, J. D.↗

A hill-sliding strategy for initialization of Gaussian clusters in the multidimensional space

A hill sliding technique was devised to extract Gaussian clusters from the multivariate probability density estimate of sample data for the first step of iterative unsupervised classification. Each cluster was assumed to posses a unimodal normal distribution. A clustering function proposed distinguished elements of a cluster under formation from the rest in the feature space. Initial clusters were extracted one by one according to the hill sliding tactics. A dimensionless cluster compactness parameter was proposed as a universal measure of cluster goodness and used satisfactorily in test runs with LANDSAT multispectral scanner data. The normalized divergence, defined by the cluster divergence divided by the entropy of the entire sample data, was utilized as a general separability measure between clusters. An overall clustering objective function was set forth in terms of cluster covariance matrices, from which the cluster compactness measure could be deduced. Minimal improvement of initial data partitioning was evaluated by this objective function in eliminating scattered sparse data points. The hill sliding clustering technique developed herein has the potential applicability to decomposition any multivariate mixture distribution into a number of unimodal distributions when an appropriate distribution function to the data set is employed.

Park, J. K.↗