Results 81 to 90 of about 78,659 (333)
Advanced Materials Interfaces, EarlyView.Nanozymes (NZs) have emerged as versatile artificial enzymes with tunable catalytic properties driven by atomic coordination, defect engineering, and surface chemistry. This review presents a bio–nano interface framework linking synthesis strategies, structural design, and catalytic behavior within complex biological microenvironments.
Karen Guadalupe Quintero‐Garrido +6 more
wiley +1 more source
Advanced Materials Technologies, EarlyView.Laser‐assisted synthesis enables rapid (within 1 h) and high‐yield (≥90%) production of Co‐MOFs with mesoporous structures, tunable magnetic and optical properties, and efficient adsorption of N2, CH4, and CO2 for low‐energy gas separation. DFT calculations elucidate the electronic structure and adsorption behavior.
Saliha Mutlu +10 more
wiley +1 more source
The spectrum of the Laplacian in a domain bounded by a flexible polyhedron in $$\mathbb R^d$$ does not always remain unaltered during the flex [PDF]
, 2020 Victor Alexandrov
openalex +1 more source
Advanced Materials Technologies, EarlyView.One‐dimensional C4N2H14PbBr4 is shown to have a quasi‐direct electronic band structure and strongly anisotropic transport with polarized broadband emission. A GW/Bethe–Salpeter excited‐state force formalism, supported by polarized Raman and temperature‐dependent photoluminescence, identifies low–frequency Pb–Br phonons that drive ultrafast exciton self‐
Rijan Karkee +7 more
wiley +1 more source
Distributive Lattices, Polyhedra, and Generalized Flow
, 2008 A D-polyhedron is a polyhedron $P$ such that if $x,y$ are in $P$ then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive lattice with the dominance order. We provide a full characterization of the
Kolja B. Knauer +2 more
core +1 more source
Specialising finite domain programs with polyhedra [PDF]
, 2000 A procedure is described for tightening domain constraints of finite domain logic programs by applying a static analysis based on convex polyhedra. Individual finite domain constraints are over-approximated by polyhedra to describe the solution space ...
Howe, J. M., King, A.
core
Grid Vertex-Unfolding Orthogonal Polyhedra
, 2006 An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a *net*, a connected planar piece with no overlaps. A *grid unfolding* allows additional cuts along grid edges induced by coordinate planes passing through ...
Damian, Mirela +2 more
core +3 more sources
Advanced Robotics Research, EarlyView.Robots can learn manipulation tasks from human demonstrations. This work proposes a versatile method to identify the physical interactions that occur in a demonstration, such as sequences of different contacts and interactions with mechanical constraints.
Alex Harm Gert‐Jan Overbeek +3 more
wiley +1 more source
Closed Locally Minimal Networks on the Surfaces of Convex Polyhedra
Моделирование и анализ информационных систем, 2013 Closed locally minimal networks can be viewed as “branching” closed geodesics. We study such networks on the surfaces of convex polyhedra and discuss the problem of describing the set of all convex polyhedra that have such networks.
N. P. Strelkova
doaj +3 more sources
AgricultureThe shape of particles is a critical determinant that significantly influences the accuracy of discrete element simulations. To reduce the discrepancies between the discrete element model of wheat seeds and the actual particle shapes, and to enhance the ...
Longbao Wang +6 more
doaj +1 more source