Existence of log canonical closures

Let $f:X\to U$ be a projective morphism of normal varieties and $(X,\Delta)$ a dlt pair. We prove that if there is an open set $U^0\subset U$, such that $(X,\Delta)\times_U U^0$ has a good minimal model over $U^0$ and the images of all the non-klt centers intersect $U^0$, then $(X,\Delta)$ has a good minimal model over $U$. As consequences we show the existence of log canonical compactifications for open log canonical pairs, and the fact that the moduli functor of stable schemes satisfies the valuative criterion for properness

Highly efficient optogenetic cell ablation in C. elegans using membrane-targeted miniSOG.

The genetically encoded photosensitizer miniSOG (mini Singlet Oxygen Generator) can be used to kill cells in C. elegans. miniSOG generates the reactive oxygen species (ROS) singlet oxygen after illumination with blue light. Illumination of neurons expressing miniSOG targeted to the outer mitochondrial membrane (mito-miniSOG) causes neuronal death. To enhance miniSOG's efficiency as an ablation tool in multiple cell types we tested alternative targeting signals. We find that membrane targeted miniSOG allows highly efficient cell killing. When combined with a point mutation that increases miniSOG's ROS generation, membrane targeted miniSOG can ablate neurons in less than one tenth the time of mito-miniSOG. We extend the miniSOG ablation technique to non-neuronal tissues, revealing an essential role for the epidermis in locomotion. These improvements expand the utility and throughput of optogenetic cell ablation in C. elegans

Self-supporting liberals and their cliques : an axiomatic characterization

social groupssocial status;social choice

Interface refactoring in performance-constrained web services

This paper presents the development of REF-WS an approach to enable a Web Service provider to reliably evolve their service through the application of refactoring transformations. REF-WS is intended to aid service providers, particularly in a reliability and performance constrained domain as it permits upgraded ’non-backwards compatible’ services to be deployed into a performance constrained network where existing consumers depend on an older version of the service interface. In order for this to be successful, the refactoring and message mediation needs to occur without affecting functional compatibility with the services’ consumers, and must operate within the performance overhead expected of the original service, introducing as little latency as possible. Furthermore, compared to a manually programmed solution, the presented approach enables the service developer to apply and parameterize refactorings with a level of confidence that they will not produce an invalid or ’corrupt’ transformation of messages. This is achieved through the use of preconditions for the defined refactorings