Physical and physiological attributes of soccer goalkeepers - Should we rely only on means and standard deviations?

The purpose of this study was twofold: (a) to profile physical characteristics and physiological attributes of soccer goalkeepers (GKs) who were divided into three age groups – under 16 years, 16-19, and over 19, and (b) to examine the intra-individual variability among the GKs in each age group on all physical and physiological measurements performed in the study. The GKs underwent a series of physical (e.g., height, body mass, and percentage of body fat) and physiological (e.g., anaerobic profile, power and strength, and flexibility) tests. The three main findings of the current study were: (a) differences in physical characteristics and physiological attributes existed between GKs in the three age groups, (b) intra-individual variability can be found in most physical characteristics and physiological attributes of the GKs, and (c) the intra-individual variability was observed in all three groups. These findings emphasize the need for coaches to examine the intra-individual variability in GKs on their teams. These findings can be used by coaches when planning specific training programs for GKs of different age and skill levels

Role of electrolytes and unmeasured anions in the metabolic acid-base abnormalities in dogs with parvoviral enteritis

Background: The strong ion model (SIM) is an alternative paradigm in the characterization of acid‐base disturbances particularly in complex disorders. Hypothesis/Objectives: To compare the acid‐base changes in dogs with parvoviral enteritis (PE) using the Henderson‐Hasselbalch (HH) approach, with 2 strong ion approaches. Animals: Forty‐four dogs with PE, and 16 age‐matched control dogs. Methods: Prospective controlled observational study. Acid‐base status was evaluated using the HH model, Fencl‐Stewart (FS) approach and a validated strong ion model (VDM). The acid‐base changes according to each model were classified and compared. Statistical correlations between pH, CO2, and various SIM variables were performed, as well as between the sum of effects (SOE) of the SIM and the individual variables comprising the SOE. Results: The HH model identified acid‐base disorders in 31/44 cases of which 16/31 were mixed with metabolic acidosis and concurrent respiratory alkalosis the most common (10/31). Using the FS approach, metabolic changes were present 36/42 cases, with changes in free water (FW), chloride, and unmeasured anions (UA) being the most prevalent. Both FW and UA correlated well with pH; however, UA were most consistently abnormal in severe acidemia. Similarly to the HH, the VDM detected acid‐base disturbances in 28/44 cases. Major contributors to the acid‐base changes were hyponatremia, hypochloremia, and Atot acidosis because of elevated globulins and increased UA. Conclusions and Clinical Importance: Acid‐base changes are common and complex in dogs with PE, and were easier to understand using a SIM paradigm. Increases in UA have not been documented in PE in dogs

IOPs with Inverse Polynomial Soundness Error

We show that every language in NP has an Interactive Oracle Proof (IOP) with inverse polynomial soundness error and small query complexity. This achieves parameters that surpass all previously known PCPs and IOPs. Specifically, we construct an IOP with perfect completeness, soundness error $1/n$, round complexity $O(\log \log n)$, proof length $poly(n)$ over an alphabet of size $O(n)$, and query complexity $O(\log \log n)$. This is a step forward in the quest to establish the sliding-scale conjecture for IOPs (which would additionally require query complexity $O(1)$). Our main technical contribution is a high-soundness small-query proximity test for the Reed-Solomon code. We construct an IOP of proximity for Reed-Solomon codes, over a field $\mathbb{F}$ with evaluation domain $L$ and degree $d$, with perfect completeness, soundness error (roughly) $\max\{1-\delta , O(\rho^{1/4})\}$ for $\delta$-far functions, round complexity $O(\log \log d)$, proof length $O(|L|/\rho)$ over $\mathbb{F}$, and query complexity $O(\log \log d)$; here $\rho = (d+1)/|L|$ is the code rate. En route, we obtain a new high-soundness proximity test for bivariate Reed-Muller codes. The IOP for NP is then obtained via a high-soundness reduction from NP to Reed-Solomon proximity testing with rate $\rho = 1/poly(n)$ and distance $\delta = 1-1/poly(n)$ (and applying our proximity test). Our constructions are direct and efficient, and hold the potential for practical realizations that would improve the state-of-the-art in real-world applications of IOPs

