Markerless attenuation correction for carotid MRI surface receiver coils in combined PET/MR imaging.

The purpose of the study was to evaluate the effect of attenuation of MR coils on quantitative carotid PET/MR exams. Additionally, an automated attenuation correction method for flexible carotid MR coils was developed and evaluated.The attenuation of the carotid coil was measured by imaging a uniform water phantom injected with 37 MBq of 18F-FDG in a combined PET/MR scanner for 24 min with and without the coil. In the same session, an ultra-short echo time (UTE) image of the coil on top of the phantom was acquired. Using a combination of rigid and non-rigid registration, a CT-based attenuation map was registered to the UTE image of the coil for attenuation and scatter correction. After phantom validation, the effect of the carotid coil attenuation and the attenuation correction method were evaluated in five subjects.Phantom studies indicated that the overall loss of PET counts due to the coil was 6.3% with local region-of-interest (ROI) errors reaching up to 18.8%. Our registration method to correct for attenuation from the coil decreased the global error and local error (ROI) to 0.8% and 3.8%, respectively. The proposed registration method accurately captured the location and shape of the coil with a maximum spatial error of 2.6 mm. Quantitative analysis in human studies correlated with the phantom findings, but was dependent on the size of the ROI used in the analysis.MR coils result in significant error in PET quantification and thus attenuation correction is needed. The proposed strategy provides an operator-free method for attenuation and scatter correction for a flexible MRI carotid surface coil for routine clinical use

Stability of closed gaps for the alternating Kronig-Penney Hamiltonian

We consider the Kronig-Penney model for a quantum crystal with equispaced periodic delta-interactions of alternating strength. For this model all spectral gaps at the centre of the Brillouin zone are known to vanish, although so far this noticeable property has only been proved through a very delicate analysis of the discriminant of the corresponding ODE and the associated monodromy matrix. We provide a new, alternative proof by showing that this model can be approximated, in the norm resolvent sense, by a model of regular periodic interactions with finite range for which all gaps at the centre of the Brillouin zone are still vanishing. In particular this shows that the vanishing gap property is stable in the sense that it is present also for the "physical" approximants and is not only a feature of the idealised model of zero-range interactions. \ua9 2015, Springer Basel

Automatic Verification of Finite Precision Implementations of Linear Controllers

We consider the problem of verifying finite precision implementation of linear time-invariant controllers against mathematical specifications. A specification may have multiple correct implementations which are different from each other in controller state representation, but equivalent from a perspective of input-output behavior (e.g., due to optimization in a code generator). The implementations may use finite precision computations (e.g. floating-point arithmetic) which cause quantization (i.e., roundoff) errors. To address these challenges, we first extract a controller\u27s mathematical model from the implementation via symbolic execution and floating-point error analysis, and then check approximate input-output equivalence between the extracted model and the specification by similarity checking. We show how to automatically verify the correctness of floating-point controller implementation in C language using the combination of techniques such as symbolic execution and convex optimization problem solving. We demonstrate the scalability of our approach through evaluation with randomly generated controller specifications of realistic size

Scalable Verification of Linear Controller Software

We consider the problem of verifying software implementations of linear time-invariant controllers against mathematical specifications. Given a controller specification, multiple correct implementations may exist, each of which uses a different representation of controller state (e.g., due to optimizations in a third-party code generator). To accommodate this variation, we first extract a controller\u27s mathematical model from the implementation via symbolic execution, and then check input-output equivalence between the extracted model and the specification by similarity checking. We show how to automatically verify the correctness of C code controller implementation using the combination of techniques such as symbolic execution, satisfiability solving and convex optimization. Through evaluation using randomly generated controller specifications of realistic size, we demonstrate that the scalability of this approach has significantly improved compared to our own earlier work based on the invariant checking method

Formal Analysis of Sneak-Peek: A Data-Centre Attack and its Mitigations

