Results 51 to 60 of about 42,399 (264)
Phase Field Failure Modeling: Brittle‐Ductile Dual‐Phase Microstructures under Compressive Loading
The approach by Amor and the approach by Miehe and Zhang for asymmetric damage behavior in the phase field method for fracture are compared regarding their fitness for microcrack‐based failure modeling. The comparison is performed for the case of a dual‐phase microstructure with a brittle and a ductile constituent.
Jakob Huber, Jan Torgersen, Ewald Werner
wiley +1 more source
Fork-decomposition of strong product of graphs
Decomposition of arbitrary graphs into subgraphs of small size is assuming importance in the literature. There are several studies on the isomorphic decomposition of graphs into paths, cycles, trees, stars, sunlet etc.
Samuel Issacraj, Paulraj Joseph
doaj +1 more source
Building machine‐readable vocabularies for materials science is slow, expert‐driven work. This study benchmarks 13 large language models on two of its first steps: finding candidate terms in engineering articles and deciding where they belong in a class hierarchy.
Thomas Bjarsch +3 more
wiley +1 more source
Multimodal Data‐Driven Microstructure Characterization
A self‐consistent autonomous workflow for EBSP‐based microstructure segmentation by integrating PCA, GMM clustering, and cNMF with information‐theoretic parameter selection, requiring no user input. An optimal ROI size related to characteristic grain size is identified.
Qi Zhang +4 more
wiley +1 more source
Mixing effects of understory plant litter on decomposition and nutrient release of tree litter in two plantations in Northeast China. [PDF]
Understory vegetation plays a crucial role in carbon and nutrient cycling in forest ecosystems; however, it is not clear how understory species affect tree litter decomposition and nutrient dynamics.
Lei Zhao +5 more
doaj +1 more source
A Practical Noise2Noise Denoising Pipeline for High‐Throughput Raman Spectroscopy
A lightweight and reproducible denoising pipeline for high‐throughput Raman spectroscopy is introduced, based on a 1D convolutional autoencoder trained with a Noise2Noise strategy. Using only repeated short‐exposure acquisitions, the method suppresses stochastic noise without reference spectra, enabling reliable spectral reconstruction while preserving
David Martin‐Calle +5 more
wiley +1 more source
Composing dynamic programming tree-decomposition-based algorithms [PDF]
Given two integers $\ell$ and $p$ as well as $\ell$ graph classes $\mathcal{H}_1,\ldots,\mathcal{H}_\ell$, the problems $\mathsf{GraphPart}(\mathcal{H}_1, \ldots, \mathcal{H}_\ell,p)$, \break $\mathsf{VertPart}(\mathcal{H}_1, \ldots, \mathcal{H}_\ell ...
Julien Baste
doaj +1 more source
New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design
This work introduces an innovative framework for designing structured materials by ex panding the design space through reparameterization of qualitative variables into continuous structural descriptors. Combined with machine‐learning‐based prediction and multi‐objective optimization, the approach enables the discovery of novel lattice architectures ...
G. H. Gahimbare +5 more
wiley +1 more source
Rapid decomposition of leaf litter from fast-growing tropical wood jabon (Anthocephalus cadamba Miq.) [PDF]
Nutrient releases are considered functional processes related to soil fertility. In fast-growing tree plantation, maintaining the nutrient supply in soil is crucial for sustaining productivity.
Atunnisa Rifa +2 more
doaj +1 more source
Tree-decompositions of graphs (I)
The author proves the following two theorems: Theorem 1. Let \(G\) be a connected graph with order \(n\geq 3\) and size \(2n-4\) and \(u\) and \(v\) be two given vertices of \(G\) with \(uv\in E(G)\). Then \(G\) has an \(\{n,n-2\}\)-tree-decomposition with \(u\) and \(v\) as the two singular vertices if and only if the number of edges \(\varepsilon(H ...
openaire +1 more source

