Cardiac outcomes in adults with supravalvar aortic stenosis

Aims Supravalvar aortic stenosis is a rare form of left ventricular outflow tract obstruction that is often progressive in childhood. Little data are available on outcomes in the adult population. Our aim was to define cardiac outcomes in adults with supravalvar aortic stenosis. Methods and results This is a multicentre retrospective study of cardiac outcomes in adults (≥18 years) with supravalvar aortic stenosis. We examined: (i) adverse cardiac events (cardiovascular death, myocardial infarction, stroke, heart failure, sustained arrhythmias, and infective endocarditis) and (ii) the need for cardiac surgery in adulthood. One hundred and thirteen adults (median age at first visit 19 years; 55% with Williams-Beuren syndrome; 67% with surgical repair in childhood) were identified. Adults without Williams-Beuren syndrome had more severe supravalvar aortic stenosis and more often associated left ventricular outflow tract obstructions (P < 0.001). In contrast, mitral valve regurgitation was more common in patients with Williams-Beuren syndrome. Eighty-five per cent of adults (96/113) had serial follow-up information (median follow-up 6.0 years). Of these patients, 13% (12/96) had an adverse cardiac event and 13% (12/96) had cardiac operations (7 valve repair or replacements, 4 supravalvar aortic stenosis repairs, 1 other). Cardiac surgery was more common in adults without Williams-Beuren syndrome (P = 0.007). Progression of supravalvar aortic stenosis during adulthood was rare. Conclusion Adults with supravalvar aortic stenosis remain at risk for cardiac complications and reoperations, while progression of supravalvar aortic stenosis in adulthood is rare. Valve surgery is the most common indication for cardiac surgery in adulthoo

Strangeness in Astrophysics and Cosmology

Some recent developments concerning the role of strange quark matter for astrophysical systems and the QCD phase transition in the early universe are addressed. Causality constraints of the soft nuclear equation of state as extracted from subthreshold kaon production in heavy-ion collisions are used to derive an upper mass limit for compact stars. The interplay between the viscosity of strange quark matter and the gravitational wave emission from rotation-powered pulsars are outlined. The flux of strange quark matter nuggets in cosmic rays is put in perspective with a detailed numerical investigation of the merger of two strange stars. Finally, we discuss a novel scenario for the QCD phase transition in the early universe, which allows for a small inflationary period due to a pronounced first order phase transition at large baryochemical potential.Comment: 8 pages, invited talk given at the International Conference on Strangeness in Quark Matter (SQM2009), Buzios, Brasil, September 28 - October 2, 200

Lower Bounds on the Time/Memory Tradeoff of Function Inversion

We study time/memory tradeoffs of function inversion: an algorithm, i.e., an inverter, equipped with an $s$-bit advice on a randomly chosen function $f\colon [n] \mapsto [n]$ and using $q$ oracle queries to $f$, tries to invert a randomly chosen output $y$ of $f$, i.e., to find $x\in f^{-1}(y)$. Much progress was done regarding adaptive function inversion - the inverter is allowed to make adaptive oracle queries. Hellman [IEEE transactions on Information Theory \u2780] presented an adaptive inverter that inverts with high probability a random $f$. Fiat and Naor [SICOMP \u2700] proved that for any $s,q$ with $s^3 q = n^3$ (ignoring low-order terms), an $s$-advice, $q$-query variant of Hellman\u27s algorithm inverts a constant fraction of the image points of any function. Yao [STOC \u2790] proved a lower bound of $sq\ge n$ for this problem. Closing the gap between the above lower and upper bounds is a long-standing open question. Very little is known for the non-adaptive variant of the question - the inverter chooses its queries in advance. The only known upper bounds, i.e., inverters, are the trivial ones (with $s+q= n$), and the only lower bound is the above bound of Yao. In a recent work, Corrigan-Gibbs and Kogan [TCC \u2719] partially justified the difficulty of finding lower bounds on non-adaptive inverters, showing that a lower bound on the time/memory tradeoff of non-adaptive inverters implies a lower bound on low-depth Boolean circuits. Bounds that, for a strong enough choice of parameters, are notoriously hard to prove. We make progress on the above intriguing question, both for the adaptive and the non-adaptive case, proving the following lower bounds on restricted families of inverters: - Linear-advice (adaptive inverter): If the advice string is a linear function of $f$ (e.g., $A\times f$, for some matrix $A$, viewing $f$ as a vector in $[n]^n$), then $s+q \in \Omega(n)$. The bound generalizes to the case where the advice string of $f_1 + f_2$, i.e., the coordinate-wise addition of the truth tables of $f_1$ and $f_2$, can be computed from the description of $f_1$ and $f_2$ by a low communication protocol. - Affine non-adaptive decoders: If the non-adaptive inverter has an affine decoder - it outputs a linear function, determined by the advice string and the element to invert, of the query answers - then $s \in \Omega(n)$ (regardless of $q$). - Affine non-adaptive decision trees: If the non-adaptive inversion algorithm is a $d$-depth affine decision tree - it outputs the evaluation of a decision tree whose nodes compute a linear function of the answers to the queries - and $q 0$, then $s\in \Omega(n/d \log n)$

