154,347 research outputs found
q-Differential equations for q-classical polynomials and q-Jacobi-Stirling numbers
Full text linkWe introduce, characterise and provide a combinatorial interpretation for the so-called q-Jacobi–Stirling numbers.
This study is motivated by their key role in the (reciprocal) expansion of any power of a second order
q-differential operator having the q-classical polynomials as eigenfunctions in terms of other even order operators,
which we explicitly construct in this work. The results here obtained can be viewed as the q-version of
those given by Everitt et al. and by the first author, whilst the combinatorics of this new set of numbers is a
q-version of the Jacobi–Stirling numbers given by Gelineau and the second author
Evidence for erbium-erbium energy migration in erbium(III) bis(perfluoro-p-tolyl)phosphinate
No full textCopyright 2008 American Institute of Physics. This article may be downloaded for personal use only. Any other use requires prior permission of the author and the American Institute of Physics. This article appeared in Applied Physics Letters 92, 103303 (2008) and may be found at
Postać n-tej iteracji operatora q = f d/dx
No full textArtykuł nie zawiera streszczeniaMotivated by applications in linear dynamical systems, the author studies q^n(f), where q is the operator f●(d/dx) and qn is its n-th iteration. q^n(f) is a polynomial F(f(0),f(1),...,f(n)) in the derivatives f(0)=f,...,f(n) of f with integer coefficients. Special attention is paid to determining the coefficients of F. The author presents algorithms for computing the coefficients and also shows that the sum of all coefficients of F equals n!. The paper ends with some remarks on the number of coefficients of F, which is related to the number-theoretic unrestricted partition function
Remarks on Some Compact Symplectic Solvmanifolds
No full textWe study the hard Lefschetz property on compact symplectic solvmanifolds, i.e., compact quotients M = ΓG of a simply-connected solvable Lie group G by a lattice Γ, admitting a symplectic structure
Additions to the moss flora of Endau Rompin National Park, Johore State, peninsular Malaysia
No full textIn a recent survey of the Endau Rompin National Park (ERNP) in Johore State, 81 species and 4 varieties of mosses were documented. This increases the previous count from 62 species and 3 varieties of mosses in ERNP to 111 species and 5 varieties in total. Of these, 30 species are new records for Johore State. Rhaphidostichum bunodicarpum and Trichosteleum stigmosum are two species new to Peninsular Malaysia. Thuidium assimile is a new record for West Malesia. A new combination, Papillidiopsis aquaticum (Dix.) Boon-Chuan Ho & B.C. Tan is proposed. In terms of species composition, the pan-tropical families of Calymperaceae, Fissidentaceae, Leucobryaceae and Sematophyllaceae predominate the moss flora of ERNP
Part of the global seawater delta oxygen-18 database from reference Tan 1996
No full textPart of the global seawater delta oxygen-18 database from reference Tan 199
Recommended from our members
Network Q
No full textA press release from Network Q announcing that they will begin featuring Brian McNaught, a gay columnist and author, for a monthly segment
Network Q
No full textA press release from Network Q announcing that they will begin featuring Brian McNaught, a gay columnist and author, for a monthly segment
Sous-facteurs de L(F∞) d'indice 4cos2π/n,n≥3
No full textLet Q be a factor of type II1, λ a number in the Jones discrete series {4cosπ/m:m≥3}, and {ei} the Jones projections associated with λ. Denote by A2n and A1n the finite-dimensional von Neumann algebras generated, respectively, by {1,e2,⋯,en} and {1,e1,⋯,en}, with the corresponding traces. The author shows that, for n sufficiently large, the index of the inclusion An=(Q⊗A2n)∗A2nA1n⊂(Q⊗A2n+1)∗A2n+1A1n+1=An+1 is equal to λ (here ∗ denotes the reduced, amalgamated free product of the algebras in question). Using the random matrix model of Voiculescu, he proves that if Q is the von Neumann algebra L(F∞) of the free group with infinitely many generators, then An is isomorphic to L(F∞).
The two facts together imply the existence, for any λ in the Jones discrete series, of an irreducible subfactor of L(F∞) of index λ. This constitutes the first example of a nonhyperfinite, non-Γ II1 factor such that its Jones invariant is fully computable (the existence of nonirreducible subfactors of L(F∞) for any index ≥4 is a simple consequence of known results)
Cardiac rhythm analysis during ongoing cardiopulmonary resuscitation using the Analysis During Compressions with Fast reconfirmation technology
Full text linkBACKGROUND Pauses in chest compressions (CCs) have a negative association with survival from cardiac arrest. Electrocardiographic (ECG) rhythm analysis and defibrillator charging are significant contributors to CC pauses.
OBJECTIVE Accuracy of the Analysis During Compressions with Fast Reconfirmation (ADC-FR) algorithm, which features automated rhythm analysis and charging during CCs to reduce CC pauses, was retrospectively determined in a large database of ECGs from 2701 patients with out-of-hospital cardiac arrest.
METHODS The ADC-FR algorithm generated a total of 7264 advisories, of which 3575 were randomly assigned to a development data set and 3689 to a test data set. With ADC-FR, a high-pass digital filter is used to remove CC artifacts, while the underlying ECG rhythm is automatically interpreted. When CCs are paused at the end of the 2-minute cardiopulmonary resuscitation interval, a 3-second reconfirmation analysis is performed using the artifact-free ECG to confirm the shock/no-shock advisory. The sensitivity and specificity of the ADC-FR algorithm in correctly identifying shockable/nonshockable rhythms during CCs were calculated.
RESULTS In both data sets, the accuracy of the ADC-FR algorithm for each ECG rhythm exceeded the recommended performance goals, which apply to a standard artifact-free ECG analysis. Sensitivity and specificity were 97% and 99%, respectively, for the development data set and 95% and 99% for the test data set.
CONCLUSION The ADC-FR algorithm is highly accurate in discriminating shockable and nonshockable rhythms and can be used to reduce CC pauses
- …
