This study investigated whether the "constant limb force" hypothesis can be applied to bend sprinting on an athletics track and to understand how force production influences performance on the bend compared with the straight. Force and three-dimensional video analyses were conducted on seven competitive athletes during maximal effort sprinting on the bend (radius 37.72 m) and straight. Left ste...

Bend sensors have been developed based on conductive ink, optical fiber, and electronic textiles. Each type has advantages and disadvantages in terms of performance, ease of use, and cost. This study proposes a new and low-cost bend sensor that can measure a wide range of accumulated bend angles with large curvatures. This bend sensor utilizes a Bowden-cable, which consists of a coil sheath and...

Base-level fall in river beds occurs due to varying natural or unnatural causes. Base-level fall causes the change in the behavior of flow at the location of drop in base-level. In such situations, most of scour occur at the foot of the slope, and slope wall retreats in the upstream direction. This phenomenon widens the wall of the river bank, thus leading to its destruction. The amount of bed ...

Use the Spur dike as one of the easiest ways to protect the costal of the river has always been of interest to River engineers.The aim of this study was numerical investigate, the effect of distance and angle of the spur dikes parameters  on the pattern of distribution of average velocity  and the location of maximum velocity position at a mild 90 degree bend. For this purpose used ANSYS CFX so...

Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We present a onedimensional compaction algorithm that alters the orthogonal shape of edges for better geometric results. An experimental evaluation shows that we were able to reduce the total edge length and the drawing...

This paper discusses the calculation of bend minimal shapes for non-planar graphs with given topology. Based on the Simple-Kandinsky drawing standard – a simplification of the more complex Kandinsky standard – we show the disadvantage of using standard models for this task: We show that the minimal bend count is suboptimal, when these models are applied to non-planar graphs; it is therefore ben...

In octilinear drawings of planar graphs, every edge is drawn as an alternating sequence of horizontal, vertical and diagonal (45◦) line-segments. In this paper, we study octilinear drawings of low edge complexity, i.e., with few bends per edge. A k-planar graph is a planar graph in which each vertex has degree less or equal to k. In particular, we prove that every 4-planar graph admits a planar...