Miracle-dz/UniFAR-FTUs huggingface dataset:
Effect of green tea extract supplementation on glycogen replenishment in exercised human skeletal muscle

Abstract The purpose of this study was to investigate the effects of 8-week green tea extract (GTE) supplementation on promoting postexercise muscle glycogen resynthesis and systemic energy substrate utilisation in young college students. A total of eight healthy male participants (age: 22·0 (se 1·0) years, BMI: 24·2 (se 0·7) kg/m2, VO2max: 43·2 (se 2·4) ml/kg per min) participated in this study. GTE (500 mg/d for 8 weeks) was compared with placebo in participants in a double-blind/placebo-controlled and crossover study design with an 8-week washout period. Thereafter, all participants performed a 60-min cycling exercise (75 % VO2max) and consumed a carbohydrate-enriched meal immediately after exercise. Vastus lateralis muscle samples were collected immediately (0 h) and 3 h after exercise, and blood and gaseous samples were collected during the 3-h postexercise recovery period. An 8-week oral GTE supplementation had no effects on further promoting muscle glycogen resynthesis in exercised human skeletal muscle, but the exercise-induced muscle GLUT type 4 (GLUT4) protein content was greater in the GTE supplementation trial (P<0·05). We observed that, during the postexercise recovery period, GTE supplementation elicited an increase in energy reliance on fat oxidation compared with the placebo trial (P<0·05), although there were no differences in blood glucose and insulin responses between the two trials. In summary, 8-week oral GTE supplementation increases postexercise systemic fat oxidation and exercise-induced muscle GLUT4 protein content in response to an acute bout of endurance exercise. However, GTE supplementation has no further benefit on promoting muscle glycogen resynthesis during the postexercise period.
Age, Race/Ethnicity, and Behavioral Risk Factors Associated With Per Contact Risk of HIV Infection Among Men Who Have Sex With Men in the United States

Objective:Young men who have sex with men (MSM) and MSM of color have the highest HIV incidence in the United States. To explore possible explanations for these disparities and known individual risk factors, we analyzed the per contact risk (PCR) of HIV seroconversion in the early highly active antiretroviral therapy era. Methods:Data from 3 longitudinal studies of MSM (HIV Network for Prevention Trials Vaccine Preparedness Study, EXPLORE behavioral efficacy trial, and VAX004 vaccine efficacy trial) were pooled. The analysis included visits where participants reported unprotected receptive anal intercourse (URA), protected receptive anal intercourse, or unprotected insertive anal intercourse (UIA) with an HIV seropositive, unknown HIV serostatus, or an HIV seronegative partner. We used regression standardization to estimate average PCRs for each type of contact, with bootstrap confidence intervals. Results:The estimated PCR was highest for URA with an HIV seropositive partner (0.73%; 95% bootstrap confidence interval [BCI]: 0.45% to 0.98%) followed by URA with a partner of unknown HIV serostatus (0.49%; 95% BCI: 0.32% to 0.62%). The estimated PCR for protected receptive anal intercourse and UIA with an HIV seropositive partner was 0.08% (95% BCI: 0.0% to 0.19%) and 0.22% (95% BCI: 0.05% to 0.39%), respectively. Average PCRs for URA and UIA with HIV seropositive partners were higher by 0.14%–0.34% among younger participants and higher by 0.08% for UIA among Latino participants compared with white participants. Estimated PCRs increased with the increasing number of sexual partners, use of methamphetamines or poppers, and history of sexually transmitted infection. Conclusions:Susceptibility or partner factors may explain the higher HIV conversion risk for younger MSM, some MSM of color, and those reporting individual risk factors.
POLITECNICO DI TORINO Repository ISTITUZIONALE Neighborhood Filtering Strategies for Overlay Construction in P 2 PTV Systems : Design and Experimental Comparison /

Peer-to-Peer live-streaming (P2P-TV) systems aim at disseminating real time video content using Peer-to-Peer technology. Their performance is driven by the overlay topology, i.e., the virtual topology that peers use to exchange video chunks. Several proposals have been made in the past to optimize it, yet few experimental studies have corroborated results. The aim of this paper is to provide a comprehensive experimental comparison based on PeerStreamer, in order to benchmark different strategies for the construction and maintenance of the overlay topology in P2P-TV systems. We present only experimental results in which fully-distributed strategies are evaluated in both controlled experiments, and in the Internet, using thousands of peers. Results confirm that the topological properties of the overlay have a deep impact on both user quality of experience and network load. Strategies based solely on random peer selection are greatly outperformed by smart, yet simple and actually implementable strategies. The most performing strategy we devise guarantees to deliver almost all chunks to all peers with a playout delay as low as 6 seconds even when system load approaches 1, and in almost adversarial network scenarios. PeerStreamer is Open Source to make results reproducible and allow further research by the community.
The role of detachment of in-links in scale-free networks

