An exploration of an equine facilitated intervention with young offenders.

This research reports a qualitative study to explore the behavioural responses to, and reported reflections from Young Offenders undertaking an Equine Facilitated Learning (EFL) Intervention in prison in the UK. Learning was facilitated by an instructor and the participants were taught introductory natural horsemanship skills. Establishments holding young adult prisoners are typically characterised by increased disruption to the regime, and with greater incidents of violence, bullying and conflict than in other types of prison. A resulting challenge for those working with young prisoners is the need to respond to increased levels of social isolation, and difficulties in managing impulsivity, problem solving, temper and conduct. It is hoped that this research will provide some initial evidence to contribute to ideas around the nature of learning practical positive skills and knowledge through inter species interactions

Counting Subgraphs in Somewhere Dense Graphs

We study the problems of counting copies and induced copies of a small pattern graph $H$ in a large host graph $G$. Recent work fully classified the complexity of those problems according to structural restrictions on the patterns $H$. In this work, we address the more challenging task of analysing the complexity for restricted patterns and restricted hosts. Specifically we ask which families of allowed patterns and hosts imply fixed-parameter tractability, i.e., the existence of an algorithm running in time $f(H)\cdot |G|^{O(1)}$ for some computable function $f$. Our main results present exhaustive and explicit complexity classifications for families that satisfy natural closure properties. Among others, we identify the problems of counting small matchings and independent sets in subgraph-closed graph classes $\mathcal{G}$ as our central objects of study and establish the following crisp dichotomies as consequences of the Exponential Time Hypothesis: (1) Counting $k$-matchings in a graph $G\in\mathcal{G}$ is fixed-parameter tractable if and only if $\mathcal{G}$ is nowhere dense. (2) Counting $k$-independent sets in a graph $G\in\mathcal{G}$ is fixed-parameter tractable if and only if $\mathcal{G}$ is nowhere dense. Moreover, we obtain almost tight conditional lower bounds if $\mathcal{G}$ is somewhere dense, i.e., not nowhere dense. These base cases of our classifications subsume a wide variety of previous results on the matching and independent set problem, such as counting $k$-matchings in bipartite graphs (Curticapean, Marx; FOCS 14), in $F$-colourable graphs (Roth, Wellnitz; SODA 20), and in degenerate graphs (Bressan, Roth; FOCS 21), as well as counting $k$-independent sets in bipartite graphs (Curticapean et al.; Algorithmica 19).Comment: 35 pages, 3 figures, 4 tables, abstract shortened due to ArXiv requirement

Counting Subgraphs in Somewhere Dense Graphs

We study the problems of counting copies and induced copies of a small pattern graph H in a large host graph G. Recent work fully classified the complexity of those problems according to structural restrictions on the patterns H. In this work, we address the more challenging task of analysing the complexity for restricted patterns and restricted hosts. Specifically we ask which families of allowed patterns and hosts imply fixed-parameter tractability, i.e., the existence of an algorithm running in time f(H)?|G|^O(1) for some computable function f. Our main results present exhaustive and explicit complexity classifications for families that satisfy natural closure properties. Among others, we identify the problems of counting small matchings and independent sets in subgraph-closed graph classes ? as our central objects of study and establish the following crisp dichotomies as consequences of the Exponential Time Hypothesis: - Counting k-matchings in a graph G ? ? is fixed-parameter tractable if and only if ? is nowhere dense. - Counting k-independent sets in a graph G ? ? is fixed-parameter tractable if and only if ? is nowhere dense. Moreover, we obtain almost tight conditional lower bounds if ? is somewhere dense, i.e., not nowhere dense. These base cases of our classifications subsume a wide variety of previous results on the matching and independent set problem, such as counting k-matchings in bipartite graphs (Curticapean, Marx; FOCS 14), in F-colourable graphs (Roth, Wellnitz; SODA 20), and in degenerate graphs (Bressan, Roth; FOCS 21), as well as counting k-independent sets in bipartite graphs (Curticapean et al.; Algorithmica 19). At the same time our proofs are much simpler: using structural characterisations of somewhere dense graphs, we show that a colourful version of a recent breakthrough technique for analysing pattern counting problems (Curticapean, Dell, Marx; STOC 17) applies to any subgraph-closed somewhere dense class of graphs, yielding a unified view of our current understanding of the complexity of subgraph counting

Visualization and Quantification of Post-Stroke Neural Connectivity and Neuroinflammation Using Serial Two-Photon Tomography in the Whole Mouse Brain

