Lesser or just different? Capturing children''s voices in consumer research

Child research has been conducted 'on' rather than 'with' children, and has often used parental proxies or opinion to account for the views of the child. Due to this the voice of the child has been unheard. Once access and ethical concerns have been addressed the adult researcher then has to decide which role to take when conducting research with children. Children are largely seen in one of three ways, and each perspective has an impact on the role the adult researcher could adopt. The first claims that children are entirely different from adults, and fosters the notion that they are unreliable and contaminated data sources. The second perspective views children as being entirely the same as adults, and the third views children as being similar to adults but as having different (although not necessarily inferior) competencies. The latter perspective has received most support and is the favoured view of the child respondent

Superfluid instability of r-modes in "differentially rotating" neutron stars

Superfluid hydrodynamics affects the spin-evolution of mature neutron stars, and may be key to explaining timing irregularities such as pulsar glitches. However, most models for this phenomenon exclude the global instability required to trigger the event. In this paper we discuss a mechanism that may fill this gap. We establish that small scale inertial r-modes become unstable in a superfluid neutron star that exhibits a rotational lag, expected to build up due to vortex pinning as the star spins down. Somewhat counterintuitively, this instability arises due to the (under normal circumstances dissipative) vortex-mediated mutual friction. We explore the nature of the superfluid instability for a simple incompressible model, allowing for entrainment coupling between the two fluid components. Our results recover a previously discussed dynamical instability in systems where the two components are strongly coupled. In addition, we demonstrate for the first time that the system is secularly unstable (with a growth time that scales with the mutual friction) throughout much of parameter space. Interestingly, large scale r-modes are also affected by this new aspect of the instability. We analyse the damping effect of shear viscosity, which should be particularly efficient at small scales, arguing that it will not be sufficient to completely suppress the instability in astrophysical systems.Comment: RevTex, 11 figure

Single-Step Quantum Search Using Problem Structure

The structure of satisfiability problems is used to improve search algorithms for quantum computers and reduce their required coherence times by using only a single coherent evaluation of problem properties. The structure of random k-SAT allows determining the asymptotic average behavior of these algorithms, showing they improve on quantum algorithms, such as amplitude amplification, that ignore detailed problem structure but remain exponential for hard problem instances. Compared to good classical methods, the algorithm performs better, on average, for weakly and highly constrained problems but worse for hard cases. The analytic techniques introduced here also apply to other quantum algorithms, supplementing the limited evaluation possible with classical simulations and showing how quantum computing can use ensemble properties of NP search problems.Comment: 39 pages, 12 figures. Revision describes further improvement with multiple steps (section 7). See also http://www.parc.xerox.com/dynamics/www/quantum.htm

Study of electro-absorption effects in 1300nm In(Ga)As/GaAs quantum dot materials

No abstract available

GaAs-based Self-Aligned Stripe Superluminescent Diodes Processed Normal to the Cleaved Facet

We demonstrate GaAs-based superluminescent diodes (SLDs) incorporating a window-like back facet in a self-aligned stripe. SLDs are realised with low spectral modulation depth (SMD) at high power spectral density, without application of anti-reflection coatings. Such application of a window-like facet reduces effective facet reflectivity in a broadband manner. We demonstrate 30mW output power in a narrow bandwidth with only 5% SMD, outline the design criteria for high power and low SMD, and describe the deviation from a linear dependence of SMD on output power as a result of Joule heating in SLDs under continuous wave current injection. Furthermore, SLDs processed normal to the facet demonstrate output powers as high as 20mW, offering improvements in beam quality, ease of packaging and use of real estate. © (2016) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only

Quantum Portfolios

Quantum computation holds promise for the solution of many intractable problems. However, since many quantum algorithms are stochastic in nature they can only find the solution of hard problems probabilistically. Thus the efficiency of the algorithms has to be characterized both by the expected time to completion {\it and} the associated variance. In order to minimize both the running time and its uncertainty, we show that portfolios of quantum algorithms analogous to those of finance can outperform single algorithms when applied to the NP-complete problems such as 3-SAT.Comment: revision includes additional data and corrects minor typo

Nested quantum search and NP-complete problems

A quantum algorithm is known that solves an unstructured search problem in a number of iterations of order $\sqrt{d}$, where $d$ is the dimension of the search space, whereas any classical algorithm necessarily scales as $O(d)$. It is shown here that an improved quantum search algorithm can be devised that exploits the structure of a tree search problem by nesting this standard search algorithm. The number of iterations required to find the solution of an average instance of a constraint satisfaction problem scales as $\sqrt{d^\alpha}$, with a constant $\alpha<1$ depending on the nesting depth and the problem considered. When applying a single nesting level to a problem with constraints of size 2 such as the graph coloring problem, this constant $\alpha$ is estimated to be around 0.62 for average instances of maximum difficulty. This corresponds to a square-root speedup over a classical nested search algorithm, of which our presented algorithm is the quantum counterpart.Comment: 18 pages RevTeX, 3 Postscript figure

Field testing of World Health Organization (WHO) 2003 recommendations for initiating anti-retroviral therapy (ART) where CD4 is not available revealed low sensitivity among stage I and II patients; a combination of Automated Total Lymphocyte Count (TLC) and Haemoglobin (Hgb) can ration the referral for CD4 testing.

2006 AIDS Conference, Toront

Early-type galaxies in the SDSS. II. Correlations between observables

A magnitude limited sample of nearly 9000 early-type galaxies, in the redshift range 0.01 < z < 0.3, was selected from the Sloan Digital Sky Survey using morphological and spectral criteria. The sample was used to study how early-type galaxy observables, including luminosity L, effective radius R_o, surface brightness I_o, color, and velocity dispersion sigma, are correlated with one another. Measurement biases are understood with mock catalogs which reproduce all of the observed scaling relations and their dependences on fitting technique. At any given redshift, the intrinsic distribution of luminosities, sizes and velocity dispersions in our sample are all approximately Gaussian. A maximum likelihood analysis shows that sigma ~ L^{0.25\pm 0.012}, R_o ~ L^{0.63\pm 0.025}, and R_o ~ I^{-0.75\pm 0.02} in the r* band. In addition, the mass-to-light ratio within the effective radius scales as M_o/L ~ L^{0.14\pm 0.02} or M_o/L ~ M_o^{0.22\pm 0.05}, and galaxies with larger effective masses have smaller effective densities: Delta_o ~ M_o^{-0.52\pm 0.03}. These relations are approximately the same in the g*, i* and z* bands. Relative to the population at the median redshift in the sample, galaxies at lower and higher redshifts have evolved only little, with more evolution in the bluer bands. The luminosity function is consistent with weak passive luminosity evolution and a formation time of about 9 Gyrs ago.Comment: 29 pages, 11 figures. Accepted by AJ (scheduled for April 2003). This paper is part II of a revised version of astro-ph/011034

Adiabatic Quantum Computing for Random Satisfiability Problems

The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only as the cube of the number of variables, the adiabatic method gives solution probabilities close to 1 for problem sizes feasible to evaluate via simulation on current computers. However, for these sizes the minimum energy gaps of most instances are fairly large, so the good performance scaling seen for small problems may not reflect asymptotic behavior where costs are dominated by tiny gaps. Moreover, the resulting search costs are much higher than for other methods. Variants of the quantum algorithm that do not match the adiabatic limit give lower costs, on average, and slower growth than the conventional GSAT heuristic method.Comment: added discussion of discrete adiabatic method, and simulations with 30 bits 8 pages, 8 figure