Optimal V. O2max-to-mass ratio for predicting 15 km performance among elite male cross-country skiers

The aim of this study was 1) to validate the 0.5 body-mass exponent for maximal oxygen uptake (V. O2max) as the optimal predictor of performance in a 15 km classical-technique skiing competition among elite male cross-country skiers and 2) to evaluate the influence of distance covered on the body-mass exponent for V. O2max among elite male skiers. Twenty-four elite male skiers (age: 21.4±3.3 years [mean ± standard deviation]) completed an incremental treadmill roller-skiing test to determine their V. O2max. Performance data were collected from a 15 km classicaltechnique cross-country skiing competition performed on a 5 km course. Power-function modeling (ie, an allometric scaling approach) was used to establish the optimal body-mass exponent for V . O2max to predict the skiing performance. The optimal power-function models were found to be race speed = 8.83⋅(V . O2max m-0.53) 0.66 and lap speed = 5.89⋅(V . O2max m-(0.49+0.018lap)) 0.43e0.010age, which explained 69% and 81% of the variance in skiing speed, respectively. All the variables contributed to the models. Based on the validation results, it may be recommended that V. O2max divided by the square root of body mass (mL⋅min−1 ⋅kg−0.5) should be used when elite male skiers’ performance capability in 15 km classical-technique races is evaluated. Moreover, the body-mass exponent for V . O2max was demonstrated to be influenced by the distance covered, indicating that heavier skiers have a more pronounced positive pacing profile (ie, race speed gradually decreasing throughout the race) compared to that of lighter skiers.

Ett litet ord betyder så mycket : Alliansregeringen, Handlingsplanen och betydelseförskjutningarav begreppet mäns våld mot kvinnor

A little word may mean so much: Changed meanings of the concept men’s violence against women This article concerns the process of policymaking in the Swedish political system with a focus on the concept of men’s violence against women. The material analyzed is based on interviews with key civil servants and the Minister of Equality responsible for the ”Action Plan for Combating Men’s Violence Against Women” launched by the right wing government in 2007. The article shows how a shift in the concept of men’s violence against women is achieved through complex negotiations involving the administration staff as well as the political representatives.The outcome is a change from an understanding of the issue as a structural gender power relation problem, to explaining it as related to individual deviations. This change has been made by re-wording and editing out earlier understandings of men’s violence against women as a structural gender power concern in policies and guidelines, so that the concept is framed as something pertaining to groups of vulnerable women with specific individual obstacles. The political goals are then expressed along the lines of providing support for each group’s designated problems, but the connection to gendered power structures is made invisible.

Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing

This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. The goal is to solve the transportation problem, to be able to deliver the packages-on time for the customers,-enough package for each Customer,-using the available resources- and – of course - to be so effective as it is possible.Although this problem seems to be very easy to solve with a small number of cities or customers, it is not. In this problem the algorithm have to face with several constraints, for example opening hours, package delivery times, truck capacities, etc. This makes this problem a so called Multi Constraint Optimization Problem (MCOP). What’s more, this problem is intractable with current amount of computational power which is available for most of us. As the number of customers grow, the calculations to be done grows exponential fast, because all constraints have to be solved for each customers and it should not be forgotten that the goal is to find a solution, what is best enough, before the time for the calculation is up. This problem is introduced in the first chapter: form its basics, the Traveling Salesman Problem, using some theoretical and mathematical background it is shown, why is it so hard to optimize this problem, and although it is so hard, and there is no best algorithm known for huge number of customers, why is it a worth to deal with it. Just think about a huge transportation company with ten thousands of trucks, millions of customers: how much money could be saved if we would know the optimal path for all our packages.Although there is no best algorithm is known for this kind of optimization problems, we are trying to give an acceptable solution for it in the second and third chapter, where two algorithms are described: the Genetic Algorithm and the Simulated Annealing. Both of them are based on obtaining the processes of nature and material science. These algorithms will hardly ever be able to find the best solution for the problem, but they are able to give a very good solution in special cases within acceptable calculation time.In these chapters (2nd and 3rd) the Genetic Algorithm and Simulated Annealing is described in details, from their basis in the “real world” through their terminology and finally the basic implementation of them. The work will put a stress on the limits of these algorithms, their advantages and disadvantages, and also the comparison of them to each other.Finally, after all of these theories are shown, a simulation will be executed on an artificial environment of the VRP, with both Simulated Annealing and Genetic Algorithm. They will both solve the same problem in the same environment and are going to be compared to each other. The environment and the implementation are also described here, so as the test results obtained.Finally the possible improvements of these algorithms are discussed, and the work will try to answer the “big” question, “Which algorithm is better?”, if this question even exists.