Whole-brain volumetric microscopy techniques such as serial two-photon tomography (STPT) can provide detailed information on the roles of neuroinflammation and neuroplasticity throughout the whole brain post-stroke. STPT automatically generates high-resolution images of coronal sections of the entire mouse brain that can be readily visualized in three dimensions. We developed a pipeline for whole brain image analysis that includes supervised machine learning (pixel-wise random forest models via the “ilastik” software package) followed by registration to a standardized 3-D atlas of the adult mouse brain (Common Coordinate Framework v3.0; Allen Institute for Brain Science). These procedures allow the detection of cellular fluorescent signals throughout the brain in an unbiased manner. To illustrate our imaging techniques and automated image quantification, we examined long-term post-stroke motor circuit connectivity in mice that received a motor cortex photothrombotic stroke. Two weeks post-stroke, mice received intramuscular injections of pseudorabies virus (PRV-152), a trans-synaptic retrograde herpes virus driving expression of green fluorescent protein (GFP), into the affected contralesional forelimb to label neurons in descending tracts to the forelimb musculature. Mice were sacrificed 3 weeks post-stroke. We also quantified sub-acute neuroinflammation in the post-stroke brain in a separate cohort of mice following a 60 min transient middle cerebral artery occlusion (tMCAo). Naive e450+-labeled splenic CD8+ cytotoxic T cells were intravenously injected at 7, 24, 48, and 72 h post-tMCAo. Mice were sacrificed 4 days after stroke. Detailed quantification of post-stroke neural connectivity and neuroinflammation indicates a role for remote brain regions in stroke pathology and recovery. The workflow described herein, incorporating STPT and automated quantification of fluorescently labeled features of interest, provides a framework by which one can objectively evaluate labeled neuronal or lymphocyte populations in healthy and injured brains. The results provide region-specific quantification of neural connectivity and neuroinflammation, which could be a critical tool for investigating mechanisms of not only stroke recovery, but also a wide variety of brain injuries or diseases

B Cells Migrate into Remote Brain Areas and Support Neurogenesis and Functional Recovery after Focal Stroke in Mice

Lymphocytes infiltrate the stroke core and penumbra and often exacerbate cellular injury. B cells, however, are lymphocytes that do not contribute to acute pathology but can support recovery. B cell adoptive transfer to mice reduced infarct volumes 3 and 7 d after transient middle cerebral artery occlusion (tMCAo), independent of changing immune populations in recipient mice. Testing a direct neurotrophic effect, B cells cocultured with mixed cortical cells protected neurons and maintained dendritic arborization after oxygen-glucose deprivation. Whole-brain volumetric serial two-photon tomography (STPT) and a custom-developed image analysis pipeline visualized and quantified poststroke B cell diapedesis throughout the brain, including remote areas supporting functional recovery. Stroke induced significant bilateral B cell diapedesis into remote brain regions regulating motor and cognitive functions and neurogenesis (e.g., dentate gyrus, hypothalamus, olfactory areas, cerebellum) in the whole-brain datasets. To confirm a mechanistic role for B cells in functional recovery, rituximab was given to human CD20+ (hCD20+) transgenic mice to continuously deplete hCD20+-expressing B cells following tMCAo. These mice experienced delayed motor recovery, impaired spatial memory, and increased anxiety through 8 wk poststroke compared to wild type (WT) littermates also receiving rituximab. B cell depletion reduced stroke-induced hippocampal neurogenesis and cell survival. Thus, B cell diapedesis occurred in areas remote to the infarct that mediated motor and cognitive recovery. Understanding the role of B cells in neuronal health and disease-based plasticity is critical for developing effective immune-based therapies for protection against diseases that involve recruitment of peripheral immune cells into the injured brain

Tilbakeføringsprosjektet – Viste kirkeruin, Randaberg kommune

Oppdragsgiver: RiksantikvarenArkeologisk museum, Universitet i Stavanger (AM-UiS) har tidligere utarbeidet to rapporter om Viste kirkeruin1. Arkeolog Mari Høgestøl og konservator Ann Meeks skrev «Viste – et kirkested fra middelalder» i 2012. Rapporten gir en beskrivelse av ruinen, kirkens utforming, og dimensjoner basert på historisk kildemateriale. I tillegg har restaureringstekniker George Murphy skrevet «Tiltaksplan for Viste kirkeruin, Randaberg» i 2015. Tiltaksplanen beskriver tilstand sammenlignet med historiske kilder og foreslår tiltak for det gjenværende murverket. Denne rapporten beskriver gjennomførte tiltak foreslått i tiltaksplanen fra 2015. Prosjektet ble utført i samarbeid med Riksantikvarens ruinprosjekt ved seniorrådgiver Inger-Marie Aicher Olsrud og AM-UiS ved avdelingsleder/arkeolog Mari Høgestøl, steinkonservator Ann Meeks, og restaureringstekniker George Murphy. Torfinn Viste er grunneieren for Viste kirkeruin. Han er blitt holdt oppdatert fortløpende gjennom prosjektet. Hovedforfatteren av oppdragsrapporten er George Murphy. Ann Meeks har skrevet avsnittene «Funn» og «Dokumentasjon etter utført arbeid». Rapporten er redigert av avdelingsleder Inger Marie Egenberg og avdelingsleder Mari Høgestøl

Randaberg - et kirkested fra middelalder. Kirketuft og kirkegård

Utført på oppdrag fra Riksantikvare