Results 131 to 140 of about 524,063 (295)

Architecture‐Driven Sensor Stability in Weft‐Knitted Engineering Textiles

open access: yesAdvanced Engineering Materials, EarlyView.
Textile‐integrated sensor architectures are systematically compared to evaluate their electromechanical behavior under combined mechanical and environmental loading. Pocket‐based integration exhibits stable and reproducible signals, whereas tunnel‐based routing shows higher sensitivity accompanied by increased variability.
Adnan Maroof Khan   +5 more
wiley   +1 more source

Adaptive Foam 3D Printing of Ultralight and Multifunctional Materials

open access: yesAdvanced Engineering Materials, EarlyView.
Adaptive foam 3D printing, enabled by expandable microspheres, imparts cellular structures to thermoplastic and thermosetting polymers, manufactured through a variety of processes including fused filament fabrication, direct ink writing, digital light processing, and inkjet printing.
Nariman Rajabifar, Amir Ameli
wiley   +1 more source

Blocked algorithm of finding all-pairs shortest paths in graphs divided into weakly connected clusters

open access: yesСистемный анализ и прикладная информатика
The problem of finding all shortest paths between vertices in a graph (APSP) has real-life applications in planning, communication, economics and many other areas.
O. N. Karasik, A. A. Prihozhy
doaj   +1 more source

Controlling Grain Growth in Powder Bed Fusion of Yttria‐Stabilized Zirconia Using Femtosecond Lasers: Challenges and Methodological Insights

open access: yesAdvanced Engineering Materials, EarlyView.
Binder‐free laser powder bed fusion of 8YSZ with a femtosecond laser is used to map process windows linking scan strategy, heat accumulation, and grain growth. Time‐resolved thermography and simulations reveal thermal regimes that enable continuous, vitrified, and fine‐grained 8YSZ surface layers without absorptive additives and demonstrate ...
Markus Kühn   +5 more
wiley   +1 more source

Universal Shortest Paths [PDF]

open access: yes, 2010
We introduce the universal shortest path problem (Univ-SPP) which generalizes both - classical and new - shortest path problems. Starting with the definition of the even more general universal combinatorial optimization problem (Univ-COP), we show that a
Hamacher, Horst W., Turner, Lara
core   +1 more source

Gallium Microalloying in Bi–Sn Solders: Interfacial Phase Formation, Wettability, and Long‐Term Shear Reliability Under Isothermal Aging

open access: yesAdvanced Engineering Materials, EarlyView.
Gallium microalloying redirects interfacial reactions in low‐temperature Bi–Sn solders from Cu–Sn toward Cu–Ga intermetallic formation. The resulting Cu–Ga layer suppresses intermetallic growth during thermal aging, alters fracture pathways, and improves interfacial stability.
Iva Králová   +6 more
wiley   +1 more source

Shortest Paths In Unweighed Graphs

open access: yes, 2006
When dealing with shortest paths in weighed or unweighed graphs, one may solve one-to-one, one-to-all or all-to-all instances. But the known algorithms compute one single shortest path of the considered instance.
Koskas, Michel
core   +2 more sources

Shortest Paths in a Graph

open access: yes, 2009
This thesis deals with shortest paths problem in graphs. Shortest paths problem is the basic issue of graph theory with many pracitcal applications. We can divide this problem into two following generalizations: single-source shortest path problem and ...
Krauter, Michal
core  

Morphology, Transport, and Dynamics of Protein Adsorption in Open‐Cell Metal Foam

open access: yesAdvanced Engineering Materials, EarlyView.
Stainless steel (SS) open‐cell foams are shown to adsorb more protein per unit area than previously reported 316L SS and chromium oxide surfaces under static and flow conditions. An integrated approach combining 3D pore imaging, flow simulation, and protein adsorption experiments characterizes the foam’s performance.
Chinmaya Prerana Inguva   +2 more
wiley   +1 more source

Precedence‐Constrained Shortest Path

open access: yesNetworks
ABSTRACTWe propose a variant of the shortest path problem where the order in which vertices occur in the path is subject to precedence constraints. Precedence constraints are defined in terms of vertex pairs which indicate that a vertex is the predecessor of a vertex .
Christina Büsing   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy