The polaroid image as photo-object

This article is part of a larger project on the cultural history of Polaroid photography and draws on research done at the Polaroid Corporate archive at Harvard and at the Polaroid company itself. It identifies two cultural practices engendered by Polaroid photography, which, at the point of its extinction, has briefly flared into visibility again. It argues that these practices are mistaken as novel but are in fact rediscoveries of practices that stretch back as many as five decades. The first section identifies Polaroid image-making as a photographic equivalent of what Tom Gunning calls the ‘cinema of attractions’. That is, the emphasis in its use is on the display of photographic technologies rather than the resultant image. Equally, the common practice, in both fine art and vernacular circles, of making composite pictures with Polaroid prints, draws attention from image content and redirects it to the photo as object

A Parameterized Algebra for Event Notification Services

Event notification services are used in various applications such as digital libraries, stock tickers, traffic control, or facility management. However, to our knowledge, a common semantics of events in event notification services has not been defined so far. In this paper, we propose a parameterized event algebra which describes the semantics of composite events for event notification systems. The parameters serve as a basis for flexible handling of duplicates in both primitive and composite events

Complexity of ITL model checking: some well-behaved fragments of the interval logic HS

Model checking has been successfully used in many computer science fields, including artificial intelligence, theoretical computer science, and databases. Most of the proposed solutions make use of classical, point-based temporal logics, while little work has been done in the interval temporal logic setting. Recently, a non-elementary model checking algorithm for Halpern and Shoham's modal logic of time intervals HS over finite Kripke structures (under the homogeneity assumption) and an EXPSPACE model checking procedure for two meaningful fragments of it have been proposed. In this paper, we show that more efficient model checking procedures can be developed for some expressive enough fragments of HS

Vaccine innovation, translational research and the management of knowledge accumulation

What does it take to translate research into socially beneficial technologies like vaccines? Current policy that focuses on expanding research or strengthening incentives overlooks how the supply and demand of innovation is mediated by problem-solving processes that generate knowledge which is often fragmented and only locally valid. This paper details some of the conditions that allow fragmented, local knowledge to accumulate through a series of structured steps from the artificial simplicity of the laboratory to the complexity of real world application. Poliomyelitis is used as an illustrative case to highlight the importance of experimental animal models and the extent of co-ordination that can be required if they are missing. Implications for the governance and management of current attempts to produce vaccines for HIV, TB and Malaria are discussed. Article Outlin

LTL Fragments are Hard for Standard Parameterisations

We classify the complexity of the LTL satisfiability and model checking problems for several standard parameterisations. The investigated parameters are temporal depth, number of propositional variables and formula treewidth, resp., pathwidth. We show that all operator fragments of LTL under the investigated parameterisations are intractable in the sense of parameterised complexity.Comment: TIME 2015 conference versio

Bounded Reachability for Temporal Logic over Constraint Systems

We present CLTLB(D), an extension of PLTLB (PLTL with both past and future operators) augmented with atomic formulae built over a constraint system D. Even for decidable constraint systems, satisfiability and Model Checking problem of such logic can be undecidable. We introduce suitable restrictions and assumptions that are shown to make the satisfiability problem for the extended logic decidable. Moreover for a large class of constraint systems we propose an encoding that realize an effective decision procedure for the Bounded Reachability problem

Partially Punctual Metric Temporal Logic is Decidable

Metric Temporal Logic \mathsf{MTL}[\until_I,\since_I] is one of the most studied real time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of time interval constraints $I$. Henzinger et al., in their seminal paper showed that the non-punctual fragment of $\mathsf{MTL}$ called $\mathsf{MITL}$ is decidable. In this paper, we sharpen this decidability result by showing that the partially punctual fragment of $\mathsf{MTL}$ (denoted $\mathsf{PMTL}$) is decidable over strictly monotonic finite point wise time. In this fragment, we allow either punctual future modalities, or punctual past modalities, but never both together. We give two satisfiability preserving reductions from $\mathsf{PMTL}$ to the decidable logic \mathsf{MTL}[\until_I]. The first reduction uses simple projections, while the second reduction uses a novel technique of temporal projections with oversampling. We study the trade-off between the two reductions: while the second reduction allows the introduction of extra action points in the underlying model, the equisatisfiable \mathsf{MTL}[\until_I] formula obtained is exponentially succinct than the one obtained via the first reduction, where no oversampling of the underlying model is needed. We also show that $\mathsf{PMTL}$ is strictly more expressive than the fragments \mathsf{MTL}[\until_I,\since] and \mathsf{MTL}[\until,\since_I]