用共振光散射技术研究蛋白质与丽春红2R的相互作用

在pH3．50的Britton-Robinson缓冲溶液中，丽春红2R与蛋白质发生结合反应，使最大波长为352．5nm的共振散射光谱得到加强。据此建立了利用丽春红2R作探针，用共振散射光谱技术测定蛋白质的新方法。散射光强度与牛血清白蛋白(BSA)、人血清白蛋白(HAS)和免疫球蛋白(IgG)的浓度在0．25～17．5μg／mL范围内成正比。方法的稳定性好，快速、简便，绝大多数氨基酸、金属离子均不产生干扰，用于人血清样品中蛋白质的测定，获得了满意的结果，加标回收率为93．4％～100．1％。     

由(1S)-cis-菊酸合成(1R)-cis-二溴菊酸

拟除虫菊脂是在研究天然除虫菊脂化学的基础上发展起来的一类高效低毒,广谱杀虫剂。其中,溴氰菊脂是活性较高,光稳定性较好的一种菊脂类杀虫剂, 它是具有(IRcis.αs) 构型的单一光学异构体。 生产溴氰菊脂的关键中间体是IR-cis-)二溴菊脂。本文报道利用化学剪切法将(is)-cis-菊脂转化为(IR-cis-)二溴菊脂的新方法。     

离子液体两相不对称氢甲酰化催化反应的研究

从(R)-BINAP出发制备水溶性磺酸钠盐配体(R)-BINAPS,采用离子液体BF4和PF6为介质,实现其Rh配合物对乙酸乙烯酯的两相不对称氢甲酰化反应.实验结果表明,在以BF4为介质的乙酸乙烯酯不对称氢甲酰化反应中,该催化剂在温和条件下显示出高于相应均相体系的产物ee值和异构醛选择性,并在6次循环使用中,反应产物的ee值、选择性和转化率均无明显改变;在离子液体体系中添加适当的甲苯时,油溶性配体(R)-BINAP与Rh组成的配合物催化剂亦可形成类似的两相反应体系,但其活性和选择性在重复使用中呈明显下降趋势.本文还考察了溶剂体系、膦铑比、温度、压力、时间等的影响,并尝试苯乙烯的两相不对称氢甲酰化反应.     

用亚硝基R盐螯合树脂分离富集催化极谱法测定矿石中的铱

本文研究了利用亚硝基Ｒ盐螯合形成的树脂，分离富集试液中痕量贵金属元素铱的实验条件。并利用ＪＰ－１型示波极谱仪，在１．５０ｍｏｌ／Ｌ盐酸＋５．０×１０＾－５ｍｏｌ／Ｌ硫脲＋０．２ｍｏｌ／Ｌ盐酸＋５．０×１０＾－５ｍｏｌ／Ｌ硫脲＋０．２ｍｏｌ／Ｌ碘化钾＋碲（ρ（Ｂ）＝０．４ｍｇ／Ｌ）的混合底液中，对铱进行极谱催化波测定。在示波极谱仪上峰电位约－０．５５Ｖ（银汞齐为参比电极），可测定试液中５．０×１．０     

亚硝基R盐离子对固相萃取光度法测定钴(Ⅱ)

研究了用亚硝基R盐离子对固相萃取光度法测定钴,在pH 6.0的HOAc-NH4OAc缓冲介质中,溴化十六烷基三甲基铵(CTMAB)存在下,亚硝基R盐与钴反应生成3∶1稳定络合物,该络合物可用C18固相萃取小柱富集,富集倍数达100倍,小柱上富集的络合物用乙醇洗脱后用光度法测定,钴的质量浓度在0.05~5.0 mg.L-1内符合比耳定律。方法用于食品样和水样中钴的分析,结果与AAS法测得结果一致,RSD值(n=5)≤2.5%,回收率在97%~103%之间。     

Synthesis of New Ligand 1,2-Bis{di[（R,R）-1,3,2-oxzaphosphlidine]phosphino}ethane with C_2-symmetric Axis and Application in Rh-catalyzed Asymmetric Hydrogenation

New ligand 1,2-bis{di[（R,R）-1,3,2-oxzaphosphlidine]phosphino}ethane [（R,R）-BDOPPEs 1,2,3 and 4] with C2-symmetric axis and bearing nitrogen and oxygen were synthesized from readily available optically active amino alcohols.Rh complexes with these ligands were highly enantioselective catalysts for asymmetric hydrogenation of N-benzoyldehydroamino acid derivatives and α-functionalized ketones in 99%e.e.and 98%e.e.,respectively.This new class of（R,R）-BDOPPEs 1,2,3 and 4 gave much more effectivity and enantionselectivity than their corresponding non-C2-asymmetric aminophosphine phosphinite.     

