Multiple synaptic and membrane sites of anesthetic action in the CA1 region of rat hippocampal slices

Background  

Anesthesia is produced by a depression of central nervous system function, however, the sites and mechanisms of action underlying this depression remain poorly defined. The present study compared and contrasted effects produced by five general anesthetics on synaptic circuitry in the CA1 region of hippocampal slices.     

Modular diphosphine ligands based on bisphenol A backbones

A straightforward two-step synthesis is used to obtain new phosphorus-containing ligands based on readily available bisphenol A type backbones. Five diphosphine ligands have been prepared in good yields. An X-ray crystallographic study is presented for ligand 5. Preliminary results on rhodium-catalyzed hydroformylation exemplify the use of these ligands for homogeneous catalysis.     

4‐Benzoyl‐3,4‐dihydro‐2H‐1,4‐benzoxazine‐2‐carbonitrile: refinement using a multipolar atom model

The structural model for the title compound, C₁₆H₁₂N₂O₂, was refined using a multipolar atom model transferred from an experimental electron‐density database. The refinement showed some improvements of crystallographic statistical indices when compared with a conventional spherical neutral‐atom refinement. The title compound adopts a half‐chair conformation. The amide N atom lies almost in the plane defined by the three neighbouring C atoms. In the crystal structure, molecules are linked by weak intermolecular C—H...O and C—H...π hydrogen bonds.     

Computing finest mincut partitions of a graph and application to routing problems

Let G=(V,E,w) be an n-vertex graph with edge weights w>0. We propose an algorithm computing all partitions of V into mincuts of G such that the mincuts in the partitions cannot be partitioned further into mincuts. There are O(n) such finest mincut partitions. A mincut is a non-empty proper subset of V such that the total weight of edges with exactly one end in the subset is minimal. The proposed algorithm exploits the cactus representation of mincuts and has the same time complexity as cactus construction. An application to the exact solution of the general routing problem is described.     

Literatur

Ohne Zusammenfassung