The Impact of Price Regulation on the Launch Delay of New Drugs - Evidence from Twenty-Five Major Markets in the 1990s

This study analyzes the effect of pharmaceutical price regulation on delays in new drug launches. Because low price in one market may 'spill-over' to others, though parallel trade and external referencing, manufacturers may rationally prefer longer delay or non-launch to accepting a low price. We use a Cox proportional hazard model to analyze the launch experience in 25 major markets of 85 new chemical entities (NCEs) launched in the UK or US between 1994 and 1998. There are 1,167 observed launches, or about 55% of the maximum. The US leads with 73 launches, followed by Germany (66) and the UK (64). Only 13 NCEs launched in Japan, 26 in Portugal and 28 in New Zealand. Countries with fewer launches also have longer average launch lags. The launch hazard is positively related to expected price and to expected volume, controlling for income per capita. The originator firm(s) characteristics, specifically, launch in home country and global experience, also significantly reduce launch delay. Within the EU, likely parallel export countries have the most negative effects. Our results suggest that countries with lower expected prices or smaller expected market size experience longer delays in new drug access, controlling for per capita income and other country and firm characteristics.

Nuclear β+\beta^+/EC decays in covariant density functional theory and the impact of isoscalar proton-neutron pairing

Self-consistent proton-neutron quasiparticle random phase approximation based on the spherical nonlinear point-coupling relativistic Hartree-Bogoliubov theory is established and used to investigate the $\beta^+$/EC-decay half-lives of neutron-deficient Ar, Ca, Ti, Fe, Ni, Zn, Cd, and Sn isotopes. The isoscalar proton-neutron pairing is found to play an important role in reducing the decay half-lives, which is consistent with the same mechanism in the $\beta$ decays of neutron-rich nuclei. The experimental $\beta^+$/EC-decay half-lives can be well reproduced by a universal isoscalar proton-neutron pairing strength.Comment: 12 pages, 4 figure

Spin-dependent transport in a quasiballistic quantum wire

We describe the transport properties of a 5 $\mu$m long one-dimensional (1D) quantum wire. Reduction of conductance plateaux due to the introduction of weakly disorder scattering are observed. In an in-plane magnetic field, we observe spin-splitting of the reduced conductance steps. Our experimental results provide evidence that deviation from conductance quantisation is very small for electrons with spin parallel and is about 1/3 for electrons with spin anti-parallel. Moreover, in a high in-plane magnetic field, a spin-polarised 1D channel shows a plateau-like structure close to $0.3 \times e^2/h$ which strengthens with {\em increasing} temperatures. It is suggested that these results arise from the combination of disorder and the electron-electron interactions in the 1D electron gas.Comment: 4 pages, 5 figures, latex to be published in Phys. Rev. B (15/3/2000

Effective Field Theory for Rydberg Polaritons

We develop an effective field theory (EFT) to describe the few- and many-body propagation of one dimensional Rydberg polaritons. We show that the photonic transmission through the Rydberg medium can be found by mapping the propagation problem to a non-equilibrium quench, where the role of time and space are reversed. We include effective range corrections in the EFT and show that they dominate the dynamics near scattering resonances in the presence of deep bound states. Finally, we show how the long-range nature of the Rydberg-Rydberg interactions induces strong effective $N$-body interactions between Rydberg polaritons. These results pave the way towards studying non-perturbative effects in quantum field theories using Rydberg polaritons.Comment: 5+ pages main text, 3 figures; 5 pages supplemental, 1 figure; v2 - replaced discussion of N-body bound state preparation with discussion of effective range corrections and made other minor correction

Environment, morphology and stellar populations of bulgeless low surface brightness galaxies

Based on the Sloan Digital Sky Survey DR 7, we investigate the environment, morphology and stellar population of bulgeless low surface brightness (LSB) galaxies in a volume-limited sample with redshift ranging from 0.024 to 0.04 and $M_r$ $\leq$ $-18.8$. The local density parameter $\Sigma_5$ is used to trace their environments. We find that, for bulgeless galaxies, the surface brightness does not depend on the environment. The stellar populations are compared for bulgeless LSB galaxies in different environments and for bulgeless LSB galaxies with different morphologies. The stellar populations of LSB galaxies in low density regions are similar to those of LSB galaxies in high density regions. Irregular LSB galaxies have more young stars and are more metal-poor than regular LSB galaxies. These results suggest that the evolution of LSB galaxies may be driven by their dynamics including mergers rather than by their large scale environment.Comment: 12 pages, 13 figures, Accepted by A&

All Maximal Independent Sets and Dynamic Dominance for Sparse Graphs

We describe algorithms, based on Avis and Fukuda's reverse search paradigm, for listing all maximal independent sets in a sparse graph in polynomial time and delay per output. For bounded degree graphs, our algorithms take constant time per set generated; for minor-closed graph families, the time is O(n) per set, and for more general sparse graph families we achieve subquadratic time per set. We also describe new data structures for maintaining a dynamic vertex set S in a sparse or minor-closed graph family, and querying the number of vertices not dominated by S; for minor-closed graph families the time per update is constant, while it is sublinear for any sparse graph family. We can also maintain a dynamic vertex set in an arbitrary m-edge graph and test the independence of the maintained set in time O(sqrt m) per update. We use the domination data structures as part of our enumeration algorithms.Comment: 10 page