A colimit decomposition for homotopy algebras in Cat

Badzioch showed that in the category of simplicial sets each homotopy algebra of a Lawvere theory is weakly equivalent to a strict algebra. In seeking to extend this result to other contexts Rosicky observed a key point to be that each homotopy colimit in simplicial sets admits a decomposition into a homotopy sifted colimit of finite coproducts, and asked the author whether a similar decomposition holds in the 2-category of categories Cat. Our purpose in the present paper is to show that this is the case.Comment: Some notation changed; small amount of exposition added in intr

Computational techniques for the assessment of fracture repair

The combination of high-resolution three-dimensional medical imaging, increased computing power, and modern computational methods provide unprecedented capabilities for assessing the repair and healing of fractured bone. Fracture healing is a natural process that restores the mechanical integrity of bone and is greatly influenced by the prevailing mechanical environment. Mechanobiological theories have been proposed to provide greater insight into the relationships between mechanics (stress and strain) and biology. Computational approaches for modelling these relationships have evolved from simple tools to analyze fracture healing at a single point in time to current models that capture complex biological events such as angiogenesis, stochasticity in cellular activities, and cell-phenotype specific activities. The predictive capacity of these models has been established using corroborating physical experiments. For clinical application, mechanobiological models accounting for patient-to-patient variability hold the potential to predict fracture healing and thereby help clinicians to customize treatment. Advanced imaging tools permit patient-specific geometries to be used in such models. Refining the models to study the strain fields within a fracture gap and adapting the models for case-specific simulation may provide more accurate examination of the relationship between strain and fracture healing in actual patients. Medical imaging systems have significantly advanced the capability for less invasive visualization of injured musculoskeletal tissues, but all too often the consideration of these rich datasets has stopped at the level of subjective observation. Computational image analysis methods have not yet been applied to study fracture healing, but two comparable challenges which have been addressed in this general area are the evaluation of fracture severity and of fracture-associated soft tissue injury. CT-based methodologies developed to assess and quantify these factors are described and results presented to show the potential of these analysis methods

Arctic shipping emissions inventories and future scenarios

This paper presents 5 km×5 km Arctic emissions inventories of important greenhouse gases, black carbon and other pollutants under existing and future (2050) scenarios that account for growth of shipping in the region, potential diversion traffic through emerging routes, and possible emissions control measures. These high-resolution, geospatial emissions inventories for shipping can be used to evaluate Arctic climate sensitivity to black carbon (a short-lived climate forcing pollutant especially effective in accelerating the melting of ice and snow), aerosols, and gaseous emissions including carbon dioxide. We quantify ship emissions scenarios which are expected to increase as declining sea ice coverage due to climate change allows for increased shipping activity in the Arctic. A first-order calculation of global warming potential due to 2030 emissions in the high-growth scenario suggests that short-lived forcing of ~4.5 gigagrams of black carbon from Arctic shipping may increase global warming potential due to Arctic ships' CO<sub>2</sub> emissions (~42 000 gigagrams) by some 17% to 78%. The paper also presents maximum feasible reduction scenarios for black carbon in particular. These emissions reduction scenarios will enable scientists and policymakers to evaluate the efficacy and benefits of technological controls for black carbon, and other pollutants from ships

Borrowed contexts for attributed graphs

