Writing in Britain and Ireland, c. 400 to c. 800

No abstract available

Creating and curating an archive: Bury St Edmunds and its Anglo-Saxon past

This contribution explores the mechanisms by which the Benedictine foundation of Bury St Edmunds sought to legitimise and preserve their spurious pre-Conquest privileges and holdings throughout the Middle Ages. The archive is extraordinary in terms of the large number of surviving registers and cartularies which contain copies of Anglo-Saxon charters, many of which are wholly or partly in Old English. The essay charts the changing use to which these ancient documents were put in response to threats to the foundation's continued enjoyment of its liberties. The focus throughout the essay is to demonstrate how pragmatic considerations at every stage affects the development of the archive and the ways in which these linguistically challenging texts were presented, re-presented, and represented during the Abbey’s history

Combined Scheduling and Mapping for Scalable Computing with Parallel Tasks

Recent and future parallel clusters and supercomputers use symmetric multiprocessors (SMPs) and multi-core processors as basic nodes, providing a huge amount of parallel resources. These systems often have hierarchically structured interconnection networks combining computing resources at different levels, starting with the interconnect within multi-core processors up to the interconnection network combining nodes of the cluster or supercomputer. The challenge for the programmer is that these computing resources should be utilized efficiently by exploiting the available degree of parallelism of the application program and by structuring the application in a way which is sensitive to the heterogeneous interconnect. In this article, we pursue a parallel programming method using parallel tasks to structure parallel implementations. A parallel task can be executed by multiple processors or cores and, for each activation of a parallel task, the actual number of executing cores can be adapted to the specific execution situation. In particular, we propose a new combined scheduling and mapping technique for parallel tasks with dependencies that takes the hierarchical structure of modern multi-core clusters into account. An experimental evaluation shows that the presented programming approach can lead to a significantly higher performance compared to standard data parallel implementations

Combining Measures for Temporal and Spatial Locality

Numerical software for sequential or parallel machines with memory hierarchies can benefit from locality optimizations which are usually achieved by program restructuring or program transformations. The choice of the program version that achieves the best performance is usually complex as many dependencies have to be taken into account. Thus program-based locality measures have been introduced to give programmers a guideline if a performance gain can be expected from a program restructuring. The novel contribution of this paper is the extension of these locality measures to support spatial locality. These extended measures are applied to two applications from scientific computing and the obtained prediction is compared to benchmark results

Is the outcome of elective vs non-elective patients undergoing transcatheter aortic valve implantation different? Results of a single-centre, observational assessment of outcomes at a large university clinic

Background: Transcatheter aortic valve implantation (TAVI) can either be conducted as an elective (scheduled in advance) or a non-elective procedure performed during an unplanned hospital admission. The objective of this study was to compare the outcomes of elective and non-elective TAVI patients. Methods This single-centre study included 512 patients undergoing transfemoral TAVI between October 2018 and December 2020; 378 (73.8%) were admitted for elective TAVI, 134 (26.2%) underwent a non-elective procedure. Our TAVI programme entails an optimized fast-track concept aimed at minimizing the total length of stay to ≤ 5 days for elective patients which in the German healthcare system is currently defined as the minimal time period to safely perform TAVI. Clinical characteristics and survival rates at 30 days and 1 year were analysed. Results Patients who underwent non-elective TAVI had a significantly higher comorbidity burden. Median duration from admission to discharge was 6 days (elective group 6 days versus non-elective group 15 days; p < 0.001), including a median postprocedural stay of 5 days (elective 4 days versus non-elective 7 days; p < 0.001). All-cause mortality at 30 days was 1.1% for the elective group and 3.7% for non-elective patients (p = 0.030). At 1 year, all-cause mortality among elective TAVI patients was disproportionately lower than in non-elective patients (5.0% versus 18.7%, p < 0.001). In the elective group, 54.5% of patients could not be discharged early due to comorbidities or procedural complications. Factors associated with a failure of achieving a total length of stay of ≤ 5 days comprised frailty syndrome, renal impairment as well as new permanent pacemaker implantation, new bundle branch block or atrial fibrillation, life-threatening bleeding, and the use of self-expanding valves. After multivariate adjustment, new permanent pacemaker implantation (odds ratio 6.44; 95% CI 2.59–16.00), life-threatening bleeding (odds ratio 4.19; 95% confidence interval 1.82–9.66) and frailty syndrome (odds ratio 5.15; 95% confidence interval 2.40–11.09; all p < 0.001, respectively) were confirmed as significant factors. Conclusions While non-elective patients had acceptable periprocedural outcomes, mortality rates at 1 year were significantly higher compared to elective patients. Approximately only half of elective patients could be discharged early. Improvements in periprocedural care, follow-up strategies and optimized treatment of both elective and non-elective TAVI patients are needed.Applied Science, Faculty ofNon UBCNursing, School ofReviewedFacultyResearcherOthe

Regulation of Protein Kinase A Activity by p90 Ribosomal S6 Kinase 1*

Previously, we reported that the catalytic subunit of cAMP-dependent protein kinase (PKAc) binds to the active p90 ribosomal S6 kinase 1 (RSK1) (Chaturvedi, D., Poppleton, H. M., Stringfield, T., Barbier, A., and Patel, T. B. (2006) Mol. Cell. Biol. 26, 4586–4600). Herein, by overexpressing hemagglutinin-tagged RSK1 fragments in HeLa cells we have identified the region of RSK1 that is responsible for the interaction with PKAc. PKAc bound to the last 13 amino acids of RSK1, which overlaps the Erk1/2 docking site. This interaction between PKAc and RSK1 required the phosphorylation of Ser-732 in the C terminus of RSK1. Depending upon its phosphorylation status, RSK1 switched interactions between Erk1/2 and PKAc. In addition, a peptide corresponding to the last 13 amino acids of RSK1 with substitution of Ser-732 with Glu (peptide E), but not Ala (peptide A), decreased interactions between endogenous active RSK1 and PKAc. RSK1 attenuated the ability of cAMP to activate PKA in vitro and this modulation was abrogated by peptide E, but not by peptide A. Similarly, in intact cells, cAMP-mediated phosphorylation of Bcl-xL/Bcl-2-associated death promoter on Ser-115, the PKA site, was reduced when RSK1 was activated by epidermal growth factor, and this effect was blocked by peptide E, but not by peptide A. These findings demonstrate that interactions between endogenous RSK1 and PKAc in intact cells regulate the ability of cAMP to activate PKA and identify a novel mechanism by which PKA activity is regulated by the Erk1/2 pathway