Results 71 to 80 of about 186,232 (291)

Triplet‐Triplet Annihilation Enhances Photochemical Curing Contrast for Vat‐Based 3D Printing

Advanced Functional Materials, EarlyView.
Triplet–triplet annihilation photopolymerization (TTAP) resins enhance curing contrast for digital light processing (DLP) 3D printing compared to conventional Type I and II photopolymerizations at matched optical densities. By exploiting a superlinear initiation response, TTAP preserves fine details, allowing reliable fabrication of complex structures ...
Connor J. O'Dea, Evan P. Scruggs, Zachariah A. Page   +2 more
wiley   +1 more source

A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks

, 2011
In the complete graph on n vertices, when each edge has a weight which is an exponential random variable, Frieze proved that the minimum spanning tree has weight tending to zeta(3)=1/1^3+1/2^3+1/3^3+... as n goes to infinity.
Angel, Omer, Flaxman, Abraham D., Wilson, David B.   +2 more
core   +1 more source

Selenium‐Incorporated Polymerized Nonfullerene Acceptors/SWCNT Composites with Polymer‐Assisted n‐Doping for High‐Performance Organic Thermoelectrics

Advanced Functional Materials, EarlyView.
Selenium‐incorporated polymerized nonfullerene acceptor PCB2Se forms a strong supramolecular complex with SWCNTs, enabling a record‐high zT of 0.29. Sequential N‐DMBI doping, mediated through a polymer‐assisted electron‐transfer pathway, successfully converts the PCB2Se/SWCNT composite into an efficient n‐type material with an impressive power factor ...
Chi‐Chun Tseng, Che‐An Chou, Chi Chang, Li‐Lun Yeh, Chien‐Yi Ku, Jhih‐Min Lin, Shih‐Huang Tung, Cheng‐Liang Liu, Yen‐Ju Cheng   +8 more
wiley   +1 more source

Cross Decomposition of the Degree-Constrained Minimum Spanning Tree problem [PDF]

Journal of Systemics, Cybernetics and Informatics, 2007
As computer communication networks become a prevalent part in our daily life, the importance of efficient design of those networks becomes more evident.
Han-Suk Sohn, Dennis Bricker
doaj  

The generalized minimum spanning tree polytope and related polytopes [PDF]

, 2001
The Generalized Minimum Spanning Tree problem denoted by GMST is a variant of the classical Minimum Spanning Tree problem in which nodes are partitioned into clusters and the problem calls for a minimum cost tree spanning at least one node from each ...
Pop, P.C.
core   +1 more source

Computational Modeling Meets 3D Bioprinting: Emerging Synergies in Cardiovascular Disease Modeling

Advanced Healthcare Materials, EarlyView.
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, Mehdi Salar Amoli, Sarah Rezapourdamanab, Lama Rita El Shammas, Martin L. Tomov, Emilio A. Mendiola, Vahid Serpooshan, Reza Avazmohammadi   +7 more
wiley   +1 more source

Algorithms for the minimum spanning tree problem with resource allocation

Operations Research Perspectives, 2016
We formulate the minimum spanning tree problem with resource allocation (MSTRA) in two ways, as discrete and continuous optimization problems (d-MSTRA/c-MSTRA), prove these to be NP-hard, and present algorithms to solve these problems to optimality.
Seiji Kataoka, Takeo Yamada
doaj   +1 more source

Fully dynamic maintenance of euclidean minimum spanning trees [PDF]

, 1992
We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and deletions, in time O(n^5/6 log1^2/2 n) per update operation. No nontrivial dynamic geometric minimum spanning tree algorithm was previously known.
Eppstein, David
core  

Characterization of an Injectable Poly(vinyl alcohol)‐gelatin Hydrogel for Growth Factor Delivery in an Orthopedic Application

Advanced Healthcare Materials, EarlyView.
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, Gretel S. Major, Sam Arnold, Samuel Tomkins, Eugenia Spessot, Scott Loeffler, Kieran Lau, Richard Tan, Jessica Harte, Roslyn Kemp, Tess Reynolds, Jelena Rnjak‐Kovacina, Gary J. Hooper, Tim B. F. Woodfield, David C. Kieser, Khoon S. Lim   +15 more
wiley   +1 more source

The Minimum Spanning Tree Problem on networks with Neutrosophic numbers [PDF]

Neutrosophic Sets and Systems
The minimum spanning tree problem (MSTP) revolves around creating a spanning tree (ST) within a graph/network that incurs the least cost compared to all other potential STs.
Kalyan Adhikary, Prashnatita Pal, Jayanta Poray   +2 more
doaj   +1 more source