‎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...

Multi-constraint quality-of-service routing will become increasingly important as the Internet evolves to support real-time services. It is well known however, that optimum multi-constraint QoS routing is computationally complex, and for this reason various heuristics have been proposed for routing in practical situations. Among these methods, those that use a single mixed metric are the mo...

CA Corresponding Author Tel: (+55)11 3726 7222, ext. 2165 Fax: (+55)11 3726 1505 E-mail: [email protected] BACKGROUND: We have previously shown that the calcium-binding protein MRP-14 secreted by neutrophils mediates the antinociceptive response in an acute inflammatory model induced by the intraperitoneal injection of glycogen in mice. Aim: In an attempt to broaden the concept that neutrophil...

We study the spectrum of transfer operators associated to various dynamical systems. Our aim is obtain precise information on discrete spectrum. To this end we propose a unitary approach. consider settings where new can be obtained following different branches along proposed path. These include affine expanding Markov maps, uniformly non-uniformly or simply monotone hyperbolic diffeomorphisms. ...