Deoxyfluorination of Phenols

An operationally simple ipso fluorination of phenols with a new deoxyfluorination reagent is presented.Chemistry and Chemical Biolog

Mechanism of C−F Reductive Elimination from Palladium(IV) Fluorides

The first systematic mechanism study of C−F reductive elimination from a transition metal complex is described. C−F bond formation from three different Pd(IV) fluoride complexes was mechanistically evaluated. The experimental data suggest that reductive elimination occurs from cationic Pd(IV) fluoride complexes via a dissociative mechanism. The ancillary pyridyl-sulfonamide ligand plays a crucial role for C−F reductive elimination, likely due to a κ^3 coordination mode, in which an oxygen atom of the sulfonyl group coordinates to Pd. The pyridyl-sulfonamide can support Pd(IV) and has the appropriate geometry and electronic structure to induce reductive elimination

Palladium(III)-Catalyzed Fluorination of Arylboronic Acid Derivatives

A practical, palladium-catalyzed synthesis of aryl fluorides from arylboronic acid derivatives is presented. The reaction is operationally simple and amenable to multigram-scale synthesis. Evaluation of the reaction mechanism suggests a single-electron-transfer pathway, involving a Pd(III) intermediate that has been isolated and characterized.Chemistry and Chemical Biolog

Reducing Transport Latency for Short Flows with Multipath TCP

Multipath TCP (MPTCP) has been an emerging transport protocol that provides network resilience to failures and improves throughput by splitting a data stream into multiple subflows across all the available multiple paths. While MPTCP is generally beneficial for throughput-sensitive large flows with large number of subflows, it may be harmful for latency-sensitive small flows. MPTCP assigns each subflow a congestion window, making short flows susceptible to timeout when a flow only contains a few packets. This condition becomes even worse when the paths have heterogeneous characteristics as packet reordering occurs and the slow paths can be used with MPTCP, causing the increased end-to-end delay and the lower application Goodput. Thus, it is important to choose the appropriate subflows for each MPTCP connection to achieve the good performance. However, the subflows in MPTCP are determined before a connection is established, and they usually remain unchanged during the lifetime of that connection. To address this issue, we propose DMPTCP, which dynamically adjusts the subflows according to application workloads. Specifically, DMPTCP first utilizes the idea of TCP modeling to estimate the latency on the path under scheduling and the data amount sent on the other paths simultaneously, and then decides the set of subflows to be used for certain application periodically with the goal of reducing completion time for short flows and achieving a higher throughput for long flows. We implement DMPTCP in a Linux server and conduct extensive experiments both in NS3 and in Linux testbed to validate its effectiveness. Our evaluation shows that DMPTCP decreases the completion time by over 46.55% compared to conventional MPTCP for short flows while increases the Goodput up to 21.3% for long-lived flows

A MPTCP Scheduler for Web Transfer

Multipath TCP (MPTCP) is the most significant extension of TCP that enables transmission via multiple paths concurrently to improve the resource usage and throughput of long flows. However, due to the concurrent multiple transfer (CMT) in short flow trans-mission, the congestion window (cwnd) of each MPTCP subflow is too small and it may lead to timeout when a single lost packet cannot be recovered through fast retransmission. As a result, MPTCP has even worse performance for short flows compared to regular TCP. In this paper, we take the first step to analyze the main reason why MPTCP has the diminished performance for short flows, and then we propose MPTCP-SF, which dynamically adjusts the number of subflows for each flow . In particular, MPTCP-SF firstly analyzes the distribution characteristics of the web objects to extract two thresholds to be used for classifying each flow. After eceiving each new ACK, MPTCP-SF periodically counts the data being sent based on per-flow and uses the threshold to classify the we blows. Finally, MPTCP-SF dynamically switches path scheduling model for different classification flows. We conduct extensive experiments in NS3 to evaluate its e fficiency. Our evaluation proves that MPTCP-SF decreases the completion time of short flows by over 42.64% com-pared to MPTCP, and the throughput achieved by MPTCP-SF in transmitting long flows is about 11.11% higher than that of MPTCP in a WLAN/LTE wireless network. The results successfully validate the improved performance of MPTCP-SF

Reducing Transport Latency for Short Flows with Multipath TCP

Multipath TCP (MPTCP) has been an emerging transport protocol that provides network resilience to failures and improves throughput by splitting a data stream into multiple subflows across all the available multiple paths. While MPTCP is generally beneficial for throughput-sensitive large flows with large number of subflows, it may be harmful for latency-sensitive small flows. MPTCP assigns each subflow a congestion window, making short flows susceptible to timeout when a flow only contains a few packets. This condition becomes even worse when the paths have heterogeneous characteristics as packet reordering occurs and the slow paths can be used with MPTCP, causing the increased end-to-end delay and the lower application Goodput. Thus, it is important to choose the appropriate subflows for each MPTCP connection to achieve the good performance. However, the subflows in MPTCP are determined before a connection is established, and they usually remain unchanged during the lifetime of that connection. To address this issue, we propose DMPTCP, which dynamically adjusts the subflows according to application workloads. Specifically, DMPTCP first utilizes the idea of TCP modeling to estimate the latency on the path under scheduling and the data amount sent on the other paths simultaneously, and then decides the set of subflows to be used for certain application periodically with the goal of reducing completion time for short flows and achieving a higher throughput for long flows. We implement DMPTCP in a Linux server and conduct extensive experiments both in NS3 and in Linux testbed to validate its effectiveness. Our evaluation shows that DMPTCP decreases the completion time by over 46.55% compared to conventional MPTCP for short flows while increases the Goodput up to 21.3% for long-lived flows

Terahertz master-oscillator power-amplifier quantum cascade laser with a grating coupler of extremely low reflectivity

A terahertz master-oscillation power-amplifier quantum cascade laser (THz-MOPA-QCL) is demonstrated where a grating coupler is employed to efficiently extract the THz radiation. By maximizing the group velocity and eliminating the scattering of THz wave in the grating coupler, the residue reflectivity is reduced down to the order of 10−3. A buried DFB grating and a tapered preamplifier are proposed to improve the seed power and to reduce the gain saturation, respectively. The THz-MOPA-QCL exhibits single-mode emission, a single-lobed beam with a narrow divergence angle of 18° × 16°, and a pulsed output power of 136 mW at 20 K, which is 36 times that of a second-order DFB laser from the same material

Genotype-Corrector: improved genotype calls for genetic mapping in F2 and RIL populations

F2 and recombinant inbred lines (RILs) populations are very commonly used in plant genetic mapping studies. Although genome-wide genetic markers like single nucleotide polymorphisms (SNPs) can be readily identified by a wide array of methods, accurate genotype calling remains challenging, especially for heterozygous loci and missing data due to low sequencing coverage per individual. Therefore, we developed Genotype-Corrector, a program that corrects genotype calls and imputes missing data to improve the accuracy of genetic mapping. Genotype-Corrector can be applied in a wide variety of genetic mapping studies that are based on low coverage whole genome sequencing (WGS) or Genotyping-by-Sequencing (GBS) related techniques. Our results show that Genotype-Corrector achieves high accuracy when applied to both synthetic and real genotype data. Compared with using raw or only imputed genotype calls, the linkage groups built by corrected genotype data show much less noise and significant distortions can be corrected. Additionally, Genotype-Corrector compares favorably to the popular imputation software LinkImpute and Beagle in both F2 and RIL populations