Multi-Vendor and Multisite Evaluation of Cerebrovascular Reactivity Mapping Using Hypercapnia Challenge

Cerebrovascular reactivity (CVR), which measures the ability of cerebral blood vessels to dilate or constrict in response to vasoactive stimuli such as CO2 inhalation, is an important index of the brain\u27s vascular health. Quantification of CVR using BOLD MRI with hypercapnia challenge has shown great promises in research and clinical studies. However, in order for it to be used as a potential imaging biomarker in large-scale and multi-site studies, the reliability of CO2-CVR quantification across different MRI acquisition platforms and researchers/raters must be examined. The goal of this report from the MarkVCID small vessel disease biomarkers consortium is to evaluate the reliability of CO2-CVR quantification in three studies. First, the inter-rater reliability of CO2-CVR data processing was evaluated by having raters from 5 MarkVCID sites process the same 30 CVR datasets using a cloud-based CVR data processing pipeline. Second, the inter-scanner reproducibility of CO2-CVR quantification was assessed in 10 young subjects across two scanners of different vendors. Third, test-retest repeatability was evaluated in 20 elderly subjects from 4 sites with a scan interval of less than 2 weeks. In all studies, the CO2 CVR measurements were performed using the fixed inspiration method, where the subjects wore a nose clip and a mouthpiece and breathed room air and 5% CO2 air contained in a Douglas bag alternatively through their mouth. The results showed that the inter-rater CoV of CVR processing was 0.08 ± 0.08% for whole-brain CVR values and ranged from 0.16% to 0.88% in major brain regions, with ICC of absolute agreement above 0.9959 for all brain regions. Inter-scanner CoV was found to be 6.90 ± 5.08% for whole-brain CVR values, and ranged from 4.69% to 12.71% in major brain regions, which are comparable to intra-session CoVs obtained from the same scanners on the same day. ICC of consistency between the two scanners was 0.8498 for whole-brain CVR and ranged from 0.8052 to 0.9185 across major brain regions. In the test-retest evaluation, test-retest CoV across different days was found to be 18.29 ± 17.12% for whole-brain CVR values, and ranged from 16.58% to 19.52% in major brain regions, with ICC of absolute agreement ranged from 0.6480 to 0.7785. These results demonstrated good inter-rater, inter-scanner, and test-retest reliability in healthy volunteers, and suggested that CO2-CVR has suitable instrumental properties for use as an imaging biomarker of cerebrovascular function in multi-site and longitudinal observational studies and clinical trials

Code Renewability for Native Software Protection

Software protection aims at safeguarding assets embedded in software by preventing and delaying reverse engineering and tampering attacks. This paper presents an architecture and supporting tool flow to renew parts of native applications dynamically. Renewed and diversified code and data belonging to either the original application or to linked-in protections are delivered from a secure server to a client on demand. This results in frequent changes to the software components when they are under attack, thus making attacks harder. By supporting various forms of diversification and renewability, novel protection combinations become available, and existing combinations become stronger. The prototype implementation is evaluated on a number of industrial use cases

Berry and Pancharatnam Topological Phases of Atomic and Optical Systems

Theoretical and experimental studies of Berry and Pancharatnam phases are reviewed. Basic elements of differential geometry are presented for understanding the topological nature of these phases. The basic theory analyzed by Berry in relation to magnetic monopoles is presented. The theory is generalized to nonadiabatic processes and to noncyclic Pancharatnam phases. Different systems are discussed including polarization optics, n-level atomic systems, neutron interferometry and molecular topological phases.Comment: Review article,72 pages, 186 reference

Using FIRE & ICE for detecting and recovering compromised nodes in sensor networks

Abstract: "This paper presents a suite of protocols called FIRE (Forgery-resilient Intrusion detection, Recovery, and Establishments of keys), for detecting and recovering compromised nodes in sensor networks. FIRE consists of two protocols: an intrusion detection and code update protocol, and a cryptographic key update protocol. In concert, the FIRE protocols enable us to design a sensor network that can always detect compromised nodes (no false negatives), and either repair them through code updates and set up new cryptographic keys, or revoke the compromised nodes from the network. The FIRE protocols are based on ICE (Indisputable Code Execution), a mechanism providing externally verifiable code execution on off-the-shelf sensor nodes. ICE gives the following two properties: 1) the locations in memory from where the code is currently executing on a sensor node, matches memory locations being verified and 2) the memory contents being verified are correct. Together, these two properties guarantee that the code currently executing on the sensor node is correct. The FIRE protocols represent a significant step towards designing secure sensor networks. As far as we are aware, there are no techniques for intrusion detection in adhoc and sensor networks that do make any false negative claims. Also, we do not know of any existing techniques that can automatically recover compromised sensor nodes. We present an implementation of our FIRE protocols and ICE on current off-the-shelf sensor devices.

SWATT: SoftWare-based ATTestation for Embedded Devices

We expect a future where we are surrounded by embedded devices, ranging from Java-enabled cell phones to sensor networks and smart appliances. An adversary can compromise our privacy and safety by maliciously modifying the memory contents of these embedded devices. In this paper, we propose a SoftWare-based ATTestation technique (SWATT) to verify the memory contents of embedded devices and establish the absence of malicious changes to the memory contents. SWATT does not need physical access to the device’s memory, yet provides memory content attestation similar to TCG or NGSCB without requiring secure hardware. SWATT can detect any change in memory contents with high probability, thus detecting viruses, unexpected configuration settings, and Trojan Horses. To circumvent SWATT, we expect that an attacker needs to change the hardware to hide memory content changes. We present an implementation of SWATT in off-the-shelf sensor network devices, which enables us to verify the contents of the program memory even while the sensor node is running.