静磁场伴随有静电场存在

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

(Ni0.8Zn0.2Fe2O4)epoxy-PZT双层膜中的磁电效应

讨论了Ni_0.8Zn_0.2Fe₂O₄ (NZFO)与锆钛酸铅(PZT)的双层膜结构样品的磁电(ME)效应.NZFO粉料由溶胶-凝胶法制成，再经900℃热压，并高温烧结.在该双层膜中测量到了很强的磁电相互作用.发现横向的磁电效应比纵向效应大一个数量级，并且随NZFO烧结温度的提高而增加.当烧结温度从950℃上升到1380℃时，横向ME电压系数(α_E)的最大值变化范围为25.6 mV Am^-2≤α_E≤199.6 mV Am^-2.理论分析显示NZFO-PZT双层膜样品中ME效应源于NZFO与PZT之间相对良好的磁电耦合. 关键词： 镍铁氧体 PZT 热压法 ME效应     

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 Novel Biomass Supported Na2CO3 System for Flue Gas Desulfurization

The breakthrough and stoichiometric SO2 adsorption efficiencies of a biomass supported Na2CO3 system (80 wt %Na2CO3/straw) have reached 48.9% and 80.6% respectively at a desulfurization temperature of 80℃.     

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