Regional variation in digital cushion pressure in the forefeet of horses and elephants

In this study, we seek to understand how the digital cushion morphologies evident in horse and elephant feet influence internal and external foot pressures. Our novel use of invasive blood pressure monitoring equipment, combined with a pressure pad and force plate, enabled measurements of (ex vivo) digital cushion pressure under increasing axial loads in seven horse and six elephant forefeet. Linear mixed effects models (LMER) revealed that internal digital cushion pressures increase under load and differ depending on region; elephant feet experienced higher magnitudes of medial digital cushion pressure, whereas horse feet experienced higher magnitudes of centralised digital cushion pressure. Direct comparison of digital cushion pressure magnitudes in both species, at equivalent loads relative to body weight, revealed that medial and lateral pressures increased more rapidly with load in elephant limbs. Within the same approximate region, internal pressures exceeded external, palmar pressures (on the sole of the foot), supporting previous Finite Element (FE) predictions. High pressures and large variations in pressure may relate to the development of foot pathology, which is a major concern in horses and elephants in a captive/domestic environment

Surface enhanced resonance Raman detection of a catalytic intermediate of DyP-type peroxidase

Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich.This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively.We report herein the vibrational spectroscopic characterisation of a catalytic intermediate formed by the reaction of H2O2 with DyP-type peroxidase immobilised on a biocompatible coated metal support. The SERR spectroscopic approach is of general applicability to other peroxidases which form relatively stable catalytic intermediates.DFG, EXC 314, Unifying Concepts in Catalysi

Bridging the Accountability Gap: Rights for New Entities in the Information Society?

Technological developments in the information society bring new challenges, both to the applicability and to the enforceability of the law. One major challenge is posed by new entities such as pseudonyms, avatars, and software agents that operate at an increasing distance from the physical persons "behind" them (the "principal"). In case of accidents or misbehavior, current laws require that the physical or legal principal behind the entity be found so that she can be held to account. This may be problematic if the linkability of the principal and the operating entity is questionable. In light of the ongoing developments in electronic agents, there is sufficient reason to conduct a review of the literature in order to more closely examine arguments for and against legal personhood for some nonhuman acting entities. This article also includes a discussion of alternative approaches to solving the "accountability gap.

GaBoDS: The Garching-Bonn Deep Survey - III. Lyman-Break Galaxies in the Chandra Deep Field South

We present first results of our search for high-redshift galaxies in deep CCD mosaic images. As a pilot study for a larger survey, very deep images of the Chandra Deep Field South (CDFS), taken withWFI@MPG/ESO2.2m, are used to select large samples of 1070 U-band and 565 B-band dropouts with the Lyman-break method. The data of these Lyman-break galaxies are made public as an electronic table. These objects are good candidates for galaxies at z~3 and z~4 which is supported by their photometric redshifts. The distributions of apparent magnitudes and the clustering properties of the two populations are analysed, and they show good agreement to earlier studies. We see no evolution in the comoving clustering scale length from z~3 to z~4. The techniques presented here will be applied to a much larger sample of U-dropouts from the whole survey in near future.Comment: 11 pages, 11 figures, replaced with version accepted by A&A. Minor changes and tabular appendix with LBG catalogues. Version with full resolution figures available at http://www.astro.uni-bonn.de/~hendrik/2544.pd

Large Oligomeric Complex Structures Can Be Computationally Assembled by Efficiently Combining Docked Interfaces

