Results 51 to 60 of about 170,454 (272)
Abstract Purpose Due to the tight curvature in their design, ring applicators are usually associated with large positioning errors. The standard practice to correct for these deviations based on global offsets may not be sufficient to comply with the recommended tolerance.
Leon G. Aldrovandi+3 more
wiley +1 more source
An MRI assessment of mechanisms underlying lesion growth and shrinkage in multiple sclerosis
By applying the tensor model, we analysed lesion orientation and the directionality of lesion expansion/contraction in multiple sclerosis. Each lesion is summarized as an ellipsoid, and the tensor model is applied to calculate lesion anisotropy. From the top to the bottom white matter atlas, surface‐in gradient segmentation and venous atlas used in the
Ermelinda De Meo+9 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
Summary Data‐driven forecasting of ship motions in waves is investigated through feedforward and recurrent neural networks as well as dynamic mode decomposition. The goal is to predict future ship motion variables based on past data collected on the field, using equation‐free approaches.
Matteo Diez+2 more
wiley +1 more source
Vector Bond Graph Method of Kineto-static Analysis for Planar Multi-body System with Gear Pair
In order to increase the reliability and efficiency of the kineto-static analysis of complex planar multi-body system,the corresponding vector bond graph method is proposed.According to the kinematic constraint condition,the vector bond graph model of a ...
Wang Zhongshuang+3 more
doaj
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
On the Planarity of Generalized Line Graphs
One of the most familiar derived graphs is the line graph. The line graph $L(G)$ of a graph $G$ is that graph whose vertices are the edges of $G$ where two vertices of $L(G)$ are adjacent if the corresponding edges are adjacent in~$G$.
Khawlah H. Alhulwah+2 more
doaj +1 more source
Elasticity of Diametrically Compressed Microfabricated Woodpile Lattices
Modulus–porosity relationship is derived for woodpile lattices with struts under diametrical compression. The formula presented here that Young's modulus is proportional to the square of the volume fraction E˜ρ2$E \sim \left(\rho\right)^{2}$ is shown to be consistent with computations and laboratory experiments on 3D‐printed samples.
Faezeh Shalchy, Atul Bhaskar
wiley +1 more source
Choosability in signed planar graphs [PDF]
This paper studies the choosability of signed planar graphs. We prove that every signed planar graph is 5-choosable and that there is a signed planar graph which is not 4-choosable while the unsigned graph is 4-choosable. For each $k \in \{3,4,5,6\}$, every signed planar graph without circuits of length $k$ is 4-choosable.
arxiv
In this study, exciting new bi‐/multi‐linear elastic behavior of soft elastic composites that accompany the activation of wrinkling in the embedded interfacial layers is analyzed. The new features and performance of these composite materials, including dramatic enhancements in energy storage, can be tailored by the concentration of interfacial layers ...
Narges Kaynia+2 more
wiley +1 more source