Real-world networks may exhibit a detachment phenomenon determined by the canceling of previously existing connections. We discuss a tractable extension of the Yule model to account for this feature. Analytical results are derived and discussed both asymptotically and for a finite number of links. Comparison with the original model is performed in the supercritical case. The first-order asymptotic tail behavior of the two models is similar but differences arise in the second-order term. We explicitly refer to world wide web modeling and we show the agreement of the proposed model on very recent data. However, other possible network applications are also mentioned.
Static Analysis of an Actor-based Process Calculus by Abstract Interpretation. (Analyse statique d'un calcul d'acteurs par interprétation abstraite)

The Actor model, introduced by HEWITT and AGHA in the late 80s, describes a concurrent communicating system as a set of autonomous agents, with non uniform interfaces and communicating by the use of labeled messages. The CAP process calculus, proposed by COLACO, is based on this model and allows to describe non trivial realistic systems, without the need of complex encodings. CAP is a higher-order calculus: messages can carry actor behaviors. Multiple works address the analysis of CAP properties, mainly by the use of inferencebased type systems using behavioral types and sub-typing. Otherwise, ore recent works, by VENET and later FERET, propose the use of abstract interpretation to analyze process calculi. These approaches allow to compute non-uniform properties. For example, they are able to differentiate recursive instances of the same thread. This thesis is at the crossroad of these two approaches, applying abstract interpretation to the analysis of CAP. Following the framework of FERET, CAP is firstly expressed in a non standard form, easing its analysis. The set of reachable states is then over-approximated via a sound by construction representation within existing abstract domains. New general abstract domains are then introduced in order to improve the accuracy of existing analyses or to represent local properties. CAP specific properties such as the linearity of terms or the absence of orphan messages, are then considered in this framework. Specific abstract domains are defined and used to check these properties. The proposed framework is able to relax any existing restriction of previous analyses such as constraints on the shape of terms or limitation in the use of CAP behavior passing. The whole analyses have been implemented in a prototype
Evaluation of anticataract potential of Triphala in selenite-induced cataract: In vitro and in vivo studies

Triphala (TP) is composed of Emblica officinalis, Terminalia chebula, and Terminalia belerica. The present study was undertaken to evaluate its anticataract potential in vitro and in vivo in a selenite-induced experimental model of cataract. In vitro enucleated rat lenses were maintained in organ culture containing Dulbecco’s Modified Eagles Medium alone or with the addition of 100μM selenite. These served as the normal and control groups, respectively. In the test group, the medium was supplemented with selenite and different concentrations of TP aqueous extract. The lenses were incubated for 24 h at 37°C. After incubation, the lenses were processed to estimate reduced glutathione (GSH), lipid peroxidation product, and antioxidant enzymes. In vivo selenite cataract was induced in 9-day-old rat pups by subcutaneous injection of sodium selenite (25 μmole/kg body weight). The test groups received 25, 50, and 75 mg/kg of TP intraperitoneally 4 h before the selenite challenge. At the end of the study period, the rats’ eyes were examined by slit-lamp. TP significantly (P < 0.01) restored GSH and decreased malondialdehyde levels. A significant restoration in the activities of antioxidant enzymes such as superoxide dismutase (P < 0.05), catalase (P < 0.05), glutathione peroxidase (P < 0.05), and glutathione-s-transferase (P < 0.005) was observed in the TP-supplemented group compared to controls. In vivo TF 25mg/kg developed only 20% nuclear cataract as compared to 100% in control. TP prevents or retards experimental selenite-induced cataract. This effect may be due to antioxidant activity. Further studies are warranted to explore its role in human cataract.
3D Assessment of Mandibular Growth Based on Image Registration: A Feasibility Study in a Rabbit Model

Background. Our knowledge of mandibular growth mostly derives from cephalometric radiography, which has inherent limitations due to the two-dimensional (2D) nature of measurement. Objective. To assess 3D morphological changes occurring during growth in a rabbit mandible. Methods. Serial cone-beam computerised tomographic (CBCT) images were made of two New Zealand white rabbits, at baseline and eight weeks after surgical implantation of 1 mm diameter metallic spheres as fiducial markers. A third animal acted as an unoperated (no implant) control. CBCT images were segmented and registered in 3D (Implant Superimposition and Procrustes Method), and the remodelling pattern described used color maps. Registration accuracy was quantified by the maximal of the mean minimum distances and by the Hausdorff distance. Results. The mean error for image registration was 0.37 mm and never exceeded 1 mm. The implant-based superimposition showed most remodelling occurred at the mandibular ramus, with bone apposition posteriorly and vertical growth at the condyle. Conclusion. We propose a method to quantitatively describe bone remodelling in three dimensions, based on the use of bone implants as fiducial markers and CBCT as imaging modality. The method is feasible and represents a promising approach for experimental studies by comparing baseline growth patterns and testing the effects of growth-modification treatments.
Standard facies models to incorporate all heterogeneity levels in a reservoir model

