Charge transport in a polypeptide chain

Charge transport is one important example of signal transduction in a protein which is responsible for action at a distance, and is a fundamental process in biochemical action. A model is presented in which electronic effects interact with motional processes to combine into a bifunctional model. This model is investigated with new detailed molecular dynamics calculations and successfully explains such action at a distance. Received 1st February 2002 / Received in final form 26 May 2002 Published online 13 September 2002     

静磁场伴随有静电场存在

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

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     

Two-component model of solar plages

By use of the 2-m Mcmath-Pierce telescope at Kitt Peak, the high-quality spectra of a plage with moderate brightness near the center of solar disk were obtained. The data include seven spectral lines, which are Hα, Hβ, CaII H and K lines and the infrared triplet. With the consideration of fine structures of solar plages, a two-component atmospheric model is constructed by keeping the cool component to be the quiet atmosphere. Three cases of the hot component are given for different filling factors where the temperature and density distribution are adjusted in order to reproduce the seven observed spectral profiles. We also briefly discuss the influence of the column density at the base of the corona, m0, and the macro-turbulent velocity on the required filling factor and computed profiles. The two-component model is compared with precious one-component semi-empirical models. The limitation of the model is pointed out and further improvement is indicated.