Reliable Real-Time Solution of Parametrized Elliptic Partial Differential Equations: Application to Elasticity

The optimization, control, and characterization of engineering components or systems require fast, repeated, and accurate evaluation of a partial-differential-equation-induced input-output relationship. We present a technique for the rapid and reliable prediction of linear-functional outputs of elliptic partial differential equations with affine parameter dependence. The method has three components: (i) rapidly convergent reduced{basis approximations; (ii) a posteriori error estimation; and (iii) off-line/on-line computational procedures. These components -- integrated within a special network architecture -- render partial differential equation solutions truly "useful": essentially real{time as regards operation count; "blackbox" as regards reliability; and directly relevant as regards the (limited) input-output data required.Singapore-MIT Alliance (SMA

From Scattering Amplitudes to the Dilatation Generator in N=4 SYM

The complete spin chain representation of the planar N=4 SYM dilatation generator has long been known at one loop, where it involves leading nearest-neighbor 2 -> 2 interactions. In this work we use superconformal symmetry to derive the unique solution for the leading L -> 2 interactions of the planar dilatation generator for arbitrarily large L. We then propose that these interactions are given by the scattering operator that has N=4 SYM tree-level scattering amplitudes as matrix elements. We provide compelling evidence for this proposal, including explicit checks for L=2,3 and a proof of consistency with superconformal symmetry.Comment: 39 pages, v2: reference added and minor changes, published versio

Cryptanalysis of MORUS

Item does not contain fulltextAdvances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-

Group art therapy as an adjunctive treatment for people with schizophrenia: a randomised controlled trial (MATISSE).

OBJECTIVE: To examine the clinical effectiveness and cost-effectiveness of referral to group art therapy plus standard care, compared with referral to an activity group plus standard care and standard care alone, among people with schizophrenia. DESIGN: A three-arm, parallel group, single-blind, pragmatic, randomised controlled trial. Participants were randomised via an independent and remote telephone randomisation service using permuted blocks, stratified by study centre. SETTING: Study participants were recruited from secondary care mental health and social services in four UK centres. PARTICIPANTS: Potential participants were aged 18 years or over, had a clinical diagnosis of schizophrenia, confirmed by an examination of case notes, and provided written informed consent. We excluded those who were unable to speak sufficient English to complete the baseline assessment, those with severe cognitive impairment and those already receiving arts therapy. INTERVENTIONS: Group art therapy was delivered by registered art therapists according to nationally agreed standards. Groups had up to eight members, lasted for 90 minutes and ran for 12 months. Members were given access to a range of art materials and encouraged to use these to express themselves freely. Activity groups were designed to control for the non-specific effects of group art therapy. Group facilitators offered various activities and encouraged participants to collectively select those they wanted to pursue. Standard care involved follow-up from secondary care mental health services and the option of referral to other services, except arts therapies, as required. MAIN OUTCOME MEASURES: Our co-primary outcomes were global functioning (measured using the Global Assessment of Functioning Scale - GAF) and mental health symptoms (measured using the Positive and Negative Syndrome Scale - PANSS) at 24 months. The main secondary outcomes were level of group attendance, social functioning, well-being, health-related quality of life, service utilisation and other costs measured 12 and 24 months after randomisation. RESULTS: Four hundred and seventeen people were recruited, of whom 355 (85%) were followed up at 2 years. Eighty-six (61%) of those randomised to art therapy and 73 (52%) of those randomised to activity groups attended at least one group. No differences in primary outcomes were found between the three study arms. The adjusted mean difference between art therapy and standard care at 24 months was -0.9 [95% confidence interval (CI) -3.8 to 2.1] on the GAF Scale and 0.7 (95% CI -3.1 to 4.6) on the PANSS Scale. Differences in secondary outcomes were not found, except that those referred to an activity group had fewer positive symptoms of schizophrenia at 24 months than those randomised to art therapy. Secondary analysis indicated that attendance at art therapy groups was not associated with improvements in global functioning or mental health. Although the total cost of the art therapy group was lower than the cost of the two comparison groups, referral to group art therapy did not appear to provide a cost-effective use of resources. CONCLUSIONS: Referring people with established schizophrenia to group art therapy as delivered in this randomised trial does not appear to improve global functioning or mental health of patients or provide a more cost-effective use of resources than standard care alone. TRIAL REGISTRATION: Current Controlled Trials ISRCTN 46150447. FUNDING: This project was funded by the NIHR Health Technology Assessment programme and will be published in full in Health Technology Assessment; Vol. 16, No. 8. See the HTA programme website for further project information

Universal Forgery Attack against GCM-RUP

International audienceAuthenticated encryption (AE) schemes are widely used to secure communications because they can guarantee both confidentiality and authenticity of a message. In addition to the standard AE security notion, some recent schemes offer extra robustness, i.e. they maintain security in some misuse scenarios. In particular, Ashur, Dunkelman and Luykx proposed a generic AE construction at CRYPTO'17 that is secure even when releasing unverified plaintext (the RUP setting), and a concrete instantiation, GCM-RUP. The designers proved that GCM-RUP is secure up to the birthday bound in the nonce-respecting model. In this paper, we perform a birthday-bound universal forgery attack against GCM-RUP, matching the bound of the proof. While there are simple distinguishing attacks with birthday complexity on GCM-RUP, our attack is much stronger: we have a partial key recovery leading to universal forgeries. For reference, the best known universal forgery attack against GCM requires 2 2n/3 operations, and many schemes do not have any known universal forgery attacks faster than 2 n. This suggests that GCM-RUP offers a different security trade-off than GCM: stronger protection in the RUP setting, but more fragile when the data complexity reaches the birthday bound. In order to avoid this attack, we suggest a minor modification of GCM-RUP that seems to offer better robustness at the birthday bound

Quantum Spectral Curve at Work: From Small Spin to Strong Coupling in N=4 SYM

We apply the recently proposed quantum spectral curve technique to the study of twist operators in planar N=4 SYM theory. We focus on the small spin expansion of anomalous dimensions in the sl(2) sector and compute its first two orders exactly for any value of the 't Hooft coupling. At leading order in the spin S we reproduced Basso's slope function. The next term of order S^2 structurally resembles the Beisert-Eden-Staudacher dressing phase and takes into account wrapping contributions. This expansion contains rich information about the spectrum of local operators at strong coupling. In particular, we found a new coefficient in the strong coupling expansion of the Konishi operator dimension and confirmed several previously known terms. We also obtained several new orders of the strong coupling expansion of the BFKL pomeron intercept. As a by-product we formulated a prescription for the correct analytical continuation in S which opens a way for deriving the BFKL regime of twist two anomalous dimensions from AdS/CFT integrability.Comment: 53 pages, references added; v3: due to a typo in the coefficients C_2 and D_2 on page 29 we corrected the rational part of the strong coupling predictions in equations (1.5-6), (6.22-24), (6.27-30) and in Table

New Attacks on the Concatenation and XOR Hash Combiners

We study the security of the concatenation combiner $H_1(M) \| H_2(M)$ for two independent iterated hash functions with $n$-bit outputs that are built using the Merkle-Damgård construction. In 2004 Joux showed that the concatenation combiner of hash functions with an $n$-bit internal state does not offer better collision and preimage resistance compared to a single strong $n$-bit hash function. On the other hand, the problem of devising second preimage attacks faster than $2^n$ against this combiner has remained open since 2005 when Kelsey and Schneier showed that a single Merkle-Damgård hash function does not offer optimal second preimage resistance for long messages. In this paper, we develop new algorithms for cryptanalysis of hash combiners and use them to devise the first second preimage attack on the concatenation combiner. The attack finds second preimages faster than $2^n$ for messages longer than $2^{2n/7}$ and has optimal complexity of $2^{3n/4}$. This shows that the concatenation of two Merkle-Damgård hash functions is not as strong a single ideal hash function. Our methods are also applicable to other well-studied combiners, and we use them to devise a new preimage attack with complexity of $2^{2n/3}$ on the XOR combiner $H_1(M) \oplus H_2(M)$ of two Merkle-Damgård hash functions. This improves upon the attack by Leurent and Wang (presented at Eurocrypt 2015) whose complexity is $2^{5n/6}$ (but unlike our attack is also applicable to HAIFA hash functions). Our algorithms exploit properties of random mappings generated by fixing the message block input to the compression functions of $H_1$ and $H_2$. Such random mappings have been widely used in cryptanalysis, but we exploit them in new ways to attack hash function combiners

Sensitivity Analysis for Not-at-Random Missing Data in Trial-Based Cost-Effectiveness Analysis : A Tutorial

Cost-effectiveness analyses (CEA) of randomised controlled trials are a key source of information for health care decision makers. Missing data are, however, a common issue that can seriously undermine their validity. A major concern is that the chance of data being missing may be directly linked to the unobserved value itself [missing not at random (MNAR)]. For example, patients with poorer health may be less likely to complete quality-of-life questionnaires. However, the extent to which this occurs cannot be ascertained from the data at hand. Guidelines recommend conducting sensitivity analyses to assess the robustness of conclusions to plausible MNAR assumptions, but this is rarely done in practice, possibly because of a lack of practical guidance. This tutorial aims to address this by presenting an accessible framework and practical guidance for conducting sensitivity analysis for MNAR data in trial-based CEA. We review some of the methods for conducting sensitivity analysis, but focus on one particularly accessible approach, where the data are multiply-imputed and then modified to reflect plausible MNAR scenarios. We illustrate the implementation of this approach on a weight-loss trial, providing the software code. We then explore further issues around its use in practice

The Missing Difference Problem, and its Applications to Counter Mode Encryption

National audienc