Amplitude to phase conversion of InGaAs pin photo-diodes for femtosecond lasers microwave signal generation

When a photo-diode is illuminated by a pulse train from a femtosecond laser, it generates microwaves components at the harmonics of the repetition rate within its bandwidth. The phase of these components (relative to the optical pulse train) is known to be dependent on the optical energy per pulse. We present an experimental study of this dependence in InGaAs pin photo-diodes illuminated with ultra-short pulses generated by an Erbium-doped fiber based femtosecond laser. The energy to phase dependence is measured over a large range of impinging pulse energies near and above saturation for two typical detectors, commonly used in optical frequency metrology with femtosecond laser based optical frequency combs. When scanning the optical pulse energy, the coefficient which relates phase variations to energy variations is found to alternate between positive and negative values, with many (for high harmonics of the repetition rate) vanishing points. By operating the system near one of these vanishing points, the typical amplitude noise level of commercial-core fiber-based femtosecond lasers is sufficiently low to generate state-of-the-art ultra-low phase noise microwave signals, virtually immune to amplitude to phase conversion related noise.Comment: 7 pages, 6 figures, submitted to Applied Physics

Risk profiles and one-year outcomes of patients with newly diagnosed atrial fibrillation in India: Insights from the GARFIELD-AF Registry.

BACKGROUND: The Global Anticoagulant Registry in the FIELD-Atrial Fibrillation (GARFIELD-AF) is an ongoing prospective noninterventional registry, which is providing important information on the baseline characteristics, treatment patterns, and 1-year outcomes in patients with newly diagnosed non-valvular atrial fibrillation (NVAF). This report describes data from Indian patients recruited in this registry. METHODS AND RESULTS: A total of 52,014 patients with newly diagnosed AF were enrolled globally; of these, 1388 patients were recruited from 26 sites within India (2012-2016). In India, the mean age was 65.8 years at diagnosis of NVAF. Hypertension was the most prevalent risk factor for AF, present in 68.5% of patients from India and in 76.3% of patients globally (P < 0.001). Diabetes and coronary artery disease (CAD) were prevalent in 36.2% and 28.1% of patients as compared with global prevalence of 22.2% and 21.6%, respectively (P < 0.001 for both). Antiplatelet therapy was the most common antithrombotic treatment in India. With increasing stroke risk, however, patients were more likely to receive oral anticoagulant therapy [mainly vitamin K antagonist (VKA)], but average international normalized ratio (INR) was lower among Indian patients [median INR value 1.6 (interquartile range {IQR}: 1.3-2.3) versus 2.3 (IQR 1.8-2.8) (P < 0.001)]. Compared with other countries, patients from India had markedly higher rates of all-cause mortality [7.68 per 100 person-years (95% confidence interval 6.32-9.35) vs 4.34 (4.16-4.53), P < 0.0001], while rates of stroke/systemic embolism and major bleeding were lower after 1 year of follow-up. CONCLUSION: Compared to previously published registries from India, the GARFIELD-AF registry describes clinical profiles and outcomes in Indian patients with AF of a different etiology. The registry data show that compared to the rest of the world, Indian AF patients are younger in age and have more diabetes and CAD. Patients with a higher stroke risk are more likely to receive anticoagulation therapy with VKA but are underdosed compared with the global average in the GARFIELD-AF. CLINICAL TRIAL REGISTRATION-URL: http://www.clinicaltrials.gov. Unique identifier: NCT01090362

RPO constraint solving is in NP

A new decision procedure for the existential fragment of ordering constraints expressed using the recursive path ordering is presented. This procedure is nondeterministic and checks whether a set of constraints is solvable over the given signature, i.e., the signature over which the terms in the constraints are defined. It is shown that this nondeterministic procedure runs in polynomial time, thus establishing the membership of this problem in the complexity class NP for the first time