Some graphs with small second eigenvalue

For any prime,p, we construct a Cayley graph on the group,G, of affine linear transformations ofℤ/pℤ of degree 2(p−1) and second eigenvalue with the following special property: the adjacency matrix of the graph is supported on the “blocks” associated to the trivial representation and the irreducible representation of sizep−1. SinceG is of orderp(p−1), the correspondingt-uniform Cayley hypergraph has essentially optimal second eigenvalue for this degree and size of the graph (see [2] for definitions). En route we give, for any integerk>1, a simple Cayley graph onp ^k nodes of degreep of second eigenvalue . The author wishes to acknowledge the National Science Foundation for supporting this research in part under Grant CCR-8858788, and the Office of Naval Research under Grant N00014-87-K-0467.     

An approximate max-flow min-cut relation for undirected multicommodity flow,with applications

In this paper, we prove the first approximate max-flow min-cut theorem for undirected multicommodity flow. We show that for a feasible flow to exist in a multicommodity problem, it is sufficient that every cut's capacity exceeds its demand by a factor ofO(logClogD), whereC is the sum of all finite capacities andD is the sum of demands. Moreover, our theorem yields an algorithm for finding a cut that is approximately minimumrelative to the flow that must cross it. We use this result to obtain an approximation algorithm for T. C. Hu's generalization of the multiway-cut problem. This algorithm can in turn be applied to obtain approximation algorithms for minimum deletion of clauses of a 2-CNF formula, via minimization, and other problems. We also generalize the theorem to hypergraph networks; using this generalization, we can handle CNF clauses with an arbitrary number of literals per clause.Most of the results in this paper were presented in preliminary form in Approximation through multicommodity flow,Proceedings, 31th Annual Symposium on Foundations of Computer Science (1990), pp. 726–737.Research supported by the National Science Foundation under NSF grant CDA 8722809, by the Office of Naval and the Defense Advanced Research Projects Agency under contract N00014-83-K-0146, and ARPA Order No. 6320, Amendament 1.Research supported by NSF grant CCR-9012357 and by an NSF Presidential Young Investigator Award.     

A family of (n−1)! Diagonal polynomial orders ofN n

Letn>0 be an element of the setN of nonnegative integers, and lets(x)=x ₁+...+x _n , forx=(x ₁, ...,x _n ) N _n . Adiagonal polynomial order inN _n is a bijective polynomialp:N _n N (with real coefficients) such that, for allx,y N _n ,p(x)<p(y) whenevers(x)<s(y). Two diagonal polynomial orders areequivalent if a relabeling of variables makes them identical. For eachn, Skolem (1937) found a diagonal polynomial order. Later, Morales and Lew (1992) generalized this polynomial order, obtaining a family of 2 ^n–2 (n>1) inequivalent diagonal polynomial orders. Here we present, for eachn>0, a family of (n – 1)! diagonal polynomial orders, up to equivalence, which contains the Morales and Lew diagonal orders.     

The Dold-Lashof-Fuchs construction revisited

Sia dato uno spazio topologicoE con azione di un monoide topologicoH e siaE→B una funzione continue che, su ogni apertoU di una partizione dell'unità diB, sia, a meno di omotopia, la proiezioneU×H→U (ovvero una fibrazione numerabile). Un classico risultato di A. Dold e R. Lashof (1959) permette di costruire, a partire daE→B, una funzione continuaE _∞→B_∞, conE _∞ debolmente contraibile e munito di azione diH: laH-fibrazione universale associata daH. Tale funzione, in generale, non è purtroppo numerabile e quindi non si presta alla classificazione delleH-fibrazioni numerabili. Successivamente (1971), M. Fuchs ha trovato un modo di modificare la costruzione di Dold-Lashof per recuperare la numerabilità. La costruzione di Dold-Lashof-Fuchs è, da allora, uno dei principali strumenti nella teoria degli spazi classificanti di monoidi topologici, anche se vi è un uso di topologie alquanto complesse e quindi poco maneggevoli. In questo lavoro ci proponiamo di mostrare come, lavorando nella categoria conveniente deik-spazi, sia possibile descrivere la costruzione di Dold-Lashof-Fuchs in modo estremamente semplificato ed adattarla anche alla classificazione delleF-fibrazioni numerabili.

---

Conferenza tenuta da R. Piccinini il 15 maggio 1995