Environmental factors influencing the spread of the highly pathogenic avian influenza H5N1 virus in wild birds in Europe

A large number of occurrences of the highly pathogenic avian influenza (HPAI) H5N1 virus in wild birds were reported in Europe. The relationship between the occurrence pattern and environmental factors has, however, not yet been explored. This research uses logistic regression to quantify the relationships between anthropogenic or physical environmental factors and HPAI H5N1 occurrences. Our results indicate that HPAI H5N1 occurrences are highly correlated with the following: the increased normalized difference vegetation index (NDVI) in December; intermediate NDVI in March; lower elevations; increased minimum temperatures in January; and reduced precipitation in January. A predictive risk map of HPAI H5N1 occurrences in wild birds in Europe was generated on the basis of five key environmental factors. Independent validation of the risk map showed the predictive model to be of high accuracy (79%). The analysis suggests that HPAI H5N1 occurrences in wild birds are strongly influenced by the availability of food resources and are facilitated by increased temperatures and reduced precipitation. We therefore deduced that HPAI H5N1 occurrences in wild birds in Europe are probably caused by contact with other wild birds and not by contact with domestic poultry. These findings are important considerations for the global surveillance of HPAI H5N1 occurrences in wild birds

Short-segment posterior instrumentation combined with calcium sulfate cement vertebroplasty for thoracolumbar compression fractures: Radiographic outcomes including nonunion and other complications

AbstractObjectiveTo evaluate the radiographic outcomes of short-segment posterior instrumentation plus vertebroplasty using injectable calcium sulfate cement (CSC) for thoracolumbar compression fractures.Materials and methodsTwenty-eight patients with a single-level thoracolumbar compression fracture, who underwent short-segment pedicle screw fixation and CSC vertebroplasty, were included in the study. The anterior vertebral body height ratio, local kyphosis angle, and the height of the intervertebral disc adjacent to the fractured vertebra were used to evaluate the radiographic results. Complications including bone nonunion, instrument failure, cement leakage, and disc vacuum formation were also assessed.ResultsThe patients were followed up for an average of 24.20±5.40 months. The relative preoperative anterior body height was 55.71±15.29%, which improved to 94.93±5.39% immediately after surgery (P<0.001), and at final follow-up showed a 6.50±3.89% loss of height correction (P<0.001). The mean preoperative local kyphosis angle was 22.23±5.65°, which corrected to 2.67±4.43° immediately after surgery (P<0.001), but reverted to 6.71±4.95° at final follow-up, showing a 4.04±1.91° loss of correction (P<0.001). The mean height of the intervertebral disc proximal to the fractured vertebra was 9.87±0.91mm before surgery, 12.53±0.98mm after operation (P<0.001), and the loss of correction at final follow-up was 2.35±1.15mm with a significant difference compared to immediate postoperative values (P<0.001). Bone nonunion occurred in 7 patients, 2 patients had hardware failure, 9 patients had cement leakage, and 10 patients had disc vacuum phenomenon adjacent to the fractured vertebra.ConclusionsThe patients who underwent this procedure had a loss of correction of vertebral height and local kyphosis. Complications such as bone nonunion, instrument failure, cement leakage, and disc vacuum may occur. Rapid CSC resorption accounts for these radiographic outcomes and complications.Level of evidenceLevel IV, retrospective study

Instability of vortex array and transitions to turbulent states in rotating helium II

We consider superfluid helium inside a container which rotates at constant angular velocity and investigate numerically the stability of the array of quantized vortices in the presence of an imposed axial counterflow. This problem was studied experimentally by Swanson {\it et al.}, who reported evidence of instabilities at increasing axial flow but were not able to explain their nature. We find that Kelvin waves on individual vortices become unstable and grow in amplitude, until the amplitude of the waves becomes large enough that vortex reconnections take place and the vortex array is destabilized. The eventual nonlinear saturation of the instability consists of a turbulent tangle of quantized vortices which is strongly polarized. The computed results compare well with the experiments. Finally we suggest a theoretical explanation for the second instability which was observed at higher values of the axial flow

Neutrino-photon scattering and its crossed processes in a background magnetic field

We study the neutrino-photon processes such as $\gamma\gamma\to \nu\bar{\nu}$ and $\nu\gamma\to \nu\gamma$ in a background magnetic field smaller than the critical magnetic field $B_c\equiv m_e^2/e$. Using Schwinger's proper-time method, we extract leading magnetic-field contributions to the above processes. Our result is valid throughout the kinematic regime where both neutrino and photon energies are significantly smaller than $m_W$. We briefly discuss the astrophysical implications of our result.Comment: Revtex, 10 pages, 4 ps figures, to appear in Phys. Lett.

Fast pattern-matching on indeterminate strings

See attache

An adaptive hybrid pattern-matching algorithm on indeterminate strings

