The expected transmission count (ETX) metric is a new route metric for finding high-throughput paths in multi-hop wireless networks. The ETX of a path is the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet along that path. For practical networks, paths with the minimum ETX have the highest throughput. The ETX metric incorporate...

PURPOSES To describe the process of gait initiation of pregnant women and to compare the behavior of the pressure center in the three trimesters of pregnancy. METHODS Fifty-seven low-risk pregnant women were evaluated, aged 18 to 35 years, selected for convenience location during the three trimesters of pregnancy. The women were divided into three groups of 19 subjects each, according to gest...

Background Intensive physical exercise that competitive sports athletes participate in can negatively affect their pro-oxidative–antioxidant balance. Compounds with high antioxidant potential, such as those present chokeberry (Aronia melanocarpa), prevent these adverse changes. We here investigated the effect of supplementation on oxidative stress balance young footballers.Methods The study was...

The Network Configuration Protocol (NETCONF) is applicable to a wide range of devices in a variety of environments. Web Services is one such environment and is presently characterized by the use of the Simple Object Access Protocol (SOAP). NETCONF finds many benefits in this environment: from the reuse of existing standards, to ease of software development, to integration with deployed systems....

The Network Configuration Protocol (NETCONF) is applicable to a wide range of devices in a variety of environments. Web Services is one such environment and is presently characterized by the use of the Simple Object Access Protocol (SOAP). NETCONF finds many benefits in this environment: from the reuse of existing standards, to ease of software development, to integration with deployed systems....

We explore the question how well we can color graphs in distributed models, especially in graph classes for which ∆+ 1-colorings provide no approximation guarantees. We particularly focus on interval graphs. In the LOCAL model, we give an algorithm that computes a constant factor approximation to the coloring problem on interval graphs in O(log∗ n) rounds, which is best possible. The result hol...