Results 61 to 70 of about 202,813 (262)
Smart Rubber Extrusion Line Combining Multiple Sensor Techniques for AI‐Based Process Control
This publication presents a digitalization approach for a laboratory rubber extrusion line, employing innovative measurement methods and artificial intelligence (AI)‐based process control. The results demonstrate that the measurement systems are capable of detecting changes in the process and extrudate quality.
Alexander Aschemann+18 more
wiley +1 more source
Temporal power modulation increases weld depth in high‐power laser beam welding of dissimilar round bars by nearly 20% compared to same average continuously welded welding power. The mechanism of action also applies to sheet welding and depends on the inertia of keyhole depth for the modulated laser beam power.
Jan Grajczak+7 more
wiley +1 more source
2-subcoloring is NP-complete for planar comparability graphs [PDF]
A $k$-subcoloring of a graph is a partition of the vertex set into at most $k$ cluster graphs, that is, graphs with no induced $P_3$. 2-subcoloring is known to be NP-complete for comparability graphs and three subclasses of planar graphs, namely triangle-free planar graphs with maximum degree 4, planar perfect graphs with maximum degree 4, and planar ...
arxiv
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends
We study the following classes of beyond-planar graphs: 1-planar, IC-planar, and NIC-planar graphs. These are the graphs that admit a 1-planar, IC-planar, and NIC-planar drawing, respectively.
C Bachmaier+13 more
core +1 more source
A methodology for establishing an ontology‐augmented structural digital twin for fiber‐reinforced polymer structures dedicated to individual lifetime prediction, in this case, a wind turbine rotor blade, is introduced. The methodology resembles the manufacturing as well as the operation of the structure.
Marc Luger+6 more
wiley +1 more source
On Upward Drawings of Trees on a Given Grid
Computing a minimum-area planar straight-line drawing of a graph is known to be NP-hard for planar graphs, even when restricted to outerplanar graphs. However, the complexity question is open for trees.
A Gregori+13 more
core +1 more source
Hydrostatic bearings excel in high‐precision applications, but their performance hinges on a continuous external supply. This study evaluates various material combinations for sliding surfaces to mitigate damage during supply failures or misalignment and to discover the most effective materials identified for enhancing the reliability and efficiency of
Michal Michalec+6 more
wiley +1 more source
The edge-vertex inequality in a planar graph and a bipartition for the class of all planar graphs [PDF]
For a planar graph with a given f-vector $(f_{0}, f_{1}, f_{2}),$ we introduce a cubic polynomial whose coefficients depend on the f-vector. The planar graph is said to be real if all the roots of the corresponding polynomial are real. Thus we have a bipartition of all planar graphs into two disjoint class of graphs, real and complex ones.
arxiv
We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., convex drawings. We consider two families of graph classes with nice convex drawings: outer $k$-planar graphs, where each edge is crossed by at
AWM Dress+23 more
core +1 more source
The additive manufacturing technology laser powder bed fusion enables the manufacturing of pure Zn thin walls as battery electrodes. Modification of the laser beam parameters allows to tailor the physical characteristics of the as‐deposited thin walls.
Leonardo Caprio+3 more
wiley +1 more source