A PCP Theorem for Interactive Proofs and Applications

The celebrated PCP Theorem states that any language in NP can be decided via a verifier that reads $O(1)$ bits from a polynomially long proof. Interactive oracle proofs (IOP), a generalization of PCPs, allow the verifier to interact with the prover for multiple rounds while reading a small number of bits from each prover message. While PCPs are relatively well understood, the power captured by IOPs (beyond NP) has yet to be fully explored. We present a generalization of the PCP theorem for interactive languages. We show that any language decidable by a $k(n)$-round IP has a $k(n)$-round public-coin IOP, where the verifier makes its decision by reading only $O(1)$ bits from each (polynomially long) prover message and $O(1)$ bits from each of its own (random) messages to the prover. Our result and the underlying techniques have several applications. We get a new hardness of approximation result for a stochastic satisfiability problem, we show IOP-to-IOP transformations that previously were known to hold only for IPs, and we formulate a new notion of PCPs (index-decodable PCPs) that enables us to obtain a commit-and-prove SNARK in the random oracle model for nondeterministic computations

Hamming Weight Proofs of Proximity with One-Sided Error

We provide a wide systematic study of proximity proofs with one-sided error for the Hamming weight problem $\mathsf{Ham}_{\alpha}$ (the language of bit vectors with Hamming weight at least $\alpha$), surpassing previously known results for this problem. We demonstrate the usefulness of the one-sided error property in applications: no malicious party can frame an honest prover as cheating by presenting verifier randomness that leads to a rejection. We show proofs of proximity for $\mathsf{Ham}_{\alpha}$ with one-sided error and sublinear proof length in three models (MA, PCP, IOP), where stronger models allow for smaller query complexity. For $n$-bit input vectors, highlighting input query complexity, our MA has $O(\mathrm{log} n)$ query complexity, the PCP makes $O(\mathrm{loglog} n)$ queries, and the IOP makes a single input query. The prover in all of our applications runs in expected quasi-linear time. Additionally, we show that any perfectly complete IP of proximity for $\mathsf{Ham}_{\alpha}$ with input query complexity $n^{1-\epsilon}$ has proof length $\Omega(\mathrm{log} n)$. Furthermore, we study PCPs of proximity where the verifier is restricted to making a single input query (SIQ). We show that any SIQ-PCP for $\mathsf{Ham}_{\alpha}$ must have a linear proof length, and complement this by presenting a SIQ-PCP with proof length $n+o(n)$. As an application, we provide new methods that transform PCPs (and IOPs) for arbitrary languages with nonzero completeness error into PCPs (and IOPs) that exhibit perfect completeness. These transformations achieve parameters previously unattained

A Toolbox for Barriers on Interactive Oracle Proofs

Interactive oracle proofs (IOPs) are a proof system model that combines features of interactive proofs (IPs) and probabilistically checkable proofs (PCPs). IOPs have prominent applications in complexity theory and cryptography, most notably to constructing succinct arguments. In this work, we study the limitations of IOPs, as well as their relation to those of PCPs. We present a versatile toolbox of IOP-to-IOP transformations containing tools for: (i) length and round reduction; (ii) improving completeness; and (iii) derandomization. We use this toolbox to establish several barriers for IOPs: -- Low-error IOPs can be transformed into low-error PCPs. In other words, interaction can be used to construct low-error PCPs; alternatively, low-error IOPs are as hard to construct as low-error PCPs. This relates IOPs to PCPs in the regime of the sliding scale conjecture for inverse-polynomial soundness error. -- Limitations of quasilinear-size IOPs for 3SAT with small soundness error. -- Limitations of IOPs where query complexity is much smaller than round complexity. -- Limitations of binary-alphabet constant-query IOPs. We believe that our toolbox will prove useful to establish additional barriers beyond our work