Macromolecular oligomeric assemblies are involved in many biochemical processes of living organisms. The benefits of such assemblies in crowded cellular environments include increased reaction rates, efficient feedback regulation, cooperativity and protective functions. However, an atom‐level structural determination of large assemblies is challenging due to the size of the complex and the difference in binding affinities of the involved proteins. In this study, we propose a novel combinatorial greedy algorithm for assembling large oligomeric complexes from information on the approximate position of interaction interfaces of pairs of monomers in the complex. Prior information on complex symmetry is not required but rather the symmetry is inferred during assembly. We implement an efficient geometric score, the transformation match score, that bypasses the model ranking problems of state‐of‐the‐art scoring functions by scoring the similarity between the inferred dimers of the same monomer simultaneously with different binding partners in a (sub)complex with a set of pregenerated docking poses. We compiled a diverse benchmark set of 308 homo and heteromeric complexes containing 6 to 60 monomers. To explore the applicability of the method, we considered 48 sets of parameters and selected those three sets of parameters, for which the algorithm can correctly reconstruct the maximum number, namely 252 complexes (81.8%) in, at least one of the respective three runs. The crossvalidation coverage, that is, the mean fraction of correctly reconstructed benchmark complexes during crossvalidation, was 78.1%, which demonstrates the ability of the presented method to correctly reconstruct topology of a large variety of biological complexes. Proteins 2015; 83:1887–1899. © 2015 The Authors. Proteins: Structure, Function, and Bioinformatics Published by Wiley Periodicals, Inc

Complex span versus updating tasks of working memory : the gap is not that deep

How to best measure working memory capacity is an issue of ongoing debate. Besides established complex span tasks, which combine short-term memory demands with generally unrelated secondary tasks, there exists a set of paradigms characterized by continuous and simultaneous updating of several items in working memory, such as the n-back, memory updating, or alpha span tasks. With a latent variable analysis (N = 96) based on content-heterogeneous operationalizations of both task families, the authors found a latent correlation between a complex span factor and an updating factor that was not statistically different from unity (r = .96). Moreover, both factors predicted fluid intelligence (reasoning) equally well. The authors conclude that updating tasks measure working memory equally well as complex span tasks. Processes involved in building, maintaining, and updating arbitrary bindings may constitute the common working memory ability underlying performance on reasoning, complex span, and updating tasks

Challenges in Medicine: The Odyssey of a Patient with Isolated IgG4-Related Eosinophilic Angiocentric Fibrosis Presenting as a Locally Destructive Sinonasal Mass

Eosinophilic angiocentric fibrosis (EAF) is an exceeding rare clinical entity and is considered a part of the spectrum of IgG4-related disease (IgG4RD). We hereby present such an unusual case of a 60-year-old female who presented to us with recurrent sinonasal mass, after a decade long haul of multiple clinical evaluations, biopsies, and debulking surgery without a definitive diagnosis. Over this period, the mass eroded through the ethmoid cells along with nasal septal destruction leading to saddle nose deformity, extended superiorly through the cribriform plates to right frontal lobe, and compressed the optic nerve leading to visual loss. Although initial biopsy was negative, repeat biopsy was performed owing to high clinical suspicion due to all the classic histopathological findings compatible with the diagnosis of eosinophilic angiocentric fibrosis IgG4-related disease (EAF-IgG4RD). Steroids are the recommended first-line therapy; however, our case was resistant to steroids needing rituximab to halt the disease progression. Our case interestingly also had T-cell clonality and isolated isocitrate dehydrogenase 2 enzyme mutation on next-generation sequencing, suggesting a possible role of novel molecular-targeted therapies in this rare disease. This case highlights the clinical challenges physicians face towards diagnosing and treating EAF-IgG4RD, emphasizing the need for high clinical suspicion and the possible role of targeted therapies for this rare disease

Interestingness of traces in declarative process mining: The janus LTLPf Approach

Declarative process mining is the set of techniques aimed at extracting behavioural constraints from event logs. These constraints are inherently of a reactive nature, in that their activation restricts the occurrence of other activities. In this way, they are prone to the principle of ex falso quod libet: they can be satisfied even when not activated. As a consequence, constraints can be mined that are hardly interesting to users or even potentially misleading. In this paper, we build on the observation that users typically read and write temporal constraints as if-statements with an explicit indication of the activation condition. Our approach is called Janus, because it permits the specification and verification of reactive constraints that, upon activation, look forward into the future and backwards into the past of a trace. Reactive constraints are expressed using Linear-time Temporal Logic with Past on Finite Traces (LTLp f). To mine them out of event logs, we devise a time bi-directional valuation technique based on triplets of automata operating in an on-line fashion. Our solution proves efficient, being at most quadratic w.r.t. trace length, and effective in recognising interestingness of discovered constraints