Chloromycetin in the nutrition of the silkworm Bombyx mori L.-II. Influence on digestion and utilization of protein, fat, and minerals

The nature and extent of the influence of chloromycetin on larval digestion and utilization of the principal dietary constituents-the proteins, fats, and minerals-was studied. The antibiotic was shown to influence favourably the utilization of all the constituents studied. The results have been discussed in the light of these and other findings.

The Effect of Obesity on Wages and Employment: The Difference Between Having a High BMI and Being Fat

In this paper, we re-examine the relationship between overweight and labour market success, using indicators of individual body composition along with BMI (Body Mass Index). We use the dataset from Finland in which weight, height, fat mass and waist circumference are not self-reported, but obtained as part of the overall health examination. We find that waist circumference, but not weight or fat mass, has a negative effect on wages for women, whereas all measures of obesity have negative effects on women’s employment probabilities. For men, the only obesity measure that is significant for men’s employment probabilities is fat mass. One interpretation of our findings is that the negative wage effects of overweight on wages run through the discrimination channel, but that the negative effects of overweight on employment have more to do with ill health. All in all, measures of body composition provide a more refined picture about the effects of obesity on wages and employment.

Snow cover models in operational watershed forecasting

Yhteenveto: Lumimallit vesistöjen ennustemalleissa

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

We present a distributed algorithm that finds a maximal edge packing in O(Δ + log* W) synchronous communication rounds in a weighted graph, independent of the number of nodes in the network; here Δ is the maximum degree of the graph and W is the maximum weight. As a direct application, we have a distributed 2-approximation algorithm for minimum-weight vertex cover, with the same running time. We also show how to find an f-approximation of minimum-weight set cover in O(f2k2 + fk log* W) rounds; here k is the maximum size of a subset in the set cover instance, f is the maximum frequency of an element, and W is the maximum weight of a subset. The algorithms are deterministic, and they can be applied in anonymous networks.

A local 2-approximation algorithm for the vertex cover problem

We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (Δ + 1)2 synchronous communication rounds, where Δ is the maximum degree of the graph. For Δ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.

A simple local 3-approximation algorithm for vertex cover

We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxiliary information besides port numbering is required. (c) 2009 Elsevier B.V. All rights reserved.

A local 2-approximation algorithm for the vertex cover problem

We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (Δ + 1)2 synchronous communication rounds, where Δ is the maximum degree of the graph. For Δ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.