Borrowed context graph transformation is a simple and powerful technique developed by Ehrig and König that allow us to derive labeled transitions and bisimulation congruences for graph transformation systems or, in general, for pocess calculi that can be defined in terms of graph transformation systems. Moreover, the same authors have also shown how to use this technique for the verification of bisimilarity. In principle, the main results about borrowed context transformation do not apply only to plain graphs, but they are generic in the sense that they apply to all categories tha satisfy certain properties related to the notion of adhesivity. In particular, this is the case of attributed graphs. However, as we show in the paper, the techniques used for checking bisimilarity are not equally generic and, in particular they fail, if we want to apply them to attributed graphs. To solve this problem, in this paper, we define a special notion of symbolic graph bisimulation and show how it can be used to check bisimilarity of attributed graphs.Postprint (published version

Can sexual selection drive female life histories? A comparative study on Galliform birds

Sexual selection is an important driver of many of the most spectacular morphological traits that we find in the animal kingdom (for example see Andersson, 1994). As such, sexual selection is most often emphasized as

The Serre spectral sequence of a noncommutative fibration for de Rham cohomology

For differential calculi on noncommutative algebras, we construct a twisted de Rham cohomology using flat connections on modules. This has properties similar, in some respects, to sheaf cohomology on topological spaces. We also discuss generalised mapping properties of these theories, and relations of these properties to corings. Using this, we give conditions for the Serre spectral sequence to hold for a noncommutative fibration. This might be better read as giving the definition of a fibration in noncommutative differential geometry. We also study the multiplicative structure of such spectral sequences. Finally we show that some noncommutative homogeneous spaces satisfy the conditions to be such a fibration, and in the process clarify the differential structure on these homogeneous spaces. We also give two explicit examples of differential fibrations: these are built on the quantum Hopf fibration with two different differential structures.Comment: LaTeX, 33 page

Enhanced Animation of Parallel Algorithms

Algorithm animation is a visualization method used to enhance understanding of the functioning of an algorithm or program. Visualization is used for many purposes, including education, algorithm research, performance analysis, and program debugging. This research, which follows from previous work, examines algorithm animation requirements for the various visualization purposes and extends the capabilities of an existing facilities, the AFIT algorithm Animation Research Facility (AAARF). The structure of AAARF is summarised and its visualization capabilities presented, analysed and compared with other similar packages. This research focuses on the parallel data requirements of the AAARF users, and the meaningful display of large amounts of data. This paper discusses a series of refined animations suitable for a variety of purposes which are capable of conveying detailed information in a concise and timely manner and the development and implementation of a new performance animation type is presented. These animations are built upon pedagogical efforts in a classroom environment. To assist novice users in efficiently using AAARF, an expert system interface has been implemented to advise on optimizing environment configuration. Considerable effort has been devoted to porting AAARF to the X Windows environment and the lessons learned and progress made are discussed

Perinatal health monitoring in Europe: results from the EURO-PERISTAT project

Data about deliveries, births, mothers and newborn babies are collected extensively to monitor the health and care of mothers and babies during pregnancy, delivery and the post-partum period, but there is no common approach in Europe. We analysed the problems related to using the European data for international comparisons of perinatal health. We made an inventory of relevant data sources in 25 European Union (EU) member states and Norway, and collected perinatal data using a previously defined indicator list. The main sources were civil registration based on birth and death certificates, medical birth registers, hospital discharge systems, congenital anomaly registers, confidential enquiries and audits. A few countries provided data from routine perinatal surveys or from aggregated data collection systems. The main methodological problems were related to differences in registration criteria and definitions, coverage of data collection, problems in combining information from different sources, missing data and random variation for rare events. Collection of European perinatal health information is feasible, but the national health information systems need improvements to fill gaps. To improve international comparisons, stillbirth definitions should be standardised and a short list of causes of fetal and infant deaths should be developed

Rewriting modulo symmetric monoidal structure

String diagrams are a powerful and intuitive graphical syntax for terms of symmetric monoidal categories (SMCs). They find many applications in computer science and are becoming increasingly relevant in other fields such as physics and control theory.An important role in many such approaches is played by equational theories of diagrams, typically oriented and applied as rewrite rules. This paper lays a comprehensive foundation for this form of rewriting. We interpret diagrams combinatorially as typed hypergraphs and establish the precise correspondence between diagram rewriting modulo the laws of SMCs on the one hand and double pushout (DPO) rewriting of hypergraphs, subject to a soundness condition called convexity, on the other. This result rests on a more general characterisation theorem in which we show that typed hypergraph DPO rewriting amounts to diagram rewriting modulo the laws of SMCs with a chosen special Frobenius structure.We illustrate our approach with a proof of termination for the theory of non-commutative bimonoids