We describe a hybrid pattern-matching algorithm that works on both regular and indeterminate strings. This algorithm is inspired by the recently proposed hybrid algorithm FJS [11] and its indeterminate successor [15]. However, as discussed in this paper, because of the special properties of indeterminate strings, it is not straightforward to directly migrate FJS to an indeterminate version. Our new algorithm combines two fast pattern-matching algorithms, Shift-And and BMS (the Sunday variant of the Boyer-Moore algorithm), and is highly adaptive to the nature of the text being processed. It avoids using the border array, therefore avoids some of the cases that are awkward for indeterminate strings. Although not always the fastest in individual test cases, our new algorithm is superior in overall performance to its two component algorithms — perhaps a general advantage of hybrid algorithms

A new approach to the periodicity lemma on strings with holes

We first give an elementary proof of the periodicity lemma for strings containing one hole (variously called a "wild card", a "don't-care" or an "indeterminate letter" in the literature). The proof is modelled on Euclid's algorithm for the greatest common divisor and is simpler than the original proof given in [J. Berstel, L. Boasson, Partial words and a theorem of Fine and Wilf, Theoret. Comput. Sci. 218 (1999) 135-141]. We then study the two-hole case, where our result agrees with the one given in [F. Blanchet-Sadri, Robert A. Hegstrom, Partial words and a theorem of Fine and Wilf revisited, Theoret. Comput. Sci. 270 (1-2) (2002) 401-419] but is more easily proved and enables us to identify a maximum-length prefix or suffix of the string to which the periodicity lemma does apply. Finally, we extend our result to three or more holes using elementary methods, and state a version of the periodicity lemma that applies to all strings with or without holes. We describe an algorithm that, given the locations of the holes in a string, computes maximum-length substrings to which the periodicity lemma applies, in time proportional to the number of holes. Our approach is quite different from that used by Blanchet-Sadri and Hegstrom, and also simpler

Measurement of low‐density lipoprotein cholesterol levels in primary and secondary prevention patients: Insights from the PALM registry

Background The 2013 American College of Cardiology/American Heart Association Guideline on the Treatment of Blood Cholesterol to Reduce Atherosclerotic Cardiovascular Risk in Adults recommended testing low-density lipoprotein cholesterol ( LDL -C) to identify untreated patients with LDL -C ≥190 mg/dL, assess lipid-lowering therapy adherence, and consider nonstatin therapy. We sought to determine whether clinician lipid testing practices were consistent with these guidelines. Methods and Results The PALM (Patient and Provider Assessment of Lipid Management) registry enrolled primary and secondary prevention patients from 140 US cardiology, endocrinology, and primary care offices in 2015 and captured demographic data, lipid treatment history, and the highest LDL -C level in the past 2 years. Core laboratory lipid levels were drawn at enrollment. Among 7627 patients, 2787 (36.5%) had no LDL -C levels measured in the 2 years before enrollment. Patients without chart-documented LDL -C levels were more often women, nonwhite, uninsured, and non-college graduates (all P\u3c0.01). Patients without prior lipid testing were less likely to receive statin treatment (72.6% versus 76.0%; P=0.0034), a high-intensity statin (21.5% versus 24.3%; P=0.016), nonstatin lipid-lowering therapy (24.8% versus 27.3%; P=0.037), and had higher core laboratory LDL -C levels at enrollment (median 97 versus 92 mg/dL; P\u3c0.0001) than patients with prior LDL -C testing. Of 166 individuals with core laboratory LDL -C levels ≥190 mg/dL, 36.1% had no LDL -C measurement in the prior 2 years, and 57.2% were not on a statin at the time of enrollment. Conclusions In routine clinical practice, LDL -C testing is associated with higher-intensity lipid-lowering treatment and lower achieved LDL -C level

Indeterminate strings, prefix arrays & undirected graphs

An integer array y=y[1..n] is said to be feasible if and only if y[1]=n and, for every i∈2..n, i≤i+y[i]≤n+1. A string is said to be indeterminate if and only if at least one of its elements is a subset of cardinality greater than one of a given alphabet Σ; otherwise it is said to be regular. A feasible array y is said to be regular if and only if it is the prefix array of some regular string. We show using a graph model that every feasible array of integers is a prefix array of some (indeterminate or regular) string, and for regular strings corresponding to y, we use the model to provide a lower bound on the alphabet size. We show further that there is a 1–1 correspondence between labelled simple graphs and indeterminate strings, and we show how to determine the minimum alphabet size σ of an indeterminate string x based on its associated graph Gx. Thus, in this sense, indeterminate strings are a more natural object of combinatorial interest than the strings on elements of Σ that have traditionally been studied

On optimal summable graphs

For a graph G , let σ ( G ) and δ ( G ) denote, respectively, its sum number and minimum degree. Trivially, σ ( G ) ≥ δ ( G ) . A nontrivial connected graph G is called a k -optimum summable graph , where k ≥ 1 , if σ ( G ) = δ ( G ) = k . In this paper, we show that if G is a k -optimum summable graph of order n , k ≥ 3 , then (1) n ≥ 2 k ; (2) the complete bipartite graph K k,n − k is not a spanning subgraph of G . We also describe new families of k -optimum summable graphs for k ≥ 1