Emerging quantitative MR imaging biomarkers in inflammatory arthritides

PURPOSE: To review quantitative magnetic resonance imaging (qMRI) methods for imaging inflammation in connective tissues and the skeleton in inflammatory arthritis. This review is designed for a broad audience including radiologists, imaging technologists, rheumatologists and other healthcare professionals. METHODS: We discuss the use of qMRI for imaging skeletal inflammation from both technical and clinical perspectives. We consider how qMRI can be targeted to specific aspects of the pathological process in synovium, cartilage, bone, tendons and entheses. Evidence for the various techniques from studies of both adults and children with inflammatory arthritis is reviewed and critically appraised. RESULTS: qMRI has the potential to objectively identify, characterize and quantify inflammation of the connective tissues and skeleton in both adult and pediatric patients. Measurements of tissue properties derived using qMRI methods can serve as imaging biomarkers, which are potentially more reproducible and informative than conventional MRI methods. Several qMRI methods are nearing transition into clinical practice and may inform diagnosis and treatment decisions, with the potential to improve patient outcomes. CONCLUSIONS: qMRI enables specific assessment of inflammation in synovium, cartilage, bone, tendons and entheses, and can facilitate a more consistent, personalized approach to diagnosis, characterisation and monitoring of disease

Call-by-value non-determinism in a linear logic type discipline

We consider the call-by-value lambda-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent intersection types, we endow this calculus with a type system based on the so-called Girard's second translation of intuitionistic logic into linear logic. We prove that a term is typable if and only if it is converging, and that its typing tree carries enough information to give a bound on the length of its lazy call-by-value reduction. Moreover, when the typing tree is minimal, such a bound becomes the exact length of the reduction

Cost-Effectiveness of Total Hip and Knee Replacements for the Australian Population with Osteoarthritis: Discrete-Event Simulation Model

Background: Osteoarthritis constitutes a major musculoskeletal burden for the aged Australians. Hip and knee replacement surgeries are effective interventions once all conservative therapies to manage the symptoms have been exhausted. This study aims to evaluate the cost-effectiveness of hip and knee replacements in Australia. To our best knowledge, the study is the first attempt to account for the dual nature of hip and knee osteoarthritis in modelling the severities of right and left joints separately

OntoMathPROOntoMath^{PRO} Ontology: A Linked Data Hub for Mathematics

In this paper, we present an ontology of mathematical knowledge concepts that covers a wide range of the fields of mathematics and introduces a balanced representation between comprehensive and sensible models. We demonstrate the applications of this representation in information extraction, semantic search, and education. We argue that the ontology can be a core of future integration of math-aware data sets in the Web of Data and, therefore, provide mappings onto relevant datasets, such as DBpedia and ScienceWISE.Comment: 15 pages, 6 images, 1 table, Knowledge Engineering and the Semantic Web - 5th International Conferenc

Contour extracting networks in early extrastriate cortex

Neurons in the visual cortex process a local region of visual space, but in order to adequately analyze natural images, neurons need to interact. The notion of an ?association field? proposes that neurons interact to extract extended contours. Here, we identify the site and properties of contour integration mechanisms. We used functional magnetic resonance imaging (fMRI) and population receptive field (pRF) analyses. We devised pRF mapping stimuli consisting of contours. We isolated the contribution of contour integration mechanisms to the pRF by manipulating the contour content. This stimulus manipulation led to systematic changes in pRF size. Whereas a bank of Gabor filters quantitatively explains pRF size changes in V1, only V2/V3 pRF sizes match the predictions of the association field. pRF size changes in later visual field maps, hV4, LO-1, and LO-2 do not follow either prediction and are probably driven by distinct classical receptive field properties or other extraclassical integration mechanisms. These pRF changes do not follow conventional fMRI signal strength measures. Therefore, analyses of pRF changes provide a novel computational neuroimaging approach to investigating neural interactions. We interpreted these results as evidence for neural interactions along co-oriented, cocircular receptive fields in the early extrastriate visual cortex (V2/V3), consistent with the notion of a contour association field

Online Publics in Muslim Southeast Asia: In Between Religious Politics and Popular Pious Practices

This article introduces the special issue ‘Online Publics in Muslim Southeast Asia: In Between Religious Politics and Popular Pious Practices’ by discussing prominent ap- proaches in the study of media and the public sphere in light of the specific history of digital media’s rise in Muslim Southeast Asia. It focuses on earlier and current expres- sions of mobile and Islamic modernity as well as on changing moralities and forms of Islamic authority. Referencing the other contributions to this special issue, it particu- larly emphasizes the (discursive and visual) contestations and social dramas that take place in the region’s media spaces providing for a variety of Islamic forms, practices, and socialities that can best be grasped, the authors argue, by considering politics, the pious, and the popular not as separate, but as mutually constitutive domains.  Global Challenges (FSW

A Vernacular for Coherent Logic

We propose a simple, yet expressive proof representation from which proofs for different proof assistants can easily be generated. The representation uses only a few inference rules and is based on a frag- ment of first-order logic called coherent logic. Coherent logic has been recognized by a number of researchers as a suitable logic for many ev- eryday mathematical developments. The proposed proof representation is accompanied by a corresponding XML format and by a suite of XSL transformations for generating formal proofs for Isabelle/Isar and Coq, as well as proofs expressed in a natural language form (formatted in LATEX or in HTML). Also, our automated theorem prover for coherent logic exports proofs in the proposed XML format. All tools are publicly available, along with a set of sample theorems.Comment: CICM 2014 - Conferences on Intelligent Computer Mathematics (2014

A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems

Basic proof-search tactics in logic and type theory can be seen as the root-first applications of rules in an appropriate sequent calculus, preferably without the redundancies generated by permutation of rules. This paper addresses the issues of defining such sequent calculi for Pure Type Systems (PTS, which were originally presented in natural deduction style) and then organizing their rules for effective proof-search. We introduce the idea of Pure Type Sequent Calculus with meta-variables (PTSCalpha), by enriching the syntax of a permutation-free sequent calculus for propositional logic due to Herbelin, which is strongly related to natural deduction and already well adapted to proof-search. The operational semantics is adapted from Herbelin's and is defined by a system of local rewrite rules as in cut-elimination, using explicit substitutions. We prove confluence for this system. Restricting our attention to PTSC, a type system for the ground terms of this system, we obtain the Subject Reduction property and show that each PTSC is logically equivalent to its corresponding PTS, and the former is strongly normalising iff the latter is. We show how to make the logical rules of PTSC into a syntax-directed system PS for proof-search, by incorporating the conversion rules as in syntax-directed presentations of the PTS rules for type-checking. Finally, we consider how to use the explicitly scoped meta-variables of PTSCalpha to represent partial proof-terms, and use them to analyse interactive proof construction. This sets up a framework PE in which we are able to study proof-search strategies, type inhabitant enumeration and (higher-order) unification

Hierarchical models for service-oriented systems

We present our approach to the denotation and representation of hierarchical graphs: a suitable algebra of hierarchical graphs and two domains of interpretations. Each domain of interpretation focuses on a particular perspective of the graph hierarchy: the top view (nested boxes) is based on a notion of embedded graphs while the side view (tree hierarchy) is based on gs-graphs. Our algebra can be understood as a high-level language for describing such graphical models, which are well suited for defining graphical representations of service-oriented systems where nesting (e.g. sessions, transactions, locations) and linking (e.g. shared channels, resources, names) are key aspects