859 research outputs found
Effects of Carbohydrates on Landing Mechanics and Postural Stability During Intermittent High-Intensity Exercise to Fatigue
Please refer to the pdf version of the abstract located adjacent to the title
Physical Performance Differences in Sea, Air and Land (SEAL) Operator Cohorts Separated by Demographics
Please refer to the pdf version of the abstract located adjacent to the title
Young children's cognitive achievement: home learning environment, language and ethnic background
For decades, research has shown differences in cognitive assessment scores between White and minority ethnic group(s) learners as well as differences across different minority ethnic groups. More recent data have indicated that the home learning environment and languages spoken can impact cognitive assessment and other corollary outcomes. This study uses the Millennium Cohort Study to jointly assess how minority ethnic group, home learning environment and home languages predict child cognitive assessment scores. Regression analyses were conducted using two assessment measures. The following is hypothesised: (1) cognitive achievement scores vary by minority ethnic group, (2) more home learning environment in early childhood leads to higher cognitive development scores and (3) English only in the home yields the highest cognitive scores while no English in the home yields the lowest. Findings reveal that there are differences in cognitive scores along ethnic group categories although there are also some unexpected findings. Home learning environment does not play as large a role as was predicted in raising the assessment scores overall for learners while speaking English in the home does, irrespective of ethnic background
The Optimal Single Copy Measurement for the Hidden Subgroup Problem
The optimization of measurements for the state distinction problem has
recently been applied to the theory of quantum algorithms with considerable
successes, including efficient new quantum algorithms for the non-abelian
hidden subgroup problem. Previous work has identified the optimal single copy
measurement for the hidden subgroup problem over abelian groups as well as for
the non-abelian problem in the setting where the subgroups are restricted to be
all conjugate to each other. Here we describe the optimal single copy
measurement for the hidden subgroup problem when all of the subgroups of the
group are given with equal a priori probability. The optimal measurement is
seen to be a hybrid of the two previously discovered single copy optimal
measurements for the hidden subgroup problem.Comment: 8 pages. Error in main proof fixe
Scalability of quantum computation with addressable optical lattices
We make a detailed analysis of error mechanisms, gate fidelity, and
scalability of proposals for quantum computation with neutral atoms in
addressable (large lattice constant) optical lattices. We have identified
possible limits to the size of quantum computations, arising in 3D optical
lattices from current limitations on the ability to perform single qubit gates
in parallel and in 2D lattices from constraints on laser power. Our results
suggest that 3D arrays as large as 100 x 100 x 100 sites (i.e.,
qubits) may be achievable, provided two-qubit gates can be performed with
sufficiently high precision and degree of parallelizability. Parallelizability
of long range interaction-based two-qubit gates is qualitatively compared to
that of collisional gates. Different methods of performing single qubit gates
are compared, and a lower bound of is determined on the
error rate for the error mechanisms affecting Cs in a blue-detuned
lattice with Raman transition-based single qubit gates, given reasonable limits
on experimental parameters.Comment: 17 pages, 5 figures. Accepted for publication in Physical Review
A Lower Bound for Quantum Phase Estimation
We obtain a query lower bound for quantum algorithms solving the phase
estimation problem. Our analysis generalizes existing lower bound approaches to
the case where the oracle Q is given by controlled powers Q^p of Q, as it is
for example in Shor's order finding algorithm. In this setting we will prove a
log (1/epsilon) lower bound for the number of applications of Q^p1, Q^p2, ...
This bound is tight due to a matching upper bound. We obtain the lower bound
using a new technique based on frequency analysis.Comment: 7 pages, 1 figur
The inverse spectral problem for the discrete cubic string
Given a measure on the real line or a finite interval, the "cubic string"
is the third order ODE where is a spectral parameter. If
equipped with Dirichlet-like boundary conditions this is a nonselfadjoint
boundary value problem which has recently been shown to have a connection to
the Degasperis-Procesi nonlinear water wave equation. In this paper we study
the spectral and inverse spectral problem for the case of Neumann-like boundary
conditions which appear in a high-frequency limit of the Degasperis--Procesi
equation. We solve the spectral and inverse spectral problem for the case of
being a finite positive discrete measure. In particular, explicit
determinantal formulas for the measure are given. These formulas generalize
Stieltjes' formulas used by Krein in his study of the corresponding second
order ODE .Comment: 24 pages. LaTeX + iopart, xypic, amsthm. To appear in Inverse
Problems (http://www.iop.org/EJ/journal/IP
Neumark Operators and Sharp Reconstructions, the finite dimensional case
A commutative POV measure with real spectrum is characterized by the
existence of a PV measure (the sharp reconstruction of ) with real
spectrum such that can be interpreted as a randomization of . This paper
focuses on the relationships between this characterization of commutative POV
measures and Neumark's extension theorem. In particular, we show that in the
finite dimensional case there exists a relation between the Neumark operator
corresponding to the extension of and the sharp reconstruction of . The
relevance of this result to the theory of non-ideal quantum measurement and to
the definition of unsharpness is analyzed.Comment: 37 page
Q-systems, Heaps, Paths and Cluster Positivity
We consider the cluster algebra associated to the -system for as a
tool for relating -system solutions to all possible sets of initial data. We
show that the conserved quantities of the -system are partition functions
for hard particles on particular target graphs with weights, which are
determined by the choice of initial data. This allows us to interpret the
simplest solutions of the Q-system as generating functions for Viennot's heaps
on these target graphs, and equivalently as generating functions of weighted
paths on suitable dual target graphs. The generating functions take the form of
finite continued fractions. In this setting, the cluster mutations correspond
to local rearrangements of the fractions which leave their final value
unchanged. Finally, the general solutions of the -system are interpreted as
partition functions for strongly non-intersecting families of lattice paths on
target lattices. This expresses all cluster variables as manifestly positive
Laurent polynomials of any initial data, thus proving the cluster positivity
conjecture for the -system. We also give an alternative formulation in
terms of domino tilings of deformed Aztec diamonds with defects.Comment: 106 pages, 38 figure
Effects of Gravitational Microlensing on P-Cygni Profiles of Type Ia Supernovae
A brief description of the deformed spectra of microlensed SNe Ia is
presented. We show that microlensing amplification can have significant effects
on line profiles. The resonance-scattering code SYNOW is used to compute the
intensity profile in the rest frame of the supernova. The observed
(microlensed) spectral lines are predicted assuming a simple stellar-size
deflector, and are compared to unlensed cases to show the effects microlensing
by solar-size deflectors can have on spectral lines. We limit our work to
spherically symmetric deflectors.Comment: 18 pages, 9 figures, references added, submitted to Ap
- …