LibSEAL: revealing service integrity violations using trusted execution

Users of online services such as messaging, code hosting and collaborative document editing expect the services to uphold the integrity of their data. Despite providers’ best efforts, data corruption still occurs, but at present service integrity violations are excluded from SLAs. For providers to include such violations as part of SLAs, the competing requirements of clients and providers must be satisfied. Clients need the ability to independently identify and prove service integrity violations to claim compensation. At the same time, providers must be able to refute spurious claims. We describe LibSEAL, a SEcure Audit Library for Internet services that creates a non-repudiable audit log of service operations and checks invariants to discover violations of service integrity. LibSEAL is a drop-in replacement for TLS libraries used by services, and thus observes and logs all service requests and responses. It runs inside a trusted execution environment, such as Intel SGX, to protect the integrity of the audit log. Logs are stored using an embedded relational database, permitting service invariant violations to be discovered using simple SQL queries. We evaluate LibSEAL with three popular online services (Git, ownCloud and Dropbox) and demonstrate that it is effective in discovering integrity violations, while reducing throughput by at most 14%

Effects of transcranial ultrasound stimulation pulsed at 40 Hz on A beta plaques and brain rhythms in 5xFAD mice

Background: Alzheimer’s disease (AD) is the most common cause of dementia, and is characterized by amyloid-β (Aβ) plaques and tauopathy. Reducing Aβ has been considered a major AD treatment strategy in pharmacological and non-pharmacological approaches. Impairment of gamma oscillations, which play an important role in perception and cognitive function, has been shown in mouse AD models and human patients. Recently, the therapeutic effect of gamma entrainment in AD mouse models has been reported. Given that ultrasound is an emerging neuromodulation modality, we investigated the effect of ultrasound stimulation pulsed at gamma frequency (40 Hz) in an AD mouse model. Methods: We implanted electroencephalogram (EEG) electrodes and a piezo-ceramic disc ultrasound transducer on the skull surface of 6-month-old 5×FAD and wild-type control mice (n = 12 and 6, respectively). Six 5×FAD mice were treated with two-hour ultrasound stimulation at 40 Hz daily for two weeks, and the other six mice received sham treatment. Soluble and insoluble Aβ levels in the brain were measured by enzyme-linked immunosorbent assay. Spontaneous EEG gamma power was computed by wavelet analysis, and the brain connectivity was examined with phase-locking value and cross-frequency phase-amplitude coupling. Results: We found that the total Aβ42 levels, especially insoluble Aβ42, in the treatment group decreased in pre- and infra-limbic cortex (PIL) compared to that of the sham treatment group. A reduction in the number of Aβ plaques was also observed in the hippocampus. There was no increase in microbleeding in the transcranial ultrasound stimulation (tUS) group. In addition, the length and number of microglial processes decreased in PIL and hippocampus. Encelphalographic spontaneous gamma power was increased, and cross-frequency coupling was normalized, implying functional improvement after tUS stimulation. Conclusion: These results suggest that the transcranial ultrasound-based gamma-band entrainment technique can be an effective therapy for AD by reducing the Aβ load and improving brain connectivity. © 2021, The Author(s).1

Is Myocardial Infarction in Patients without Significant Stenosis on a Coronary Angiogram as Benign as Believed?

The present study aimed to investigate the clinical characteristics and 1-year outcomes of acute myocardial infarction (AMI) patients without significant stenosis on a coronary angiogram comparison with the clinical characteristics and outcomes of patients with significant coronary artery stenosis. A total of 1,220 patients with AMI were retrospectively classified into Group I (≥50% diameter stenosis, n=1,120) and Group II (<50%, n=100). Group II was further divided into two subgroups according to the underlying etiology: cryptogenic (Group II-a, n=54) and those with possible causative factors (Group II-b, n=46). Patients in Group II were younger, were more likely to be women, and were less likely to smoke and to have diabetes mellitus than were patients in Group I. The levels of cardiac enzymes, LDL-cholesterol levels, and the apo-B/A1 ratio were lower in Group II. However, 1-month and 12-month rates of major adverse cardiac events (MACE) were not significantly different between the two groups. The Group II-b subgroup comprised 29 patients with vasospasm, 11 with myocardial bridge, and 6 with spontaneous thrombolysis. Left ventricular ejection fraction and creatinine clearance were lower and levels of N-terminal pro-brain natriuretic peptide (NT-proBNP) and high-sensitivity C-reactive protein (hs-CRP) were higher in Group II-a than in Group II-b. However, outcomes including MACE and mortality at 12 months were not significantly different between the two subgroups. The 1-year outcomes of patients in Group II were similar to those of patients in Group I. The clinical outcomes in Group II-a were also similar to those of Group II-b, although the former group showed higher levels of NT-proBNP and hs-CRP

A Function-Composition Approach to Synthesize Fortran 90 Array Operations

[[abstract]]An increasing number of programming languages, such as Fortran 90 and APL, are providing a rich set of intrinsic array functions and array expressions. These constructs which constitute an important part of data parallel languages provide excellent opportunities for compiler optimizations. In this paper, we present a new approach to combine consecutive array operations or array expressions into a composite access function of the source arrays. Our scheme is based on the composition of access functions, which is analogous to a composition of mathematic functions. Our new scheme can handle not only data movements of arrays with different numbers of dimensions and with multiple-clause array operations but also masked array expressions and multiple-source array operations. As a result, our proposed scheme is the first synthesis scheme which can collectively synthesize Fortran 90 RESHAPE, EOSHIFT, MERGE, array reduction operations, and WHERE constructs. In addition, we also discuss the case that the synthesis scheme may result in a performance anomaly in the presence of common subexpressions and one-to-many array operations. A solution is proposed to avoid such a performance anomaly. Experimental results show speedups from 1.21 to 2.95 over the base code for code fragments from real applications on a Sequent multiprocessor machine and also show comparable performance improvements on an 8-node SGI Power Challenge by incorporating our proposed optimizations[[fileno]]2030216010010[[department]]資訊工程學

Communication Set Generations with CSD Calculus and Expression-Rewriting Framework

In this paper, we present a new framework based on expression rewritings and a calculus form called CSD calculus to generate the local enumeration set and communication set for HPF programs with Block-Cyclic distribution. Our framework is a practical software framework, and can handle the general cases so that the communication set of HPF programs of &quot;Block-Cyclic&quot; distributions with two-level alignments (or multiplelevel alignments), multi-dimensional arrays, array intrinsic functions (such as Transpose operation), and affine indexes and axis exchange in the array subscript, can be calculated in a systematic way with a sound software foundation. Previously, existing work do not report a software framework to solve a problem with such general cases. In addition, our expression-rewriting framework is based on a new representative form, CSD (common-stride descriptor), to describe the regularity of the access patterns of HPF programs with &quot;Block-Cyclic&quot; distribution. We also demonstrate a..