Results 111 to 120 of about 356,172 (299)
Minimum Cost Flows in Graphs with Unit Capacities.
We consider the minimum cost flow problem on graphs with unit capacities and its special cases. In previous studies, special purpose algorithms exploiting the fact that capacities are one have been developed. In contrast, for maximum flow with unit capacities, the best bounds are proven for slight modifications of classical blocking flow and push ...
Goldberg, Andrew V. +3 more
openaire +3 more sources
Minimum-Cost Network Flow with Dual Predictions
Recent work has shown that machine-learned predictions can provably improve the performance of classic algorithms. In this work, we propose the first minimum-cost network flow algorithm augmented with a dual prediction. Our method is based on a classic minimum-cost flow algorithm, namely ε-relaxation.
Zhiyang Chen 0006 +2 more
openaire +2 more sources
Zein‐Based Adhesives: Sustainable Extraction and Application in Bioadhesive Technologies
Zein is extracted from corn gluten meal using a simple and scalable process with high yield (~90%). The resulting protein is applied in bioadhesives modified with Ca2+ and Fe3+ ions, exhibiting substrate‐dependent adhesion. The findings demonstrate competitive bonding performance and highlight the role of ionic interactions in tuning adhesion ...
Paula Bertolino Sanvezzo +3 more
wiley +1 more source
A hierarchical porous copper current collector is fabricated via three‐dimensional printing combined with pressureless sintering to stabilize lithium metal anodes. The interconnected architecture lowers local current density, guides uniform Li deposition within pores, and suppresses dendrite growth.
Alok Kumar Mishra, Mukul Shukla
wiley +1 more source
The literature has explored various methods for assessing minimum environmental flow. Implementing holistic approaches proves to be prohibitively expensive and impractical for many small and medium projects.
Mahdi Sedighkia, Bithin Datta
doaj +1 more source
A scaling out-of-kilter algorithm for minimum cost flow
The out-of-kilter algorithm is one of the basic algorithms that solve the minimum cost flow problem. Its drawback is that it can improve the objective function at each iteration by only a small value. Consequently, it runs in pseudo-polynomial time.
Ciupala, L.
core
Near‐Field Electrospinning Micro‐Printhead Achieves Precise Control of Nanofiber Deposition
A micro‐printhead for near‐field electrospinning enables reproducible deposition of polymer nanofibers with diameters below 50 nm. Systematic parameter studies uncover the mechanisms linking operating conditions to fiber morphology, paving the way for precise and low‐cost nanoscale 3D manufacturing.As a high‐resolution, cost‐effective, and rapid ...
Han Xu, Dario Mager, Jan G. Korvink
wiley +1 more source
A combined finite element and phase‐field approach predicts the evolution of microstructure during the directional solidification of Ni‐based superalloys. The model reveals how withdrawal rate, temperature gradient, and wall thickness control the dendrite spacing, highlighting the strong effect of surface regions in thin sections where dendrite growth ...
Sean Böhm +3 more
wiley +1 more source
A New Minimum Cost Flow Algorithm with Applications to Graph Drawing
Let N be a single-source single-sink flow network with n nodes, m arcs, and positive arc costs. We present a pseudo-polinomial algorithm that computes a maximum flow of minimum cost for N in time O( X^(3/4)m* \sqrt{logn}), where X is the cost of the flow.
Tamassia, Roberto, Garg, Ashim
core +1 more source
Powder Optimization Strategies for Binder Jetting Printing of BaTiO3 and Ba0,6Sr0,4TiO3 Ceramics
Powder optimization is investigated to enable binder jetting of BaTiO3 and Ba0.6Sr0.4TiO3 ferroelectric ceramics. The antagonistic relationship between flowability and binder compatibility is addressed through binder impregnation of granulated powders and fumed silica addition to fine powders.
Fanny Pruvost +4 more
wiley +1 more source