The construction of reservoir models is frustrated by the fact that core and well cover only a fraction of the reservoir volume and it is therefore difficult to determine features like facies shape, -size, and -distribution, interand intra-facies boundaries and lateral trends from them. These features are, however, critical to fluid flow and they should necessarily be incorporated in the reservoir model and we therefore propose to systematically describe geometry and distribution of facies. To this end we make use of ‘‘standard facies models’’ that a priori contain all elements and boundaries of facies for a number of typical depositional environments. r 2006 Elsevier Ltd. All rights reserved.
A multiagent evolutionary algorithm for constraint satisfaction problems

With the intrinsic properties of constraint satisfaction problems (CSPs) in mind, we divide CSPs into two types, namely, permutation CSPs and nonpermutation CSPs. According to their characteristics, several behaviors are designed for agents by making use of the ability of agents to sense and act on the environment. These behaviors are controlled by means of evolution, so that the multiagent evolutionary algorithm for constraint satisfaction problems (MAEA-CSPs) results. To overcome the disadvantages of the general encoding methods, the minimum conflict encoding is also proposed. Theoretical analyzes show that MAEA-CSPs has a linear space complexity and converges to the global optimum. The first part of the experiments uses 250 benchmark binary CSPs and 79 graph coloring problems from the DIMACS challenge to test the performance of MAEA-CSPs for nonpermutation CSPs. MAEA-CSPs is compared with six well-defined algorithms and the effect of the parameters is analyzed systematically. The second part of the experiments uses a classical CSP, n-queen problems, and a more practical case, job-shop scheduling problems (JSPs), to test the performance of MAEA-CSPs for permutation CSPs. The scalability of MAEA-CSPs along n for n-queen problems is studied with great care. The results show that MAEA-CSPs achieves good performance when n increases from 10/sup 4/ to 10/sup 7/, and has a linear time complexity. Even for 10/sup 7/-queen problems, MAEA-CSPs finds the solutions by only 150 seconds. For JSPs, 59 benchmark problems are used, and good performance is also obtained.
A Local Algorithm for the Sparse Spanning Graph Problem

Constructing a sparse spanning subgraph is a fundamental primitive in graph theory. In this paper, we study this problem in the Centralized Local model, where the goal is to decide whether an edge is part of the spanning subgraph by examining only a small part of the input; yet, answers must be globally consistent and independent of prior queries. Unfortunately, maximally sparse spanning subgraphs, i.e., spanning trees, cannot be constructed efficiently in this model. Therefore, we settle for a spanning subgraph containing at most $(1+\varepsilon)n$ edges (where $n$ is the number of vertices and $\varepsilon$ is a given approximation/sparsity parameter). We achieve query complexity of $\tilde{O}(poly(\Delta/\varepsilon)n^{2/3})$, ($\tilde{O}$-notation hides polylogarithmic factors in $n$). where $\Delta$ is the maximum degree of the input graph. Our algorithm is the first to do so on arbitrary bounded degree graphs. Moreover, we achieve the additional property that our algorithm outputs a spanner, i.e., distances are approximately preserved. With high probability, for each deleted edge there is a path of $O(poly(\Delta/\varepsilon)\log^2 n)$ hops in the output that connects its endpoints.
Cathepsin B and L are involved in degradation of prions in GT1-1 neuronal cells

In scrapie-infected cells, the abnormal isoform of the prion protein, PrPSc, accumulates in endosomes/lysosomes. In this study, the involvement of two lysosomal proteases, cathepsin B and L, in cellular processing of PrPSc was analyzed in immortalized neuronal gonadotropin-releasing hormone cells (GT1-1) infected with scrapie. Treatment with inhibitors of either cathepsin B or L resulted in accumulation of PrPSc. Such an increased accumulation also occurred when the activities of both cathepsins were inhibited using RNA interference. We conclude that cathepsin B and L are involved in the degradation of PrPSc in scrapie-infected GT1-1 cells and that they can compensate for each other's functions. This study shows that specific proteases, abundantly present in neurons, have the capacity to degrade PrPSc.
Aging Parents, Health Care, and the Family; Estimating a Structural Model

