32 resultados para Almost-sectional paths


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Background Comparisons of objectively measured physical activity (PA) between residents of European countries measured concurrently with the same protocol are lacking. We aimed to compare PA between the seven European countries involved in the Food4Me Study, using accelerometer data collected remotely via the Internet. Methods Of the 1607 participants recruited, 1287 (539 men and 748 women) provided at least 3 weekdays and 2 weekend days of valid accelerometer data (TracmorD) at baseline and were included in the present analyses. Results Men were significantly more active than women (physical activity level = 1.74 vs. 1.70, p < 0.001). Time spent in light PA and moderate PA differed significantly between countries but only for women. Adherence to the World Health Organization recommendation to accumulate at least 150 min of moderate-equivalent PA weekly was similar between countries for men (range: 54–65%) but differed significantly between countries for women (range: 26–49%). Prevalence estimates decreased substantially for men and women in all seven countries when PA guidelines were defined as achieving 30 min of moderate and vigorous PA per day. Conclusions We were able to obtain valid accelerometer data in real time via the Internet from 80% of participants. Although our estimates are higher compared with data from Sweden, Norway, Portugal and the US, there is room for improvement in PA for all countries involved in the Food4Me Study.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The Team Formation problem (TFP) has become a well-known problem in the OR literature over the last few years. In this problem, the allocation of multiple individuals that match a required set of skills as a group must be chosen to maximise one or several social positive attributes. Speci�cally, the aim of the current research is two-fold. First, two new dimensions of the TFP are added by considering multiple projects and fractions of people's dedication. This new problem is named the Multiple Team Formation Problem (MTFP). Second, an optimization model consisting in a quadratic objective function, linear constraints and integer variables is proposed for the problem. The optimization model is solved by three algorithms: a Constraint Programming approach provided by a commercial solver, a Local Search heuristic and a Variable Neighbourhood Search metaheuristic. These three algorithms constitute the first attempt to solve the MTFP, being a variable neighbourhood local search metaheuristic the most effi�cient in almost all cases. Applications of this problem commonly appear in real-life situations, particularly with the current and ongoing development of social network analysis. Therefore, this work opens multiple paths for future research.