Skip to content
#edge computing Open access

From spheres to rods: tuning defects and dislocations generated by oxygen disorder in CeO₂ nanoparticles

Aug 2026 · National repository of research data in engineering
Catalytic Processes in Materials Science

Abstract

CeO₂ is key in catalysis, fuel cells, chemical mechanical planarization, and oxygen storage due to its Ce⁴⁺ / Ce³⁺ redox couple and oxygen mobility. At the nanoscale, properties become morphology-dependent, yet the link between morphology and mechanical behavior‒particularly elastic properties and defect structure‒remains underexplored. Here we investigate four CeO₂ morphologies (nanoparticles, spherulites, intermediate rods, and long rods) using XRD line profile analysis, bond valence sum (BVS) calculations, and DFT+U. Rietveld-refined lattice parameters serve as direct DFT inputs. Four Williamson-Hall models quantify crystallite size, microstrain, dislocation density, and character, with DFT-computed direction-dependent Young’s moduli and contrast factors. Results show bulk (≈169 GPa), shear (≈58.8 GPa), and Young’s (≈158 GPa) moduli remain constant within uncertainty across morphologies. The high dislocation densities (up to 10¹⁵ m⁻²) represent a small volume fraction (≈0.03 %) and do not appreciably alter the effective polycrystalline moduli. In contrast, defect structure varies dramatically: dislocation density increases from 10¹¹ to 10¹⁵ m⁻², transitioning from screw-dominated to mixed / edge character with aspect ratio. Oxygen displacement parameters (Uiso, O = 0.0136 – 0.0669 A²) peak in rods, indicating enhanced anionic disorder, while BVS (4.71– 4.75 v.u.) reveals compressed Ce-O bonds. These findings demonstrate that defect populations are morphology-dependent, enabling independent optimization for catalysis, chemical mechanical planarization (CMP), solid oxide fuel cells (SOFCs), and coatings, while the mechanical backbone of CeO2 remains unchanged.

View source

Similar papers

#computer vision Review Sep 2017

Agile Software Development Methods: Review and Analysis

This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.

P. Abrahamsson, O. Salo, Jussi Ronkainen et al. · 727 citations · ⚡54
#computer vision Jun 2008

The impact of agile practices on communication in software development

The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.

M. Pikkarainen, Jukka Haikara, O. Salo et al. · 401 citations · ⚡48
#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.