The synthesis and utilization of low molecular weight ozonides for air revitalization Supplement to interim report of 14 Nov. 1965

Thermal decomposition characteristics of sodium superoxide, sodium peroxide, and lithium peroxide and magnetic susceptibility of calcium superoxid

Demographic characteristics of exploited tropical lutjanids: a comparative analysis

Demographic parameters from seven exploited coral reef lutjanid species were compared as a case study of the implications of intrafamily variation in life histories for multispecies harvest management. Modal lengths varied by 4 cm among four species (Lutjanus fulviflamma, L. vitta, L. carponotatus, L. adetii), which were at least 6 cm smaller than the modal lengths of the largest species (L. gibbus, Symphorus nematophorus, Aprion virescens). Modal ages, indicating ages of full selection to fishing gear, were 10 years or less for all species, but maximum ages ranged from 12 (L. gibbus) to 36 years (S. nematophorus). Each species had a unique growth pattern, with differences in length-at-age and mean asymptotic fork length (L∞), but smaller species generally grew fast during the first 1–2 years of life and larger species grew more slowly over a longer period. Total mortality rates varied among species; L. gibbus had the highest mortality and L. fulviflamma, the lowest mortality. The variability in life history strategies of these tropical lutjanids makes generalizations about lutjanid life histories difficult, but the fact that all seven had characteristics that would make them particularly vulnerable to fishing indicates that harvest of tropical lutjanids should be managed with caution

Independence in CLP Languages

Studying independence of goals has proven very useful in the context of logic programming. In particular, it has provided a formal basis for powerful automatic parallelization tools, since independence ensures that two goals may be evaluated in parallel while preserving correctness and eciency. We extend the concept of independence to constraint logic programs (CLP) and prove that it also ensures the correctness and eciency of the parallel evaluation of independent goals. Independence for CLP languages is more complex than for logic programming as search space preservation is necessary but no longer sucient for ensuring correctness and eciency. Two additional issues arise. The rst is that the cost of constraint solving may depend upon the order constraints are encountered. The second is the need to handle dynamic scheduling. We clarify these issues by proposing various types of search independence and constraint solver independence, and show how they can be combined to allow dierent optimizations, from parallelism to intelligent backtracking. Sucient conditions for independence which can be evaluated \a priori" at run-time are also proposed. Our study also yields new insights into independence in logic programming languages. In particular, we show that search space preservation is not only a sucient but also a necessary condition for ensuring correctness and eciency of parallel execution

Autonomous clustering using rough set theory

This paper proposes a clustering technique that minimises the need for subjective human intervention and is based on elements of rough set theory. The proposed algorithm is unified in its approach to clustering and makes use of both local and global data properties to obtain clustering solutions. It handles single-type and mixed attribute data sets with ease and results from three data sets of single and mixed attribute types are used to illustrate the technique and establish its efficiency

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

(G)hosting television: Ghostwatch and its medium

This article’s subject is Ghostwatch (BBC, 1992), a drama broadcast on Halloween night of 1992 which adopted the rhetoric of live non-fiction programming, and attracted controversy and ultimately censure from the Broadcasting Standards Council. In what follows, we argue that Ghostwatch must be understood as a televisually-specific artwork and artefact. We discuss the programme’s ludic relationship with some key features of television during what Ellis (2000) has termed its era of ‘availability’, principally liveness, mass simultaneous viewing, and the flow of the television super-text. We trace the programme’s television-specific historicity whilst acknowledging its allusions and debts to other media (most notably film and radio). We explore the sophisticated ways in which Ghostwatch’s visual grammar and vocabulary and deployment of ‘broadcast talk’ (Scannell 1991) variously ape, comment upon and subvert the rhetoric of factual programming, and the ends to which these strategies are put. We hope that these arguments collectively demonstrate the aesthetic and historical significance of Ghostwatch and identify its relationship to its medium and that medium’s history. We offer the programme as an historically-reflexive artefact, and as an exemplary instance of the work of art in television’s age of broadcasting, liveness and co-presence

Please mind the gap: students’ perspectives of the transition in academic skills between A-level and degree level geography

This paper explores first-year undergraduates’ perceptions of the transition from studying geography at pre-university level to studying for a degree. This move is the largest step students make in their education, and the debate about it in the UK has been reignited due to the government’s planned changes to A-level geography. However, missing from most of this debate is an appreciation of the way in which geography students themselves perceive their transition to university. This paper begins to rectify this absence. Using student insights, we show that their main concern is acquiring the higher level skills required for university learning

An assertion language for constraint logic programs

In an advanced program development environment, such as that discussed in the introduction of this book, several tools may coexist which handle both the program and information on the program in different ways. Also, these tools may interact among themselves and with the user. Thus, the different tools and the user need some way to communicate. It is our design principie that such communication be performed in terms of assertions. Assertions are syntactic objects which allow expressing properties of programs. Several assertion languages have been used in the past in different contexts, mainly related to program debugging. In this chapter we propose a general language of assertions which is used in different tools for validation and debugging of constraint logic programs in the context of the DiSCiPl project. The assertion language proposed is parametric w.r.t. the particular constraint domain and properties of interest being used in each different tool. The language proposed is quite general in that it poses few restrictions on the kind of properties which may be expressed. We believe the assertion language we propose is of practical relevance and appropriate for the different uses required in the tools considered

Novel thalidomide analogues display anti-angiogenic activity independently of immunomodulatory effects

The anti-tumour effects of thalidomide have been associated with its anti-angiogenic properties. Second generation thalidomide analogues are distinct compounds with enhanced therapeutic potential. Although these compounds are beginning to enter trials for the treatment of cancer there is very little information regarding the anti-angiogenic activity of these clinically relevant compounds. Furthermore, it is not known how the various immunomodulatory activities of these compounds relate to anti-angiogenic activity. In this study we assessed the anti-angiogenic activity of compounds from both IMiD™ and SelCID™ classes of analogues using a novel in vitro multicellular human assay system and the established rat aorta assay. Our results show that both the IMiDs and SelCIDs tested are significantly more potent than thalidomide. The anti-angiogenic potency of the analogues was not related to inhibition of endothelial cell proliferation, nor their TNF-α/PDE type 4 inhibitory properties. However, anti-migratory effects in vitro and inhibition of tumour growth in vivo was observed with the analogue IMiD-1 (clinically known as REVIMID™). Our results show that anti-angiogenic activity spans both currently defined classes of thalidomide analogue and is not related to their previously described immunomodulatory properties. Identification of the differential effects of these compounds will enable targeting of such compounds into the appropriate clinical setting

Hybrid Rules with Well-Founded Semantics

A general framework is proposed for integration of rules and external first order theories. It is based on the well-founded semantics of normal logic programs and inspired by ideas of Constraint Logic Programming (CLP) and constructive negation for logic programs. Hybrid rules are normal clauses extended with constraints in the bodies; constraints are certain formulae in the language of the external theory. A hybrid program is a pair of a set of hybrid rules and an external theory. Instances of the framework are obtained by specifying the class of external theories, and the class of constraints. An example instance is integration of (non-disjunctive) Datalog with ontologies formalized as description logics. The paper defines a declarative semantics of hybrid programs and a goal-driven formal operational semantics. The latter can be seen as a generalization of SLS-resolution. It provides a basis for hybrid implementations combining Prolog with constraint solvers. Soundness of the operational semantics is proven. Sufficient conditions for decidability of the declarative semantics, and for completeness of the operational semantics are given