Part 4: Software Security / AttacksInternational audienceAttackers can exploit covert channels, such as timing side-channels, to transmit information without data owners or network administrators being aware. Sneak-Peek is a recently considered data centre attack, where, in a multi-tenant setting, an insider attacker can communicate with colluding outsiders by intentionally adding delays to traffic on logically isolated but physically shared links. Timing attack mitigations typically introduce delays or randomness which can make it difficult to understand the trade-off between level of security (bandwidth of the covert channel) and performance loss. We demonstrate that formal methods can help. We analyse the impacts of two Sneak-Peek mitigations, namely, noise addition and path hopping. We provide a precise mathematical model of the attack and of the effectiveness these defences. This mathematical analysis is extended by two tool-based stochastic formal models, one formalized in Uppaal and the other in Carma. The formal models can capture more general and larger networks than a paper-based analysis, can be used to check properties and make measurements, and are more easily modifiable than conventional network simulations. With Uppaal, we can analyse the effectiveness of mitigations and with Carma, we can analyse how these mitigations affect latencies in typical data centre topologies. As results, we show that using a selective strategy for path hopping is better than a random strategy, that using the two defences in conjunction may actually be worse than using a single defence, and we show the connection between hop frequency and network latency

Retrospective observational study of HER2 immunohistochemistry in borderline breast cancer patients undergoing neoadjuvant therapy, with an emphasis on Group 2 (HER2/CEP17 ratio ≥2.0, HER2 copy number <4.0 signals/cell) cases

Background: The ASCO/CAP guidance on HER2 testing in breast cancer (BC) has recently changed. Group 2 tumours with immunohistochemistry score 2+ and HER2/CEP17 ratio ≥2.0 and HER2 copy number &lt;4.0 signals/cell were re-classified as HER2 negative. This study aims to examine the response of Group 2 tumours to neoadjuvant chemotherapy (NACT).Methods: 749 BC cases were identified from 11 institutions. The association between HER2 groups and pathological complete response (pCR) was assessed.Results: 54% of immunohistochemistry HER2 positive (score 3+) BCs showed pCR, compared to 19% of immunohistochemistry 2+ FISH amplified cases. 27% of Group 2 treated with HER2 targeted therapy achieved pCR, compared to 19 and 11% in the combined Groups 1 + 3 and Groups 4 + 5, respectively. No difference in pCR rates was identified between Group 2 and Group 1 or combined Groups 1 + 3. However, Group 2 response rate was higher than Groups 4 + 5 (p = 0.017).Conclusion: No difference in pCR was detected in tumours with a HER2/CEP17 ratio ≥2.0 and a HER2 score 2+ by IHC when stratified by HER2 gene copy number. Our data suggest that ASCO/CAP HER2 Group 2 carcinomas should be evaluated further with respect to eligibility for HER2 targeted therapy.</p

Kinetics and thermodynamics of salt-dependent T7 gene 2.5 protein binding to single- and double-stranded DNA

Bacteriophage T7 gene 2.5 protein (gp2.5) is a single-stranded DNA (ssDNA)-binding protein that has essential roles in DNA replication, recombination and repair. However, it differs from other ssDNA-binding proteins by its weaker binding to ssDNA and lack of cooperative ssDNA binding. By studying the rate-dependent DNA melting force in the presence of gp2.5 and its deletion mutant lacking 26 C-terminal residues, we probe the kinetics and thermodynamics of gp2.5 binding to ssDNA and double-stranded DNA (dsDNA). These force measurements allow us to determine the binding rate of both proteins to ssDNA, as well as their equilibrium association constants to dsDNA. The salt dependence of dsDNA binding parallels that of ssDNA binding. We attribute the four orders of magnitude salt-independent differences between ssDNA and dsDNA binding to nonelectrostatic interactions involved only in ssDNA binding, in contrast to T4 gene 32 protein, which achieves preferential ssDNA binding primarily through cooperative interactions. The results support a model in which dimerization interactions must be broken for DNA binding, and gp2.5 monomers search dsDNA by 1D diffusion to bind ssDNA. We also quantitatively compare the salt-dependent ssDNA- and dsDNA-binding properties of the T4 and T7 ssDNA-binding proteins for the first time