Results 51 to 60 of about 1,092,292 (254)
Autonomous Folding of Soft Matter From Living Polymers
Origami structures are endowed with “living” polymer creases that grow, remodel, and stiffen in response to nutrient solutions. This post‐fabrication growth enables autonomous folding, iterative regrowth, and mechanical tuning involving origami assemblies, such as cranes, Miura‐ori tessellations, rigid and non‐rigid square‐twist patterns, establishing ...
Jiahe Huang +6 more
wiley +1 more source
Graphs with edge-odd graceful labelings
Solairaju and Chithra [3] introduced a new type of labeling of a graph G with q edges called an edge-odd graceful lebeling if there is a bijection f from the edges of the graph to the set {1, 3, 5, . . . , 2q − 1} such that, when each vertex is assigned the sum of all the edges incident to it mod 2q, the resulting vertex labels are distinct.
openaire +1 more source
Intelligent Sky Guardians (InSkyGuard) is introduced as a four‐drone swarm that autonomously detects, tracks, and safely captures rogue drones using a coordinated net system. Computer vision and leader–follower control architecture enable synchronized enclosure, while integrated failsafes enhance system reliability. Validated through closed‐environment
Joshua Hastings +6 more
wiley +1 more source
A Note on 1-Edge Balance Index Set [PDF]
A graph labeling is an assignment of integers to the vertices or edges or both, subject to certain conditions. Varieties of graph labeling have been investigated by many authors [2], [3] [5] and they serve as useful models for broad range of ...
Chandrashekar Adiga, +2 more
core +1 more source
Study on Binary Equivalent Decimal Edge Graceful Labeling
Let G (V(G), E(G)) be a graph with n vertices is said to be Binary Equivalent Decimal Edge Graceful Labeling (BEDE) graph if the vertices are assigned distinct numbers from 0,1,2,…,(n-1) such that the labels induced on edges by the values obtained using binary coding of end vertices for each edge which are distinct. This paper deals with graphs such as
V. Rajeswari, K. Thiagarajan
openaire +1 more source
Learning‐Based Soft Robotic Grasping: Recent Progress and Remaining Challenges
This review analyzes learning‐based soft robotic grasping from a pipeline‐oriented perspective, encompassing soft gripper design, multimodal sensing, and learning‐based planning and control. It surveys key neural network architectures and benchmark datasets and identifies critical challenges such as sim‐to‐real transfer, generalization, and continual ...
Arnab Majumder +3 more
wiley +1 more source
A multimodal intravital imaging platform enables longitudinal tracking of human cortical organoids transplanted into chronic stroke lesions. By combining surgical microscopy, MRI, bioluminescence imaging, and two‐photon fluorescence microscopy, the platform captures graft placement, viability dynamics, and cellular‐scale morphology in vivo, offering a ...
Jinghui Wang +12 more
wiley +1 more source
Solid Harmonic Wavelet Bispectrum for Image Analysis
The Solid Harmonic Wavelet Bispectrum (SHWB), a rotation‐ and translation‐invariant descriptor that captures higher‐order (phase) correlations in signals, is introduced. Combining wavelet scattering, bispectral analysis, and group theory, SHWB achieves interpretable, data‐efficient representations and demonstrates competitive performance across texture,
Alex Brown +3 more
wiley +1 more source
Cross Kingdom Metabolic Engineering Paradigm Elevating Sustainable Protein Production
ABSTRACT Confronting the dual crisis of escalating global protein demand and unsustainable agriculture necessitates transformative solutions. Here, we pioneer evolutionary insights from maize nitrogen optimization via asparagine synthetase (ASNS) to rewire metabolism in Pichia pastoris.
Yuanyuan Du +4 more
wiley +1 more source
A graph that has a Smarandachely vertex-mean k-labeling is called Smarandachely k vertex-mean graph or Smarandachely k V -mean graph. Particularly, if k = 0, such a Smarandachely vertex-mean 0-labeling and Smarandachely 0 vertex-mean graph or ...
Lourdusamy, A., Seenivasan, M.
core +1 more source

