A PCP Characterization of AM

We introduce a 2-round stochastic constraint-satisfaction problem, and show that its approximation version is complete for (the promise version of) the complexity class AM. This gives a `PCP characterization' of AM analogous to the PCP Theorem for NP. Similar characterizations have been given for higher levels of the Polynomial Hierarchy, and for PSPACE; however, we suggest that the result for AM might be of particular significance for attempts to derandomize this class. To test this notion, we pose some `Randomized Optimization Hypotheses' related to our stochastic CSPs that (in light of our result) would imply collapse results for AM. Unfortunately, the hypotheses appear over-strong, and we present evidence against them. In the process we show that, if some language in NP is hard-on-average against circuits of size 2^{Omega(n)}, then there exist hard-on-average optimization problems of a particularly elegant form. All our proofs use a powerful form of PCPs known as Probabilistically Checkable Proofs of Proximity, and demonstrate their versatility. We also use known results on randomness-efficient soundness- and hardness-amplification. In particular, we make essential use of the Impagliazzo-Wigderson generator; our analysis relies on a recent Chernoff-type theorem for expander walks.Comment: 18 page

The case for monitoring life-span inequality : Focus on variation in age at death, not just average age

Peer reviewe

An audit of discharge summaries

Background: In the continuum of patient care, admission to the department of medicine constitutes a brief yet critical period. Subsequent patient care depends on the discharge summary (DS) and its implementation. Aim: To evaluate the department of medicine -family physician interface by a discharge summaries audit. Method: A retrospective study analyzing all admissions and discharges between a department of medicine and a primary care clinic over a period of ten months. Results: 129 DS were evaluated and compared to 97 available primary care medical charts. Most admissions were due to a medical emergency (95%), the patients were often elderly and 23% lived alone. Hospital stay averaged 4.0±2.4 days, readmission rate was 15.8%. In 73% of the DS at least one new drug was prescribed. The family physician was the one expected to continue treatment in most of the cases, but in over a third of the patients, a referral to further consultation was deemed necessary. The DS was found in 82% of the primary care charts. Median time interval between discharge and consultation with the family physician was three days (range 1-30). Home visits by physicians were documented in eight cases only. Conclusion: Most discharged patients require further evaluation and newly prescribed medications, making a timely and coordinated continuous care in the community mandatory. A high quality, rapidly available DS is therefore important for the family physician. Whether improved communication will reduce readmissions and improve patient prognosis and quality of care should be clarified by further study.peer-reviewe

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

Arya: Nearly linear-time zero-knowledge proofs for correct program execution

There have been tremendous advances in reducing interaction, communication and verification time in zero-knowledge proofs but it remains an important challenge to make the prover efficient. We construct the first zero-knowledge proof of knowledge for the correct execution of a program on public and private inputs where the prover computation is nearly linear time. This saves a polylogarithmic factor in asymptotic performance compared to current state of the art proof systems. We use the TinyRAM model to capture general purpose processor computation. An instance consists of a TinyRAM program and public inputs. The witness consists of additional private inputs to the program. The prover can use our proof system to convince the verifier that the program terminates with the intended answer within given time and memory bounds. Our proof system has perfect completeness, statistical special honest verifier zero-knowledge, and computational knowledge soundness assuming linear-time computable collision-resistant hash functions exist. The main advantage of our new proof system is asymptotically efficient prover computation. The prover’s running time is only a superconstant factor larger than the program’s running time in an apples-to-apples comparison where the prover uses the same TinyRAM model. Our proof system is also efficient on the other performance parameters; the verifier’s running time and the communication are sublinear in the execution time of the program and we only use a log-logarithmic number of rounds

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

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

Parameterized complexity of DPLL search procedures

We study the performance of DPLL algorithms on parameterized problems. In particular, we investigate how difficult it is to decide whether small solutions exist for satisfiability and other combinatorial problems. For this purpose we develop a Prover-Delayer game which models the running time of DPLL procedures and we establish an information-theoretic method to obtain lower bounds to the running time of parameterized DPLL procedures. We illustrate this technique by showing lower bounds to the parameterized pigeonhole principle and to the ordering principle. As our main application we study the DPLL procedure for the problem of deciding whether a graph has a small clique. We show that proving the absence of a k-clique requires n steps for a non-trivial distribution of graphs close to the critical threshold. For the restricted case of tree-like Parameterized Resolution, this result answers a question asked in [11] of understanding the Resolution complexity of this family of formulas

Identification of neutralising pembrolizumab anti-drug antibodies in patients with melanoma

Development of anti-drug antibodies (ADAs) can interfere with therapeutic monoclonal antibodies and may lead to drug neutralisation and clinical disease progression. Measurement of circulating drug levels and development of ADAs in the setting of anti-programmed cell death-1 agent pembrolizumab has not been well-studied. Enzyme-linked immunosorbent assays were used to measure pembrolizumab drug level and ADAs in 41 patients with melanoma at baseline, Time-point 1 (3 weeks) and Time-point 2 (21 weeks). Assay results were related to patient demographics and clinical outcome data at 6 months. The median pembrolizumab drug level at 3 weeks was 237 ng/μL and did not correlate with age, sex or body surface area.17/41 patients had an ADA detected at any timepoint, with the highest prevalence at Timepoint 1 (median concentration = 17 ng/μL). The presence of an ADA did not correlate with clinical progression at 6 months. 3/41 (7%) of patients displayed a falling pembrolizumab drug level and rising ADA titre between Timepoint 1 and 2 suggestive of a neutralising ADA. Pembrolizumab drug levels and ADAs can be readily measured. The rates of total and treatment-emergent ADAs may be higher in "real-word" settings than those previously reported. Larger studies are needed to determine effect of neutralising ADAs on long-term clinical outcome