Results 81 to 90 of about 133,936 (292)
Degree-bounded minimum spanning tree for unit disk graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xu, Hongli +4 more
openaire +2 more sources
Computational Modeling Meets 3D Bioprinting: Emerging Synergies in Cardiovascular Disease Modeling
Emerging advances in three‐dimensional bioprinting and computational modeling are reshaping cardiovascular (CV) research by enabling more realistic, patient‐specific tissue platforms. This review surveys cutting‐edge approaches that merge biomimetic CV constructs with computational simulations to overcome the limitations of traditional models, improve ...
Tanmay Mukherjee +7 more
wiley +1 more source
Application of Improved Interactive Multimodel Algorithm in Player Trajectory Feature Matching
The original target tracking algorithm based on a single model has long been unable to meet the complex and changeable characteristics of the target, and then there are problems such as poor tracking accuracy, target loss, and model mismatch.
Xi Du, Qi Ao, Lu Qi
doaj +1 more source
This work introduces photo‐crosslinkable tyraminated poly(vinyl alcohol)‐gelatin (PVA‐GT) hydrogels as tunable injectable platforms for tissue engineering and growth factor delivery applications. This schematic illustrates the two developed hydrogel formulations and the experimental workflow used to evaluate their physico‐chemical properties in vitro ...
Alessia Longoni +15 more
wiley +1 more source
An Optimization Routing Algorithm for Green Communication in Underground Mines
With the long-term dependence of humans on ore-based energy, underground mines are utilized around the world, and underground mining is often dangerous. Therefore, many underground mines have established networks that manage and acquire information from ...
Heng Xu +5 more
doaj +1 more source
Recent evidence increasingly associates network disruption in brain organization with multiple neurodegenerative diseases, including amyotrophic lateral sclerosis (ALS), a rare terminal disease. However, the comparability of brain network characteristics
Seyyed Bahram Borgheai +5 more
doaj +1 more source
Max-Leaves Spanning Tree is APX-hard for Cubic Graphs [PDF]
We consider the problem of finding a spanning tree with maximum number of leaves (MaxLeaf). A 2-approximation algorithm is known for this problem, and a 3/2-approximation algorithm when restricted to graphs where every vertex has degree 3 (cubic graphs).
Bonsma, Paul
core
Rapid dynamical mass segregation and properties of fractal star clusters
We investigate the evolution of young star clusters using N-body simulations. We confirm that subvirial and fractal-structured clusters will dynamically mass segregate on a short timescale (within 0.5 Myr). We adopt a modified minimum-spanning-tree (MST)
Allison +13 more
core +1 more source
This work pioneers melt electrowriting (MEW) of polyethylene vinyl acetate (PEVA) to fabricate ultra‐compliant, high‐resolution scaffolds. By integrating microscale precision with soft tissue‐like biomechanics, PEVA overcomes stiffness‐driven limitations of conventional MEW polymers, establishing a mechanically biomimetic platform for soft tissue ...
Finn Snow +9 more
wiley +1 more source
Topology control scheme based on simulated annealing algorithm in wireless sensor networks
In order to study the topology control scheme satisfying the requirement of lifetime objective in wireless sen-sor networks and aiming at the defect that high redundancy of connectivity or low robust of structure in traditional schemes, the desire of ...
LIU Lin-feng, LIU Ye
doaj +2 more sources

