Results 111 to 120 of about 218,505 (300)
Near‐Field Electrospinning Micro‐Printhead Achieves Precise Control of Nanofiber Deposition
Advanced Engineering Materials, EarlyView.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 scaling out-of-kilter algorithm for minimum cost flow
, 2005 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
Advanced Engineering Materials, EarlyView.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
Powder Optimization Strategies for Binder Jetting Printing of BaTiO3 and Ba0,6Sr0,4TiO3 Ceramics
Advanced Engineering Materials, EarlyView.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
A New Minimum Cost Flow Algorithm with Applications to Graph Drawing
, 1997 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
Advanced Engineering Materials, EarlyView.This study demonstrates how optimizing laser power, scanning speed, and hatching distance in laser powder bed fusion can boost the productivity of Inconel 718 manufacturing by up to 29% while maintaining mechanical integrity. The work delivers a validated process window and cost–time analysis, offering industry‐ready guidelines for efficient additive ...
Amir Behjat +7 more
wiley +1 more source
Discover WaterThe 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
Minimum Cost Flows in Graphs with Unit Capacities.
, 2015 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
Advanced Engineering Materials, EarlyView.A unified research data management framework for heterogeneous materials data is presented. The system integrates multimodal datasets using ontologies and knowledge graphs, enabling interoperability and FAIR (findable, accessible, interoperable, reusable) data principles. By linking data across scales and workflows, it supports reproducible, Artifitial
Doaa Mohamed +6 more
wiley +1 more source
On the Complexity of the Maximum Minimum Cost Flow Problem
, 2019 Consider a flow network, i.e., a directed graph where each arc has a nonnegative capacity and an associated length, together with nonempty supply-intervals for the sources and nonempty demand-intervals for the sinks.
Hoppmann, Kai
core