2,7-二氯荧光素与蛋白质相互作用的分光光度法研究

首次采用分光光度法研究了模拟生理条件(pH 7.4 Tris-HCl缓冲溶液,离子强度I=0.1)下2,7-二氯荧光素与牛血清白蛋白(BSA)相互作用的情况.研究结果表明:两者相互作用形成稳定的复合物,最大吸收波长为509nm,与2,7-二氯荧光素的最大吸收波长502nm比较,红移了7nm;两者之间主要通过静电引力结合,但并不排除疏水作用力和氢键;两者之间的结合数为32.     

静磁场伴随有静电场存在

阐述检测物体是否产生了电场的方法；通过实际检测证实立方体永磁体既产生了负静电场，也产生了正静电场，并测定了具体的场强．     

Nd(Fe,Si)11Cx化合物的全电子计算(x=0,2)

采用基于第一原理的全势能线性缀加平面波加局域轨道((L)APW lo)方法对Nd(Fe,Si)11Cx化合物(x=0,2)的电子结构进行了计算,得到了化合物态密度和磁矩等信息.计算结果表明NdFe9Si2化合物中Si原子主要与4b和32i位Fe原子产生杂化,导致Fe原子磁矩减小.NdFe9Si2C2化合物C原子使32i位Fe原子磁矩进一步降低,同时减弱了Si原子的影响,使得4b位Fe原子磁矩增大.     

A novel and efficient synthesis of porphine

meso-Tetra(n-hexyloxycarbonyl)porphyrin was found to be converted into porphine, the mother compound of porphyrins, in a 77% yield when heated in aqueous sulfuric acid at 180 °C over 30 min under an inert atmosphere. The observation demonstrates that the substituted porphyrin serves as a novel and useful precursor for porphine.     

猜想M(2k,k+1)=3k-1+[(k-1)/2]的反例

Brualdi与Jung在[1]中研究了一类具有固定线和k的n×n矩阵上的最大跳跃数M(n,k),并提出猜想M(2k, k + 1) = 3k - 1 + [(k-1)/2].本文给出了这一猜想的两个反例．     

Inequalities for the Moments and Distribution of the Ladder Height of a Random Walk

We obtain upper bounds for the tail distribution of the first nonnegative sum of a random walk and for the moments of the overshoot over an arbitrary nonnegative level if the expectation of jumps is positive and close to zero. In addition, we find an estimate for the expectation of the first ladder epoch.     

A primer on perfect simulation for spatial point processes

This primer provides a self-contained exposition of the case where spatial birth-and-death processes are used for perfect simulation of locally stable point processes. Particularly, a simple dominating coupling from the past (CFTP) algorithm and the CFTP algorithms introduced in [13], [14], and [5] are studied. Some empirical results for the algorithms are discussed. Received: 30 June 2002     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008