Tight Time-Space Lower Bounds for Finding Multiple Collision Pairs and Their Applications

We consider a collision search problem (CSP), where given a parameter $C$, the goal is to find $C$ collision pairs in a random function $f:[N] \rightarrow [N]$ (where $[N] = \{0,1,\ldots,N-1\})$ using $S$ bits of memory. Algorithms for CSP have numerous cryptanalytic applications such as space-efficient attacks on double and triple encryption. The best known algorithm for CSP is parallel collision search (PCS) published by van Oorschot and Wiener, which achieves the time-space tradeoff $T^2 \cdot S = \tilde{O}(C^2 \cdot N)$ for $S = \tilde{O}(C)$. In this paper, we prove that any algorithm for CSP satisfies $T^2 \cdot S = \tilde{\Omega}(C^2 \cdot N)$ for $S = \tilde{O}(C)$, hence the best known time-space tradeoff is optimal (up to poly-logarithmic factors in $N$). On the other hand, we give strong evidence that proving similar unconditional time-space tradeoff lower bounds on CSP applications (such as breaking double and triple encryption) may be very difficult, and would imply a breakthrough in complexity theory. Hence, we propose a new restricted model of computation and prove that under this model, the best known time-space tradeoff attack on double encryption is optimal

A Protocol for the Secure Linking of Registries for HPV Surveillance

In order to monitor the effectiveness of HPV vaccination in Canada the linkage of multiple data registries may be required. These registries may not always be managed by the same organization and, furthermore, privacy legislation or practices may restrict any data linkages of records that can actually be done among registries. The objective of this study was to develop a secure protocol for linking data from different registries and to allow on-going monitoring of HPV vaccine effectiveness.A secure linking protocol, using commutative hash functions and secure multi-party computation techniques was developed. This protocol allows for the exact matching of records among registries and the computation of statistics on the linked data while meeting five practical requirements to ensure patient confidentiality and privacy. The statistics considered were: odds ratio and its confidence interval, chi-square test, and relative risk and its confidence interval. Additional statistics on contingency tables, such as other measures of association, can be added using the same principles presented. The computation time performance of this protocol was evaluated.The protocol has acceptable computation time and scales linearly with the size of the data set and the size of the contingency table. The worse case computation time for up to 100,000 patients returned by each query and a 16 cell contingency table is less than 4 hours for basic statistics, and the best case is under 3 hours.A computationally practical protocol for the secure linking of data from multiple registries has been demonstrated in the context of HPV vaccine initiative impact assessment. The basic protocol can be generalized to the surveillance of other conditions, diseases, or vaccination programs

The emerging role of magnetic resonance imaging and multidetector computed tomography in the diagnosis of dilated cardiomyopathy

Magnetic resonance imaging and multidetector computed tomography are new imaging methods that have much to offer clinicians caring for patients with dilated cardiomyopathy. In this article we briefly describe the clinical, pathophysiological and histological aspects of dilated cardiomyopathy. Then we discuss in detail the use of both imaging methods for measurement of chamber size, global and regional function, for myocardial tissue characterisation, including myocardial viability assessment, and determination of arrhythmogenic substrate, and their emerging role in cardiac resynchronisation therapy

Exploring new physics frontiers through numerical relativity

The demand to obtain answers to highly complex problems within strong-field gravity has been met with significant progress in the numerical solution of Einstein's equations - along with some spectacular results - in various setups. We review techniques for solving Einstein's equations in generic spacetimes, focusing on fully nonlinear evolutions but also on how to benchmark those results with perturbative approaches. The results address problems in high-energy physics, holography, mathematical physics, fundamental physics, astrophysics and cosmology