活性炭自溶液吸附锌(II)离子及其配合物

近年来，有人提出通过表面处理提高活性炭表面电荷，加强对无机离子吸附力等观点，但活性炭对无机离子的吸附活性点，表面含氧基团及配体对吸附的影响等重要问题仍众说纷经[1－4]为此，本文提出用氧化一负离子化法处理活性炭，以表面酸度表征表面含氧基团的量，探讨活性炭对Zn（Ⅱ）及其配合物的吸附特性．1试验（1）试验材料活性发由北京光华木材厂出品，分析纯．过20－30目，BET法测得比表面为1316m2·g-1．在2．5×10－2mlo·dm－3的NaNO3中，测得等电点pHIEP为7．75[5]，元素含量（质量分数）为C（83．9％），N（0．07％），H（1…     

Large cycles in random generalized Johnson graphs

This paper studies thresholds in random generalized Johnson graphs for containing large cycles, i.e. cycles of variable length growing with the size of the graph. Thresholds are obtained for different growth rates.     

带有随机初值的复值Ginzburg-Landau方程的弱平均动力学*

本文研究了无界域上的带有随机初值的复值Ginzburg-Landau方程.首先, 基于解过程的全局适定性, 建立了带有随机初值的Ginzburg-Landau方程的平均随机动力系统.然后, 证明了弱拉回平均随机吸引子的存在唯一性以及随机吸引子的周期性,并将其进一步推广到加权空间L²(?, L²_σ(R)).     

GO-MOCE: Greedy Order Method of Conditional Expectations for Max Sat

In this paper we present and study a new algorithm for the Maximum Satisfiability (Max Sat) problem. The algorithm is based on the Method of Conditional Expectations (MOCE, also known as Johnson’s Algorithm) and applies a greedy variable ordering to MOCE. Thus, we name it Greedy Order MOCE (GO-MOCE). We also suggest a combination of GO-MOCE with CCLS, a state-of-the-art solver. We refer to this combined solver as GO-MOCE-CCLS.We conduct a comprehensive comparative evaluation of GO-MOCE versus MOCE on random instances and on public competition benchmark instances. We show that GO-MOCE reduces the number of unsatisfied clauses by tens of percents, while keeping the runtime almost the same. The worst case time complexity of GO-MOCE is linear. We also show that GO-MOCE-CCLS improves on CCLS consistently by up to about 80%.We study the asymptotic performance of GO-MOCE. To this end, we introduce three measures for evaluating the asymptotic performance of algorithms for Max Sat. We point out to further possible improvements of GO-MOCE, based on an empirical study of the main quantities managed by GO-MOCE during its execution.     

Spectra of graphs and fractal dimensions II

This paper continues the study of exponentsd(x), d (x), d _R (x) andd (x) for graphG; and the nearest neighbor random walk {X _n } _nN onG, if the starting pointX ₀=x is fixed. These exponents are responsible for the geometric, resistance, diffusion and spectral properties of the graph. The main concern of this paper is the relation of these exponents to the spectral density of the transition matrix. A series of new exponentse, e ,e _R ,e are introduced by allowingx to vary along the vertices. The results suggest that the geometric and resistance properties of the graph are responsible for the diffusion speed on the graph.     

Dynamic structure factor in a random diffusion model

Let {X _t:0} denote random walk in the random waiting time model, i.e., simple random walk with jump ratew ^–1(X _t), where {w(x):x^d} is an i.i.d. random field. We show that (under some mild conditions) theintermediate scattering function F(q,t)=E ₀ (q^d) is completely monotonic int (E ₀ denotes double expectation w.r.t. walk and field). We also show that thedynamic structure factor S(q, w)=2 ₀ cos(t)F(q, t) exists for 0 and is strictly positive. Ind=1, 2 it diverges as 1/||^1/2, resp. –ln(||), in the limit 0; ind3 its limit value is strictly larger than expected from hydrodynamics. This and further results support the conclusion that the hydrodynamic region is limited to smallq and small such that ||D |q|², whereD is the diffusion constant.     

On three conjectures by K. E. Shuler

Some fifteen years ago, Shuler formulated three conjectures relating to the large-time asymptotic properties of a nearest-neighbor random walk on ² that is allowed to make horizontal steps everywhere but vertical steps only on a random fraction of the columns. We give a proof of his conjectures for the situation where the column distribution is stationary and satisfies a certain mixing codition. We also prove a strong form of scaling to anisotropic Brownian motion as well as a local limit theorem. The main ingredient of the proofs is a large-deviation estimate for the number of visits to a random set made by a simple random walk on . We briefly discuss extensions to higher dimension and to other types of random walk.Dedicated to Prof. K. E. Shuler on the occasion of his 70th birthday, celebrated at a Symposium in his honor on July 13, 1992, at the University of California at San Diego, La Jolla, California.     

Structural aspects of antibody-antigen interaction revealed through small random peptide libraries

Summary Two small random peptide libraries, one composed of 4550 dodecapeptides and one of 8000 tripeptides, were synthesized in newly developed credit-card format miniPEPSCAN cards (miniPEPSCAN libraries). Each peptide was synthesized in a discrete well (455 peptides/card). The two miniPEPSCAN libraries were screened with three different monoclonal antibodies (Mabs). Two other random peptide libraries, expressed on the wall of bacteria (recombinant libraries) and composed of 10⁷ hexa- and octapeptides, were screened with the same three Mabs. The aim of this study was to compare the amino acid sequence of peptides selected from small and large pools of random peptides and, in this way, investigate the potential of small random peptide libraries. The screening of the two miniPEPSCAN libraries resulted in the identification of a surprisingly large number of antibody-binding peptides, while the screening of the large recombinant libraries, using the same Mabs, resulted in the identification of only a small number of peptides. The large number of peptides derived from the small random peptide libraries allowed the determination of consensus sequences. These consensus sequences could be related to small linear and nonlinear parts of the respective epitopes. The small number of peptides derived from the large random peptide libraries could only be related to linear epitopes that were previously mapped using small libraries of overlapping peptides covering the antigenic protein. Thus, with respect to the cost and speed of identifying peptides that resemble linear and nonlinear parts of epitopes, small diversity libraries based on synthetic peptides appear to be superior to large diversity libraries based on expression systems.Abbreviations ABTS 2,2-azino-di-3-ethylbenzthiazoline sulfonate - EGF epidermal growth factor - Mab monoclonal antibody - OD_ccd optical density obtained using CCD camera - RAMPO rabbit-antimouse peroxidase - SDS sodium dodecylsulfate - TGEV transmissible gastroenteritis virus     

偏最小二乘法在原子吸收光谱分析中的应用——钴和铟的同时测定

本文用偏最小二乘法（ＰＬＳ）校正了火焰原子吸收分析Ｉｎ２５２．１３７ｎｍ对Ｃｏ２５２．１３６ｎｍ的吸收线重叠干扰,对混合样中Ｃｏ和Ｉｎ的含量进行了测定,结果令人满意。     

A “Multiplicative Coboundary” theorem for some sequences of random matrices

Schmidt(¹⁰) showed that if the family of distributions of the partial sums of a strictly stationary random sequence is tight, then that random sequence is a coboundary. Here an analog of that result is proved for some sequences of random matrices, with partial sums replaced by matrix products.