STIR: Reed–Solomon Proximity Testing with Fewer Queries

We present STIR (Shift To Improve Rate), an interactive oracle proof of proximity (IOPP) for Reed-Solomon codes that achieves the best known query complexity of any concretely efficient IOPP for this problem. For $\lambda$ bits of security, STIR has query complexity $O(\log d + \lambda \cdot \log \log d )$, while FRI, a popular protocol, has query complexity $O(\lambda \cdot \log d )$ (including variants of FRI based on conjectured security assumptions). STIR relies on a new technique for recursively improving the rate of the tested Reed-Solomon code. We provide an implementation of STIR compiled to a SNARK. Compared to a highly-optimized implementation of FRI, STIR achieves an improvement in argument size that ranges from $1.25\times$ to $2.46\times$ depending on the chosen parameters, with similar prover and verifier running times. For example, in order to achieve 128 bits of security for degree $2^{26}$ and rate $1/4$, STIR has argument size $114$ KiB, compared to $211$ KiB for FRI

Harnessing Soluble NK Cell Killer Receptors for the Generation of Novel Cancer Immune Therapy

The natural cytotoxic receptors (NCRs) are a unique set of activating proteins expressed mainly on the surface of natural killer (NK) cells. The NCRs, which include three members; NKp46, NKp44 and NKp30, are critically involved in NK cytotoxicity against different targets, including a wide range of tumor cells derived from various origins. Even though the tumor ligands of the NCRs have not been identified yet, the selective manner by which these receptors target tumor cells may provide an excellent basis for the development of novel anti-tumor therapies. To test the potential use of the NCRs as anti-tumor agents, we generated soluble NCR-Ig fusion proteins in which the constant region of human IgG1 was fused to the extracellular portion of the receptor. We demonstrate, using two different human prostate cancer cell lines, that treatment with NKp30-Ig, dramatically inhibits tumor growth in vivo. Activated macrophages were shown to mediate an ADCC response against the NKp30-Ig coated prostate cell lines. Finally, the Ig fusion proteins were also demonstrated to discriminate between benign prostate hyperplasia and prostate cancer. This may provide a novel diagnostic modality in the difficult task of differentiating between these highly common pathological conditions

Granulosa Cell Endothelin-2 Expression is Fundamental for Ovulatory Follicle Rupture

Ovulation is dependent upon numerous factors mediating follicular growth, vascularization, and ultimately oocyte release via follicle rupture. Endothelin-2 (EDN2) is a potent vasoconstrictor that is transiently produced prior to follicle rupture by granulosa cells of periovulatory follicles and induces ovarian contraction. To determine the role of Edn2 expression, surgical transplant and novel conditional knockout mice were super-ovulated and analyzed. Conditional knockout mice utilized a new iCre driven by the Esr2 promoter to selectively remove Edn2. Follicle rupture and fertility were significantly impaired in the absence of ovarian Edn2 expression. When ovaries of Edn2KO mice were transplanted in wild type recipients, significantly more corpora lutea containing un-ovulated oocytes were present after hormonal stimulation (1.0 vs. 5.4, p = 0.010). Following selective ablation of Edn2 in granulosa cells, Esr2-Edn2KO dams had reduced oocytes ovulated (3.8 vs. 16.4 oocytes/ovary) and smaller litters (4.29 ± l.02 vs. 8.50 pups/dam). However, the number of pregnancies per pairing was not different and the reproductive axis remained intact. Esr2-Edn2KO ovaries had a higher percentage of antral follicles and fewer corpora lutea; follicles progressed to the antral stage but many were unable to rupture. Conditional loss of endothelin receptor A in granulosa cells also decreased ovulation but did not affect fecundity. These data demonstrate that EDN2-induced intraovarian contraction is a critical trigger of normal ovulation and subsequent fecundity