Valoración de los efectos de una pretemporada en equipos de fútbol, mediante la aplicación de una batería de test

11 p.El objetivo de este trabajo es determinar si la aplicación de una batería de test es eficaz para valorar el estado físico de los jugadores de un mismo club en sus diferentes categorías; así como analizar si los resultados obtenidos pueden ser utilizados como feed-back en el proceso de entrenamiento, comparándolos con los obtenidos en otros trabajos y estudios precedentes. Participaron 79 futbolistas de distintas edades y niveles. Se concluye con las diferencias halladas tras el estudio, asegurando que la batería de test propuesta resultó muy prácticaS

Fortification and bioaccessibility of saffron apocarotenoids in potato tubers

Carotenoids are C40 isoprenoids with well-established roles in photosynthesis, pollination, photoprotection, and hormone biosynthesis. The enzymatic or ROS-induced cleavage of carotenoids generates a group of compounds named apocarotenoids, with an increasing interest by virtue of their metabolic, physiological, and ecological activities. Both classes are used industrially in a variety of fields as colorants, supplements, and bio-actives. Crocins and picrocrocin, two saffron apocarotenoids, are examples of high-value pigments utilized in the food, feed, and pharmaceutical industries. In this study, a unique construct was achieved, namely O6, which contains CsCCD2L, UGT74AD1, and UGT709G1 genes responsible for the biosynthesis of saffron apocarotenoids driven by a patatin promoter for the generation of potato tubers producing crocins and picrocrocin. Different tuber potatoes accumulated crocins and picrocrocin ranging from 19.41-360 to 105-800 mu g/g DW, respectively, with crocetin, crocin 1 [(crocetin-(beta-D-glucosyl)-ester)] and crocin 2 [(crocetin)-(beta-D-glucosyl)-(beta-D-glucosyl)-ester)] being the main compounds detected. The pattern of carotenoids and apocarotenoids were distinct between wild type and transgenic tubers and were related to changes in the expression of the pathway genes, especially from PSY2, CCD1, and CCD4. In addition, the engineered tubers showed higher antioxidant capacity, up to almost 4-fold more than the wild type, which is a promising sign for the potential health advantages of these lines. In order to better investigate these aspects, different cooking methods were applied, and each process displayed a significant impact on the retention of apocarotenoids. More in detail, the in vitro bioaccessibility of these metabolites was found to be higher in boiled potatoes (97.23%) compared to raw, baked, and fried ones (80.97, 78.96, and 76.18%, respectively). Overall, this work shows that potatoes can be engineered to accumulate saffron apocarotenoids that, when consumed, can potentially offer better health benefits. Moreover, the high bioaccessibility of these compounds revealed that potato is an excellent way to deliver crocins and picrocrocin, while also helping to improve its nutritional value

Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks

In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model (Blesa et al. in MFCS, Lecture Notes in Computer Science, vol. 3618, pp. 144–155, 2005) by considering the possibility that the router clocks in the network are not synchronized. We name the new model Non Synchronized CAQT (NSCAQT). Clearly, this new extension to the model only affects those scheduling policies that use some form of timing. In a first approach we consider the case in which although not synchronized, all clocks run at the same speed, maintaining constant differences. In this case we show that all universally stable policies in CAQT that use the injection time and the remaining path to schedule packets remain universally stable. These policies include, for instance, Shortest in System (SIS) and Longest in System (LIS). Then, we study the case in which clock differences can vary over time, but the maximum difference is bounded. In this model we show the universal stability of two families of policies related to SIS and LIS respectively (the priority of a packet in these policies depends on the arrival time and a function of the path traversed). The bounds we obtain in this case depend on the maximum difference between clocks. This is a necessary requirement, since we also show that LIS is not universally stable in systems without bounded clock difference. We then present a new policy that we call Longest in Queues (LIQ), which gives priority to the packet that has been waiting the longest in edge queues. This policy is universally stable and, if clocks maintain constant differences, the bounds we prove do not depend on them. To finish, we provide with simulation results that compare the behavior of some of these policies in a network with stochastic injection of packets

Novel Techniques to Speed Up the Computation of the Automorphism Group of a Graph

Graph automorphism (GA) is a classical problem, in which the objective is to compute the automorphism group of an input graph. Most GA algorithms explore a search tree using the individualization-refinement procedure. Four novel techniques are proposed which increase the performance of any algorithm of this type by reducing the depth of the search tree and by effectively pruning it. We formally prove that a GA algorithm that uses these techniques correctly computes the automorphism group of an input graph. Then, we describe how these techniques have been incorporated into the GA algorithm conauto, as conauto-2.03, with at most an additive polynomial increase in its asymptotic time complexity. Using a benchmark of different graph families, we have evaluated the impact of these techniques on the size of the search tree, observing a significant reduction both when they are applied individually and when all of them are applied together. This is also reflected in a reduction of the running time, which is substantial for some graph families. Finally, we have compared the search tree size of conauto-2.03 against those of other popular GA algorithms, observing that, in most cases, conauto explores less nodes than these algorithms

Novel Techniques for Automorphism Group Computation

Abstract. Graph automorphism (GA) is a classical problem, in which the objective is to compute the automorphism group of an input graph. In this work we propose four novel techniques to speed up algorithms that solve the GA problem by exploring a search tree. They increase the performance of the algorithm by allowing to reduce the depth of the search tree, and by effectively pruning it. We formally prove that a GA algorithm that uses these techniques correctly computes the automorphism group of the input graph. We also describe how the techniques have been incorporated into the GA algorithm conauto, as conauto-2.03, with at most an additive polynomial increase in its asymptotic time complexity. We have experimentally evaluated the impact of each of the above techniques with several graph families. We have observed that each of the techniques by itself significantly reduces the number of processed nodes of the search tree in some subset of graphs, which justifies the use of each of them. Then, when they are applied together, their effect is combined, leading to reductions in the number of processed nodes in most graphs. This is also reflected in a reduction of the running time, which is substantial in some graph families

Power Performance Verification of a Wind Farm Using the Friedman’s Test

In this paper, a method of verification of the power performance of a wind farm is presented. This method is based on the Friedman’s test, which is a nonparametric statistical inference technique, and it uses the information that is collected by the SCADA system from the sensors embedded in the wind turbines in order to carry out the power performance verification of a wind farm. Here, the guaranteed power curve of the wind turbines is used as one more wind turbine of the wind farm under assessment, and a multiple comparison method is used to investigate differences between pairs of wind turbines with respect to their power performance. The proposed method says whether the power performance of the specific wind farm under assessment differs significantly from what would be expected, and it also allows wind farm owners to know whether their wind farm has either a perfect power performance or an acceptable power performance. Finally, the power performance verification of an actual wind farm is carried out. The results of the application of the proposed method showed that the power performance of the specific wind farm under assessment was acceptable