Abstract: The action of a pneumatic muscle actuator (PMA) is very similar to that of animal skeletal muscle. It also has other advantages such as high power/weight ratio, high power/volume ratio, low price, little maintenance needed, great compliance and inherent safety. Therefore, it can be suitably applied to rehabilitation engineering for persons with neuromuscular or musculoskeletal patholo...

In our previous demonstrations of chromatic discrimination in infants, we have used test and surround fields of different chromaticities that abutted each other at sharp chromatic edges. In order to see whether sharp chromatic edges are necessary for infants to make chromatic discriminations, 16-week-old infants were tested with three stimulus configurations in which sharp chromatic edges were ...

In this paper, we propose the spectral collocation method based on radial basis functions to solve the fractional Bagley-Torvik equation under uncertainty, in the fuzzy Caputo's H-differentiability sense with order ($1< nu < 2$). We define the fuzzy Caputo's H-differentiability sense with order $nu$ ($1< nu < 2$), and employ the collocation RBF method for upper and lower approximate solutions. ...

That's it, a book to wait for in this month. Even you have wanted for long time for releasing this book chromatic algorithms synthetic color computer art and aesthetics after code; you may not be able to get in some stress. Should you go around and seek fro the book until you really get it? Are you sure? Are you that free? This condition will force you to always end up to get a book. But now, w...

let $g$ be a connected graph of order $3$ or more and $c:e(g)rightarrowmathbb{z}_k$‎ ‎($kge 2$) a $k$-edge coloring of $g$ where adjacent edges may be colored the same‎. ‎the color sum $s(v)$ of a vertex $v$ of $g$ is the sum in $mathbb{z}_k$ of the colors of the edges incident with $v.$ the $k$-edge coloring $c$ is a modular $k$-edge coloring of $g$ if $s(u)ne s(v)$ in $mathbb{z}_k$ for all pa...

for a given hypergraph $h$ with chromatic number $chi(h)$ and with no edge containing only one vertex, it is shown that the minimum number $l$ for which there exists a partition (also a covering) ${e_1,e_2,ldots,e_l}$ for $e(h)$, such that the hypergraph induced by $e_i$ for each $1leq ileq l$ is $k$-colorable, is $lceil log_{k} chi(h) rceil$.

Sophisticated fuzzy rule systems are supposed to be flexible, complete, consistent and compact (FC(3)). Flexibility, and consistency are essential for fuzzy systems to exhibit an excellent performance and to have a clear physical meaning, while compactness is crucial when the number of the input variables increases. However, the completeness and consistency conditions are often violated if a fu...

‎let $f$ be a proper $k$-coloring of a connected graph $g$ and‎ ‎$pi=(v_1,v_2,ldots,v_k)$ be an ordered partition of $v(g)$ into‎ ‎the resulting color classes‎. ‎for a vertex $v$ of $g$‎, ‎the color‎ ‎code of $v$ with respect to $pi$ is defined to be the ordered‎ ‎$k$-tuple $c_{{}_pi}(v)=(d(v,v_1),d(v,v_2),ldots,d(v,v_k))$‎, ‎where $d(v,v_i)=min{d(v,x):~xin v_i}‎, ‎1leq ileq k$‎. ‎if‎ ‎distinct...