反超图的笛卡儿积的上色数

讨论反超图的笛卡儿积的着色理论 ,求出了满足一定条件的反超图的笛卡儿积的上色数 .     

Symplectic Generating Functions and Moyal Products

We introduce an affine-invariant version of generating functions of symplectic transformations of affine symplectic spaces, together with a generalization for other symmetric symplectic spaces. The composition of these functions has a nice connection with the Moyal product.     

Differential geometry of tensor product immersions

In this article we obtain the best possible estimates of the type number of tensor product immersions and investigate tensor product immersions with lowest possible type. Several classification theorems in this respect are then proved.     

Diagrams,orientations, and varieties

One of the central problems in the theory of ordered sets is to describe the orientations of the covering graph of an ordered set. We show that the particular operation called inversion, together with the classical constructions of retraction and product, provide a context for the classification of all such orientations. AMS subject classifications (1980). 06A10, 05C75, 05C20.     

在H－ZSM－5沸石上甲醇转化为汽油的初始产物分布

在Ｈ－ＺＳＭ－５沸石上甲醇转化为汽油的初始产物分布姜玄珍（浙江大学化学系，杭州３１００２７）Ｒ．Ｆ．Ｈｏｗｅ（新南威尔士大学物理化学系，澳大利亚）关键词Ｈ－ＺＳＭ－５沸石，甲醇转化汽油，产物分布以氢型ＺＳＭ－５沸石作催化剂转化甲醇为汽油（ＭＴＧ），在...     

Networks and chain coverings in partial orders and their products

For an arbitrary poset P, subposets {P _i : 1ik} form a transitive basis of P if P is the transitive closure of their union. Let u be the minimum size of a covering of P by chains within posets of the basis, s the maximum size of a family of elements with no pair comparable in any basis poset, and a the maximum size of an antichain in P. Define a dense covering to be a collection D of chains within basis posets such that each element belongs to a chain in D within each basis poset and is the top of at least k-1 chains and the bottom of at least k-1 chains in D. Dense coverings generalize ordinary chain coverings of poset. Let d=min {|D|–(k–1)|P|}. For an arbitrary poset and transitive basis, a convenient network model for dense coverings yields the following: Theorem 1: da, with equality iff P has a minimum chain decomposition in which every pair of consecutive elements on each chain are comparable in some basis poset. Theorem 2: usda. Theorem 3: s=d iff s=a. The most interesting special case is where the transitive basis expresses P as the product of two posets, in which case u and s measure the minimum and maximum sizes of unichain coverings and semiantichains.     

大环二萜天然产物(±)-Mayol的全合成

西松烷型二萜类化合物是一大类广泛分布于松脂、烟草、陆地动物及海洋生物体中的具有十四元碳环骨架的化合物.其结构新颖复杂,且大多具有显著和广谱的生物活性.近几十年来,有关这类化合物的研究已引起了人们的极大兴趣.因此,开展这类天然产物及其类似物的全合成及构效关系的研究不仅具有重要的学术价值,而且具有潜在的应用前景.     

Product or sum: comparative tests of Voigt,and product or sum of Gaussian and Lorentzian functions in the fitting of synthetic Voigt‐based X‐ray photoelectron spectra

A comparative study for the fitting of X‐ray photoelectron spectra (XPS) using different model functions is presented. Synthetically generated test spectra using Gaussian/Lorentzian convolution and a real measured spectrum are fitted with the three commonly used models: product, sum and Gaussian/Lorentzian convolution functions. In these limited tests, it was found that the sum function is superior to the product function, particularly for low‐noise spectra. Copyright © 2007 John Wiley & Sons, Ltd.     

Synthesis of Obyanamide, a Marine Cytotoxic Cyclic Depsipeptide

Obyanamide 1 is a cyclic depsipeptide that was recently isolated from the marine cyanobacterium Lyngbya confervoides by Moore and co-workers1. This compound displayed a potent inhibitory effect on both KB and LoVo cells in vitro. Several structural analog…     

天然产物的酶法结构修饰

为赋予天然产物以新颖和特定的性质，往往需要对其进行结构修饰。结果修饰 可以通过化学法、微生物法和酶法实现。其中酶法由于条件温和，化学、区域和立 体选择性高，操作简便，环境友好等特点而发展非常迅速。本文介绍了糖和糖苷、 甾族化合物、β-内酰胺抗生素、氨基酸和多糖类等的酶法结构修饰，并指出组合 酶催化将成为现有组合化学方法的重要补充。