30,305 research outputs found
Simple Coherent Polarization Manipulation Scheme for Generating High Power Radially Polarized Beam
We present a simple novel scheme that converts a Gaussian beam into an
approximated radially polarized beam using coherent polarization manipulation
together with Poynting walk-off in birefringent crystals. Our scheme alleviates
the interferometric stability required by previous schemes that implemented
this coherent mode summation using Mach-Zehnder-like interferometers. A
symmetrical arrangement of two walk-off crystals with a half-wave plate, allows
coherence control even when the laser has short temporal coherence length. We
generated 14 watts of radially polarized beam from an Ytterbium fiber laser,
only limited by the available fiber laser power.Comment: Submitting for publicatio
Rotating Leaks in the Stadium Billiard
The open stadium billiard has a survival probability, , that depends on
the rate of escape of particles through the leak. It is known that the decay of
is exponential early in time while for long times the decay follows a
power law. In this work we investigate an open stadium billiard in which the
leak is free to rotate around the boundary of the stadium at a constant
velocity, . It is found that is very sensitive to . For
certain values is purely exponential while for other values the
power law behaviour at long times persists. We identify three ranges of
values corresponding to three different responses of . It is
shown that these variations in are due to the interaction of the moving
leak with Marginally Unstable Periodic Orbits (MUPOs)
FIR Filter Implementation by Efficient Sharing of Horizontal and Vertical Common Sub-expressions
No abstract availabl
Depression and anxiety in prostate cancer: a systematic review and meta-analysis of prevalence rates
ObjectivesTo systematically review the literature pertaining to the prevalence of depression and anxiety in patients with prostate cancer as a function of treatment stage.DesignSystematic review and meta-analysis.Participants4494 patients with prostate cancer from primary research investigations.Primary outcome measureThe prevalence of clinical depression and anxiety in patients with prostate cancer as a function of treatment stage.ResultsWe identified 27 full journal articles that met the inclusion criteria for entry into the meta-analysis resulting in a pooled sample size of 4494 patients. The meta-analysis of prevalence rates identified pretreatment, on-treatment and post-treatment depression prevalences of 17.27% (95% CI 15.06% to 19.72%), 14.70% (95% CI 11.92% to 17.99%) and 18.44% (95% CI 15.18% to 22.22%), respectively. Pretreatment, on-treatment and post-treatment anxiety prevalences were 27.04% (95% CI 24.26% to 30.01%), 15.09% (95% CI 12.15% to 18.60%) and 18.49% (95% CI 13.81% to 24.31%), respectively.ConclusionsOur findings suggest that the prevalence of depression and anxiety in men with prostate cancer, across the treatment spectrum, is relatively high. In light of the growing emphasis placed on cancer survivorship, we consider that further research within this area is warranted to ensure that psychological distress in patients with prostate cancer is not underdiagnosed and undertreated
Eta-nucleon coupling constant in QCD with SU(3) symmetry breaking
We study the NN coupling constant using the method of QCD sum rules
starting from the vacuum-to-eta correlation function of the interpolating
fields of two nucleons. The matrix element of this correlation has been taken
with respect to nucleon spinors to avoid unwanted pole contribution. The
SU(3)-flavor symmetry breaking effects have been accounted for via the
-mass, s-quark mass and eta decay constant to leading order. Out of the
four sum rules obtained by taking the ratios of the two sum rules in
conjunction with the two sum rules in nucleon mass, three are found to give
mutually consistent results. We find the SU(3) breaking effects significant, as
large as 50% of the SU(3) symmetric part.Comment: 13 pages, 12 figure
Augmented L1 and Nuclear-Norm Models with a Globally Linearly Convergent Algorithm
This paper studies the long-existing idea of adding a nice smooth function to
"smooth" a non-differentiable objective function in the context of sparse
optimization, in particular, the minimization of
, where is a vector, as well as the
minimization of , where is a matrix and
and are the nuclear and Frobenius norms of ,
respectively. We show that they can efficiently recover sparse vectors and
low-rank matrices. In particular, they enjoy exact and stable recovery
guarantees similar to those known for minimizing and under
the conditions on the sensing operator such as its null-space property,
restricted isometry property, spherical section property, or RIPless property.
To recover a (nearly) sparse vector , minimizing
returns (nearly) the same solution as minimizing
almost whenever . The same relation also
holds between minimizing and minimizing
for recovering a (nearly) low-rank matrix , if . Furthermore, we show that the linearized Bregman algorithm for
minimizing subject to enjoys global
linear convergence as long as a nonzero solution exists, and we give an
explicit rate of convergence. The convergence property does not require a
solution solution or any properties on . To our knowledge, this is the best
known global convergence result for first-order sparse optimization algorithms.Comment: arXiv admin note: text overlap with arXiv:1207.5326 by other author
- …