Copper(I)-Phosphinite Complexes in Click Cycloadditions: Three-Component Reactions and Preparation of 5-Iodotriazoles

© 2016 The Authors. Published by Wiley-VCH Verlag GmbH & Co. KGaA.The remarkable activity displayed by copper(I)–phosphinite complexes of general formula [CuBr(L)] in two challenging cycloadditions is reported: a) the one-pot azidonation/cycloaddition of boronic acids, NaN3, and terminal alkynes; b) the cycloaddition of azides and iodoalkynes. These air-stable catalysts led to very good results in both cases and the expected triazoles could be isolated in pure form under ‘Click-suitable’ conditions

Faster Algorithms for Weighted Recursive State Machines

Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis. Yet RSMs are more convenient as they (a) explicitly model function calls and returns, and (b) specify many natural parameters for algorithmic analysis, e.g., the number of entries and exits. We consider a general framework where RSM transitions are labeled from a semiring and path properties are algebraic with semiring operations, which can model, e.g., interprocedural reachability and dataflow analysis problems. Our main contributions are new algorithms for several fundamental problems. As compared to a direct translation of RSMs to PDSs and the best-known existing bounds of PDSs, our analysis algorithm improves the complexity for finite-height semirings (that subsumes reachability and standard dataflow properties). We further consider the problem of extracting distance values from the representation structures computed by our algorithm, and give efficient algorithms that distinguish the complexity of a one-time preprocessing from the complexity of each individual query. Another advantage of our algorithm is that our improvements carry over to the concurrent setting, where we improve the best-known complexity for the context-bounded analysis of concurrent RSMs. Finally, we provide a prototype implementation that gives a significant speed-up on several benchmarks from the SLAM/SDV project

Time-asymmetry of probabilities versus relativistic causal structure: an arrow of time

There is an incompatibility between the symmetries of causal structure in relativity theory and the signaling abilities of probabilistic devices with inputs and outputs: while time-reversal in relativity will not introduce the ability to signal between spacelike separated regions, this is not the case for probabilistic devices with space-like separated input-output pairs. We explicitly describe a non-signaling device which becomes a perfect signaling device under time-reversal, where time-reversal can be conceptualized as playing backwards a videotape of an agent manipulating the device. This leads to an arrow of time that is identifiable when studying the correlations of events for spacelike separated regions. Somewhat surprisingly, although time-reversal of Popuscu-Roerlich boxes also allows agents to signal, it does not yield a perfect signaling device. Finally, we realize time-reversal using post-selection, which could lead experimental implementation.Comment: 4 pages, some figures; replaces arXiv:1010.4572 [quant-ph

Book reviews

Teaching/Communication/Extension/Profession,

The 43-kD polypeptide of heart gap junctions: immunolocalization, topology, and functional domains

Analysis by SDS-PAGE of gap junction fractions isolated from heart suggests that the junctions are comprised of a protein with an Mr 43,000. Antibodies against the electroeluted protein and a peptide representing the 20 amino terminal residues bind specifically on immunoblots to the 43-kD protein and to the major products arising from proteolysis during isolation. By immunocytochemistry, the protein is found in ventricle and atrium in patterns consistent with the known distribution of gap junctions. Both antibodies bind exclusively to gap junctions in fractions from heart examined by EM after gold labeling. Since only domains of the protein exposed at the cytoplasmic surface should be accessible to antibody, we conclude that the 43-kD protein is assembled in gap junctions with the amino terminus of the molecule exposed on the cytoplasmic side of the bilayer, that is, on the same side as the carboxy terminus as determined previously. By combining proteolysis experiments with data from immunoblotting, we can identify a third cytoplasmic region, a loop of some 4 kD between membrane protected domains. This loop carries an antibody binding site. The protein, if transmembrane, is therefore likely to cross the membrane four times. We have used the same antisera to ascertain if the 43-kD protein is involved in cell-cell communication. The antiserum against the amino terminus blocked dye coupling in 90% of cell pairs tested; the antiserum recognizing epitopes in the cytoplasmic loop and cytoplasmic tail blocked coupling in 75% of cell pairs tested. Preimmune serum and control antibodies (one against MIP and another binding to a cardiac G protein) had no or little effect on dye transfer. Our experimental evidence thus indicates that, in spite of the differences in amino acid sequence, the gap junction proteins in heart and liver share a general organizational plan and that there may be several domains (including the amino terminus) of the molecule that are involved in the control of junctional permeability

The Beneficial Impact of Sorting Heavy Cattle at Re-Implant

This research examined a simple sorting strategy to reduce the prevalence of heavyweight carcass discounts. Cattle that were identified and sorted off at re-implant had a reduced prevalence of heavyweight carcasses versus unsorted cattle. Re-implant sorting was profitable at pen average in-weights of 800 pounds or less.cattle, fed cattle marketing, cattle sorting, formula marketing, Farm Management, Livestock Production/Industries, Marketing, Q11, Q16, M31,

Transport in quantum wires

With a brief introduction to one-dimensional channels and conductance quantisation in mesoscopic systems, we discuss some recent experimental puzzles in these systems, which include reduction of quantised conductances and an interesting {\it odd-even} effect in the presence of an in-plane magnetic field. We then discuss a recent non-homogeneous Luttinger liquid model proposed by us, which addresses and gives an explanation for the reduced conductances and the {\it odd-even} effect. We end with a brief summary and discussion of future projects.Comment: Talk presented at the International Discussion Meeting on Mesoscopic and Disordered systems, December, 2000, 16 pages, 2 figure

Tautomeric mutation: A quantum spin modelling

A quantum spin model representing tautomeric mutation is proposed for any DNA molecule. Based on this model, the quantum mechanical calculations for mutational rate and complementarity restoring repair rate in the replication processes are carried out. A possible application to a real biological system is discussed.Comment: 7 pages (no figures

Uncovering Bugs in Distributed Storage Systems during Testing (not in Production!)

Testing distributed systems is challenging due to multiple sources of nondeterminism. Conventional testing techniques, such as unit, integration and stress testing, are ineffective in preventing serious but subtle bugs from reaching production. Formal techniques, such as TLA+, can only verify high-level specifications of systems at the level of logic-based models, and fall short of checking the actual executable code. In this paper, we present a new methodology for testing distributed systems. Our approach applies advanced systematic testing techniques to thoroughly check that the executable code adheres to its high-level specifications, which significantly improves coverage of important system behaviors. Our methodology has been applied to three distributed storage systems in the Microsoft Azure cloud computing platform. In the process, numerous bugs were identified, reproduced, confirmed and fixed. These bugs required a subtle combination of concurrency and failures, making them extremely difficult to find with conventional testing techniques. An important advantage of our approach is that a bug is uncovered in a small setting and witnessed by a full system trace, which dramatically increases the productivity of debugging