Testing formula satisfaction

We study the query complexity of testing for properties defined by read once formulae, as instances of massively parametrized properties, and prove several testability and non-testability results. First we prove the testability of any property accepted by a Boolean read-once formula involving any bounded arity gates, with a number of queries exponential in \epsilon and independent of all other parameters. When the gates are limited to being monotone, we prove that there is an estimation algorithm, that outputs an approximation of the distance of the input from satisfying the property. For formulae only involving And/Or gates, we provide a more efficient test whose query complexity is only quasi-polynomial in \epsilon. On the other hand we show that such testability results do not hold in general for formulae over non-Boolean alphabets; specifically we construct a property defined by a read-once arity 2 (non-Boolean) formula over alphabets of size 4, such that any 1/4-test for it requires a number of queries depending on the formula size

Low rate of non-attenders to primary care providers in Israel - a retrospective longitudinal study

BACKGROUND: A model that combines reactive and anticipatory care within routine consultations has become recognized as a cost-effective means of providing preventive health care, challenging the need of the periodic health examination. As such, opportunistic screening may be preferable to organized screening. Provision of comprehensive preventive healthcare within the primary care system depends on regular attendance of the general population to primary care physicians (PCPs). Objectives: To assess the proportion of patients who do not visit a PCP even once during a four-year period, and to describe the characteristics of this population. METHODS: An observational study, based on electronic medical records of 421,012 individuals who were members of one district of Clalit Health Services, the largest health maintenance organization in Israel. RESULTS: The average annual number of visits to PCPs was 7.6 ± 8.7 to 8.3 ± 9.0 (median 5, 25%-75% interval 1–11) and 9.5 ± 10.0 to10.2 ± 10.4 (median 6, 25%-75% interval 1–14) including visits to direct access consultants) in the four years of the study. During the first year of the study 87.2% of the population visited a PCP. During the four year study period, only 1.5% did not visit a PCP even once. In a multivariate analysis having fewer chronic diseases (for each additional chronic disease the OR, 95% CI was 0.40 (0.38¬0.42)), being a new immigrant (OR, 95% CI 2.46 (2.32¬2.62)), and being male (OR, 95% CI 1.66 (1.58¬1.75)) were the strongest predictors of being a non-attender to a PCP for four consecutive years. CONCLUSIONS: The rate of nonattendance to PCPs in Israel is low. Other than new immigrant status, none of the characteristics identified for nonattendance suggest increased need for healthcare services

On the origin of the λ\lambda-transition in liquid Sulphur

Developing a novel experimental technique, we applied photon correlation spectroscopy using infrared radiation in liquid Sulphur around $T_\lambda$, i.e. in the temperature range where an abrupt increase in viscosity by four orders of magnitude is observed upon heating within few degrees. This allowed us - overcoming photo-induced and absorption effects at visible wavelengths - to reveal a chain relaxation process with characteristic time in the ms range. These results do rehabilitate the validity of the Maxwell relation in Sulphur from an apparent failure, allowing rationalizing the mechanical and thermodynamic behavior of this system within a viscoelastic scenario.Comment: 5 pages, 4 eps figures, accepted in Phys. Rev. Let

Brief report: how adolescents with ASD process social information in complex scenes. Combining evidence from eye movements and verbal descriptions

We investigated attention, encoding and processing of social aspects of complex photographic scenes. Twenty-four high-functioning adolescents (aged 11–16) with ASD and 24 typically developing matched control participants viewed and then described a series of scenes, each containing a person. Analyses of eye movements and verbal descriptions provided converging evidence that both groups displayed general interest in the person in each scene but the salience of the person was reduced for the ASD participants. Nevertheless, the verbal descriptions revealed that participants with ASD frequently processed the observed person’s emotion or mental state without prompting. They also often mentioned eye-gaze direction, and there was evidence from eye movements and verbal descriptions that gaze was followed accurately. The combination of evidence from eye movements and verbal descriptions provides a rich insight into the way stimuli are processed overall. The merits of using these methods within the same paradigm are discussed

Predicting vaccine effectiveness against severe COVID-19 over time and against variants: a meta-analysis

Vaccine protection from symptomatic SARS-CoV-2 infection has been shown to be strongly correlated with neutralising antibody titres; however, this has not yet been demonstrated for severe COVID-19. To explore whether this relationship also holds for severe COVID-19, we performed a systematic search for studies reporting on protection against different SARS-CoV-2 clinical endpoints and extracted data from 15 studies. Since matched neutralising antibody titres were not available, we used the vaccine regimen, time since vaccination and variant of concern to predict corresponding neutralising antibody titres. We then compared the observed vaccine effectiveness reported in these studies to the protection predicted by a previously published model of the relationship between neutralising antibody titre and vaccine effectiveness against severe COVID-19. We find that predicted neutralising antibody titres are strongly correlated with observed vaccine effectiveness against symptomatic (Spearman ρ = 0.95, p < 0.001) and severe (Spearman ρ = 0.72, p < 0.001 for both) COVID-19 and that the loss of neutralising antibodies over time and to new variants are strongly predictive of observed vaccine protection against severe COVID-19

Fractal: Post-Quantum and Transparent Recursive Proofs from Holography

We present a new methodology to efficiently realize recursive composition of succinct non-interactive arguments of knowledge (SNARKs). Prior to this work, the only known methodology relied on pairing-based SNARKs instantiated on cycles of pairing-friendly elliptic curves, an expensive algebraic object. Our methodology does not rely on any special algebraic objects and, moreover, achieves new desirable properties: it is *post-quantum* and it is *transparent* (the setup is public coin). We exploit the fact that recursive composition is simpler for SNARKs with *preprocessing*, and the core of our work is obtaining a preprocessing zkSNARK for rank-1 constraint satisfiability (R1CS) that is post-quantum and transparent. We obtain this latter by establishing a connection between holography and preprocessing in the random oracle model, and then constructing a holographic proof for R1CS. We experimentally validate our methodology, demonstrating feasibility in practice

Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings

Ever since their introduction, zero-knowledge proofs have become an important tool for addressing privacy and scalability concerns in a variety of applications. In many systems each client downloads and verifies every new proof, and so proofs must be small and cheap to verify. The most practical schemes require either a trusted setup, as in (pre-processing) zk-SNARKs, or verification complexity that scales linearly with the complexity of the relation, as in Bulletproofs. The structured reference strings required by most zk-SNARK schemes can be constructed with multi-party computation protocols, but the resulting parameters are specific to an individual relation. Groth et al. discovered a zk-SNARK protocol with a universal structured reference string that is also updatable, but the string scales quadratically in the size of the supported relations. Here we describe a zero-knowledge SNARK, Sonic, which supports a universal and continually updatable structured reference string that scales linearly in size. We also describe a generally useful technique in which untrusted "helpers" can compute advice that allows batches of proofs to be verified more efficiently. Sonic proofs are constant size, and in the "helped" batch verification context the marginal cost of verification is comparable with the most efficient SNARKs in the literature