On the generalised Ritt problem as a computational problem

The Ritt problem asks if there is an algorithm that tells whether one prime differential ideal is contained in another one if both are given by their characteristic sets. We give several equivalent formulations of this problem. In particular, we show that it is equivalent to testing if a differential polynomial is a zero divisor modulo a radical differential ideal. The technique used in the proof of equivalence yields algorithms for computing a canonical decomposition of a radical differential ideal into prime components and a canonical generating set of a radical differential ideal. Both proposed representations of a radical differential ideal are independent of the given set of generators and can be made independent of the ranking.Comment: 9 page

Linking data and BPMN processes to achieve executable models

We describe a formally well founded approach to link data and processes conceptually, based on adopting UML class diagrams to represent data, and BPMN to represent the process. The UML class diagram together with a set of additional process variables, called Artifact, form the information model of the process. All activities of the BPMN process refer to such an information model by means of OCL operation contracts. We show that the resulting semantics while abstract is fully executable. We also provide an implementation of the executor.Peer ReviewedPostprint (author's final draft

Relative judgement is relatively difficult: evidence against the role of relative judgement in absolute identification

A variety of processes have been put forward to explain absolute identification performance. One difference between current models of absolute identification is the extent to which the task involves accessing stored representations in long-term memory (e.g. exemplars in memory, Kent & Lamberts, Journal of Experimental Psychology: Learning Memory and Cognition, 31, 289–305, 2005) or relative judgement (comparison of the current stimulus to the stimulus on the previous trial, Stewart, Brown & Chater, Psychological Review, 112, 881–911, 2005). In two experiments we explored this by tapping into these processes. In Experiment 1 participants completed an absolute identification task using eight line lengths whereby a single stimulus was presented on each trial for identification. They also completed a matching task aimed at mirroring exemplar comparison in which eight line lengths were presented in a circular array and the task was to report which of these matched a target presented centrally. Experiment 2 was a relative judgement task and was similar to Experiment 1 except that the task was to report the difference (jump-size) between the current stimulus and that on the previous trial. The absolute identification and matching data showed clear similarities (faster and more accurate responding for stimuli near the edges of the range and similar stimulus-response confusions). In contrast, relative judgment performance was poor suggesting relative judgement is not straightforward. Moreover, performance as a function of jump-size differed considerably between the relative judgement and absolute identification tasks. Similarly, in the relative judgement task, predicting correct stimulus identification based on successful relative judgement yielded the reverse pattern of performance observed in the absolute identification task. Overall, the data suggest that relative judgement does not underlie absolute identification and that the task is more likely reliant on an exemplar comparison process

Accounting Problems Under the Excess Profits Tax

DNA vaccines based on subunits from pathogens have several advantages over other vaccine strategies. DNA vaccines can easily be modified, they show good safety profiles, are stable and inexpensive to produce, and the immune response can be focused to the antigen of interest. However, the immunogenicity of DNA vaccines which is generally quite low needs to be improved. Electroporation and co-delivery of genetically encoded immune adjuvants are two strategies aiming at increasing the efficacy of DNA vaccines. Here, we have examined whether targeting to antigen-presenting cells (APC) could increase the immune response to surface envelope glycoprotein (Env) gp120 from Human Immunodeficiency Virus type 1 (HIV- 1). To target APC, we utilized a homodimeric vaccine format denoted vaccibody, which enables covalent fusion of gp120 to molecules that can target APC. Two molecules were tested for their efficiency as targeting units: the antibody-derived single chain Fragment variable (scFv) specific for the major histocompatilibility complex (MHC) class II I-E molecules, and the CC chemokine ligand 3 (CCL3). The vaccines were delivered as DNA into muscle of mice with or without electroporation. Targeting of gp120 to MHC class II molecules induced antibodies that neutralized HIV-1 and that persisted for more than a year after one single immunization with electroporation. Targeting by CCL3 significantly increased the number of HIV-1 gp120-reactive CD8(+) T cells compared to non-targeted vaccines and gp120 delivered alone in the absence of electroporation. The data suggest that chemokines are promising molecular adjuvants because small amounts can attract immune cells and promote immune responses without advanced equipment such as electroporation.Funding Agencies|Research Council of Norway; Odd Fellow</p

A cardinal role for cathepsin D in co-ordinating the host-mediated apoptosis of macrophages and killing of pneumococci

The bactericidal function of macrophages against pneumococci is enhanced by their apoptotic demise, which is controlled by the anti-apoptotic protein Mcl-1. Here, we show that lysosomal membrane permeabilization (LMP) and cytosolic translocation of activated cathepsin D occur prior to activation of a mitochondrial pathway of macrophage apoptosis. Pharmacological inhibition or knockout of cathepsin D during pneumococcal infection blocked macrophage apoptosis. As a result of cathepsin D activation, Mcl-1 interacted with its ubiquitin ligase Mule and expression declined. Inhibition of cathepsin D had no effect on early bacterial killing but inhibited the late phase of apoptosis-associated killing of pneumococci in vitro. Mice bearing a cathepsin D-/- hematopoietic system demonstrated reduced macrophage apoptosis in vivo, with decreased clearance of pneumococci and enhanced recruitment of neutrophils to control pulmonary infection. These findings establish an unexpected role for a cathepsin D-mediated lysosomal pathway of apoptosis in pulmonary host defense and underscore the importance of apoptosis-associated microbial killing to macrophage function

Networked buffering: a basic mechanism for distributed robustness in complex adaptive systems

A generic mechanism - networked buffering - is proposed for the generation of robust traits in complex systems. It requires two basic conditions to be satisfied: 1) agents are versatile enough to perform more than one single functional role within a system and 2) agents are degenerate, i.e. there exists partial overlap in the functional capabilities of agents. Given these prerequisites, degenerate systems can readily produce a distributed systemic response to local perturbations. Reciprocally, excess resources related to a single function can indirectly support multiple unrelated functions within a degenerate system. In models of genome:proteome mappings for which localized decision-making and modularity of genetic functions are assumed, we verify that such distributed compensatory effects cause enhanced robustness of system traits. The conditions needed for networked buffering to occur are neither demanding nor rare, supporting the conjecture that degeneracy may fundamentally underpin distributed robustness within several biotic and abiotic systems. For instance, networked buffering offers new insights into systems engineering and planning activities that occur under high uncertainty. It may also help explain recent developments in understanding the origins of resilience within complex ecosystems. \ud \u