Investigating the effect of a stress-based uniaxial anisotropy on the magnetic behaviour of La_0.7Sr_0.3MnO₃ elements

We investigate the interplay between shape anisotropy and a stress-based uniaxial anisotropy on the magnetic domain structure of La<sub>0.7</sub>Sr<sub>0.3</sub>MnO<sub>3</sub> nanoelements as a function of aspect ratio, using micromagnetic simulations. We show that a direct competition between the anisotropies gives rise to high energy multi-domain flux closure configurations, whilst an alignment of the anisotropies can modify the effective element dimensions and act to stabilise a single domain configuration. Our results demonstrate the ability to control the spin state of La<sub>0.7</sub>Sr<sub>0.3</sub>MnO<sub>3</sub> elements in addition to tailoring the domain wall width by controlling the anisotropy of the material, which is key for spintronic applications that require a high spin-polarization and stable magnetic configurations

The tractability frontier of graph-like first-order query sets

We study first-order model checking, by which we refer to the problem of deciding whether or not a given first-order sentence is satisfied by a given finite structure. In particular, we aim to understand on which sets of sentences this problem is tractable, in the sense of parameterized complexity theory. To this end, we define the notion of a graph-like sentence set, which definition is inspired by previous work on first-order model checking wherein the permitted connectives and quantifiers were restricted. Our main theorem is the complete tractability classification of such graphlike sentence sets, which is (to our knowledge) the first complexity classification theorem concerning a class of sentences that has no restriction on the connectives and quantifiers. To present and prove our classification, we introduce and develop a novel complexity-theoretic framework which is built on parameterized complexity and includes new notions of reduction

A Three-dimensional Deformable Brain Atlas for DBS Targeting. I. Methodology for Atlas Creation and Artifact Reduction.

BackgroundTargeting in deep brain stimulation (DBS) relies heavily on the ability to accurately localize particular anatomic brain structures. Direct targeting of subcortical structures has been limited by the ability to visualize relevant DBS targets.Methods and resultsIn this work, we describe the development and implementation, of a methodology utilized to create a three dimensional deformable atlas for DBS surgery. This atlas was designed to correspond to the print version of the Schaltenbrand-Bailey atlas structural contours. We employed a smoothing technique to reduce artifacts inherent in the print version.ConclusionsWe present the methodology used to create a three dimensional patient specific DBS atlas which may in the future be tested for clinical utility

Prevailing Arguments and Types of Conclusions of Parent\u2013Child Argumentation

This chapter examines the types of arguments used most often by parents and children and the different types of conclusions of their argumentative discussions. The conceptual tool adopted for the analysis is based on the integration of the pragma-dialectical ideal model of a critical discussion (van Eemeren & Grootendorst, 2004) with the Argumentum Model of Topics (Rigotti & Greco Morasso, 2019). The integration of these two tools of analysis permits to reconstruct the inferential configuration of the arguments used by parents and children and to identify the types of conclusions of their argumentative discussions. Exemplary argumentative sequences that bring to light the results obtained through the qualitative analysis of a larger corpus of argumentative discussions between parents and children are presented and discussed

Parameterized Compilation Lower Bounds for Restricted CNF-formulas

We show unconditional parameterized lower bounds in the area of knowledge compilation, more specifically on the size of circuits in decomposable negation normal form (DNNF) that encode CNF-formulas restricted by several graph width measures. In particular, we show that - there are CNF formulas of size $n$ and modular incidence treewidth $k$ whose smallest DNNF-encoding has size $n^{\Omega(k)}$, and - there are CNF formulas of size $n$ and incidence neighborhood diversity $k$ whose smallest DNNF-encoding has size $n^{\Omega(\sqrt{k})}$. These results complement recent upper bounds for compiling CNF into DNNF and strengthen---quantitatively and qualitatively---known conditional low\-er bounds for cliquewidth. Moreover, they show that, unlike for many graph problems, the parameters considered here behave significantly differently from treewidth

The STAR MAPS-based PiXeL detector

The PiXeL detector (PXL) for the Heavy Flavor Tracker (HFT) of the STAR experiment at RHIC is the first application of the state-of-the-art thin Monolithic Active Pixel Sensors (MAPS) technology in a collider environment. Custom built pixel sensors, their readout electronics and the detector mechanical structure are described in detail. Selected detector design aspects and production steps are presented. The detector operations during the three years of data taking (2014-2016) and the overall performance exceeding the design specifications are discussed in the conclusive sections of this paper

