As one of the convenient and noninvasive sensing approaches, the automatic limb girth measurement has been applied to detect intention behind human motion from muscle deformation. The sensing validity has been elaborated by preliminary researches but still need more fundamental studies, especially on kinetic contraction modes. Based on the novel fabric strain sensors, a soft and smart limb girt...

During the 1997 Federation Internationale des Sociétés d'Aviron (FISA) World Junior Rowing Championships, the anthropometric characteristics of 245 female junior rowers aged 17.5 +/- 0.8 years (mean +/- s) were assessed. Twenty-seven body dimensions (body mass, 6 heights or lengths, 4 breadths, 10 girths and 6 skinfolds) were measured in total. The elite female junior rowers were taller (174.5 ...

We consider the problem of coloring the squares of graphs of bounded maximum average degree, that is, the problem of coloring the vertices while ensuring that two vertices that are adjacent or have a common neighbour receive different colors. Borodin et al. proved in 2004 and 2008 that the squares of planar graphs of girth at least seven and sufficiently large maximum degree ∆ are list (∆ + 1)-...

OBJECTIVE To evaluate waist-to-height ratio (WTHR), waist girth and body mass index (BMI) as predictors of cardiovascular risk factors in Australian Aborigines. DESIGN Indices were examined as predictors of mean blood pressures (BP), blood lipids, glucose, insulin and as predictors of hypertension, decreased HDL-cholesterol, elevated glucose and type 2 diabetes. SETTING Aboriginal communiti...

The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer μ0(g), the smallest number of vertices for which a cubic graph with girth at least g exists, and furthermore, the minimum value μ0(g) is attained by a graph whose girth is exactly g. The values of μ0(g) when 3 ≤ g ≤ 8 have been known for over thirty y...

Let us take two groups of, say, 310 people each, drawn from the same population. Now let usdraw two large circles. Withineachcircle, let usdraw31 equallyspacedsmallercir-cles, sothat,foreachsmallcircleinonelargecircle, thereisan equivalently situated small circle in the other large circle. Now we instruct the 31 0 people to form self-assorted sub-groupsof lopeopleeach, andoccupyoneofthesmallcir...

A d-angulation is a planar map with faces of degree d. We present for each integer d ≥ 3 a bijection between the class of d-angulations of girth d and a class of decorated plane trees. Each of the bijections is obtained by specializing a “master bijection” which extends an earlier construction of the first author. Bijections already existed for triangulations (d = 3) and for quadrangulations (d...

We show that every (sub)cubic n-vertex graph with sufficiently large girth has fractional chromatic number at most 2.2978 which implies that it contains an independent set of size at least 0.4352n. Our bound on the independence number is valid to random cubic graphs as well as it improves existing lower bounds on the maximum cut in cubic graphs with large girth.

We show that a planar graph with girth at least 20t−2 3 has circular chromatic number at most 2+ 1t , improving earlier results. This follows from a general result establishing homomorphisms into special targets for graphs with given girth and given maximum average degree. Other applications concern oriented chromatic number and homomorphisms into mixed graphs with colored edges.

We describe some new applications of nonabelian pq-groups to construction problems in Graph Theory. The constructions include the smallest known trivalent graph of girth 17, the smallest known regular graphs of girth five for several degrees, along with four edge colorings of complete graphs that improve lower bounds on classical Ramsey numbers.