Results 111 to 120 of about 310,757 (283)
Meta‐Rod Mechanical Metamaterials With Programmable Reconfiguration
Existing mechanical metamaterials achieve programmable large deformations in planar square or cubic configurations, restricted by required complex boundary conditions. This research proposes a 1D metamaterial, Meta‐rod, with linear, bending, twisting, area, and volume deformation modes.
Atharva Pande, Lyes Kadem, Hang Xu
wiley +1 more source
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints
In this paper, we consider the minimal vertex cover and minimal dominating sets with capacity and/or connectivity constraint enumeration problems. We develop polynomial-delay enumeration algorithms for these problems on bounded-degree graphs.
Yasuaki Kobayashi +4 more
doaj +1 more source
Polymorph engineering in ErMnO3 enables low‐voltage, forming‐free threshold switching with tunable negative differential resistance. Conducting orthorhombic regions embedded in an insulating hexagonal matrix provide controlled Joule‐heating‐enhanced Poole–Frenkel transport. The hexagonal phase prevents excessive heating and breakdown.
Rong Wu +8 more
wiley +1 more source
Dispensing Volumetric Additive Manufacturing
Dispensing volumetric additive manufacturing (DVAM) prints 3D structures inside a photocurable resin droplet suspended from the tip of a glass pipette, enabling sequential printing without resin vats or manual part removal. Real‐time droplet profiling and ray‐tracing‐based correction compensate for optical distortion at the curved resin‐air interface ...
Hongryung Jeon +5 more
wiley +1 more source
Some Inequalities between General Randić-Type Graph Invariants
The Randić-type graph invariants are extensively investigated vertex-degree-based topological indices and have gained much prominence in recent years.
Imran Nadeem, Saba Siddique, Yilun Shang
doaj +1 more source
A Matrix Approach to Vertex-Degree-Based Topological Indices
A VDB (vertex-degree-based) topological index over a set of digraphs H is a function φ:H→R, defined for each H∈H as φH=12∑uv∈Eφdu+dv−, where E is the arc set of H, du+ and dv− denote the out-degree and in-degree of vertices u and v respectively, and φij ...
Roberto Cruz, Carlos Espinal, Juan Rada
doaj +1 more source
Butterfly wing scales are intricate cuticular functional nanosctructures. This perspective suggests that spatially varying material properties, cytoskeletal constraints, and growth‐driven mechanical instabilities shape the resulting nanoscale architectures created from single cells.
Anupama Prakash +10 more
wiley +1 more source
Vertex-degree-based topological indices of uniform directed hypergraphs
Modelling a chemical network is crucial for understanding the complex interactions and dynamics within a chemical system, allowing for precise predictions of reaction behaviour under various conditions.
Shashwath S. Shetty, K. Arathi Bhat
doaj +1 more source
Gold bipyramids can act as efficient plasmonic nanoheaters, but they often reshape during laser heating. This study shows that oxygen nanobubbles drive oxidative etching and that surface ligands control stability. CTAB‐ and citrate‐coated particles blunt and lose optical performance, whereas polystyrene sulfonate preserves shape and heating by ...
Irene López‐Sicilia +7 more
wiley +1 more source
Vertex Degree of Random Intersection Graph
A random intersection graph is constructed by independently assigning a subset of a given set of objects $W,$ to each vertex of the vertex set $V$ of a simple graph $G.$ There is an edge between two vertices of $V,$ iff their respective subsets(in $W$,) have at least one common element.
openaire +2 more sources