We develop a structural model of inter-sibling decision making to analyze the process of informal care provision by adult children to their parents. Each child chooses the number of visits paid to parents and the amount of time actually spent on providing care, taking into account opportunity costs in terms of time and money, and the behavior of siblings. A key element in the analysis is the distinction between cooperative and non-cooperative equilibria. A tentative data exploration using SHARE reveals that the stylized empirical facts are consistent with qualitative predictions from the model: children provide more care the larger the difficulties their parents experience in daily life; children provide less care when they live farther away and when they are more involved in paid work; and the occurrence of conflicts in families is associated with less care provided. To estimate the parameters of the structural model we formulate the model as a discrete choice problem. Maximum simulated likelihood will be used to obtain estimates of the parameter values. We indicate how the model can be used to assess the effects of a variety of policy measures aimed at encouraging the provision of low-cost informal care, such as compensating travel expenses, compensating informal care, changing the price of formal care, and promoting cooperative sibling behavior. One important issue is the possibility of unintended side effects, such as discouraging labor force participation.
Light-Load Efficiency Improvement in Buck-Derived Single-Stage Single-Switch PFC Converters

Single-stage single-switch ac/dc converters with power factor correction (PFC) generally have higher power losses under a light-load condition, as compared to that of the two-stage approach, due to the sharing of a common power transistor such that the PFC stage cannot be switched OFF separately to save power losses. This letter addresses this problem by using a buck topology for the PFC stage of the single-stage single-switch converters as it can be completely turned OFF by operating the converter only near the zero crossing of the input voltage, due to the presence of the dead angle of input current. Hence, the switching and conduction losses to the transistor and diodes, and passive devices are reduced. Also, further improvement is made by finding the best combination of dc-bus capacitor charging time and discharging time to achieve the lowest power loss. A recently proposed converter topology which combines a buck PFC cell with a buck-boost dc/dc cell is used as an example. Experimental results are reported and confirmed that the proposed light-load power loss reduction scheme on the converter can improve power stage efficiency by up to 7% at 1 W of output power as compared to that without the proposed scheme.
SASE Economic regulation and social solidarity: conceptual and analytic innovations in the study of advanced capitalism

The title for this year’s SASE conference, ‘Capitalism in Crisis: Economic Regulation and Social Solidarity after the Fall of Finance Capitalism’, reflects the turbulent times in which we find ourselves. Policymakers struggle to respond to rapidly unfolding developments, while academics assess how well their theories capture those features of the contemporary situation that best reflect the choices these actors confront. Contemporary developments pose a special challenge for institutionalist theories of political economy since many of the institutional arrangements on which our explanations of cross-national policy differences are based are themselves in flux. The most widely used framework in the literature is that proposed by Peter A. Hall and David Soskice in their influential volume Varieties of Capitalism (2001). The framework they lay out is based on national models defined by
Multimodel assessment of flood characteristics in four large river basins at global warming of 1.5, 2.0 and 3.0 K above the pre-industrial level

This study assesses the flood characteristics (timing, magnitude and frequency) in the pre-industrial and historical periods, and analyzes climate change impacts on floods at the warming levels of 1.5, 2.0 and 3.0 K above the pre-industrial level in four large river basins as required by the Paris agreement. Three well-established hydrological models (HMs) were forced with bias-corrected outputs from four global climate models (GCMs) for the pre-industrial, historical and future periods until 2100. The long pre-industrial and historical periods were subdivided into multiple 31-year subperiods to investigate the natural variability. The mean flood characteristics in the pre-industrial period were derived from the large ensemble based on all GCMs, HMs and 31-year subperiods, and compared to the ensemble means in the historical and future periods. In general, the variance of simulated flood characteristics is quite large in the pre-industrial and historical periods. Mostly GCMs and HMs contribute to the variance, especially for flood timing and magnitude, while the selection of 31-year subperiods is an important source of variance for flood frequency. The comparison between the ensemble means shows that there are already some changes in flood characteristics between the pre-industrial and historical periods. There is a clear shift towards earlier flooding for the Rhine (1.5 K scenario) and Upper Mississippi (3.0 K scenario). The flood magnitudes show a substantial increase in the Rhine and Upper Yellow only under the 3.0 K scenario. The floods are projected to occur more frequently in the Rhine under the 1.5 and 2.0 K scenarios, and less frequently in the Upper Mississippi under all scenarios.
Image retrieval via probabilistic hypergraph ranking

In this paper, we propose a new transductive learning framework for image retrieval, in which images are taken as vertices in a weighted hypergraph and the task of image search is formulated as the problem of hypergraph ranking. Based on the similarity matrix computed from various feature descriptors, we take each image as a ‘centroid’ vertex and form a hyperedge by a centroid and its k-nearest neighbors. To further exploit the correlation information among images, we propose a probabilistic hypergraph, which assigns each vertex vi to a hyperedge ej in a probabilistic way. In the incidence structure of a probabilistic hypergraph, we describe both the higher order grouping information and the affinity relationship between vertices within each hy-peredge. After feedback images are provided, our retrieval system ranks image labels by a transductive inference approach, which tends to assign the same label to vertices that share many incidental hyperedges, with the constraints that predicted labels of feedback images should be similar to their initial labels. We compare the proposed method to several other methods and its effectiveness is demonstrated by extensive experiments on Corel5K, the Scene dataset and Caltech 101.