The Initial Phase of the Argumentative Discussions Between Parents and Children

This chapter examines the initial phase of parent\u2013child argumentative discussions during mealtime. The conceptual tool adopted for the analysis is based on the pragma-dialectical ideal model of a critical discussion (van Eemeren & Grootendorst\u201a 2004). The types of issues leading parents and children to engage in argumentative discussions during mealtime as well as the contribution that parents and children provide to the inception of argumentation are described and discussed. The analysis of the initial phase of parent\u2013child argumentative discussions also considers the role played by the specificity of the parent\u2013child relationship and the distinctive features of the activity of family mealtime for the beginning of an argumentative discussion. Exemplary argumentative sequences that bring to light the results obtained through the qualitative analysis of a larger corpus of argumentative discussions between parents and children are presented and discussed

Microseminoprotein-Beta Expression in Different Stages of Prostate Cancer

Microseminoprotein-beta (MSMB, MSMB) is an abundant secretory protein contributed by the prostate, and is implicated as a prostate cancer (PC) biomarker based on observations of its lower expression in cancerous cells compared with benign prostate epithelium. However, as the current literature on MSMB is inconsistent, we assessed the expression of MSMB at the protein and mRNA levels in a comprehensive set of different clinical stages of PC. Immunohistochemistry using monoclonal and polyclonal antibodies against MSMB was used to study protein expression in tissue specimens representing prostatectomies (n = 261) and in diagnostic needle biopsies from patients treated with androgen deprivation therapy (ADT) (n = 100), and in locally recurrent castration-resistant PC (CRPC) (n = 105) and CRPC metastases (n = 113). The transcript levels of MSMB, nuclear receptor co-activator 4 (NCOA4) and MSMB-NCOA4 fusion were examined by qRT-PCR in prostatectomy samples and by RNA-sequencing in benign prostatic hyperplasia, PC, and CRPC samples. We also measured serum MSMB levels and genotyped the single nucleotide polymorphism rs10993994 using DNA from the blood of 369 PC patients and 903 controls. MSMB expression in PC (29% of prostatectomies and 21% of needle biopsies) was more frequent than in CRPC (9% of locally recurrent CRPCs and 9% of CRPC metastases) (p<0.0001). Detection of MSMB protein was inversely correlated with the Gleason score in prostatectomy specimens (p = 0.024). The read-through MSMB-NCOA4 transcript was detected at very low levels in PC. MSMB levels in serum were similar in cases of PC and controls but were significantly associated with PC risk when adjusted for age at diagnosis and levels of free or total PSA (p<0.001). Serum levels of MSMB in both PC patients and controls were significantly associated with the rs10993994 genotype (p<0.0001). In conclusion, decreased expression of MSMB parallels the clinical progression of PC and adjusted serum MSMB levels are associated with PC risk

Introduction

Why do parent\u2013child argumentative interactions matter? What is the reason for such an interest? This chapter provides the reasons that motivated the study of parent\u2013child argumentation with the aim to understand the function of this type of interactions. Focusing on the activity of family mealtime, in the first part, the chapter draws attention to the distinctive features of parent\u2013child conversations. A second section of the chapter is devoted to discussing whether and, eventually, when children have the competence to construct arguments and engage in argumentative discussions with the aim to convince their parents to change opinion. In the last part of the chapter, research questions and structure of the volume are presented

How many variables are needed to express an existential positive query?

The number of variables used by a first-order query is a fundamental measure which has been studied in numerous contexts, and which is known to be highly relevant to the task of query evaluation. In this article, we study this measure in the context of existential positive queries. Building on previous work, we present a combinatorial quantity defined on existential positive queries; we show that this quantity not only characterizes the minimum number of variables needed to express a given existential positive query by another existential positive query, but also that it characterizes the minimum number of variables needed to express a given existential positive query, over all first-order queries. Put differently and loosely, we show that for any existential positive query, no variables can ever be saved by moving out of existential positive logic to first-order logic. One component of this theorem's proof is the construction of a winning strategy for a certain Ehrenfeucht-Fra\"{i}ss\'{e} type game