Results 61 to 70 of about 218,626 (238)
Shortest-Path Reconstruction Algorithms [PDF]
The Computer Journal, 1993 Summary: We study the problem of computing shortest paths between pairs of vertices in an \(n\)-vertex graph, given only the all pairs shortest paths distance matrix. This computation is called a reconstruction, since the algorithm has no access to explicit information about edges in the original graph. We present the following results: 1.
openaire +2 more sources
Advanced Engineering Materials, EarlyView.Stabilization of L‐PBF Ni50.7Ti49.3 under low‐cycle loading was investigated. Recoverable strain after cycling was dependent on the amount of applied load. Recovery ratio was 53.4% and 35.1% at intermediate and high load, respectively. The maximum total strain reached 10.3% at a high load of 1200 MPa.
Ondřej Červinek +5 more
wiley +1 more source
Additive Gaussian Process Regression for Predictive Design of High‐Performance, Printable Silicones
Advanced Engineering Materials, EarlyView.A chemistry‐aware design framework for tuning printable polydimethylsiloxane (PDMS) for vat photopolymerization (VPP) is developed using additive Gaussian process (GP) modeling. Polymer network mechanics informs variable groupings, feasible formulation constraints, and interaction variables.
Roxana Carbonell +3 more
wiley +1 more source
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
Shortest-weight paths in random regular graphs [PDF]
, 2012 Consider a random regular graph with degree $d$ and of size $n$. Assign to each edge an i.i.d. exponential random variable with mean one. In this paper we establish a precise asymptotic expression for the maximum number of edges on the shortest-weight ...
Amini, Hamed, Peres, Yuval
core +1 more source
Influence of an Oxygen‐Free Atmosphere on Diamond‐Single‐Grain Scratching of Ti–6Al–4V
Advanced Engineering Materials, EarlyView.Single‐grain scratching of Ti–6Al–4V is investigated under controlled, oxygen‐free, and ambient atmospheres using a novel experimental setup with in situ high‐speed imaging. The approach enables direct observation of chip formation and adhesion under suppressed oxidation.
Berend Denkena +2 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.This study investigates laser‐based oxide removal of Cu inserts in oxygen‐free conditions and examines long‐term oxidation kinetics and surface chemistry under different atmospheres via X‐ray photoelectron spectroscopy. Al–Cu compound casting with differently oxidized surfaces is performed, and intermetallic phase formation, morphology, and thermal ...
Timon Steinhoff +9 more
wiley +1 more source
Finding k-Dissimilar Paths with Minimum Collective Length
, 2018 Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough.
Blumenthal, David B. +4 more
core +1 more source
Advanced Engineering Materials, EarlyView.The wettability of aluminum droplets (Al) on different copper substrates (Cu), where liquid Al spreads on solid Cu surfaces to form a liquid–solid interface, is studied numerically and experimentally. The experimental and numerical results show good agreement in the fast‐spreading regime.
Shan Lyu +8 more
wiley +1 more source
Faster all-pairs shortest paths via circuit complexity
, 2014 We present a new randomized method for computing the min-plus product (a.k.a., tropical product) of two $n \times n$ matrices, yielding a faster algorithm for solving the all-pairs shortest path problem (APSP) in dense $n$-node directed graphs with ...
Aho Alfred V. +3 more
core +1 more source