Results 71 to 80 of about 11,443 (267)
A sequential deep learning framework is developed to model surface roughness progression in multi‐stage microneedle fabrication. Using real‐world experimental data from 3D printing, molding, and casting stages, an long short‐term memory‐based recurrent neural network captures the cumulative influence of geometric parameters and intermediate outputs ...
Abdollah Ahmadpour +5 more
wiley +1 more source
Coordination‐Driven Direct C─H Metalation of N‐Heterocycles With a Superbasic Co(II) Amide Co(TMP)2
By enabling regioselectivities that are inaccessible with conventional bases, this study introduces a Co(II) amide platform for the deprotonative C─H metalation of sensitive N‐heterocycles. Subsequent interception of the resulting Co(II) intermediates with external oxidants affords a family of sterically congested, TMP‐substituted heterocycles via C─N ...
Na Jin +3 more
wiley +2 more sources
This work establishes a correlation between solvent properties and the charge transport performance of solution‐processed organic thin films through interpretable machine learning. Strong dispersion interactions (δD), moderate hydrogen bonding (δH), closely matching and compatible with the solute (quadruple thiophene), and a small molar volume (MolVol)
Tianhao Tan, Lian Duan, Dong Wang
wiley +1 more source
Dual Activation of H2 and CO2 by a Pincer‐Type Ni–Zn Heterobimetallic Complex
A bimetallic Ni−Zn complex performs sequential activations of H2 (1 equiv) and CO2 (2 equiv). This bimetallic cooperativity is attributed to the weak Lewis acidic nature of Zn(II), which promotes fluxional ligand binding. Namely, an X‐type ligand at Ni, where X is hydride or formate, toggles between two different binding modes: bridging Zn(μ‐X)Ni and ...
Krishnendu Dey +3 more
wiley +2 more sources
A Unifying Approach to Self‐Organizing Systems Interacting via Conservation Laws
The article develops a unified way to model and analyze self‐organizing systems whose interactions are constrained by conservation laws. It represents physical/biological/engineered networks as graphs and builds projection operators (from incidence/cycle structure) that enforce those constraints and decompose network variables into constrained versus ...
F. Barrows +7 more
wiley +1 more source
Bounds for Laplacian-type graph energies [PDF]
© 2015 Miskolc University Press. Let G be an undirected simple and connected graph with n vertices (n ≥ 3) and m edges. Denote by μ1 ≥ μ2 ≥ ... ≥ μn-1 > μn = 0, γ1 ≥ γ2 ≥ ... ≥ γn, and ρ1 ≥ ρ2 ≥ ... ≥ ρn-1 > ρn = 0, respectively, the Laplacian, signless Laplacian, and normalized Laplacian eigenvalues of G.
Gutman, Ivan +2 more
openaire +3 more sources
Some improved bounds on two energy-like invariants of some derived graphs
Given a simple graph G, its Laplacian-energy-like invariant LEL(G) and incidence energy IE(G) are the sum of square root of its all Laplacian eigenvalues and signless Laplacian eigenvalues, respectively. This paper obtains some improved bounds on LEL and
Cui Shu-Yu, Tian Gui-Xian
doaj +1 more source
Harnessing Digital Microstructure for Simulation‐Guided Optimization of Permanent Magnets
An experimental‐to‐computational workflow is presented that transforms experimental 3D focused ion beam‐scanning electron microscopy data into a simulation‐ready digital microstructure for multiphase functional materials. Using heavy‐rare‐earth‐free Nd–Fe–B magnets as a model system, the approach quantifies grain connectivity across complex secondary ...
Nikita Kulesh +4 more
wiley +1 more source
Toward Intelligent Multimodal Holography for Real‐Time Chemical Imaging of Dynamic Ion Separation
Intelligent multimodal holography integrates digital off‐axis holography, spectroscopic imaging, and AI‐driven reconstruction to visualize ion transport and chemical dynamics in real time. In this perspective paper, we outline how this approach enables label‐free, chemically specific monitoring of complex environments and discuss its potential to ...
Giovanna Ricchiuti +3 more
wiley +1 more source
Certain Notions of Energy in Single-Valued Neutrosophic Graphs
A single-valued neutrosophic set is an instance of a neutrosophic set, which provides us an additional possibility to represent uncertainty, imprecise, incomplete and inconsistent information existing in real situations.
Sumera Naz +2 more
doaj +1 more source

