Engineering Papers⌕ Search

Engineering topics

Chang, Remco

Publications and source records attributed to Chang, Remco.

Resolving local ordering and structure in Mn x Ge 1- x Te alloys through thermodynamic ensembles of pair distribution functions

Characterizing local bonding environments in complex materials is essential for understanding and optimizing their properties. Equally as important is the ability to predict local motifs as a function of synthesis conditions, enhancing chemists’ ability to design properties into materials. In this study, we present an approach to leverage statistical mechanics to generate temperature- and energy-informed ensemble averaged pair distribution functions (PDFs). This method, which we have named Thermodynamic Ensemble Averages of PDFs for Ordering and Transformations (TEAPOT), utilizes density functional theory (DFT) to relax supercells while incorporating energetic penalties for local order, enabling accurate and computationally efficient analysis of local structure. We apply this method to the neutron PDF measurements of the pseudobinary MnTe–GeTe (MGT) alloy, demonstrating its capability to resolve complex local distortions and chemical ordering. Our results reveal detailed insights into phase transformations and local distortions driven by Mn substitution. For compositions that globally present as rock salt, our analysis reveals that Ge coordination geometry is heavily impacted by synthesis temperature. We propose that high temperature synthesis conditions promote a lowered Ge polyhedra distortion, promoting high charge carrier mobility due to the alignment of local and global structure. Incorporating statistical mechanics and computation into experimental analysis thus guides synthesis of tailored local structure.

36 MATERIALS SCIENCE↗

NeuralCubes: Deep Representations for Visual Data Exploration

Visual exploration of large multi-dimensional datasets has seen tremendous progress in recent years, allowing users to express rich data queries that produce informative visual summaries, all in real time. Techniques based on data cubes are some of the most promising approaches. However, these techniques usually require a large memory footprint for large datasets. To tackle this problem, we present NeuralCubes: neural networks that predict results for aggregate queries, similar to data cubes. NeuralCubes learns a function that takes as input a given query, for instance, a geographic region and temporal interval, and outputs the result of the query. The learned function serves as a real-time, low-memory approximator for aggregation queries. Our models are small enough to be sent to the client side (e.g. the web browser for a web-based application) for evaluation, enabling data exploration of large datasets without database/network connection. Here, we demonstrate the effectiveness of NeuralCubes through extensive experiments on a variety of datasets and discuss how NeuralCubes opens up opportunities for new types of visualization and interaction.

97 MATHEMATICS AND COMPUTING↗