Die Reaktion von Tellurhexafluorid mit Trimethylamin,Strukturen der TeF5−- und SeF5−-Anionen

Reaction of Telluriumhexafluoride and Trimethylamine, Structures of the TeF₅^? and SeF₅^? Anions The reaction of TeF₆ and (CH₃)₃N is of the redox kind, resulting in reduction of tellurium: X-ray single crystal analysis reveals the compounds (CH₃)₂N? CH₂? N(CH₃)₂⁺TeF₅^? and [(CH₃)₃NH⁺]₅(TeF₅^?)₃(HF₂^?)₂. By comparison with published data it can be shown that this mixture is identical to previously published [(CH₃)₃N]₂TeF₆. The latter was supposed to be one of the few examples of tellurium in a coordination state of eight. (CH₃)₄N⁺TeF₅^? and (CH₃)₄N⁴SeF₅^? are obtained and their structure is investigated by single crystal x-ray methods also. The anions SF₅^?, SeF₅^? and TeF₅^? are discussed in terms of weak interactions.     

Health-based pharmaceutical pay-for-performance risk-sharing agreements

Many new drugs, such as biologics and cancer drugs, are very costly. However, their effectiveness outside of clinical trial settings is often uncertain at the time they gain market approval. This uncertainty may reflect a lack of real-world outcomes data, as opposed to clinical trials data, for a typical patient population. A risk-sharing agreement is a contract between a drug manufacturer and a healthcare payer to help manage uncertainties regarding the cost and effectiveness of those drugs. In this paper, we model a risk-sharing agreement in which a proportion of total sales is rebated. We model disease progression using a continuous time Markov chain with uncertain transition rates. We examine the performance of this risk-sharing agreement from the manufacturer’s perspective and investigate the conditions under which the manufacturer will make a profit. We illustrate with a numerical model parameterized using data from a Phase 2 clinical trial of an oncology drug that was subjected to a risk-sharing agreement in the UK.     

Silica-coated MgAl2O4 nanoparticles supported phosphotungstic acid as an effective catalyst for synthesis of α-aminophosphonates

Research on Chemical Intermediates - In this research, a recoverable catalyst (MgAl2O4@SiO2–PTA) was prepared by a simple utilization method. The prepared catalyst was characterized by XRD,...     

Photodegradation of Congo red in aqueous solution on ZnO as an alternative catalyst to TiO2

In this research, the efficiency of ZnO and TiO₂ was compared by photocatalytic degradation of Congo red azo dye. The effects of some parameters such as pH, dye concentration and irradiation time on the degradation rate of dye solution were also examined. In addition, the aggregation feature of Congo red was studied by using UV-Vis spectroscopy techniques. The recovery of the ZnO catalyst was also investigated.     

On perfectly two-edge connected graphs

This paper studies the graphs for which the 2-edge connected spanning subgraph polytope is completely described by the trivial inequalities and the so-called cut inequalities. These graphs are called perfectly 2-edge connected. The class of perfectly 2-edge connected graphs contains for instance the class of series-parallel graphs. We introduce a new class of perfectly 2-edge connected graphs. We discuss some structural properties of graphs which are (minimally with respect to some reduction operations) nonperfectly 2-edge connected. Using this we give sufficient conditions for a graph to be perfectly 2-edge connected.     

A note on Ki-perfect graphs

Ki-perfect graphs are a special instance of F - G perfect graphs, where F and G are fixed graphs with F a partial subgraph of G. Given S, a collection of G-subgraphs of graph K, an F - G cover of S is a set of T of F-subgraphs of K such that each subgraph in S contains as a subgraph a member of T. An F - G packing of S is a subcollection S′? S such that no two subgraphs in S′ have an F-subgraph in common. K is F - G perfect if for all such S, the minimum cardinality of an F - G cover of S equals the maximum cardinality of an F - G packing of S. Thus K_i-perfect graphs are precisely K_i-1 - K_i perfect graphs. We develop a hypergraph characterization of F - G perfect graphs that leads to an alternate proof of previous results on K_i-perfect graphs as well as to a characterization of F - G perfect graphs for other instances of F and G.